MCC'2021- Execution of r254-tall-162106745800317

About the Execution of ITS-Tools for Solitaire-PT-EngNC7x7

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16234.619	3600000.00	8128496.00	238283.80	FFFFFTTFFTFTFFF?	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106745800317.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 Solitaire-PT-EngNC7x7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106745800317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 26 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 26 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 26 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 19:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 19:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 72K May 5 16:52 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 Solitaire-PT-EngNC7x7-00
FORMULA_NAME Solitaire-PT-EngNC7x7-01
FORMULA_NAME Solitaire-PT-EngNC7x7-02
FORMULA_NAME Solitaire-PT-EngNC7x7-03
FORMULA_NAME Solitaire-PT-EngNC7x7-04
FORMULA_NAME Solitaire-PT-EngNC7x7-05
FORMULA_NAME Solitaire-PT-EngNC7x7-06
FORMULA_NAME Solitaire-PT-EngNC7x7-07
FORMULA_NAME Solitaire-PT-EngNC7x7-08
FORMULA_NAME Solitaire-PT-EngNC7x7-09
FORMULA_NAME Solitaire-PT-EngNC7x7-10
FORMULA_NAME Solitaire-PT-EngNC7x7-11
FORMULA_NAME Solitaire-PT-EngNC7x7-12
FORMULA_NAME Solitaire-PT-EngNC7x7-13
FORMULA_NAME Solitaire-PT-EngNC7x7-14
FORMULA_NAME Solitaire-PT-EngNC7x7-15

=== Now, execution of the tool begins

BK_START 1621176285115

