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)
....................
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 38K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is LamportFastMutEx-COL-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585200018
=====================================================================

--------------------
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 LamportFastMutEx-COL-2-LTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527484350396

05:12:32.613 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
05:12:32.615 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/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.201805151631/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 16 LTL properties
Checking formula 0 : !((G(X(X(F("((((pid0.y_0>=1)&&(pid0.P_ifyi_15_0>=1))||((pid1.y_1>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ifyi_15_2>=1)))"))))))
Formula 0 simplified : !GXXF"((((pid0.y_0>=1)&&(pid0.P_ifyi_15_0>=1))||((pid1.y_1>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ifyi_15_2>=1)))"
built 28 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions T_setx_3_1, T_setx_3_2, T_setbi_5_1, T_setbi_5_2, T_awaity, T_sety_9_1, T_sety_9_2, T_setbi_11_1, T_setbi_11_2, T_ynei_15_1, T_ynei_15_2, T_sety0_23, T_setbi_24_1, T_setbi_24_2, pid1.T_yeqi_15_1, pid2.T_yeqi_15_2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :13/13/16/42
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
13 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.153487,21568,1,0,6723,4280,772,10167,318,19999,22626
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(G(G(G(X("(((((((((((pid_x_bool0.b_0>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid0.wait_0>=1))||(((pid_x_bool0.b_0>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid3.wait_3>=1)))||(((pid_x_bool0.b_0>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid6.wait_6>=1)))||(((pid_x_bool2.b_2>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid1.wait_1>=1)))||(((pid_x_bool2.b_2>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid4.wait_4>=1)))||(((pid_x_bool2.b_2>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid7.wait_7>=1)))||(((pid_x_bool4.b_4>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid2.wait_2>=1)))||(((pid_x_bool4.b_4>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid5.wait_5>=1)))||(((pid_x_bool4.b_4>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid8.wait_8>=1)))")))))))
Formula 1 simplified : !GX"(((((((((((pid_x_bool0.b_0>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid0.wait_0>=1))||(((pid_x_bool0.b_0>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid3.wait_3>=1)))||(((pid_x_bool0.b_0>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid6.wait_6>=1)))||(((pid_x_bool2.b_2>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid1.wait_1>=1)))||(((pid_x_bool2.b_2>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid4.wait_4>=1)))||(((pid_x_bool2.b_2>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid7.wait_7>=1)))||(((pid_x_bool4.b_4>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid2.wait_2>=1)))||(((pid_x_bool4.b_4>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid5.wait_5>=1)))||(((pid_x_bool4.b_4>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid8.wait_8>=1)))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.165609,21944,1,0,7160,4290,855,10701,318,20220,25282
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("(((((((pid0.P_setbi_24_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_24_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool5.b_5>=1)))"))
Formula 2 simplified : !"(((((((pid0.P_setbi_24_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_24_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool5.b_5>=1)))"
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.173168,22208,1,0,7337,4290,891,10926,318,20220,26298
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F("(((((((((((pid_x_bool0.b_0>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid0.wait_0>=1))||(((pid_x_bool0.b_0>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid3.wait_3>=1)))||(((pid_x_bool0.b_0>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid6.wait_6>=1)))||(((pid_x_bool2.b_2>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid1.wait_1>=1)))||(((pid_x_bool2.b_2>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid4.wait_4>=1)))||(((pid_x_bool2.b_2>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid7.wait_7>=1)))||(((pid_x_bool4.b_4>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid2.wait_2>=1)))||(((pid_x_bool4.b_4>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid5.wait_5>=1)))||(((pid_x_bool4.b_4>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid8.wait_8>=1)))"))))
Formula 3 simplified : !GF"(((((((((((pid_x_bool0.b_0>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid0.wait_0>=1))||(((pid_x_bool0.b_0>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid3.wait_3>=1)))||(((pid_x_bool0.b_0>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid6.wait_6>=1)))||(((pid_x_bool2.b_2>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid1.wait_1>=1)))||(((pid_x_bool2.b_2>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid4.wait_4>=1)))||(((pid_x_bool2.b_2>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid7.wait_7>=1)))||(((pid_x_bool4.b_4>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid2.wait_2>=1)))||(((pid_x_bool4.b_4>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid5.wait_5>=1)))||(((pid_x_bool4.b_4>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid8.wait_8>=1)))"
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.18428,22728,1,0,8356,4291,897,11646,318,20248,32802
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("(((((((pid0.P_setbi_5_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_5_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_5_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_5_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_5_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_5_2>=1)&&(pid_x_bool5.b_5>=1)))"))
Formula 4 simplified : !"(((((((pid0.P_setbi_5_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_5_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_5_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_5_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_5_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_5_2>=1)&&(pid_x_bool5.b_5>=1)))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.185433,22992,1,0,8356,4291,933,11646,318,20248,32839
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(F(F(("(((((((pid1.y_1>=1)&&(pid0.P_ify0_4_0>=1))||((pid1.y_1>=1)&&(pid1.P_ify0_4_1>=1)))||((pid1.y_1>=1)&&(pid2.P_ify0_4_2>=1)))||((pid2.y_2>=1)&&(pid0.P_ify0_4_0>=1)))||((pid2.y_2>=1)&&(pid1.P_ify0_4_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ify0_4_2>=1)))")U("(((((((pid0.P_setbi_5_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_5_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_5_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_5_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_5_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_5_2>=1)&&(pid_x_bool5.b_5>=1)))"))))))
Formula 5 simplified : !F("(((((((pid1.y_1>=1)&&(pid0.P_ify0_4_0>=1))||((pid1.y_1>=1)&&(pid1.P_ify0_4_1>=1)))||((pid1.y_1>=1)&&(pid2.P_ify0_4_2>=1)))||((pid2.y_2>=1)&&(pid0.P_ify0_4_0>=1)))||((pid2.y_2>=1)&&(pid1.P_ify0_4_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ify0_4_2>=1)))" U "(((((((pid0.P_setbi_5_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_5_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_5_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_5_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_5_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_5_2>=1)&&(pid_x_bool5.b_5>=1)))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 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.239816,25380,1,0,12753,4394,939,16312,318,23230,53097
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G("((((((((((pid0.P_sety_9_0>=1)&&(pid0.y_0>=1))||((pid1.P_sety_9_1>=1)&&(pid0.y_0>=1)))||((pid2.P_sety_9_2>=1)&&(pid0.y_0>=1)))||((pid0.P_sety_9_0>=1)&&(pid1.y_1>=1)))||((pid1.P_sety_9_1>=1)&&(pid1.y_1>=1)))||((pid2.P_sety_9_2>=1)&&(pid1.y_1>=1)))||((pid0.P_sety_9_0>=1)&&(pid2.y_2>=1)))||((pid1.P_sety_9_1>=1)&&(pid2.y_2>=1)))||((pid2.P_sety_9_2>=1)&&(pid2.y_2>=1)))")))
Formula 6 simplified : !G"((((((((((pid0.P_sety_9_0>=1)&&(pid0.y_0>=1))||((pid1.P_sety_9_1>=1)&&(pid0.y_0>=1)))||((pid2.P_sety_9_2>=1)&&(pid0.y_0>=1)))||((pid0.P_sety_9_0>=1)&&(pid1.y_1>=1)))||((pid1.P_sety_9_1>=1)&&(pid1.y_1>=1)))||((pid2.P_sety_9_2>=1)&&(pid1.y_1>=1)))||((pid0.P_sety_9_0>=1)&&(pid2.y_2>=1)))||((pid1.P_sety_9_1>=1)&&(pid2.y_2>=1)))||((pid2.P_sety_9_2>=1)&&(pid2.y_2>=1)))"
Normalized transition count is 87
// Phase 1: matrix 87 rows 69 cols
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.242383,25632,1,0,12753,4394,984,16312,320,23230,53136
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G(F(G("((((((((((pid0.y_0>=1)&&(pid0.P_CS_21_0>=1))||((pid0.y_0>=1)&&(pid1.P_CS_21_1>=1)))||((pid0.y_0>=1)&&(pid2.P_CS_21_2>=1)))||((pid1.y_1>=1)&&(pid0.P_CS_21_0>=1)))||((pid1.y_1>=1)&&(pid1.P_CS_21_1>=1)))||((pid1.y_1>=1)&&(pid2.P_CS_21_2>=1)))||((pid2.y_2>=1)&&(pid0.P_CS_21_0>=1)))||((pid2.y_2>=1)&&(pid1.P_CS_21_1>=1)))||((pid2.y_2>=1)&&(pid2.P_CS_21_2>=1)))"))))U(G("(((((((pid0.P_setbi_11_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_11_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_11_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_11_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_11_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_11_2>=1)&&(pid_x_bool5.b_5>=1)))"))))
Formula 7 simplified : !(GFG"((((((((((pid0.y_0>=1)&&(pid0.P_CS_21_0>=1))||((pid0.y_0>=1)&&(pid1.P_CS_21_1>=1)))||((pid0.y_0>=1)&&(pid2.P_CS_21_2>=1)))||((pid1.y_1>=1)&&(pid0.P_CS_21_0>=1)))||((pid1.y_1>=1)&&(pid1.P_CS_21_1>=1)))||((pid1.y_1>=1)&&(pid2.P_CS_21_2>=1)))||((pid2.y_2>=1)&&(pid0.P_CS_21_0>=1)))||((pid2.y_2>=1)&&(pid1.P_CS_21_1>=1)))||((pid2.y_2>=1)&&(pid2.P_CS_21_2>=1)))" U G"(((((((pid0.P_setbi_11_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_11_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_11_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_11_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_11_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_11_2>=1)&&(pid_x_bool5.b_5>=1)))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.257622,26364,1,0,13350,4434,1067,16939,322,23798,56340
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G("(((((pid_x_pid2.done_2>=1)&&(pid_x_pid1.done_1>=1))&&(pid0.P_await_13_0>=1))||(((pid_x_pid5.done_5>=1)&&(pid_x_pid4.done_4>=1))&&(pid1.P_await_13_1>=1)))||(((pid_x_pid8.done_8>=1)&&(pid_x_pid7.done_7>=1))&&(pid2.P_await_13_2>=1)))"))U((X("(((((((((((pid_x_bool0.b_0>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid0.wait_0>=1))||(((pid_x_bool0.b_0>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid3.wait_3>=1)))||(((pid_x_bool0.b_0>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid6.wait_6>=1)))||(((pid_x_bool2.b_2>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid1.wait_1>=1)))||(((pid_x_bool2.b_2>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid4.wait_4>=1)))||(((pid_x_bool2.b_2>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid7.wait_7>=1)))||(((pid_x_bool4.b_4>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid2.wait_2>=1)))||(((pid_x_bool4.b_4>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid5.wait_5>=1)))||(((pid_x_bool4.b_4>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid8.wait_8>=1)))"))U("((((((((((pid0.x_0>=1)&&(pid0.P_setx_3_0>=1))||((pid0.x_0>=1)&&(pid1.P_setx_3_1>=1)))||((pid0.x_0>=1)&&(pid2.P_setx_3_2>=1)))||((pid1.x_1>=1)&&(pid0.P_setx_3_0>=1)))||((pid1.x_1>=1)&&(pid1.P_setx_3_1>=1)))||((pid1.x_1>=1)&&(pid2.P_setx_3_2>=1)))||((pid2.x_2>=1)&&(pid0.P_setx_3_0>=1)))||((pid2.x_2>=1)&&(pid1.P_setx_3_1>=1)))||((pid2.x_2>=1)&&(pid2.P_setx_3_2>=1)))"))))
Formula 8 simplified : !(G"(((((pid_x_pid2.done_2>=1)&&(pid_x_pid1.done_1>=1))&&(pid0.P_await_13_0>=1))||(((pid_x_pid5.done_5>=1)&&(pid_x_pid4.done_4>=1))&&(pid1.P_await_13_1>=1)))||(((pid_x_pid8.done_8>=1)&&(pid_x_pid7.done_7>=1))&&(pid2.P_await_13_2>=1)))" U (X"(((((((((((pid_x_bool0.b_0>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid0.wait_0>=1))||(((pid_x_bool0.b_0>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid3.wait_3>=1)))||(((pid_x_bool0.b_0>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid6.wait_6>=1)))||(((pid_x_bool2.b_2>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid1.wait_1>=1)))||(((pid_x_bool2.b_2>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid4.wait_4>=1)))||(((pid_x_bool2.b_2>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid7.wait_7>=1)))||(((pid_x_bool4.b_4>=1)&&(pid0.P_await_13_0>=1))&&(pid_x_pid2.wait_2>=1)))||(((pid_x_bool4.b_4>=1)&&(pid1.P_await_13_1>=1))&&(pid_x_pid5.wait_5>=1)))||(((pid_x_bool4.b_4>=1)&&(pid2.P_await_13_2>=1))&&(pid_x_pid8.wait_8>=1)))" U "((((((((((pid0.x_0>=1)&&(pid0.P_setx_3_0>=1))||((pid0.x_0>=1)&&(pid1.P_setx_3_1>=1)))||((pid0.x_0>=1)&&(pid2.P_setx_3_2>=1)))||((pid1.x_1>=1)&&(pid0.P_setx_3_0>=1)))||((pid1.x_1>=1)&&(pid1.P_setx_3_1>=1)))||((pid1.x_1>=1)&&(pid2.P_setx_3_2>=1)))||((pid2.x_2>=1)&&(pid0.P_setx_3_0>=1)))||((pid2.x_2>=1)&&(pid1.P_setx_3_1>=1)))||((pid2.x_2>=1)&&(pid2.P_setx_3_2>=1)))"))
invariant :pid_x_pid5:wait_5 + pid_x_pid5:done_5 + -1'pid1:P_await_13_1 = 0
invariant :pid_x_pid1:wait_1 + pid_x_pid1:done_1 + -1'pid0:P_await_13_0 = 0
invariant :pid2:P_start_1_2 + pid2:P_setx_3_2 + pid2:P_setbi_5_2 + pid2:P_ify0_4_2 + pid2:P_sety_9_2 + pid2:P_ifxi_10_2 + pid2:P_setbi_11_2 + pid2:P_fordo_12_2 + pid2:P_await_13_2 + pid2:P_ifyi_15_2 + pid2:P_awaity_2 + pid2:P_CS_21_2 + pid2:P_setbi_24_2 = 1
invariant :pid_x_bool2:b_2 + pid_x_bool3:b_3 = 1
invariant :pid_x_pid3:wait_3 + pid_x_pid3:done_3 = 0
invariant :pid_x_pid6:wait_6 + pid_x_pid6:done_6 = 0
invariant :pid_x_pid2:wait_2 + pid_x_pid2:done_2 + -1'pid0:P_await_13_0 = 0
invariant :pid_x_pid4:wait_4 + pid_x_pid4:done_4 + -1'pid1:P_await_13_1 = 0
invariant :pid_x_pid8:wait_8 + pid_x_pid8:done_8 + -1'pid2:P_await_13_2 = 0
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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
invariant :pid_x_pid0:wait_0 + pid_x_pid0:done_0 = 0
STATS,0,0.263835,27232,1,0,13350,4434,1144,16939,324,23798,56397
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(G(X(F(F("(((((((pid1.y_1>=1)&&(pid0.P_ify0_4_0>=1))||((pid1.y_1>=1)&&(pid1.P_ify0_4_1>=1)))||((pid1.y_1>=1)&&(pid2.P_ify0_4_2>=1)))||((pid2.y_2>=1)&&(pid0.P_ify0_4_0>=1)))||((pid2.y_2>=1)&&(pid1.P_ify0_4_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ify0_4_2>=1)))")))))))
Formula 9 simplified : !FGXF"(((((((pid1.y_1>=1)&&(pid0.P_ify0_4_0>=1))||((pid1.y_1>=1)&&(pid1.P_ify0_4_1>=1)))||((pid1.y_1>=1)&&(pid2.P_ify0_4_2>=1)))||((pid2.y_2>=1)&&(pid0.P_ify0_4_0>=1)))||((pid2.y_2>=1)&&(pid1.P_ify0_4_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ify0_4_2>=1)))"
invariant :pid0:x_0 + pid1:x_1 + pid2:x_2 = 1
invariant :pid0:P_start_1_0 + pid0:P_setx_3_0 + pid0:P_setbi_5_0 + pid0:P_ify0_4_0 + pid0:P_sety_9_0 + pid0:P_ifxi_10_0 + pid0:P_setbi_11_0 + pid0:P_fordo_12_0 + pid0:P_await_13_0 + pid0:P_ifyi_15_0 + pid0:P_awaity_0 + pid0:P_CS_21_0 + pid0:P_setbi_24_0 = 0
invariant :pid_x_bool0:b_0 + pid_x_bool1:b_1 = 0
invariant :pid_x_bool4:b_4 + pid_x_bool5:b_5 = 1
invariant :pid1:P_start_1_1 + pid1:P_setx_3_1 + pid1:P_setbi_5_1 + pid1:P_ify0_4_1 + pid1:P_sety_9_1 + pid1:P_ifxi_10_1 + pid1:P_setbi_11_1 + pid1:P_fordo_12_1 + pid1:P_await_13_1 + pid1:P_ifyi_15_1 + pid1:P_awaity_1 + pid1:P_CS_21_1 + pid1:P_setbi_24_1 = 1
invariant :pid0:y_0 + pid1:y_1 + pid2:y_2 = 1
invariant :pid_x_pid7:wait_7 + pid_x_pid7:done_7 + -1'pid2:P_await_13_2 = 0
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.281026,27752,1,0,15047,4483,1180,18521,326,24578,63211
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G((X("(((((((pid0.P_setbi_5_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_5_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_5_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_5_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_5_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_5_2>=1)&&(pid_x_bool5.b_5>=1)))"))U(F("(((((((pid0.P_setbi_11_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_11_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_11_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_11_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_11_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_11_2>=1)&&(pid_x_bool5.b_5>=1)))"))))))
Formula 10 simplified : !FG(X"(((((((pid0.P_setbi_5_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_5_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_5_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_5_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_5_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_5_2>=1)&&(pid_x_bool5.b_5>=1)))" U F"(((((((pid0.P_setbi_11_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_11_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_11_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_11_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_11_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_11_2>=1)&&(pid_x_bool5.b_5>=1)))")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.294431,28256,1,0,16470,4491,1186,19672,326,24737,68374
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(G("((((((((((pid0.y_0>=1)&&(pid0.P_CS_21_0>=1))||((pid0.y_0>=1)&&(pid1.P_CS_21_1>=1)))||((pid0.y_0>=1)&&(pid2.P_CS_21_2>=1)))||((pid1.y_1>=1)&&(pid0.P_CS_21_0>=1)))||((pid1.y_1>=1)&&(pid1.P_CS_21_1>=1)))||((pid1.y_1>=1)&&(pid2.P_CS_21_2>=1)))||((pid2.y_2>=1)&&(pid0.P_CS_21_0>=1)))||((pid2.y_2>=1)&&(pid1.P_CS_21_1>=1)))||((pid2.y_2>=1)&&(pid2.P_CS_21_2>=1)))"))))
Formula 11 simplified : !XG"((((((((((pid0.y_0>=1)&&(pid0.P_CS_21_0>=1))||((pid0.y_0>=1)&&(pid1.P_CS_21_1>=1)))||((pid0.y_0>=1)&&(pid2.P_CS_21_2>=1)))||((pid1.y_1>=1)&&(pid0.P_CS_21_0>=1)))||((pid1.y_1>=1)&&(pid1.P_CS_21_1>=1)))||((pid1.y_1>=1)&&(pid2.P_CS_21_2>=1)))||((pid2.y_2>=1)&&(pid0.P_CS_21_0>=1)))||((pid2.y_2>=1)&&(pid1.P_CS_21_1>=1)))||((pid2.y_2>=1)&&(pid2.P_CS_21_2>=1)))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.296562,28520,1,0,16470,4491,1187,19672,326,24737,68386
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(((pid0.P_fordo_12_0>=1)||(pid1.P_fordo_12_1>=1))||(pid2.P_fordo_12_2>=1))"))
Formula 12 simplified : !"(((pid0.P_fordo_12_0>=1)||(pid1.P_fordo_12_1>=1))||(pid2.P_fordo_12_2>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.29705,28520,1,0,16470,4491,1194,19672,326,24737,68410
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((((X("((((((((((pid0.x_0>=1)&&(pid0.P_setx_3_0>=1))||((pid0.x_0>=1)&&(pid1.P_setx_3_1>=1)))||((pid0.x_0>=1)&&(pid2.P_setx_3_2>=1)))||((pid1.x_1>=1)&&(pid0.P_setx_3_0>=1)))||((pid1.x_1>=1)&&(pid1.P_setx_3_1>=1)))||((pid1.x_1>=1)&&(pid2.P_setx_3_2>=1)))||((pid2.x_2>=1)&&(pid0.P_setx_3_0>=1)))||((pid2.x_2>=1)&&(pid1.P_setx_3_1>=1)))||((pid2.x_2>=1)&&(pid2.P_setx_3_2>=1)))"))U(G("(((((((pid0.x_0>=1)&&(pid1.P_ifxi_10_1>=1))||((pid0.x_0>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid1.x_1>=1)&&(pid0.P_ifxi_10_0>=1)))||((pid1.x_1>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid2.x_2>=1)&&(pid0.P_ifxi_10_0>=1)))||((pid2.x_2>=1)&&(pid1.P_ifxi_10_1>=1)))")))U(F("((((pid0.P_ifxi_10_0>=1)&&(pid0.x_0>=1))||((pid1.P_ifxi_10_1>=1)&&(pid1.x_1>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid2.x_2>=1)))"))))
Formula 13 simplified : !((X"((((((((((pid0.x_0>=1)&&(pid0.P_setx_3_0>=1))||((pid0.x_0>=1)&&(pid1.P_setx_3_1>=1)))||((pid0.x_0>=1)&&(pid2.P_setx_3_2>=1)))||((pid1.x_1>=1)&&(pid0.P_setx_3_0>=1)))||((pid1.x_1>=1)&&(pid1.P_setx_3_1>=1)))||((pid1.x_1>=1)&&(pid2.P_setx_3_2>=1)))||((pid2.x_2>=1)&&(pid0.P_setx_3_0>=1)))||((pid2.x_2>=1)&&(pid1.P_setx_3_1>=1)))||((pid2.x_2>=1)&&(pid2.P_setx_3_2>=1)))" U G"(((((((pid0.x_0>=1)&&(pid1.P_ifxi_10_1>=1))||((pid0.x_0>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid1.x_1>=1)&&(pid0.P_ifxi_10_0>=1)))||((pid1.x_1>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid2.x_2>=1)&&(pid0.P_ifxi_10_0>=1)))||((pid2.x_2>=1)&&(pid1.P_ifxi_10_1>=1)))") U F"((((pid0.P_ifxi_10_0>=1)&&(pid0.x_0>=1))||((pid1.P_ifxi_10_1>=1)&&(pid1.x_1>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid2.x_2>=1)))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.312149,29164,1,0,18170,4527,1216,20926,327,24949,75302
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(G(G(X(F("(((((((pid0.y_0>=1)&&(pid1.P_ifyi_15_1>=1))||((pid0.y_0>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid1.y_1>=1)&&(pid0.P_ifyi_15_0>=1)))||((pid1.y_1>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid2.y_2>=1)&&(pid0.P_ifyi_15_0>=1)))||((pid2.y_2>=1)&&(pid1.P_ifyi_15_1>=1)))")))))))
Formula 14 simplified : !GXF"(((((((pid0.y_0>=1)&&(pid1.P_ifyi_15_1>=1))||((pid0.y_0>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid1.y_1>=1)&&(pid0.P_ifyi_15_0>=1)))||((pid1.y_1>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid2.y_2>=1)&&(pid0.P_ifyi_15_0>=1)))||((pid2.y_2>=1)&&(pid1.P_ifyi_15_1>=1)))"
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.316349,29428,1,0,18342,4527,1249,21144,327,25052,76318
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(F((X("(((((((pid1.y_1>=1)&&(pid0.P_ify0_4_0>=1))||((pid1.y_1>=1)&&(pid1.P_ify0_4_1>=1)))||((pid1.y_1>=1)&&(pid2.P_ify0_4_2>=1)))||((pid2.y_2>=1)&&(pid0.P_ify0_4_0>=1)))||((pid2.y_2>=1)&&(pid1.P_ify0_4_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ify0_4_2>=1)))"))U("(((((((pid0.P_setbi_24_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_24_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool5.b_5>=1)))")))))
Formula 15 simplified : !F(X"(((((((pid1.y_1>=1)&&(pid0.P_ify0_4_0>=1))||((pid1.y_1>=1)&&(pid1.P_ify0_4_1>=1)))||((pid1.y_1>=1)&&(pid2.P_ify0_4_2>=1)))||((pid2.y_2>=1)&&(pid0.P_ify0_4_0>=1)))||((pid2.y_2>=1)&&(pid1.P_ify0_4_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ify0_4_2>=1)))" U "(((((((pid0.P_setbi_24_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid0.P_setbi_24_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool5.b_5>=1)))")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.34755,31012,1,0,21016,4638,1255,23450,327,26376,88362
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527484354450

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 5:12:32 AM 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/, -smt]
May 28, 2018 5:12:32 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 5:12:32 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 28, 2018 5:12:33 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 907 ms
May 28, 2018 5:12:33 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 18 places.
May 28, 2018 5:12:33 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 28, 2018 5:12:33 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :pid * pid->wait,done,
pid * bool->b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

