Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..........
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is Peterson-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-149440871700050
=====================================================================

--------------------
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 Peterson-COL-2-LTLCardinality-0
FORMULA_NAME Peterson-COL-2-LTLCardinality-1
FORMULA_NAME Peterson-COL-2-LTLCardinality-10
FORMULA_NAME Peterson-COL-2-LTLCardinality-11
FORMULA_NAME Peterson-COL-2-LTLCardinality-12
FORMULA_NAME Peterson-COL-2-LTLCardinality-13
FORMULA_NAME Peterson-COL-2-LTLCardinality-14
FORMULA_NAME Peterson-COL-2-LTLCardinality-15
FORMULA_NAME Peterson-COL-2-LTLCardinality-2
FORMULA_NAME Peterson-COL-2-LTLCardinality-3
FORMULA_NAME Peterson-COL-2-LTLCardinality-4
FORMULA_NAME Peterson-COL-2-LTLCardinality-5
FORMULA_NAME Peterson-COL-2-LTLCardinality-6
FORMULA_NAME Peterson-COL-2-LTLCardinality-7
FORMULA_NAME Peterson-COL-2-LTLCardinality-8
FORMULA_NAME Peterson-COL-2-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496267148735


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("(((((EndTurn_0_0+EndTurn_2_0)+EndTurn_1_0)+EndTurn_1_1)+EndTurn_0_1)+EndTurn_2_1)<=(((((((((((TestAlone_1_0_0+TestAlone_0_0_1)+TestAlone_2_1_0)+TestAlone_1_1_0)+TestAlone_2_0_0)+TestAlone_0_0_2)+TestAlone_2_1_1)+TestAlone_0_1_1)+TestAlone_2_0_1)+TestAlone_1_1_2)+TestAlone_0_1_2)+TestAlone_1_0_2)"))
Formula 0 simplified : !"(((((EndTurn_0_0+EndTurn_2_0)+EndTurn_1_0)+EndTurn_1_1)+EndTurn_0_1)+EndTurn_2_1)<=(((((((((((TestAlone_1_0_0+TestAlone_0_0_1)+TestAlone_2_1_0)+TestAlone_1_1_0)+TestAlone_2_0_0)+TestAlone_0_0_2)+TestAlone_2_1_1)+TestAlone_0_1_1)+TestAlone_2_0_1)+TestAlone_1_1_2)+TestAlone_0_1_2)+TestAlone_1_0_2)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 126 rows 102 cols
invariant : 1'WantSection_2_T + 1'Idle_2= 1
invariant : 1'IsEndLoop_0_0_0 + 1'IsEndLoop_0_1_0 + 1'IsEndLoop_0_0_1 + 1'IsEndLoop_0_1_1 + 1'IsEndLoop_0_0_2 + 1'IsEndLoop_0_1_2 + 1'EndTurn_0_0 + 1'EndTurn_0_1 + 1'BeginLoop_0_0_0 + 1'BeginLoop_0_1_0 + 1'BeginLoop_0_0_1 + 1'BeginLoop_0_0_2 + 1'BeginLoop_0_1_1 + 1'BeginLoop_0_1_2 + -1'WantSection_0_T + 1'TestAlone_0_0_1 + 1'TestAlone_0_0_2 + 1'TestAlone_0_1_1 + 1'TestTurn_0_0 + 1'TestAlone_0_1_2 + 1'TestIdentity_0_0_0 + 1'TestTurn_0_1 + 1'TestIdentity_0_1_1 + 1'TestIdentity_0_1_0 + 1'TestIdentity_0_0_1 + 1'TestIdentity_0_1_2 + 1'TestIdentity_0_0_2 + 1'CS_0 + 1'AskForSection_0_1 + 1'AskForSection_0_0= 0
invariant : 1'Turn_1_2 + 1'Turn_1_0 + 1'Turn_1_1= 1
invariant : 1'WantSection_0_T + 1'WantSection_0_F= 1
invariant : 1'IsEndLoop_1_0_0 + 1'IsEndLoop_1_1_0 + 1'IsEndLoop_1_0_1 + 1'IsEndLoop_1_1_1 + 1'IsEndLoop_1_0_2 + 1'IsEndLoop_1_1_2 + 1'EndTurn_1_0 + 1'EndTurn_1_1 + 1'BeginLoop_1_0_0 + 1'BeginLoop_1_1_0 + 1'BeginLoop_1_0_1 + 1'BeginLoop_1_1_1 + 1'BeginLoop_1_1_2 + 1'BeginLoop_1_0_2 + -1'WantSection_1_T + 1'TestAlone_1_0_0 + 1'TestAlone_1_1_0 + 1'TestAlone_1_1_2 + 1'TestAlone_1_0_2 + 1'TestIdentity_1_0_0 + 1'TestTurn_1_0 + 1'TestTurn_1_1 + 1'TestIdentity_1_0_1 + 1'TestIdentity_1_1_1 + 1'TestIdentity_1_1_0 + 1'TestIdentity_1_1_2 + 1'TestIdentity_1_0_2 + 1'CS_1 + 1'AskForSection_1_1 + 1'AskForSection_1_0= 0
invariant : 1'WantSection_1_T + 1'WantSection_1_F= 1
invariant : 1'IsEndLoop_2_0_0 + 1'IsEndLoop_2_1_0 + 1'IsEndLoop_2_0_1 + 1'IsEndLoop_2_1_1 + 1'IsEndLoop_2_0_2 + 1'IsEndLoop_2_1_2 + 1'EndTurn_2_0 + 1'EndTurn_2_1 + 1'BeginLoop_2_0_0 + 1'BeginLoop_2_0_1 + 1'BeginLoop_2_1_0 + 1'BeginLoop_2_1_1 + 1'BeginLoop_2_0_2 + -1'WantSection_2_T + 1'BeginLoop_2_1_2 + 1'TestAlone_2_1_0 + 1'TestAlone_2_0_0 + 1'TestAlone_2_1_1 + 1'TestAlone_2_0_1 + 1'TestTurn_2_1 + 1'TestIdentity_2_0_0 + 1'TestTurn_2_0 + 1'TestIdentity_2_0_1 + 1'TestIdentity_2_1_0 + 1'TestIdentity_2_1_2 + 1'TestIdentity_2_1_1 + 1'TestIdentity_2_0_2 + 1'AskForSection_2_1 + 1'AskForSection_2_0 + 1'CS_2= 0
invariant : 1'WantSection_1_T + 1'Idle_1= 1
invariant : 1'Turn_0_0 + 1'Turn_0_1 + 1'Turn_0_2= 1
invariant : 1'WantSection_0_T + 1'Idle_0= 1
invariant : 1'WantSection_2_T + 1'WantSection_2_F= 1
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
158 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.62977,62124,1,0,254,163943,272,129,3047,132907,260
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(X("(((((Turn_0_0+Turn_1_2)+Turn_0_1)+Turn_1_0)+Turn_0_2)+Turn_1_1)<=(((((AskForSection_1_1+AskForSection_2_1)+AskForSection_2_0)+AskForSection_0_1)+AskForSection_0_0)+AskForSection_1_0)"))))
Formula 1 simplified : !XX"(((((Turn_0_0+Turn_1_2)+Turn_0_1)+Turn_1_0)+Turn_0_2)+Turn_1_1)<=(((((AskForSection_1_1+AskForSection_2_1)+AskForSection_2_0)+AskForSection_0_1)+AskForSection_0_0)+AskForSection_1_0)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
45 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.07634,68032,1,0,258,185022,281,129,3326,176847,281
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(G(("(((((((((((((((((BeginLoop_0_0_0+BeginLoop_2_0_0)+BeginLoop_1_0_0)+BeginLoop_1_1_0)+BeginLoop_0_1_0)+BeginLoop_1_0_1)+BeginLoop_2_0_1)+BeginLoop_2_1_0)+BeginLoop_0_0_1)+BeginLoop_2_1_1)+BeginLoop_0_0_2)+BeginLoop_0_1_1)+BeginLoop_1_1_1)+BeginLoop_0_1_2)+BeginLoop_1_1_2)+BeginLoop_1_0_2)+BeginLoop_2_0_2)+BeginLoop_2_1_2)>=2")U("((CS_0+CS_1)+CS_2)<=(((((EndTurn_0_0+EndTurn_2_0)+EndTurn_1_0)+EndTurn_1_1)+EndTurn_0_1)+EndTurn_2_1)")))))
Formula 2 simplified : !G("(((((((((((((((((BeginLoop_0_0_0+BeginLoop_2_0_0)+BeginLoop_1_0_0)+BeginLoop_1_1_0)+BeginLoop_0_1_0)+BeginLoop_1_0_1)+BeginLoop_2_0_1)+BeginLoop_2_1_0)+BeginLoop_0_0_1)+BeginLoop_2_1_1)+BeginLoop_0_0_2)+BeginLoop_0_1_1)+BeginLoop_1_1_1)+BeginLoop_0_1_2)+BeginLoop_1_1_2)+BeginLoop_1_0_2)+BeginLoop_2_0_2)+BeginLoop_2_1_2)>=2" U "((CS_0+CS_1)+CS_2)<=(((((EndTurn_0_0+EndTurn_2_0)+EndTurn_1_0)+EndTurn_1_1)+EndTurn_0_1)+EndTurn_2_1)")
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
321 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,5.28445,139344,1,0,428,492681,294,191,3704,545883,597
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X((X("((CS_0+CS_1)+CS_2)<=(((((((((((((((((IsEndLoop_0_0_0+IsEndLoop_1_0_0)+IsEndLoop_2_0_0)+IsEndLoop_0_1_0)+IsEndLoop_1_1_0)+IsEndLoop_2_1_0)+IsEndLoop_0_0_1)+IsEndLoop_1_0_1)+IsEndLoop_2_0_1)+IsEndLoop_0_1_1)+IsEndLoop_1_1_1)+IsEndLoop_2_1_1)+IsEndLoop_0_0_2)+IsEndLoop_2_0_2)+IsEndLoop_1_0_2)+IsEndLoop_1_1_2)+IsEndLoop_0_1_2)+IsEndLoop_2_1_2)"))U(G("(((((((((((((((((TestIdentity_0_0_0+TestIdentity_1_0_0)+TestIdentity_2_0_0)+TestIdentity_1_0_1)+TestIdentity_2_0_1)+TestIdentity_0_1_1)+TestIdentity_1_1_1)+TestIdentity_0_1_0)+TestIdentity_1_1_0)+TestIdentity_2_1_0)+TestIdentity_0_0_1)+TestIdentity_1_1_2)+TestIdentity_0_1_2)+TestIdentity_2_1_2)+TestIdentity_0_0_2)+TestIdentity_2_1_1)+TestIdentity_2_0_2)+TestIdentity_1_0_2)>=2")))))
Formula 3 simplified : !X(X"((CS_0+CS_1)+CS_2)<=(((((((((((((((((IsEndLoop_0_0_0+IsEndLoop_1_0_0)+IsEndLoop_2_0_0)+IsEndLoop_0_1_0)+IsEndLoop_1_1_0)+IsEndLoop_2_1_0)+IsEndLoop_0_0_1)+IsEndLoop_1_0_1)+IsEndLoop_2_0_1)+IsEndLoop_0_1_1)+IsEndLoop_1_1_1)+IsEndLoop_2_1_1)+IsEndLoop_0_0_2)+IsEndLoop_2_0_2)+IsEndLoop_1_0_2)+IsEndLoop_1_1_2)+IsEndLoop_0_1_2)+IsEndLoop_2_1_2)" U G"(((((((((((((((((TestIdentity_0_0_0+TestIdentity_1_0_0)+TestIdentity_2_0_0)+TestIdentity_1_0_1)+TestIdentity_2_0_1)+TestIdentity_0_1_1)+TestIdentity_1_1_1)+TestIdentity_0_1_0)+TestIdentity_1_1_0)+TestIdentity_2_1_0)+TestIdentity_0_0_1)+TestIdentity_1_1_2)+TestIdentity_0_1_2)+TestIdentity_2_1_2)+TestIdentity_0_0_2)+TestIdentity_2_1_1)+TestIdentity_2_0_2)+TestIdentity_1_0_2)>=2")
7 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
48 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,5.77735,150588,1,0,434,531815,303,191,4029,580847,623
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(X(("(((((((((((((((((IsEndLoop_0_0_0+IsEndLoop_1_0_0)+IsEndLoop_2_0_0)+IsEndLoop_0_1_0)+IsEndLoop_1_1_0)+IsEndLoop_2_1_0)+IsEndLoop_0_0_1)+IsEndLoop_1_0_1)+IsEndLoop_2_0_1)+IsEndLoop_0_1_1)+IsEndLoop_1_1_1)+IsEndLoop_2_1_1)+IsEndLoop_0_0_2)+IsEndLoop_2_0_2)+IsEndLoop_1_0_2)+IsEndLoop_1_1_2)+IsEndLoop_0_1_2)+IsEndLoop_2_1_2)<=(((((TestTurn_0_0+TestTurn_2_1)+TestTurn_1_0)+TestTurn_2_0)+TestTurn_0_1)+TestTurn_1_1)")U("(((((((((((TestAlone_1_0_0+TestAlone_0_0_1)+TestAlone_2_1_0)+TestAlone_1_1_0)+TestAlone_2_0_0)+TestAlone_0_0_2)+TestAlone_2_1_1)+TestAlone_0_1_1)+TestAlone_2_0_1)+TestAlone_1_1_2)+TestAlone_0_1_2)+TestAlone_1_0_2)<=(((((TestTurn_0_0+TestTurn_2_1)+TestTurn_1_0)+TestTurn_2_0)+TestTurn_0_1)+TestTurn_1_1)")))))
Formula 4 simplified : !FX("(((((((((((((((((IsEndLoop_0_0_0+IsEndLoop_1_0_0)+IsEndLoop_2_0_0)+IsEndLoop_0_1_0)+IsEndLoop_1_1_0)+IsEndLoop_2_1_0)+IsEndLoop_0_0_1)+IsEndLoop_1_0_1)+IsEndLoop_2_0_1)+IsEndLoop_0_1_1)+IsEndLoop_1_1_1)+IsEndLoop_2_1_1)+IsEndLoop_0_0_2)+IsEndLoop_2_0_2)+IsEndLoop_1_0_2)+IsEndLoop_1_1_2)+IsEndLoop_0_1_2)+IsEndLoop_2_1_2)<=(((((TestTurn_0_0+TestTurn_2_1)+TestTurn_1_0)+TestTurn_2_0)+TestTurn_0_1)+TestTurn_1_1)" U "(((((((((((TestAlone_1_0_0+TestAlone_0_0_1)+TestAlone_2_1_0)+TestAlone_1_1_0)+TestAlone_2_0_0)+TestAlone_0_0_2)+TestAlone_2_1_1)+TestAlone_0_1_1)+TestAlone_2_0_1)+TestAlone_1_1_2)+TestAlone_0_1_2)+TestAlone_1_0_2)<=(((((TestTurn_0_0+TestTurn_2_1)+TestTurn_1_0)+TestTurn_2_0)+TestTurn_0_1)+TestTurn_1_1)")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.78015,150644,1,0,434,531815,312,191,4048,580847,627
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F("(((((((((((((((((BeginLoop_0_0_0+BeginLoop_2_0_0)+BeginLoop_1_0_0)+BeginLoop_1_1_0)+BeginLoop_0_1_0)+BeginLoop_1_0_1)+BeginLoop_2_0_1)+BeginLoop_2_1_0)+BeginLoop_0_0_1)+BeginLoop_2_1_1)+BeginLoop_0_0_2)+BeginLoop_0_1_1)+BeginLoop_1_1_1)+BeginLoop_0_1_2)+BeginLoop_1_1_2)+BeginLoop_1_0_2)+BeginLoop_2_0_2)+BeginLoop_2_1_2)>=1")))
Formula 5 simplified : !F"(((((((((((((((((BeginLoop_0_0_0+BeginLoop_2_0_0)+BeginLoop_1_0_0)+BeginLoop_1_1_0)+BeginLoop_0_1_0)+BeginLoop_1_0_1)+BeginLoop_2_0_1)+BeginLoop_2_1_0)+BeginLoop_0_0_1)+BeginLoop_2_1_1)+BeginLoop_0_0_2)+BeginLoop_0_1_1)+BeginLoop_1_1_1)+BeginLoop_0_1_2)+BeginLoop_1_1_2)+BeginLoop_1_0_2)+BeginLoop_2_0_2)+BeginLoop_2_1_2)>=1"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,5.88826,152708,1,0,492,541150,321,204,4087,590724,758
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(F(X(G("(((((Turn_0_0+Turn_1_2)+Turn_0_1)+Turn_1_0)+Turn_0_2)+Turn_1_1)<=(((((EndTurn_0_0+EndTurn_2_0)+EndTurn_1_0)+EndTurn_1_1)+EndTurn_0_1)+EndTurn_2_1)"))))))
Formula 6 simplified : !XFXG"(((((Turn_0_0+Turn_1_2)+Turn_0_1)+Turn_1_0)+Turn_0_2)+Turn_1_1)<=(((((EndTurn_0_0+EndTurn_2_0)+EndTurn_1_0)+EndTurn_1_1)+EndTurn_0_1)+EndTurn_2_1)"
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Exit code :0
Exit code :1
FORMULA Peterson-COL-2-LTLCardinality-6 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA Peterson-COL-2-LTLCardinality-7 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA Peterson-COL-2-LTLCardinality-8 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA Peterson-COL-2-LTLCardinality-9 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA Peterson-COL-2-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Peterson-COL-2-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Peterson-COL-2-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Peterson-COL-2-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA Peterson-COL-2-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Peterson-COL-2-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Detected timeout of ITS tools.

