Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r199-smll-155284912600232.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3957
Executing tool itstoolsm
Input is Referendum-PT-0050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-155284912600232
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 42K Feb 12 12:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 12 12:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 8 14:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 8 14:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 105 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 343 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 9.7K Feb 5 01:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 5 01:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 4 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 4 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 1 11:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 1 11:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 51K Mar 10 17:31 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 Referendum-PT-0050-LTLFireability-00
FORMULA_NAME Referendum-PT-0050-LTLFireability-01
FORMULA_NAME Referendum-PT-0050-LTLFireability-02
FORMULA_NAME Referendum-PT-0050-LTLFireability-03
FORMULA_NAME Referendum-PT-0050-LTLFireability-04
FORMULA_NAME Referendum-PT-0050-LTLFireability-05
FORMULA_NAME Referendum-PT-0050-LTLFireability-06
FORMULA_NAME Referendum-PT-0050-LTLFireability-07
FORMULA_NAME Referendum-PT-0050-LTLFireability-08
FORMULA_NAME Referendum-PT-0050-LTLFireability-09
FORMULA_NAME Referendum-PT-0050-LTLFireability-10
FORMULA_NAME Referendum-PT-0050-LTLFireability-11
FORMULA_NAME Referendum-PT-0050-LTLFireability-12
FORMULA_NAME Referendum-PT-0050-LTLFireability-13
FORMULA_NAME Referendum-PT-0050-LTLFireability-14
FORMULA_NAME Referendum-PT-0050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553617185334

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((false))
Formula 0 simplified : 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.1259e+15 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 101 rows 151 cols
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16 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.198637,21596,1,0,57,26218,17,104,2503,25424,168
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F("((((((((((((((((((((((((((((((((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))||(voting_21>=1))||(voting_22>=1))||(voting_23>=1))||(voting_24>=1))||(voting_25>=1))||(voting_26>=1))||(voting_27>=1))||(voting_28>=1))||(voting_29>=1))||(voting_30>=1))||(voting_31>=1))||(voting_32>=1))||(voting_33>=1))||(voting_34>=1))||(voting_35>=1))||(voting_36>=1))||(voting_37>=1))||(voting_38>=1))||(voting_39>=1))||(voting_40>=1))||(voting_41>=1))||(voting_42>=1))||(voting_43>=1))||(voting_44>=1))||(voting_45>=1))||(voting_46>=1))||(voting_47>=1))||(voting_48>=1))||(voting_49>=1))||(voting_50>=1))")))
Formula 1 simplified : !F"((((((((((((((((((((((((((((((((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))||(voting_21>=1))||(voting_22>=1))||(voting_23>=1))||(voting_24>=1))||(voting_25>=1))||(voting_26>=1))||(voting_27>=1))||(voting_28>=1))||(voting_29>=1))||(voting_30>=1))||(voting_31>=1))||(voting_32>=1))||(voting_33>=1))||(voting_34>=1))||(voting_35>=1))||(voting_36>=1))||(voting_37>=1))||(voting_38>=1))||(voting_39>=1))||(voting_40>=1))||(voting_41>=1))||(voting_42>=1))||(voting_43>=1))||(voting_44>=1))||(voting_45>=1))||(voting_46>=1))||(voting_47>=1))||(voting_48>=1))||(voting_49>=1))||(voting_50>=1))"
Computing Next relation with stutter on 1.1259e+15 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.20419,21824,1,0,59,26220,26,107,2603,25434,179
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(G(F(("((((((((((((((((((((((((((((((((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))||(voting_21>=1))||(voting_22>=1))||(voting_23>=1))||(voting_24>=1))||(voting_25>=1))||(voting_26>=1))||(voting_27>=1))||(voting_28>=1))||(voting_29>=1))||(voting_30>=1))||(voting_31>=1))||(voting_32>=1))||(voting_33>=1))||(voting_34>=1))||(voting_35>=1))||(voting_36>=1))||(voting_37>=1))||(voting_38>=1))||(voting_39>=1))||(voting_40>=1))||(voting_41>=1))||(voting_42>=1))||(voting_43>=1))||(voting_44>=1))||(voting_45>=1))||(voting_46>=1))||(voting_47>=1))||(voting_48>=1))||(voting_49>=1))||(voting_50>=1))")U("(ready>=1)"))))))
Formula 2 simplified : !GF("((((((((((((((((((((((((((((((((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))||(voting_21>=1))||(voting_22>=1))||(voting_23>=1))||(voting_24>=1))||(voting_25>=1))||(voting_26>=1))||(voting_27>=1))||(voting_28>=1))||(voting_29>=1))||(voting_30>=1))||(voting_31>=1))||(voting_32>=1))||(voting_33>=1))||(voting_34>=1))||(voting_35>=1))||(voting_36>=1))||(voting_37>=1))||(voting_38>=1))||(voting_39>=1))||(voting_40>=1))||(voting_41>=1))||(voting_42>=1))||(voting_43>=1))||(voting_44>=1))||(voting_45>=1))||(voting_46>=1))||(voting_47>=1))||(voting_48>=1))||(voting_49>=1))||(voting_50>=1))" U "(ready>=1)")
invariant :voted_no_12 + -1'voted_no_50 + voted_yes_12 + -1'voted_yes_50 + voting_12 + -1'voting_50 = 0
invariant :voted_no_4 + -1'voted_no_50 + voted_yes_4 + -1'voted_yes_50 + voting_4 + -1'voting_50 = 0
invariant :voted_no_3 + -1'voted_no_50 + voted_yes_3 + -1'voted_yes_50 + voting_3 + -1'voting_50 = 0
invariant :voted_no_45 + -1'voted_no_50 + voted_yes_45 + -1'voted_yes_50 + voting_45 + -1'voting_50 = 0
invariant :voted_no_6 + -1'voted_no_50 + voted_yes_6 + -1'voted_yes_50 + voting_6 + -1'voting_50 = 0
invariant :voted_no_24 + -1'voted_no_50 + voted_yes_24 + -1'voted_yes_50 + voting_24 + -1'voting_50 = 0
invariant :voted_no_46 + -1'voted_no_50 + voted_yes_46 + -1'voted_yes_50 + voting_46 + -1'voting_50 = 0
invariant :voted_no_47 + -1'voted_no_50 + voted_yes_47 + -1'voted_yes_50 + voting_47 + -1'voting_50 = 0
invariant :voted_no_20 + -1'voted_no_50 + voted_yes_20 + -1'voted_yes_50 + voting_20 + -1'voting_50 = 0
invariant :voted_no_44 + -1'voted_no_50 + voted_yes_44 + -1'voted_yes_50 + voting_44 + -1'voting_50 = 0
invariant :voted_no_8 + -1'voted_no_50 + voted_yes_8 + -1'voted_yes_50 + voting_8 + -1'voting_50 = 0
Computing Next relation with stutter on 1.1259e+15 deadlock states
invariant :voted_no_41 + -1'voted_no_50 + voted_yes_41 + -1'voted_yes_50 + voting_41 + -1'voting_50 = 0
invariant :voted_no_19 + -1'voted_no_50 + voted_yes_19 + -1'voted_yes_50 + voting_19 + -1'voting_50 = 0
invariant :voted_no_39 + -1'voted_no_50 + voted_yes_39 + -1'voted_yes_50 + voting_39 + -1'voting_50 = 0
invariant :voted_no_21 + -1'voted_no_50 + voted_yes_21 + -1'voted_yes_50 + voting_21 + -1'voting_50 = 0
invariant :voted_no_43 + -1'voted_no_50 + voted_yes_43 + -1'voted_yes_50 + voting_43 + -1'voting_50 = 0
invariant :voted_no_1 + -1'voted_no_50 + voted_yes_1 + -1'voted_yes_50 + voting_1 + -1'voting_50 = 0
invariant :voted_no_34 + -1'voted_no_50 + voted_yes_34 + -1'voted_yes_50 + voting_34 + -1'voting_50 = 0
invariant :voted_no_31 + -1'voted_no_50 + voted_yes_31 + -1'voted_yes_50 + voting_31 + -1'voting_50 = 0
invariant :voted_no_29 + -1'voted_no_50 + voted_yes_29 + -1'voted_yes_50 + voting_29 + -1'voting_50 = 0
invariant :voted_no_49 + -1'voted_no_50 + voted_yes_49 + -1'voted_yes_50 + voting_49 + -1'voting_50 = 0
invariant :voted_no_38 + -1'voted_no_50 + voted_yes_38 + -1'voted_yes_50 + voting_38 + -1'voting_50 = 0
invariant :voted_no_25 + -1'voted_no_50 + voted_yes_25 + -1'voted_yes_50 + voting_25 + -1'voting_50 = 0
invariant :voted_no_23 + -1'voted_no_50 + voted_yes_23 + -1'voted_yes_50 + voting_23 + -1'voting_50 = 0
invariant :voted_no_42 + -1'voted_no_50 + voted_yes_42 + -1'voted_yes_50 + voting_42 + -1'voting_50 = 0
invariant :voted_no_32 + -1'voted_no_50 + voted_yes_32 + -1'voted_yes_50 + voting_32 + -1'voting_50 = 0
invariant :voted_no_40 + -1'voted_no_50 + voted_yes_40 + -1'voted_yes_50 + voting_40 + -1'voting_50 = 0
invariant :ready + voted_no_50 + voted_yes_50 + voting_50 = 1
invariant :voted_no_22 + -1'voted_no_50 + voted_yes_22 + -1'voted_yes_50 + voting_22 + -1'voting_50 = 0
invariant :voted_no_15 + -1'voted_no_50 + voted_yes_15 + -1'voted_yes_50 + voting_15 + -1'voting_50 = 0
invariant :voted_no_16 + -1'voted_no_50 + voted_yes_16 + -1'voted_yes_50 + voting_16 + -1'voting_50 = 0
invariant :voted_no_33 + -1'voted_no_50 + voted_yes_33 + -1'voted_yes_50 + voting_33 + -1'voting_50 = 0
invariant :voted_no_35 + -1'voted_no_50 + voted_yes_35 + -1'voted_yes_50 + voting_35 + -1'voting_50 = 0
invariant :voted_no_11 + -1'voted_no_50 + voted_yes_11 + -1'voted_yes_50 + voting_11 + -1'voting_50 = 0
invariant :voted_no_5 + -1'voted_no_50 + voted_yes_5 + -1'voted_yes_50 + voting_5 + -1'voting_50 = 0
invariant :voted_no_28 + -1'voted_no_50 + voted_yes_28 + -1'voted_yes_50 + voting_28 + -1'voting_50 = 0
invariant :voted_no_18 + -1'voted_no_50 + voted_yes_18 + -1'voted_yes_50 + voting_18 + -1'voting_50 = 0
invariant :voted_no_10 + -1'voted_no_50 + voted_yes_10 + -1'voted_yes_50 + voting_10 + -1'voting_50 = 0
invariant :voted_no_13 + -1'voted_no_50 + voted_yes_13 + -1'voted_yes_50 + voting_13 + -1'voting_50 = 0
invariant :voted_no_48 + -1'voted_no_50 + voted_yes_48 + -1'voted_yes_50 + voting_48 + -1'voting_50 = 0
invariant :voted_no_7 + -1'voted_no_50 + voted_yes_7 + -1'voted_yes_50 + voting_7 + -1'voting_50 = 0
invariant :voted_no_36 + -1'voted_no_50 + voted_yes_36 + -1'voted_yes_50 + voting_36 + -1'voting_50 = 0
invariant :voted_no_17 + -1'voted_no_50 + voted_yes_17 + -1'voted_yes_50 + voting_17 + -1'voting_50 = 0
invariant :voted_no_30 + -1'voted_no_50 + voted_yes_30 + -1'voted_yes_50 + voting_30 + -1'voting_50 = 0
invariant :voted_no_26 + -1'voted_no_50 + voted_yes_26 + -1'voted_yes_50 + voting_26 + -1'voting_50 = 0
invariant :voted_no_27 + -1'voted_no_50 + voted_yes_27 + -1'voted_yes_50 + voting_27 + -1'voting_50 = 0
invariant :voted_no_9 + -1'voted_no_50 + voted_yes_9 + -1'voted_yes_50 + voting_9 + -1'voting_50 = 0
invariant :voted_no_2 + -1'voted_no_50 + voted_yes_2 + -1'voted_yes_50 + voting_2 + -1'voting_50 = 0
invariant :voted_no_14 + -1'voted_no_50 + voted_yes_14 + -1'voted_yes_50 + voting_14 + -1'voting_50 = 0
invariant :voted_no_37 + -1'voted_no_50 + voted_yes_37 + -1'voted_yes_50 + voting_37 + -1'voting_50 = 0
54 unique states visited
54 strongly connected components in search stack
55 transitions explored
54 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.240114,22908,1,0,59,26220,35,107,2604,33815,437
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F((F("((((((((((((((((((((((((((((((((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))||(voting_21>=1))||(voting_22>=1))||(voting_23>=1))||(voting_24>=1))||(voting_25>=1))||(voting_26>=1))||(voting_27>=1))||(voting_28>=1))||(voting_29>=1))||(voting_30>=1))||(voting_31>=1))||(voting_32>=1))||(voting_33>=1))||(voting_34>=1))||(voting_35>=1))||(voting_36>=1))||(voting_37>=1))||(voting_38>=1))||(voting_39>=1))||(voting_40>=1))||(voting_41>=1))||(voting_42>=1))||(voting_43>=1))||(voting_44>=1))||(voting_45>=1))||(voting_46>=1))||(voting_47>=1))||(voting_48>=1))||(voting_49>=1))||(voting_50>=1))"))U(G("(ready>=1)")))))
Formula 3 simplified : !F(F"((((((((((((((((((((((((((((((((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))||(voting_21>=1))||(voting_22>=1))||(voting_23>=1))||(voting_24>=1))||(voting_25>=1))||(voting_26>=1))||(voting_27>=1))||(voting_28>=1))||(voting_29>=1))||(voting_30>=1))||(voting_31>=1))||(voting_32>=1))||(voting_33>=1))||(voting_34>=1))||(voting_35>=1))||(voting_36>=1))||(voting_37>=1))||(voting_38>=1))||(voting_39>=1))||(voting_40>=1))||(voting_41>=1))||(voting_42>=1))||(voting_43>=1))||(voting_44>=1))||(voting_45>=1))||(voting_46>=1))||(voting_47>=1))||(voting_48>=1))||(voting_49>=1))||(voting_50>=1))" U G"(ready>=1)")
Computing Next relation with stutter on 1.1259e+15 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16 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.392109,28720,1,0,205,52285,45,259,2604,96059,952
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F("((((((((((((((((((((((((((((((((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))||(voting_21>=1))||(voting_22>=1))||(voting_23>=1))||(voting_24>=1))||(voting_25>=1))||(voting_26>=1))||(voting_27>=1))||(voting_28>=1))||(voting_29>=1))||(voting_30>=1))||(voting_31>=1))||(voting_32>=1))||(voting_33>=1))||(voting_34>=1))||(voting_35>=1))||(voting_36>=1))||(voting_37>=1))||(voting_38>=1))||(voting_39>=1))||(voting_40>=1))||(voting_41>=1))||(voting_42>=1))||(voting_43>=1))||(voting_44>=1))||(voting_45>=1))||(voting_46>=1))||(voting_47>=1))||(voting_48>=1))||(voting_49>=1))||(voting_50>=1))")))
Formula 4 simplified : !F"((((((((((((((((((((((((((((((((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))||(voting_21>=1))||(voting_22>=1))||(voting_23>=1))||(voting_24>=1))||(voting_25>=1))||(voting_26>=1))||(voting_27>=1))||(voting_28>=1))||(voting_29>=1))||(voting_30>=1))||(voting_31>=1))||(voting_32>=1))||(voting_33>=1))||(voting_34>=1))||(voting_35>=1))||(voting_36>=1))||(voting_37>=1))||(voting_38>=1))||(voting_39>=1))||(voting_40>=1))||(voting_41>=1))||(voting_42>=1))||(voting_43>=1))||(voting_44>=1))||(voting_45>=1))||(voting_46>=1))||(voting_47>=1))||(voting_48>=1))||(voting_49>=1))||(voting_50>=1))"
Computing Next relation with stutter on 1.1259e+15 deadlock states
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.396528,29248,1,0,205,52285,45,259,2604,96059,952
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(F((X("(ready>=1)"))U(X("((((((((((((((((((((((((((((((((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))||(voting_21>=1))||(voting_22>=1))||(voting_23>=1))||(voting_24>=1))||(voting_25>=1))||(voting_26>=1))||(voting_27>=1))||(voting_28>=1))||(voting_29>=1))||(voting_30>=1))||(voting_31>=1))||(voting_32>=1))||(voting_33>=1))||(voting_34>=1))||(voting_35>=1))||(voting_36>=1))||(voting_37>=1))||(voting_38>=1))||(voting_39>=1))||(voting_40>=1))||(voting_41>=1))||(voting_42>=1))||(voting_43>=1))||(voting_44>=1))||(voting_45>=1))||(voting_46>=1))||(voting_47>=1))||(voting_48>=1))||(voting_49>=1))||(voting_50>=1))"))))))
Formula 5 simplified : !XF(X"(ready>=1)" U X"((((((((((((((((((((((((((((((((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))||(voting_21>=1))||(voting_22>=1))||(voting_23>=1))||(voting_24>=1))||(voting_25>=1))||(voting_26>=1))||(voting_27>=1))||(voting_28>=1))||(voting_29>=1))||(voting_30>=1))||(voting_31>=1))||(voting_32>=1))||(voting_33>=1))||(voting_34>=1))||(voting_35>=1))||(voting_36>=1))||(voting_37>=1))||(voting_38>=1))||(voting_39>=1))||(voting_40>=1))||(voting_41>=1))||(voting_42>=1))||(voting_43>=1))||(voting_44>=1))||(voting_45>=1))||(voting_46>=1))||(voting_47>=1))||(voting_48>=1))||(voting_49>=1))||(voting_50>=1))")
Computing Next relation with stutter on 1.1259e+15 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.400754,29500,1,0,205,52285,45,259,2604,96060,956
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F("(ready>=1)")))
Formula 6 simplified : !F"(ready>=1)"
Computing Next relation with stutter on 1.1259e+15 deadlock states
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.401092,29500,1,0,205,52285,45,259,2604,96060,960
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G(F(G(G(X("((((((((((((((((((((((((((((((((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))||(voting_21>=1))||(voting_22>=1))||(voting_23>=1))||(voting_24>=1))||(voting_25>=1))||(voting_26>=1))||(voting_27>=1))||(voting_28>=1))||(voting_29>=1))||(voting_30>=1))||(voting_31>=1))||(voting_32>=1))||(voting_33>=1))||(voting_34>=1))||(voting_35>=1))||(voting_36>=1))||(voting_37>=1))||(voting_38>=1))||(voting_39>=1))||(voting_40>=1))||(voting_41>=1))||(voting_42>=1))||(voting_43>=1))||(voting_44>=1))||(voting_45>=1))||(voting_46>=1))||(voting_47>=1))||(voting_48>=1))||(voting_49>=1))||(voting_50>=1))")))))))
Formula 7 simplified : !GFGX"((((((((((((((((((((((((((((((((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))||(voting_21>=1))||(voting_22>=1))||(voting_23>=1))||(voting_24>=1))||(voting_25>=1))||(voting_26>=1))||(voting_27>=1))||(voting_28>=1))||(voting_29>=1))||(voting_30>=1))||(voting_31>=1))||(voting_32>=1))||(voting_33>=1))||(voting_34>=1))||(voting_35>=1))||(voting_36>=1))||(voting_37>=1))||(voting_38>=1))||(voting_39>=1))||(voting_40>=1))||(voting_41>=1))||(voting_42>=1))||(voting_43>=1))||(voting_44>=1))||(voting_45>=1))||(voting_46>=1))||(voting_47>=1))||(voting_48>=1))||(voting_49>=1))||(voting_50>=1))"
Computing Next relation with stutter on 1.1259e+15 deadlock states
53 unique states visited
52 strongly connected components in search stack
54 transitions explored
53 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.41753,29500,1,0,205,52287,45,259,2604,96061,1113
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((false))
Formula 8 simplified : 1
Computing Next relation with stutter on 1.1259e+15 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.417813,29500,1,0,205,52287,45,259,2604,96061,1113
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(G(("(voting_16>=1)")U(G("(voting_1>=1)"))))))
Formula 9 simplified : !G("(voting_16>=1)" U G"(voting_1>=1)")
Computing Next relation with stutter on 1.1259e+15 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.420255,29792,1,0,205,52288,63,259,2612,96063,1125
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(X(X(("(voting_29>=1)")U("(voting_7>=1)"))))))
Formula 10 simplified : !GXX("(voting_29>=1)" U "(voting_7>=1)")
Computing Next relation with stutter on 1.1259e+15 deadlock states
56 unique states visited
56 strongly connected components in search stack
57 transitions explored
56 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.422017,30048,1,0,205,52288,73,259,2616,96063,1129
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(("(voting_7>=1)")U(X(X("(voting_7>=1)"))))))
Formula 11 simplified : !F("(voting_7>=1)" U XX"(voting_7>=1)")
Computing Next relation with stutter on 1.1259e+15 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
8 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.508807,31560,1,0,400,63385,80,455,2616,116353,1627
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(F(X(F(F("(voting_5>=1)")))))))
Formula 12 simplified : !GFXF"(voting_5>=1)"
Computing Next relation with stutter on 1.1259e+15 deadlock states
54 unique states visited
54 strongly connected components in search stack
55 transitions explored
54 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.510286,31804,1,0,400,63385,89,455,2616,116353,1633
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((false))
Formula 13 simplified : 1
Computing Next relation with stutter on 1.1259e+15 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.510468,31804,1,0,400,63385,89,455,2616,116353,1633
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(G(G(F(X("(voting_27>=1)")))))))
Formula 14 simplified : !GFX"(voting_27>=1)"
Computing Next relation with stutter on 1.1259e+15 deadlock states
54 unique states visited
54 strongly connected components in search stack
55 transitions explored
54 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.511472,31804,1,0,400,63385,98,455,2616,116353,1639
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X((("(voting_37>=1)")U("(voting_37>=1)"))U(G("(voting_10>=1)")))))
Formula 15 simplified : !X("(voting_37>=1)" U G"(voting_10>=1)")
Computing Next relation with stutter on 1.1259e+15 deadlock states
53 unique states visited
53 strongly connected components in search stack
53 transitions explored
53 items max in DFS search stack
39 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.904201,42668,1,0,691,114214,119,747,2624,211769,2626
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-PT-0050-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1553617190440