May 28, 2018 5:12:33 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 17 transitions.
May 28, 2018 5:12:33 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 28, 2018 5:12:33 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 5 ms
May 28, 2018 5:12:33 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 5:12:33 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 5:12:33 AM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $y of transition T_yeqi_15
May 28, 2018 5:12:33 AM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $x of transition T_xeqi_10
May 28, 2018 5:12:33 AM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 7.0 instantiations of transitions. Total transitions/syncs built is 122
May 28, 2018 5:12:33 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 42 ms
May 28, 2018 5:12:33 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays P_start_1, x, y, b, P_setx_3, P_setbi_5, P_ify0_4, P_sety_9, P_ifxi_10, P_setbi_11, P_fordo_12, wait, P_await_13, done, P_ifyi_15, P_awaity, P_CS_21, P_setbi_24 to variables to allow decomposition.
May 28, 2018 5:12:33 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 63 redundant transitions.
May 28, 2018 5:12:33 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
May 28, 2018 5:12:33 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 8 ms
May 28, 2018 5:12:33 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 42 transitions. Expanding to a total of 137 deterministic transitions.
May 28, 2018 5:12:33 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 3 ms.
May 28, 2018 5:12:34 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 17 place invariants in 28 ms
May 28, 2018 5:12:34 AM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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)
May 28, 2018 5:12:34 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 362ms 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="LamportFastMutEx-COL-2"
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

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-COL-2 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-2, 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 r260-csrt-152732585200018"
echo "====================================================================="
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 ;