BK_STOP 1496267159075

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
May 31, 2017 9:45:50 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 9:45:50 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 90 ms
May 31, 2017 9:45:51 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 102 places.
May 31, 2017 9:45:51 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 126 transitions.
May 31, 2017 9:45:51 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 105 ms
May 31, 2017 9:45:51 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 14 ms
May 31, 2017 9:45:51 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 7 ms
May 31, 2017 9:45:51 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 38 ms
May 31, 2017 9:45:52 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 102 variables to be positive in 502 ms
May 31, 2017 9:45:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 126 transitions.
May 31, 2017 9:45:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/126 took 1 ms. Total solver calls (SAT/UNSAT): 4(1/3)
May 31, 2017 9:45:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 225 ms. Total solver calls (SAT/UNSAT): 579(198/381)
May 31, 2017 9:45:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 126 transitions.
May 31, 2017 9:45:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 260 ms. Total solver calls (SAT/UNSAT): 579(246/333)
May 31, 2017 9:45:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 126 transitions.
May 31, 2017 9:45:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(33/126) took 994 ms. Total solver calls (SAT/UNSAT): 3723(2261/1462)
May 31, 2017 9:45:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(102/126) took 1997 ms. Total solver calls (SAT/UNSAT): 7725(4492/3233)
May 31, 2017 9:45:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 2060 ms. Total solver calls (SAT/UNSAT): 8001(4632/3369)
May 31, 2017 9:45:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 126 transitions.
May 31, 2017 9:45:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 31, 2017 9:45:55 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3406ms conformant to PINS in folder :/home/mcc/execution
May 31, 2017 9:45:57 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, X(<>(X([]((LTLAP9==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.001: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.003: completed loading model GAL
pins2lts-seq, 0.003: LTL layer: formula: X(<>(X([]((LTLAP9==true)))))
pins2lts-seq, 0.003: Expression is: (X (<> (X ([] (LTLAP9 == true )))))
pins2lts-seq, 0.003: buchi has 2 states
pins2lts-seq, 0.003: state 0: non-accepting
pins2lts-seq, 0.003: -> 1, | !(LTLAP9 == true )
pins2lts-seq, 0.003: -> 0, | true
pins2lts-seq, 0.003: state 1: accepting
pins2lts-seq, 0.003: -> 1, | !(LTLAP9 == true )
pins2lts-seq, 0.003: -> 0, | true
pins2lts-seq, 0.004: There are 151 state labels and 1 edge labels
pins2lts-seq, 0.004: State length is 103, there are 130 groups
pins2lts-seq, 0.004: Running scc search strategy
pins2lts-seq, 0.004: Using a tree for state storage
pins2lts-seq, 0.005: accepting cycle found!
pins2lts-seq, 0.005: exiting now

May 31, 2017 9:45:57 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>((LTLAP10==true))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 150, guards 126
pins2lts-seq, 0.017: LTL layer: formula: <>((LTLAP10==true))
pins2lts-seq, 0.017: Expression is: (<> (LTLAP10 == true ))
pins2lts-seq, 0.017: buchi has 1 states
pins2lts-seq, 0.017: state 0: accepting
pins2lts-seq, 0.017: -> 0, | !(LTLAP10 == true )
pins2lts-seq, 0.017: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.018: There are 151 state labels and 1 edge labels
pins2lts-seq, 0.018: State length is 103, there are 127 groups
pins2lts-seq, 0.018: Running scc search strategy
pins2lts-seq, 0.018: Using a tree for state storage
pins2lts-seq, 0.018: Visible groups: 0 / 127, labels: 1 / 151
pins2lts-seq, 0.018: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.019: state space 1 levels, 1 states 0 transitions

May 31, 2017 9:45:57 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (((LTLAP11==true))U((LTLAP12==true)))U(((LTLAP13==true))U((LTLAP14==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 150, guards 126
pins2lts-seq, 0.016: LTL layer: formula: (((LTLAP11==true))U((LTLAP12==true)))U(((LTLAP13==true))U((LTLAP14==true)))
pins2lts-seq, 0.016: Expression is: (((LTLAP11 == true ) U (LTLAP12 == true )) U ((LTLAP13 == true ) U (LTLAP14 == true )))
pins2lts-seq, 0.016: buchi has 5 states
pins2lts-seq, 0.016: state 0: accepting
pins2lts-seq, 0.016: -> 1, | !(LTLAP14 == true ) && !(LTLAP13 == true ) && !(LTLAP12 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.016: -> 2, | !(LTLAP14 == true ) && !(LTLAP13 == true ) && !(LTLAP12 == true )
pins2lts-seq, 0.016: -> 0, | !(LTLAP14 == true )
pins2lts-seq, 0.016: -> 3, | !(LTLAP14 == true ) && !(LTLAP12 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.016: -> 4, | !(LTLAP14 == true ) && !(LTLAP12 == true )
pins2lts-seq, 0.016: state 1: accepting
pins2lts-seq, 0.016: -> 1, | true
pins2lts-seq, 0.016: state 2: accepting
pins2lts-seq, 0.016: -> 2, | !(LTLAP12 == true )
pins2lts-seq, 0.016: -> 1, | !(LTLAP12 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.016: state 3: accepting
pins2lts-seq, 0.016: -> 3, | !(LTLAP14 == true )
pins2lts-seq, 0.016: -> 1, | !(LTLAP14 == true ) && !(LTLAP13 == true )
pins2lts-seq, 0.016: state 4: accepting
pins2lts-seq, 0.016: -> 4, | !(LTLAP14 == true ) && !(LTLAP12 == true )
pins2lts-seq, 0.016: -> 3, | !(LTLAP14 == true ) && !(LTLAP12 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.016: -> 2, | !(LTLAP14 == true ) && !(LTLAP13 == true ) && !(LTLAP12 == true )
pins2lts-seq, 0.016: -> 1, | !(LTLAP14 == true ) && !(LTLAP13 == true ) && !(LTLAP12 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.017: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.017: There are 151 state labels and 1 edge labels
pins2lts-seq, 0.017: State length is 103, there are 140 groups
pins2lts-seq, 0.017: Running scc search strategy
pins2lts-seq, 0.017: Using a tree for state storage
pins2lts-seq, 0.017: Visible groups: 657 / 140, labels: 4 / 151
pins2lts-seq, 0.017: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.018: state space 1 levels, 1 states 0 transitions

May 31, 2017 9:45:57 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP15==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 150, guards 126
pins2lts-seq, 0.016: LTL layer: formula: (LTLAP15==true)
pins2lts-seq, 0.016: Expression is: (LTLAP15 == true )
pins2lts-seq, 0.016: buchi has 2 states
pins2lts-seq, 0.016: state 0: accepting
pins2lts-seq, 0.016: -> 1, | !(LTLAP15 == true )
pins2lts-seq, 0.016: state 1: accepting
pins2lts-seq, 0.016: -> 1, | true
pins2lts-seq, 0.016: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.017: There are 151 state labels and 1 edge labels
pins2lts-seq, 0.017: State length is 103, there are 128 groups
pins2lts-seq, 0.017: Running scc search strategy
pins2lts-seq, 0.017: Using a tree for state storage
pins2lts-seq, 0.017: Visible groups: 0 / 128, labels: 1 / 151
pins2lts-seq, 0.017: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.018: state space 1 levels, 1 states 0 transitions

May 31, 2017 9:45:58 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, []([](((LTLAP16==true))U((LTLAP17==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 150, guards 126
pins2lts-seq, 0.016: LTL layer: formula: []([](((LTLAP16==true))U((LTLAP17==true))))
pins2lts-seq, 0.016: Expression is: ([] ([] ((LTLAP16 == true ) U (LTLAP17 == true ))))
pins2lts-seq, 0.016: buchi has 3 states
pins2lts-seq, 0.016: state 0: non-accepting
pins2lts-seq, 0.016: -> 0, | true
pins2lts-seq, 0.016: -> 1, | !(LTLAP17 == true ) && !(LTLAP16 == true )
pins2lts-seq, 0.016: -> 2, | !(LTLAP17 == true )
pins2lts-seq, 0.016: state 1: accepting
pins2lts-seq, 0.016: -> 1, | true
pins2lts-seq, 0.016: state 2: accepting
pins2lts-seq, 0.016: -> 2, | !(LTLAP17 == true )
pins2lts-seq, 0.016: -> 1, | !(LTLAP17 == true ) && !(LTLAP16 == true )
pins2lts-seq, 0.017: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.017: There are 151 state labels and 1 edge labels
pins2lts-seq, 0.017: State length is 103, there are 132 groups
pins2lts-seq, 0.017: Running scc search strategy
pins2lts-seq, 0.017: Using a tree for state storage
pins2lts-seq, 0.017: Visible groups: 657 / 132, labels: 2 / 151
pins2lts-seq, 0.017: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.420: explored 655 levels ~10000 states ~24942 transitions
pins2lts-seq, 0.647: state space 655 levels, 16078 states 39193 transitions

May 31, 2017 9:45:58 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>(<>([]([]((LTLAP18==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 150, guards 126
pins2lts-seq, 0.016: LTL layer: formula: <>(<>([]([]((LTLAP18==true)))))
pins2lts-seq, 0.016: Expression is: (<> (<> ([] ([] (LTLAP18 == true )))))
pins2lts-seq, 0.016: buchi has 2 states
pins2lts-seq, 0.016: state 0: non-accepting
pins2lts-seq, 0.016: -> 1, | !(LTLAP18 == true )
pins2lts-seq, 0.016: -> 0, | true
pins2lts-seq, 0.016: state 1: accepting
pins2lts-seq, 0.016: -> 1, | !(LTLAP18 == true )
pins2lts-seq, 0.016: -> 0, | true
pins2lts-seq, 0.017: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.017: There are 151 state labels and 1 edge labels
pins2lts-seq, 0.017: State length is 103, there are 130 groups
pins2lts-seq, 0.017: Running scc search strategy
pins2lts-seq, 0.017: Using a tree for state storage
pins2lts-seq, 0.017: Visible groups: 0 / 130, labels: 1 / 151
pins2lts-seq, 0.017: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.020: accepting cycle found!
pins2lts-seq, 0.020: exiting now

May 31, 2017 9:45:58 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP19==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 150, guards 126
pins2lts-seq, 0.016: LTL layer: formula: (LTLAP19==true)
pins2lts-seq, 0.016: Expression is: (LTLAP19 == true )
pins2lts-seq, 0.016: buchi has 2 states
pins2lts-seq, 0.016: state 0: accepting
pins2lts-seq, 0.016: -> 1, | !(LTLAP19 == true )
pins2lts-seq, 0.016: state 1: accepting
pins2lts-seq, 0.016: -> 1, | true
pins2lts-seq, 0.017: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.017: There are 151 state labels and 1 edge labels
pins2lts-seq, 0.017: State length is 103, there are 128 groups
pins2lts-seq, 0.017: Running scc search strategy
pins2lts-seq, 0.017: Using a tree for state storage
pins2lts-seq, 0.017: Visible groups: 0 / 128, labels: 1 / 151
pins2lts-seq, 0.017: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.018: accepting cycle found!
pins2lts-seq, 0.018: exiting now

May 31, 2017 9:45:58 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, <>(<>(<>(X((LTLAP20==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: <>(<>(<>(X((LTLAP20==true)))))
pins2lts-seq, 0.001: Expression is: (<> (<> (<> (X (LTLAP20 == true )))))
pins2lts-seq, 0.001: buchi has 2 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP20 == true )
pins2lts-seq, 0.002: There are 151 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 103, there are 128 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.005: accepting cycle found!
pins2lts-seq, 0.005: exiting now

May 31, 2017 9:45:58 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, ((LTLAP21==true))U((LTLAP22==true))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 150, guards 126
pins2lts-seq, 0.016: LTL layer: formula: ((LTLAP21==true))U((LTLAP22==true))
pins2lts-seq, 0.016: Expression is: ((LTLAP21 == true ) U (LTLAP22 == true ))
pins2lts-seq, 0.016: buchi has 2 states
pins2lts-seq, 0.016: state 0: accepting
pins2lts-seq, 0.016: -> 0, | !(LTLAP22 == true )
pins2lts-seq, 0.016: -> 1, | !(LTLAP22 == true ) && !(LTLAP21 == true )
pins2lts-seq, 0.016: state 1: accepting
pins2lts-seq, 0.016: -> 1, | true
pins2lts-seq, 0.017: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.017: There are 151 state labels and 1 edge labels
pins2lts-seq, 0.017: State length is 103, there are 129 groups
pins2lts-seq, 0.017: Running scc search strategy
pins2lts-seq, 0.017: Using a tree for state storage
pins2lts-seq, 0.017: Visible groups: 0 / 129, labels: 2 / 151
pins2lts-seq, 0.017: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.018: state space 1 levels, 1 states 0 transitions

May 31, 2017 9:45:58 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, [](X(X(X((LTLAP23==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: [](X(X(X((LTLAP23==true)))))
pins2lts-seq, 0.001: Expression is: ([] (X (X (X (LTLAP23 == true )))))
pins2lts-seq, 0.001: buchi has 5 states
pins2lts-seq, 0.001: state 0: non-accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: state 1: non-accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.001: state 2: accepting
pins2lts-seq, 0.001: -> 3, | true
pins2lts-seq, 0.001: state 3: accepting
pins2lts-seq, 0.001: -> 4, | !(LTLAP23 == true )
pins2lts-seq, 0.001: state 4: accepting
pins2lts-seq, 0.001: -> 4, | true
pins2lts-seq, 0.002: There are 151 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 103, there are 132 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.003: accepting cycle found!
pins2lts-seq, 0.003: exiting now

May 31, 2017 9:45:58 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
May 31, 2017 9:45:58 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
May 31, 2017 9:45:58 PM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null

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="Peterson-PT-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-2.tgz
mv Peterson-PT-2 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is Peterson-PT-2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r050-smll-149440871700050"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;