--------------------
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
+ 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 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 26, 2019 4:19:47 PM fr.lip6.move.gal.application.Application start
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]
Mar 26, 2019 4:19:47 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 26, 2019 4:19:47 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 55 ms
Mar 26, 2019 4:19:47 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 151 places.
Mar 26, 2019 4:19:47 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 101 transitions.
Mar 26, 2019 4:19:47 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 13 ms
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 47 ms
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 27 ms
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 101 transitions.
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 151 places.
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 101 transitions.
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 101 transitions.
Mar 26, 2019 4:19:48 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Mar 26, 2019 4:19:48 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 50 place invariants in 56 ms
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 151 variables to be positive in 397 ms
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 101 transitions.
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/101 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 101 transitions.
Mar 26, 2019 4:19:48 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 4:19:49 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 101) 1) (= (store (store s0 1 (+ (select s0 1) 1)) 101 (- (select s0 101) 1)) s1))) with error
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.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 26, 2019 4:19:49 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1142ms conformant to PINS in folder :/home/mcc/execution

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="Referendum-PT-0050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsm"
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-3957"
echo " Executing tool itstoolsm"
echo " Input is Referendum-PT-0050, 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 r199-smll-155284912600232"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0050.tgz
mv Referendum-PT-0050 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; 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
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 ;