Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814200346.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Dekker-PT-200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814200346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 25M Apr 27 14:36 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 Dekker-PT-200-00
FORMULA_NAME Dekker-PT-200-01
FORMULA_NAME Dekker-PT-200-02
FORMULA_NAME Dekker-PT-200-03
FORMULA_NAME Dekker-PT-200-04
FORMULA_NAME Dekker-PT-200-05
FORMULA_NAME Dekker-PT-200-06
FORMULA_NAME Dekker-PT-200-07
FORMULA_NAME Dekker-PT-200-08
FORMULA_NAME Dekker-PT-200-09
FORMULA_NAME Dekker-PT-200-10
FORMULA_NAME Dekker-PT-200-11
FORMULA_NAME Dekker-PT-200-12
FORMULA_NAME Dekker-PT-200-13
FORMULA_NAME Dekker-PT-200-14
FORMULA_NAME Dekker-PT-200-15

=== Now, execution of the tool begins

BK_START 1590111534281

[2020-05-22 01:38:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 01:38:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:38:57] [INFO ] Load time of PNML (sax parser for PT used): 1134 ms
[2020-05-22 01:38:57] [INFO ] Transformed 1000 places.
[2020-05-22 01:38:57] [INFO ] Transformed 40400 transitions.
[2020-05-22 01:38:57] [INFO ] Found NUPN structural information;
[2020-05-22 01:38:57] [INFO ] Parsed PT model containing 1000 places and 40400 transitions in 1508 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 163 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 2089 steps, including 0 resets, run visited all 61 properties in 166 ms. (steps per millisecond=12 )
[2020-05-22 01:39:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-22 01:39:01] [INFO ] Flatten gal took : 2658 ms
FORMULA Dekker-PT-200-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 01:39:03] [INFO ] Flatten gal took : 1642 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 01:39:08] [INFO ] Applying decomposition
[2020-05-22 01:39:09] [INFO ] Input system was already deterministic with 40400 transitions.
[2020-05-22 01:39:09] [INFO ] Too many transitions (40400) to apply POR reductions. Disabling POR matrices.
[2020-05-22 01:39:10] [INFO ] Flatten gal took : 2465 ms
[2020-05-22 01:39:12] [INFO ] Built C files in 6487ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph16207684666468140855.txt, -o, /tmp/graph16207684666468140855.bin, -w, /tmp/graph16207684666468140855.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16207684666468140855.bin, -l, -1, -v, -w, /tmp/graph16207684666468140855.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:39:15] [INFO ] Decomposing Gal with order
[2020-05-22 01:39:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:39:20] [INFO ] Removed a total of 136511 redundant transitions.
[2020-05-22 01:39:20] [INFO ] Flatten gal took : 3729 ms
[2020-05-22 01:39:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1709 ms.
[2020-05-22 01:39:22] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 258 ms
[2020-05-22 01:39:23] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 29 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 14 LTL properties
Checking formula 0 : !((!((X("((((((u90.flag_1_95!=1)||(u131.flag_1_136!=1))||(u131.p1_136!=1))&&(i63.u79.flag_1_84==1))&&(i116.u272.flag_1_161==1))&&(i63.u230.p1_84==1))"))U((("(((u169.flag_1_180==1)&&(i135.u284.flag_1_189==1))&&(i135.u178.p1_189==1))")U(X("(((i6.u9.flag_1_9==1)&&(u56.flag_1_62==1))&&(u56.p1_62==1))")))&&(X("(((i6.u9.flag_1_9==1)&&(u56.flag_1_62==1))&&(u56.p1_62==1))"))))))
Formula 0 simplified : X"((((((u90.flag_1_95!=1)||(u131.flag_1_136!=1))||(u131.p1_136!=1))&&(i63.u79.flag_1_84==1))&&(i116.u272.flag_1_161==1))&&(i63.u230.p1_84==1))" U (X"(((i6.u9.flag_1_9==1)&&(u56.flag_1_62==1))&&(u56.p1_62==1))" & ("(((u169.flag_1_180==1)&&(i135.u284.flag_1_189==1))&&(i135.u178.p1_189==1))" U X"(((i6.u9.flag_1_9==1)&&(u56.flag_1_62==1))&&(u56.p1_62==1))"))
built 19901 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u0.exit_0, u3.exit_3, u8.exit_8, u12.exit_12, u15.exit_15, u21.exit_20, u22.exit_23, u23.exit_24, u24.exit_25, u25.exit_27, u27.exit_30, u28.exit_31, u29.exit_32, u32.exit_35, u35.exit_38, u36.exit_39, u37.exit_40, u38.exit_41, u41.exit_44, u42.exit_45, u43.exit_46, u44.exit_48, u45.exit_49, u46.exit_50, u47.exit_51, u51.exit_56, u52.exit_58, u53.exit_59, u55.exit_61, u56.exit_62, u60.exit_65, u63.exit_67, u65.exit_69, u66.exit_70, u73.exit_78, u74.exit_79, u77.exit_82, u78.exit_83, u80.exit_85, u82.exit_88, u83.exit_89, u90.exit_95, u92.exit_98, u93.exit_99, u95.exit_101, u98.exit_103, u99.exit_104, u101.exit_107, u102.exit_108, u103.exit_109, u104.exit_110, u105.exit_111, u108.exit_114, u111.exit_117, u112.exit_118, u117.exit_122, u118.exit_123, u119.exit_124, u120.exit_125, u123.exit_127, u131.exit_136, u133.exit_138, u138.exit_146, u140.exit_148, u143.exit_151, u144.exit_152, u145.exit_153, u148.exit_157, u151.exit_162, u152.exit_163, u153.exit_164, u154.exit_166, u160.exit_170, u162.exit_172, u167.exit_178, u169.exit_180, u171.exit_182, u174.exit_185, u176.exit_187, u177.exit_188, u180.exit_191, u182.exit_193, u184.exit_195, u185.exit_196, u186.exit_197, u193.exit_7, u202.exit_21, u203.exit_22, u204.exit_26, u205.exit_28, u213.exit_47, u214.exit_52, u218.exit_57, u222.exit_71, u226.exit_75, u232.exit_87, u237.exit_96, u241.exit_106, u252.exit_133, u254.exit_135, u256.exit_139, u257.exit_140, u261.exit_144, u266.exit_154, u269.exit_158, u270.exit_159, u273.exit_165, u276.exit_173, u279.exit_177, u282.exit_184, u288.exit_199, i1.exit_2, i3.exit_5, i4.exit_6, i6.exit_9, i7.exit_10, i8.exit_11, i10.exit_13, i11.exit_14, i13.exit_16, i14.exit_18, i15.exit_19, i21.exit_29, i25.exit_33, i26.exit_34, i28.exit_36, i33.exit_42, i34.exit_43, i42.exit_54, i43.exit_55, i49.exit_64, i51.exit_66, i55.exit_72, i56.exit_73, i57.exit_74, i58.exit_77, i63.exit_84, i65.exit_86, i68.exit_90, i69.exit_91, i70.exit_92, i71.exit_93, i73.exit_97, i76.exit_100, i78.exit_102, i81.exit_105, i87.exit_112, i91.exit_121, i96.exit_126, i98.exit_130, i99.exit_132, i100.exit_134, i102.exit_137, i104.exit_142, i105.exit_143, i107.exit_147, i109.exit_149, i113.exit_155, i115.exit_160, i116.exit_161, i121.exit_167, i122.exit_168, i125.exit_176, i127.exit_179, i130.exit_183, i132.exit_186, i135.exit_189, i136.exit_190, i139.exit_194, i143.exit_198, i144.exit_1, i145.exit_4, i147.exit_17, i152.exit_37, i155.exit_53, i157.exit_60, i158.exit_63, i159.exit_68, i162.exit_76, i163.exit_80, i164.exit_81, i166.exit_94, i169.exit_113, i170.exit_115, i171.exit_116, i172.exit_119, i173.exit_120, i174.exit_128, i175.exit_129, i176.exit_131, i181.exit_141, i183.exit_145, i184.exit_150, i186.exit_156, i190.exit_169, i191.exit_171, i193.exit_174, i194.exit_175, i196.exit_181, i198.exit_192, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40200/200/40400
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
15853 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,173.383,3024612,1,0,9.47904e+06,20336,307893,4.1461e+06,449,30093,11156770
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Dekker-PT-200-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((F(X("(((u162.flag_1_172==1)&&(u177.flag_1_188==1))&&(u177.p1_188==1))")))||(!(F("(((i4.u192.flag_1_6==1)&&(u60.flag_1_65==1))&&(u60.p1_65==1))"))))||(X(F("((((((u202.flag_1_21!=1)||(u90.flag_1_95!=1))||(u202.p1_21!=1))||(i163.u228.flag_1_80!=1))||(i81.u100.flag_1_105!=1))||(i81.u240.p1_105!=1))")))))
Formula 1 simplified : !(FX"(((u162.flag_1_172==1)&&(u177.flag_1_188==1))&&(u177.p1_188==1))" | !F"(((i4.u192.flag_1_6==1)&&(u60.flag_1_65==1))&&(u60.p1_65==1))" | XF"((((((u202.flag_1_21!=1)||(u90.flag_1_95!=1))||(u202.p1_21!=1))||(i163.u228.flag_1_80!=1))||(i81.u100.flag_1_105!=1))||(i81.u240.p1_105!=1))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
42 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,173.805,3024960,1,0,9.47904e+06,20336,307982,4.14611e+06,450,30093,11157407
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Dekker-PT-200-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((((!(F(G((X("(((u120.flag_1_125==1)&&(i100.u130.flag_1_134==1))&&(u120.p1_125==1))"))&&(F((X("(((u214.flag_1_52==1)&&(u138.flag_1_146==1))&&(u214.p1_52==1))"))&&(F("(((i78.u97.flag_1_102==1)&&(i172.u113.flag_1_119==1))&&(i172.u246.p1_119==1))"))))))))||("(u21.flag_1_20!=1)"))||("(u266.flag_1_154!=1)"))||("(u21.p1_20!=1)"))))
Formula 2 simplified : !G("(u21.flag_1_20!=1)" | "(u21.p1_20!=1)" | "(u266.flag_1_154!=1)" | !FG(X"(((u120.flag_1_125==1)&&(i100.u130.flag_1_134==1))&&(u120.p1_125==1))" & F(X"(((u214.flag_1_52==1)&&(u138.flag_1_146==1))&&(u214.p1_52==1))" & F"(((i78.u97.flag_1_102==1)&&(i172.u113.flag_1_119==1))&&(i172.u246.p1_119==1))")))
4 unique states visited
4 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
7758 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,251.4,3174432,1,0,9.5011e+06,20336,110455,4.1779e+06,106,30093,70510
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-200-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X(G(((((!((G("(((u203.flag_1_22==1)&&(i130.u173.flag_1_183==1))&&(u203.p1_22==1))"))U("(((u65.flag_1_69==1)&&(u256.flag_1_139==1))&&(u65.p1_69==1))")))||(!(G("(((u28.flag_1_31==1)&&(i174.u124.flag_1_128==1))&&(i174.u248.p1_128==1))"))))||("(u120.flag_1_125!=1)"))||("(u256.flag_1_139!=1)"))||("(u120.p1_125!=1)"))))U(X("(((u65.flag_1_69==1)&&(u256.flag_1_139==1))&&(u65.p1_69==1))"))))
Formula 3 simplified : !(XG("(u120.flag_1_125!=1)" | "(u120.p1_125!=1)" | "(u256.flag_1_139!=1)" | !(G"(((u203.flag_1_22==1)&&(i130.u173.flag_1_183==1))&&(u203.p1_22==1))" U "(((u65.flag_1_69==1)&&(u256.flag_1_139==1))&&(u65.p1_69==1))") | !G"(((u28.flag_1_31==1)&&(i174.u124.flag_1_128==1))&&(i174.u248.p1_128==1))") U X"(((u65.flag_1_69==1)&&(u256.flag_1_139==1))&&(u65.p1_69==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2927 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,280.669,3174432,1,0,9.5011e+06,20336,134928,4.1779e+06,117,30093,122601
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-200-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(F(((!(F("(((u35.flag_1_38==1)&&(i55.u67.flag_1_72==1))&&(i55.u223.p1_72==1))")))&&(!(F("(((u36.flag_1_39==1)&&(i183.u137.flag_1_145==1))&&(u36.p1_39==1))"))))&&("(((u24.flag_1_25!=1)||(i71.u88.flag_1_93!=1))||(i71.u235.p1_93!=1))"))))||(G("(((u36.flag_1_39!=1)||(i183.u137.flag_1_145!=1))||(u36.p1_39!=1))"))))
Formula 4 simplified : !(GF("(((u24.flag_1_25!=1)||(i71.u88.flag_1_93!=1))||(i71.u235.p1_93!=1))" & !F"(((u35.flag_1_38==1)&&(i55.u67.flag_1_72==1))&&(i55.u223.p1_72==1))" & !F"(((u36.flag_1_39==1)&&(i183.u137.flag_1_145==1))&&(u36.p1_39==1))") | G"(((u36.flag_1_39!=1)||(i183.u137.flag_1_145!=1))||(u36.p1_39!=1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
2637 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,307.043,3174432,1,0,9.5011e+06,20336,143588,4.1779e+06,118,30093,272449
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-200-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(!(((X(("(((i159.u64.flag_1_68==1)&&(i70.u87.flag_1_92==1))&&(i159.u221.p1_68==1))")U("(((i8.u11.flag_1_11==1)&&(u269.flag_1_158==1))&&(i8.u196.p1_11==1))")))&&(F("(((i8.u11.flag_1_11==1)&&(u269.flag_1_158==1))&&(i8.u196.p1_11==1))")))U((X("(((i159.u64.flag_1_68==1)&&(i70.u87.flag_1_92==1))&&(i159.u221.p1_68==1))"))||(F("(((i8.u11.flag_1_11==1)&&(u269.flag_1_158==1))&&(i8.u196.p1_11==1))")))))))
Formula 5 simplified : !F!((X("(((i159.u64.flag_1_68==1)&&(i70.u87.flag_1_92==1))&&(i159.u221.p1_68==1))" U "(((i8.u11.flag_1_11==1)&&(u269.flag_1_158==1))&&(i8.u196.p1_11==1))") & F"(((i8.u11.flag_1_11==1)&&(u269.flag_1_158==1))&&(i8.u196.p1_11==1))") U (F"(((i8.u11.flag_1_11==1)&&(u269.flag_1_158==1))&&(i8.u196.p1_11==1))" | X"(((i159.u64.flag_1_68==1)&&(i70.u87.flag_1_92==1))&&(i159.u221.p1_68==1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1213 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,319.169,3174432,1,0,9.5011e+06,20336,146845,4.1779e+06,118,30093,336050
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-200-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(((X(X((F(X("(((u83.flag_1_89==1)&&(u92.flag_1_98==1))&&(u83.p1_89==1))")))||("(((u66.flag_1_70==1)&&(i139.u183.flag_1_194==1))&&(i139.u287.p1_194==1))"))))&&(!(X("(((u213.flag_1_47==1)&&(u44.flag_1_48==1))&&(u44.p1_48==1))"))))&&(G("(((u37.flag_1_40==1)&&(i186.u147.flag_1_156==1))&&(u37.p1_40==1))")))))
Formula 6 simplified : !F(XX("(((u66.flag_1_70==1)&&(i139.u183.flag_1_194==1))&&(i139.u287.p1_194==1))" | FX"(((u83.flag_1_89==1)&&(u92.flag_1_98==1))&&(u83.p1_89==1))") & !X"(((u213.flag_1_47==1)&&(u44.flag_1_48==1))&&(u44.p1_48==1))" & G"(((u37.flag_1_40==1)&&(i186.u147.flag_1_156==1))&&(u37.p1_40==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3146 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,350.628,3174432,1,0,9.5011e+06,20336,152341,4.1779e+06,118,30093,380562
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-200-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(X(F((G(X((X("(((i69.u85.flag_1_91==1)&&(i81.u100.flag_1_105==1))&&(i69.u234.p1_91==1))"))||("(((u269.flag_1_158==1)&&(u174.flag_1_185==1))&&(u269.p1_158==1))"))))U(X(F("(((u214.flag_1_52==1)&&(i157.u54.flag_1_60==1))&&(u214.p1_52==1))"))))))))
Formula 7 simplified : XF(GX("(((u269.flag_1_158==1)&&(u174.flag_1_185==1))&&(u269.p1_158==1))" | X"(((i69.u85.flag_1_91==1)&&(i81.u100.flag_1_105==1))&&(i69.u234.p1_91==1))") U XF"(((u214.flag_1_52==1)&&(i157.u54.flag_1_60==1))&&(u214.p1_52==1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
373 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,354.364,3174432,1,0,9.5011e+06,20336,153401,4.1779e+06,118,30093,399378
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-200-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(G("(((i3.u6.flag_1_5==1)&&(i147.u17.flag_1_17==1))&&(i147.u200.p1_17==1))")))||(X(G("((((i78.u97.flag_1_102==1)&&(u180.flag_1_191==1))&&(i78.u96.p1_102==1))||(((u8.flag_1_8==1)&&(u108.flag_1_114==1))&&(u108.p1_114==1)))")))))
Formula 8 simplified : !(XG"(((i3.u6.flag_1_5==1)&&(i147.u17.flag_1_17==1))&&(i147.u200.p1_17==1))" | XG"((((i78.u97.flag_1_102==1)&&(u180.flag_1_191==1))&&(i78.u96.p1_102==1))||(((u8.flag_1_8==1)&&(u108.flag_1_114==1))&&(u108.p1_114==1)))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
20 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,354.559,3174432,1,0,9.5011e+06,20336,153481,4.1779e+06,118,30093,400448
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-200-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(X(F(!(G("(((i26.u31.flag_1_34==1)&&(u182.flag_1_193==1))&&(u182.p1_193==1))")))))))
Formula 9 simplified : !FXF!G"(((i26.u31.flag_1_34==1)&&(u182.flag_1_193==1))&&(u182.p1_193==1))"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
21 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,354.774,3174432,1,0,9.5011e+06,20336,153523,4.1779e+06,118,30093,400672
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Dekker-PT-200-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F(X(X(F("(((u80.flag_1_85==1)&&(i130.u173.flag_1_183==1))&&(i130.u172.p1_183==1))")))))))
Formula 10 simplified : !XFXXF"(((u80.flag_1_85==1)&&(i130.u173.flag_1_183==1))&&(i130.u172.p1_183==1))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
633 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,361.106,3174432,1,0,9.5011e+06,20336,155656,4.1779e+06,118,30093,425281
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Dekker-PT-200-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F(G("(((i65.u81.flag_1_86==1)&&(u103.flag_1_109==1))&&(u103.p1_109==1))")))U(("((((((i152.u210.flag_1_37==1)&&(i51.u62.flag_1_66==1))&&(i51.u61.p1_66==1))&&(u55.flag_1_61==1))&&(i162.u70.flag_1_76==1))&&(i162.u227.p1_76==1))")U((("(((i158.u220.flag_1_63==1)&&(u288.flag_1_199==1))&&(i158.u57.p1_63==1))")U(G("(((u35.flag_1_38==1)&&(u65.flag_1_69==1))&&(u65.p1_69==1))")))U(X("(((i65.u81.flag_1_86==1)&&(u103.flag_1_109==1))&&(u103.p1_109==1))"))))))
Formula 11 simplified : !(FG"(((i65.u81.flag_1_86==1)&&(u103.flag_1_109==1))&&(u103.p1_109==1))" U ("((((((i152.u210.flag_1_37==1)&&(i51.u62.flag_1_66==1))&&(i51.u61.p1_66==1))&&(u55.flag_1_61==1))&&(i162.u70.flag_1_76==1))&&(i162.u227.p1_76==1))" U (("(((i158.u220.flag_1_63==1)&&(u288.flag_1_199==1))&&(i158.u57.p1_63==1))" U G"(((u35.flag_1_38==1)&&(u65.flag_1_69==1))&&(u65.p1_69==1))") U X"(((i65.u81.flag_1_86==1)&&(u103.flag_1_109==1))&&(u103.p1_109==1))")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
506 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,366.184,3174432,1,0,9.5011e+06,20336,155737,4.1779e+06,118,30093,1884169
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Dekker-PT-200-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((G(X((X(G("(((u53.flag_1_59!=1)||(i100.u130.flag_1_134!=1))||(i100.u253.p1_134!=1))")))||(X("(((u53.flag_1_59==1)&&(i100.u130.flag_1_134==1))&&(i100.u253.p1_134==1))")))))U("((((i58.u72.flag_1_77==1)&&(i122.u158.flag_1_168==1))&&(i58.u71.p1_77==1))||(((u27.flag_1_30==1)&&(u82.flag_1_88==1))&&(u82.p1_88==1)))")))
Formula 12 simplified : !(GX(XG"(((u53.flag_1_59!=1)||(i100.u130.flag_1_134!=1))||(i100.u253.p1_134!=1))" | X"(((u53.flag_1_59==1)&&(i100.u130.flag_1_134==1))&&(i100.u253.p1_134==1))") U "((((i58.u72.flag_1_77==1)&&(i122.u158.flag_1_168==1))&&(i58.u71.p1_77==1))||(((u27.flag_1_30==1)&&(u82.flag_1_88==1))&&(u82.p1_88==1)))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
874 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,374.934,3174432,1,0,9.5011e+06,20336,158647,4.1779e+06,118,30093,1936955
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Dekker-PT-200-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F((((((X(X("(((i43.u217.flag_1_55==1)&&(u102.flag_1_108==1))&&(i43.u50.p1_55==1))")))&&(F("(((i21.u26.flag_1_29!=1)||(i164.u229.flag_1_81!=1))||(i21.u206.p1_29!=1))")))&&(F("(((u103.flag_1_109==1)&&(u171.flag_1_182==1))&&(u171.p1_182==1))")))&&("(i43.u217.flag_1_55==1)"))&&("(u102.flag_1_108==1)"))&&("(i43.u50.p1_55==1)"))))
Formula 13 simplified : !F("(i43.u50.p1_55==1)" & "(i43.u217.flag_1_55==1)" & "(u102.flag_1_108==1)" & XX"(((i43.u217.flag_1_55==1)&&(u102.flag_1_108==1))&&(i43.u50.p1_55==1))" & F"(((i21.u26.flag_1_29!=1)||(i164.u229.flag_1_81!=1))||(i21.u206.p1_29!=1))" & F"(((u103.flag_1_109==1)&&(u171.flag_1_182==1))&&(u171.p1_182==1))")
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution] killed by timeout after 400 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution] killed by timeout after 400 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:80)
at java.base/java.lang.Thread.run(Thread.java:834)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1773 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,392.667,3174432,1,0,9.5011e+06,20336,164276,4.1779e+06,119,30093,1991755
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Dekker-PT-200-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590111961644

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-200"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Dekker-PT-200, 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 r066-tajo-158922814200346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-200.tgz
mv Dekker-PT-200 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;