Running Version 0
[2021-05-16 14:44:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 14:44:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:44:46] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2021-05-16 14:44:46] [INFO ] Transformed 66 places.
[2021-05-16 14:44:46] [INFO ] Transformed 76 transitions.
[2021-05-16 14:44:46] [INFO ] Found NUPN structural information;
[2021-05-16 14:44:46] [INFO ] Parsed PT model containing 66 places and 76 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 14:44:46] [INFO ] Initial state test concluded for 3 properties.
FORMULA Solitaire-PT-EngNC7x7-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-EngNC7x7-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 10 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:46] [INFO ] Computed 33 place invariants in 6 ms
[2021-05-16 14:44:47] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:47] [INFO ] Computed 33 place invariants in 9 ms
[2021-05-16 14:44:47] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:47] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-16 14:44:47] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
[2021-05-16 14:44:47] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-16 14:44:47] [INFO ] Flatten gal took : 35 ms
FORMULA Solitaire-PT-EngNC7x7-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-EngNC7x7-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-EngNC7x7-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 14:44:47] [INFO ] Flatten gal took : 14 ms
[2021-05-16 14:44:47] [INFO ] Input system was already deterministic with 76 transitions.
Finished random walk after 706 steps, including 27 resets, run visited all 28 properties in 15 ms. (steps per millisecond=47 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 11 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:47] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-16 14:44:47] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:47] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-16 14:44:47] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2021-05-16 14:44:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:47] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-16 14:44:47] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-EngNC7x7-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s36 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-EngNC7x7-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngNC7x7-00 finished in 447 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:47] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:44:47] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:48] [INFO ] Computed 33 place invariants in 3 ms
[2021-05-16 14:44:48] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:48] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:44:48] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-EngNC7x7-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (NEQ s36 1) (NEQ s45 1) (NEQ s61 1)) (OR (EQ s36 0) (EQ s45 0) (EQ s61 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-EngNC7x7-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngNC7x7-02 finished in 310 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:48] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:44:48] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:48] [INFO ] Computed 33 place invariants in 4 ms
[2021-05-16 14:44:48] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2021-05-16 14:44:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:48] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:44:48] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Solitaire-PT-EngNC7x7-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s19 1) (EQ s22 1) (EQ s33 1)), p0:(AND (EQ s5 1) (EQ s36 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-EngNC7x7-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngNC7x7-03 finished in 275 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:48] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:44:48] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:48] [INFO ] Computed 33 place invariants in 3 ms
[2021-05-16 14:44:48] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:48] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:44:48] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Solitaire-PT-EngNC7x7-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s38 1) (EQ s41 1) (EQ s50 1)), p0:(AND (EQ s36 1) (EQ s43 1) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-EngNC7x7-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngNC7x7-04 finished in 266 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||X(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 8 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:48] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-16 14:44:48] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:48] [INFO ] Computed 33 place invariants in 8 ms
[2021-05-16 14:44:48] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:48] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:44:48] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Solitaire-PT-EngNC7x7-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (NEQ s0 1) (NEQ s3 1) (NEQ s13 1)) (OR (NEQ s45 1) (NEQ s60 1) (NEQ s62 1))), p1:(OR (NEQ s0 1) (NEQ s3 1) (NEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 316 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 66 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2021-05-16 14:44:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:44:50] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:44:50] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
Product exploration explored 100000 steps with 50000 reset in 530 ms.
Product exploration explored 100000 steps with 50000 reset in 505 ms.
[2021-05-16 14:44:51] [INFO ] Flatten gal took : 10 ms
[2021-05-16 14:44:51] [INFO ] Flatten gal took : 9 ms
[2021-05-16 14:44:51] [INFO ] Time to serialize gal into /tmp/LTL17947123760569818187.gal : 101 ms
[2021-05-16 14:44:51] [INFO ] Time to serialize properties into /tmp/LTL2910065379329424844.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17947123760569818187.gal, -t, CGAL, -LTL, /tmp/LTL2910065379329424844.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17947123760569818187.gal -t CGAL -LTL /tmp/LTL2910065379329424844.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((((T31==0)||(F51==0))||(T41==0))&&(((T55==0)||(T56==0))||(F57==0)))"))||(X("(((T31==0)||(F51==0))||(T41==0))")))))
Formula 0 simplified : !F(G"((((T31==0)||(F51==0))||(T41==0))&&(((T55==0)||(T56==0))||(F57==0)))" | X"(((T31==0)||(F51==0))||(T41==0))")
Detected timeout of ITS tools.
[2021-05-16 14:45:07] [INFO ] Flatten gal took : 8 ms
[2021-05-16 14:45:07] [INFO ] Applying decomposition
[2021-05-16 14:45:07] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14390326902914609970.txt, -o, /tmp/graph14390326902914609970.bin, -w, /tmp/graph14390326902914609970.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14390326902914609970.bin, -l, -1, -v, -w, /tmp/graph14390326902914609970.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 14:45:07] [INFO ] Decomposing Gal with order
[2021-05-16 14:45:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:45:07] [INFO ] Removed a total of 162 redundant transitions.
[2021-05-16 14:45:07] [INFO ] Flatten gal took : 34 ms
[2021-05-16 14:45:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-16 14:45:07] [INFO ] Time to serialize gal into /tmp/LTL7328667467694356186.gal : 3 ms
[2021-05-16 14:45:07] [INFO ] Time to serialize properties into /tmp/LTL1987216488053219178.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7328667467694356186.gal, -t, CGAL, -LTL, /tmp/LTL1987216488053219178.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7328667467694356186.gal -t CGAL -LTL /tmp/LTL1987216488053219178.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("((((i1.i1.u0.T31==0)||(i0.u1.F51==0))||(i1.i0.u6.T41==0))&&(((i4.i1.u22.T55==0)||(i4.i1.u30.T56==0))||(i5.u31.F57==0)))"))||(X("(((i1.i1.u0.T31==0)||(i0.u1.F51==0))||(i1.i0.u6.T41==0))")))))
Formula 0 simplified : !F(G"((((i1.i1.u0.T31==0)||(i0.u1.F51==0))||(i1.i0.u6.T41==0))&&(((i4.i1.u22.T55==0)||(i4.i1.u30.T56==0))||(i5.u31.F57==0)))" | X"(((i1.i1.u0.T31==0)||(i0.u1.F51==0))||(i1.i0.u6.T41==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15834876453008085044
[2021-05-16 14:45:22] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15834876453008085044
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15834876453008085044]
Compilation finished in 482 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15834876453008085044]
Link finished in 41 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(([]((LTLAPp0==true))||X((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15834876453008085044]
LTSmin run took 346 ms.
FORMULA Solitaire-PT-EngNC7x7-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Solitaire-PT-EngNC7x7-06 finished in 34734 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((p0 U X(p1)))&&G(((p3 U p4)&&p2)))))], workingDir=/home/mcc/execution]
Support contains 15 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:23] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:45:23] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:23] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-16 14:45:23] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:23] [INFO ] Computed 33 place invariants in 6 ms
[2021-05-16 14:45:23] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p2) (NOT p4) (NOT p1)), (OR (NOT p2) (NOT p4) (NOT p1)), true, (NOT p1), (NOT p4), (OR (NOT p4) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : Solitaire-PT-EngNC7x7-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p2 p4) (AND p2 p3)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p4) p3), acceptance={} source=1 dest: 4}, { cond=(OR (AND p2 p4) (AND p2 p3)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p4) p3), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 p4) (AND p2 p3)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s9 1) (EQ s29 1) (EQ s52 1)), p4:(AND (EQ s43 1) (EQ s47 1) (EQ s48 1)), p3:(AND (EQ s19 1) (EQ s27 1) (EQ s31 1)), p0:(OR (EQ s54 0) (EQ s58 0) (EQ s63 0)), p1:(AND (EQ s16 1) (EQ s21 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-EngNC7x7-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngNC7x7-07 finished in 459 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&X(((p1 U (p2||G(p1))) U (((p1 U (p2||G(p1)))&&X(G(p0)))||G(p3)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:23] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:45:24] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:24] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:45:24] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:24] [INFO ] Computed 33 place invariants in 3 ms
[2021-05-16 14:45:24] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (NOT p3), (OR (AND (NOT p1) (NOT p2) p3) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p0 (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1) p3), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : Solitaire-PT-EngNC7x7-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(OR p2 p1), acceptance={} source=2 dest: 6}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p0 (NOT p2) (NOT p1)) (AND p3 (NOT p2) (NOT p1))), acceptance={} source=5 dest: 3}, { cond=(OR (AND p0 (NOT p2) p1) (AND p3 (NOT p2) p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p1)), acceptance={0, 1} source=6 dest: 6}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) p3 p1)), acceptance={1} source=6 dest: 6}, { cond=(OR (AND p0 (NOT p3) p2) (AND p0 (NOT p3) p1)), acceptance={0} source=6 dest: 6}, { cond=(OR (AND p0 p3 p2) (AND p0 p3 p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=6 dest: 9}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 3}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={} source=9 dest: 5}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=10 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(AND p0 p3), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(OR (NEQ s17 1) (NEQ s28 1) (NEQ s33 1)), p3:(OR (NEQ s10 1) (NEQ s14 1) (NEQ s17 1) (AND (OR (NEQ s10 1) (NEQ s14 1) (NEQ s17 1)) (OR (NEQ s18 1) (NEQ s23 1) (NEQ s33 1)))), p2:(AND (OR (NEQ s10 1) (NEQ s14 1) (NEQ s17 1)) (OR (NEQ s18 1) (NEQ s23 1) (NEQ s33 1))), p1:(OR (NEQ s10 1) (NEQ s14 1) (NEQ s17 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 77 steps with 5 reset in 1 ms.
FORMULA Solitaire-PT-EngNC7x7-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngNC7x7-10 finished in 498 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(((p0 U (p1||G(p0)))&&(p2 U (p3||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 12 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:24] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-16 14:45:24] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:24] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:45:24] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:24] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:45:24] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Solitaire-PT-EngNC7x7-12 automaton TGBA [mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=5 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2))), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(AND (OR (NEQ s1 1) (NEQ s2 1) (NEQ s13 1)) (OR (NEQ s31 1) (NEQ s54 1) (NEQ s56 1))), p2:(OR (NEQ s31 1) (NEQ s54 1) (NEQ s56 1)), p1:(AND (OR (NEQ s45 1) (NEQ s60 1) (NEQ s62 1)) (OR (NEQ s0 1) (NEQ s11 1) (NEQ s15 1))), p0:(OR (NEQ s0 1) (NEQ s11 1) (NEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 50 steps with 16 reset in 0 ms.
FORMULA Solitaire-PT-EngNC7x7-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngNC7x7-12 finished in 334 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U (p1||X(!p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:24] [INFO ] Computed 33 place invariants in 4 ms
[2021-05-16 14:45:24] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:24] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:45:24] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:24] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:45:24] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) p0), p0, (AND (NOT p1) p0), true, (NOT p0)]
Running random walk in product with property : Solitaire-PT-EngNC7x7-13 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s18 1) (EQ s23 1) (EQ s33 1)), p0:(OR (NEQ s15 1) (NEQ s23 1) (NEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 1 reset in 0 ms.
FORMULA Solitaire-PT-EngNC7x7-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngNC7x7-13 finished in 287 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((F(p0)&&X(p1))) U X(G(p2))))], workingDir=/home/mcc/execution]
Support contains 9 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:25] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:45:25] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:25] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-16 14:45:25] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:25] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:45:25] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p0)]
Running random walk in product with property : Solitaire-PT-EngNC7x7-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(OR (NEQ s9 1) (NEQ s14 1) (NEQ s22 1)), p2:(AND (EQ s36 1) (EQ s45 1) (EQ s61 1)), p0:(AND (EQ s4 1) (EQ s39 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 1 reset in 0 ms.
FORMULA Solitaire-PT-EngNC7x7-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngNC7x7-14 finished in 291 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(F((p1||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:25] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-16 14:45:25] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:25] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:45:25] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2021-05-16 14:45:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 66 cols
[2021-05-16 14:45:25] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-16 14:45:25] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 76/76 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Solitaire-PT-EngNC7x7-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s7 1) (EQ s37 1)), p2:(OR (NEQ s9 1) (NEQ s29 1) (NEQ s35 1)), p1:(AND (EQ s4 1) (EQ s9 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11180 reset in 332 ms.
Product exploration explored 100000 steps with 11204 reset in 363 ms.
Knowledge obtained : [(NOT p0), p2, (NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 11285 reset in 320 ms.
Product exploration explored 100000 steps with 11013 reset in 430 ms.
[2021-05-16 14:45:27] [INFO ] Flatten gal took : 7 ms
[2021-05-16 14:45:27] [INFO ] Flatten gal took : 8 ms
[2021-05-16 14:45:27] [INFO ] Time to serialize gal into /tmp/LTL13832766888717178104.gal : 2 ms
[2021-05-16 14:45:27] [INFO ] Time to serialize properties into /tmp/LTL4327671580635935292.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13832766888717178104.gal, -t, CGAL, -LTL, /tmp/LTL4327671580635935292.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13832766888717178104.gal -t CGAL -LTL /tmp/LTL4327671580635935292.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(((T53==1)&&(T43==1))&&(F33==1))")||(G("(((T43==0)||(T44==0))||(F45==0))")))))||("(((T53==1)&&(T52==1))&&(F54==1))"))))
Formula 0 simplified : !F("(((T53==1)&&(T52==1))&&(F54==1))" | GF("(((T53==1)&&(T43==1))&&(F33==1))" | G"(((T43==0)||(T44==0))||(F45==0))"))
Detected timeout of ITS tools.
[2021-05-16 14:45:42] [INFO ] Flatten gal took : 7 ms
[2021-05-16 14:45:42] [INFO ] Applying decomposition
[2021-05-16 14:45:42] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9101084358440676985.txt, -o, /tmp/graph9101084358440676985.bin, -w, /tmp/graph9101084358440676985.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9101084358440676985.bin, -l, -1, -v, -w, /tmp/graph9101084358440676985.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 14:45:42] [INFO ] Decomposing Gal with order
[2021-05-16 14:45:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:45:42] [INFO ] Removed a total of 162 redundant transitions.
[2021-05-16 14:45:42] [INFO ] Flatten gal took : 13 ms
[2021-05-16 14:45:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 14:45:42] [INFO ] Time to serialize gal into /tmp/LTL7093640524044867600.gal : 2 ms
[2021-05-16 14:45:42] [INFO ] Time to serialize properties into /tmp/LTL16605512033951685467.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7093640524044867600.gal, -t, CGAL, -LTL, /tmp/LTL16605512033951685467.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7093640524044867600.gal -t CGAL -LTL /tmp/LTL16605512033951685467.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(((i0.i0.u2.T53==1)&&(i0.i1.u4.T43==1))&&(i1.i0.u7.F33==1))")||(G("(((i0.i1.u4.T43==0)||(i4.u14.T44==0))||(i4.u17.F45==0))")))))||("(((i0.i0.u2.T53==1)&&(i0.i0.u3.T52==1))&&(i2.i0.u18.F54==1))"))))
Formula 0 simplified : !F("(((i0.i0.u2.T53==1)&&(i0.i0.u3.T52==1))&&(i2.i0.u18.F54==1))" | GF("(((i0.i0.u2.T53==1)&&(i0.i1.u4.T43==1))&&(i1.i0.u7.F33==1))" | G"(((i0.i1.u4.T43==0)||(i4.u14.T44==0))||(i4.u17.F45==0))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15696289741344381443
[2021-05-16 14:45:57] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15696289741344381443
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15696289741344381443]
Compilation finished in 419 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15696289741344381443]
Link finished in 34 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(([](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))||(LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15696289741344381443]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Solitaire-PT-EngNC7x7-15 finished in 46977 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12462803186984786179
[2021-05-16 14:46:12] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2021-05-16 14:46:12] [INFO ] Applying decomposition
[2021-05-16 14:46:12] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 14:46:12] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2021-05-16 14:46:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 14:46:12] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2021-05-16 14:46:12] [INFO ] Flatten gal took : 7 ms
[2021-05-16 14:46:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 14:46:12] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12462803186984786179
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12462803186984786179]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12307974693133605871.txt, -o, /tmp/graph12307974693133605871.bin, -w, /tmp/graph12307974693133605871.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12307974693133605871.bin, -l, -1, -v, -w, /tmp/graph12307974693133605871.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 14:46:12] [INFO ] Decomposing Gal with order
[2021-05-16 14:46:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:46:12] [INFO ] Removed a total of 162 redundant transitions.
[2021-05-16 14:46:12] [INFO ] Flatten gal took : 22 ms
[2021-05-16 14:46:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-16 14:46:12] [INFO ] Time to serialize gal into /tmp/LTLFireability8594217361770294411.gal : 1 ms
[2021-05-16 14:46:12] [INFO ] Time to serialize properties into /tmp/LTLFireability14009957688088591727.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability8594217361770294411.gal, -t, CGAL, -LTL, /tmp/LTLFireability14009957688088591727.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability8594217361770294411.gal -t CGAL -LTL /tmp/LTLFireability14009957688088591727.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("(((i0.u2.T53==1)&&(i0.u3.T52==1))&&(i0.u18.F54==1))")||(G(F(("(((i0.u2.T53==1)&&(i1.i1.u4.T43==1))&&(i1.i0.u7.F33==1))")||(G(!("(((i1.i1.u4.T43==1)&&(i4.u14.T44==1))&&(i3.i1.u17.F45==1))")))))))))
Formula 0 simplified : !F("(((i0.u2.T53==1)&&(i0.u3.T52==1))&&(i0.u18.F54==1))" | GF("(((i0.u2.T53==1)&&(i1.i1.u4.T43==1))&&(i1.i0.u7.F33==1))" | G!"(((i1.i1.u4.T43==1)&&(i4.u14.T44==1))&&(i3.i1.u17.F45==1))"))
Compilation finished in 465 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12462803186984786179]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAPp0==true)||[](<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12462803186984786179]
WARNING : LTSmin timed out (>327 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAPp0==true)||[](<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12462803186984786179]
Retrying LTSmin with larger timeout 2616 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAPp0==true)||[](<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12462803186984786179]
Detected timeout of ITS tools.
[2021-05-16 15:06:41] [INFO ] Applying decomposition
[2021-05-16 15:06:41] [INFO ] Flatten gal took : 6 ms
[2021-05-16 15:06:41] [INFO ] Decomposing Gal with order
[2021-05-16 15:06:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:06:41] [INFO ] Removed a total of 162 redundant transitions.
[2021-05-16 15:06:41] [INFO ] Flatten gal took : 46 ms
[2021-05-16 15:06:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 15:06:41] [INFO ] Time to serialize gal into /tmp/LTLFireability15994044928831921097.gal : 1 ms
[2021-05-16 15:06:41] [INFO ] Time to serialize properties into /tmp/LTLFireability3655429504652171565.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability15994044928831921097.gal, -t, CGAL, -LTL, /tmp/LTLFireability3655429504652171565.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability15994044928831921097.gal -t CGAL -LTL /tmp/LTLFireability3655429504652171565.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("(((u11.T53==1)&&(u12.T52==1))&&(u29.F54==1))")||(G(F(("(((u11.T53==1)&&(u13.T43==1))&&(u16.F33==1))")||(G(!("(((u13.T43==1)&&(u2.T44==1))&&(u28.F45==1))")))))))))
Formula 0 simplified : !F("(((u11.T53==1)&&(u12.T52==1))&&(u29.F54==1))" | GF("(((u11.T53==1)&&(u13.T43==1))&&(u16.F33==1))" | G!"(((u13.T43==1)&&(u2.T44==1))&&(u28.F45==1))"))
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.270: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.273: LTL layer: formula: <>(((LTLAPp0==true)||[](<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))))
pins2lts-mc-linux64( 1/ 8), 0.273: "<>(((LTLAPp0==true)||[](<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.273: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.273: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.264: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.283: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.283: Initializing POR dependencies: labels 79, guards 76
pins2lts-mc-linux64( 2/ 8), 0.284: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.285: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.285: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.285: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.521: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.549: There are 80 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.549: State length is 67, there are 82 groups
pins2lts-mc-linux64( 0/ 8), 0.549: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.549: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.549: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.549: Visible groups: 50 / 82, labels: 3 / 80
pins2lts-mc-linux64( 0/ 8), 0.549: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.549: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.632: [Blue] ~27 levels ~960 states ~2184 transitions
pins2lts-mc-linux64( 1/ 8), 0.649: [Blue] ~28 levels ~1920 states ~4136 transitions
pins2lts-mc-linux64( 1/ 8), 0.654: [Blue] ~28 levels ~3840 states ~8920 transitions
pins2lts-mc-linux64( 1/ 8), 0.675: [Blue] ~28 levels ~7680 states ~17576 transitions
pins2lts-mc-linux64( 1/ 8), 0.701: [Blue] ~28 levels ~15360 states ~36768 transitions
pins2lts-mc-linux64( 1/ 8), 0.753: [Blue] ~29 levels ~30720 states ~76408 transitions
pins2lts-mc-linux64( 1/ 8), 0.895: [Blue] ~29 levels ~61440 states ~168048 transitions
pins2lts-mc-linux64( 1/ 8), 1.168: [Blue] ~30 levels ~122880 states ~350152 transitions
pins2lts-mc-linux64( 1/ 8), 1.825: [Blue] ~30 levels ~245760 states ~742888 transitions
pins2lts-mc-linux64( 6/ 8), 3.123: [Blue] ~31 levels ~491520 states ~1573616 transitions
pins2lts-mc-linux64( 1/ 8), 5.977: [Blue] ~30 levels ~983040 states ~3335128 transitions
pins2lts-mc-linux64( 1/ 8), 12.654: [Blue] ~32 levels ~1966080 states ~7130136 transitions
pins2lts-mc-linux64( 1/ 8), 27.013: [Blue] ~32 levels ~3932160 states ~15470888 transitions
pins2lts-mc-linux64( 4/ 8), 57.563: [Blue] ~32 levels ~7864320 states ~34461584 transitions
pins2lts-mc-linux64( 1/ 8), 121.938: [Blue] ~32 levels ~15728640 states ~70758680 transitions
pins2lts-mc-linux64( 1/ 8), 266.945: [Blue] ~32 levels ~31457280 states ~154909424 transitions
pins2lts-mc-linux64( 1/ 8), 572.738: [Blue] ~32 levels ~62914560 states ~329175704 transitions
pins2lts-mc-linux64( 1/ 8), 1246.621: [Blue] ~32 levels ~125829120 states ~723049952 transitions
pins2lts-mc-linux64( 7/ 8), 1440.685: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1440.713:
pins2lts-mc-linux64( 0/ 8), 1440.713: Explored 134224839 states 791957644 transitions, fanout: 5.900
pins2lts-mc-linux64( 0/ 8), 1440.713: Total exploration time 1440.160 sec (1440.130 sec minimum, 1440.145 sec on average)
pins2lts-mc-linux64( 0/ 8), 1440.713: States per second: 93201, Transitions per second: 549909
pins2lts-mc-linux64( 0/ 8), 1440.713:
pins2lts-mc-linux64( 0/ 8), 1440.713: State space has 134217429 states, 2160566 are accepting
pins2lts-mc-linux64( 0/ 8), 1440.713: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1440.713: blue states: 134224839 (100.01%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1440.713: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1440.713: all-red states: 17534272 (13.06%), bogus 499 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1440.713:
pins2lts-mc-linux64( 0/ 8), 1440.713: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1440.713:
pins2lts-mc-linux64( 0/ 8), 1440.713: Queue width: 8B, total height: 251, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1440.713: Tree memory: 1027.3MB, 8.0 B/state, compr.: 3.0%
pins2lts-mc-linux64( 0/ 8), 1440.713: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 1440.713: Stored 76 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1440.713: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1440.713: Est. total memory use: 1027.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAPp0==true)||[](<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12462803186984786179]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAPp0==true)||[](<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12462803186984786179]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-16 15:27:11] [INFO ] Flatten gal took : 160 ms
[2021-05-16 15:27:12] [INFO ] Input system was already deterministic with 76 transitions.
[2021-05-16 15:27:12] [INFO ] Transformed 66 places.
[2021-05-16 15:27:12] [INFO ] Transformed 76 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-16 15:27:12] [INFO ] Time to serialize gal into /tmp/LTLFireability2811189395807346616.gal : 3 ms
[2021-05-16 15:27:12] [INFO ] Time to serialize properties into /tmp/LTLFireability16655304853288202474.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability2811189395807346616.gal, -t, CGAL, -LTL, /tmp/LTLFireability16655304853288202474.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability2811189395807346616.gal -t CGAL -LTL /tmp/LTLFireability16655304853288202474.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(((T53==1)&&(T52==1))&&(F54==1))")||(G(F(("(((T53==1)&&(T43==1))&&(F33==1))")||(G(!("(((T43==1)&&(T44==1))&&(F45==1))")))))))))
Formula 0 simplified : !F("(((T53==1)&&(T52==1))&&(F54==1))" | GF("(((T53==1)&&(T43==1))&&(F33==1))" | G!"(((T43==1)&&(T44==1))&&(F45==1))"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Solitaire-PT-EngNC7x7"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Solitaire-PT-EngNC7x7, 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 r254-tall-162106745800317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Solitaire-PT-EngNC7x7.tgz
mv Solitaire-PT-EngNC7x7 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 ;