Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r240-smll-165303241700388.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Solitaire-PT-SqrNC5x5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241700388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 6.8K Apr 30 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 11:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 09:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 09:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 69K May 10 09:34 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-SqrNC5x5-LTLFireability-00
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-01
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-02
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-03
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-04
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-05
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-06
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-07
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-08
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-09
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-10
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-11
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-12
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-13
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-14
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653150448049

Running Version 202205111006
[2022-05-21 16:27:29] [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]
[2022-05-21 16:27:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 16:27:30] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-05-21 16:27:30] [INFO ] Transformed 50 places.
[2022-05-21 16:27:30] [INFO ] Transformed 84 transitions.
[2022-05-21 16:27:30] [INFO ] Found NUPN structural information;
[2022-05-21 16:27:30] [INFO ] Parsed PT model containing 50 places and 84 transitions in 316 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 16 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:30] [INFO ] Computed 25 place invariants in 13 ms
[2022-05-21 16:27:30] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:30] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-21 16:27:30] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:30] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-21 16:27:30] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Support contains 36 out of 50 places after structural reductions.
[2022-05-21 16:27:31] [INFO ] Flatten gal took : 62 ms
[2022-05-21 16:27:31] [INFO ] Flatten gal took : 23 ms
[2022-05-21 16:27:31] [INFO ] Input system was already deterministic with 84 transitions.
Incomplete random walk after 10000 steps, including 455 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 27) seen :26
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:31] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 16:27:31] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(p0)))))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:32] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-21 16:27:32] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:32] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-21 16:27:32] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:32] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-21 16:27:32] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-00 automaton TGBA Formula[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:(OR (EQ s1 0) (EQ s4 0) (EQ s7 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-00 finished in 813 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0) U !F(p1))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 15 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:32] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:27:33] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:33] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-21 16:27:33] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2022-05-21 16:27:33] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:33] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:27:33] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 39 ms :[p1]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (EQ s16 1) (EQ s23 1) (EQ s30 1)) (AND (EQ s2 1) (EQ s6 1) (EQ s30 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4530 reset in 582 ms.
Product exploration explored 100000 steps with 4537 reset in 478 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[p1]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[p1]
Stuttering acceptance computed with spot in 42 ms :[p1]
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:34] [INFO ] Computed 25 place invariants in 7 ms
[2022-05-21 16:27:34] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:34] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 16:27:35] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2022-05-21 16:27:35] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:35] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:27:35] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[p1]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[p1]
Stuttering acceptance computed with spot in 34 ms :[p1]
Stuttering acceptance computed with spot in 35 ms :[p1]
Product exploration explored 100000 steps with 4526 reset in 352 ms.
Product exploration explored 100000 steps with 4536 reset in 406 ms.
Built C files in :
/tmp/ltsmin5072822645851338244
[2022-05-21 16:27:36] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2022-05-21 16:27:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:27:36] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2022-05-21 16:27:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:27:36] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2022-05-21 16:27:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:27:36] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5072822645851338244
Running compilation step : cd /tmp/ltsmin5072822645851338244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 545 ms.
Running link step : cd /tmp/ltsmin5072822645851338244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5072822645851338244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8085025057143003407.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:51] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:27:51] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:51] [INFO ] Computed 25 place invariants in 6 ms
[2022-05-21 16:27:51] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2022-05-21 16:27:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:27:51] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:27:51] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Built C files in :
/tmp/ltsmin17309214961038035510
[2022-05-21 16:27:51] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2022-05-21 16:27:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:27:51] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2022-05-21 16:27:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:27:51] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2022-05-21 16:27:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:27:51] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17309214961038035510
Running compilation step : cd /tmp/ltsmin17309214961038035510;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 299 ms.
Running link step : cd /tmp/ltsmin17309214961038035510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin17309214961038035510;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14361253378684737198.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 16:28:07] [INFO ] Flatten gal took : 16 ms
[2022-05-21 16:28:07] [INFO ] Flatten gal took : 17 ms
[2022-05-21 16:28:07] [INFO ] Time to serialize gal into /tmp/LTL2190768117819889617.gal : 5 ms
[2022-05-21 16:28:07] [INFO ] Time to serialize properties into /tmp/LTL12459838446167875295.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2190768117819889617.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12459838446167875295.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2190768...267
Read 1 LTL properties
Checking formula 0 : !((F((G("(((F34==1)&&(T44==1))&&(T54==1))"))U(!(F("((((F34==1)&&(T44==1))&&(T54==1))||(((T53==1)&&(F52==1))&&(T54==1)))"))))))
Formula 0 simplified : !F(G"(((F34==1)&&(T44==1))&&(T54==1))" U !F"((((F34==1)&&(T44==1))&&(T54==1))||(((T53==1)&&(F52==1))&&(T54==1)))")
Detected timeout of ITS tools.
[2022-05-21 16:28:22] [INFO ] Flatten gal took : 12 ms
[2022-05-21 16:28:22] [INFO ] Applying decomposition
[2022-05-21 16:28:22] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14034585802267377393.txt' '-o' '/tmp/graph14034585802267377393.bin' '-w' '/tmp/graph14034585802267377393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14034585802267377393.bin' '-l' '-1' '-v' '-w' '/tmp/graph14034585802267377393.weights' '-q' '0' '-e' '0.001'
[2022-05-21 16:28:22] [INFO ] Decomposing Gal with order
[2022-05-21 16:28:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 16:28:22] [INFO ] Removed a total of 178 redundant transitions.
[2022-05-21 16:28:22] [INFO ] Flatten gal took : 96 ms
[2022-05-21 16:28:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-21 16:28:22] [INFO ] Time to serialize gal into /tmp/LTL643628357097716417.gal : 5 ms
[2022-05-21 16:28:22] [INFO ] Time to serialize properties into /tmp/LTL13216013956066740780.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL643628357097716417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13216013956066740780.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6436283...245
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i3.i0.u8.F34==1)&&(i1.u11.T44==1))&&(i0.i1.u15.T54==1))"))U(!(F("((((i3.i0.u8.F34==1)&&(i1.u11.T44==1))&&(i0.i1.u15.T54==1...227
Formula 0 simplified : !F(G"(((i3.i0.u8.F34==1)&&(i1.u11.T44==1))&&(i0.i1.u15.T54==1))" U !F"((((i3.i0.u8.F34==1)&&(i1.u11.T44==1))&&(i0.i1.u15.T54==1))||(...217
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11556215824166075262
[2022-05-21 16:28:37] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11556215824166075262
Running compilation step : cd /tmp/ltsmin11556215824166075262;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 266 ms.
Running link step : cd /tmp/ltsmin11556215824166075262;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11556215824166075262;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true)) U !<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-02 finished in 79620 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(G(p0))||(p1 U p2)))'
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:52] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:52] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:52] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-21 16:28:52] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2022-05-21 16:28:52] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:52] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:52] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s31 1) (EQ s35 1) (EQ s46 1)), p1:(AND (EQ s16 1) (EQ s25 1) (EQ s44 1)), p0:(OR (EQ s29 0) (EQ s41 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-04 finished in 526 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0)) U (p1 U G((X(p1) U p2))))))'
Support contains 7 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:53] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:53] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:53] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 16:28:53] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:53] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-21 16:28:53] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s11 1) (EQ s15 1)), p1:(AND (EQ s15 1) (EQ s17 1) (EQ s25 1)), p0:(AND (EQ s22 1) (EQ s30 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-05 finished in 558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:53] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:53] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:53] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-21 16:28:53] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2022-05-21 16:28:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:53] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:53] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s41 1) (EQ s44 1) (EQ s47 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 21 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-06 finished in 363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!G(X(F(p0))) U F(p0))))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:53] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 16:28:54] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:54] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 16:28:54] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:54] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:54] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s33 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-08 finished in 388 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!F(p0)) U G(X(p1))))'
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:54] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:54] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:54] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:54] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:54] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-21 16:28:54] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s14 1) (EQ s17 1) (EQ s24 1)), p0:(AND (EQ s8 1) (EQ s23 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4531 reset in 350 ms.
Product exploration explored 100000 steps with 4553 reset in 436 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), p0]
Finished random walk after 49 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 288 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), p0]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), p0]
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:56] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:56] [INFO ] [Real]Absence check using 25 positive place invariants in 9 ms returned sat
[2022-05-21 16:28:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 16:28:56] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-21 16:28:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 16:28:56] [INFO ] [Nat]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-21 16:28:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 16:28:56] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-21 16:28:56] [INFO ] Computed and/alt/rep : 72/484/72 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-21 16:28:57] [INFO ] Added : 53 causal constraints over 15 iterations in 1235 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:57] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:58] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:58] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:58] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:58] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:58] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), p0]
Finished random walk after 44 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 220 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), p0]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), p0]
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:28:59] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:28:59] [INFO ] [Real]Absence check using 25 positive place invariants in 8 ms returned sat
[2022-05-21 16:28:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 16:28:59] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-05-21 16:28:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 16:28:59] [INFO ] [Nat]Absence check using 25 positive place invariants in 10 ms returned sat
[2022-05-21 16:28:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 16:28:59] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-21 16:28:59] [INFO ] Computed and/alt/rep : 72/484/72 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-21 16:29:00] [INFO ] Added : 53 causal constraints over 15 iterations in 1181 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), p0]
Stuttering criterion allowed to conclude after 52614 steps with 2380 reset in 174 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-10 finished in 6455 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p1)&&p0) U (G(p3)&&p2)))'
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:29:00] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-21 16:29:00] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:29:00] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:29:01] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2022-05-21 16:29:01] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:29:01] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-21 16:29:01] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (NOT p3)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0 p1) (AND (NOT p3) p0 p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p0 p1) (AND (NOT p3) p0 p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 p3 (NOT p0)) (AND p2 p3 (NOT p1))), acceptance={} source=0 dest: 3}, { cond=(AND p2 p3 p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p0 p1), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=4 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p1))), acceptance={} source=4 dest: 3}, { cond=(AND p3 p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s19 1) (EQ s25 1)), p0:(AND (EQ s17 1) (EQ s27 1)), p1:(OR (AND (EQ s19 1) (EQ s25 1) (EQ s14 1) (EQ s21 1)) (AND (EQ s14 1) (EQ s21 1))), p3:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-11 finished in 524 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p1 U G((X(G(p2)) U p3))))||p0)))'
Support contains 7 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:29:01] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:29:01] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:29:01] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-21 16:29:01] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:29:01] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:29:01] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), true, (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 5}, { cond=(AND p3 p2), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 4}, { cond=(AND p3 (NOT p1) p2), acceptance={} source=3 dest: 7}, { cond=(AND p3 p1 p2), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={1} source=4 dest: 4}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(NOT p2), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0, 1} source=8 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=8 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=8 dest: 6}, { cond=(AND p3 (NOT p1) p2), acceptance={} source=8 dest: 7}, { cond=(AND p3 p1 p2), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p3) p1 p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s35 0) (EQ s46 0)), p3:(AND (EQ s25 1) (EQ s44 1)), p1:(AND (EQ s35 1) (EQ s46 1)), p2:(AND (EQ s0 1) (EQ s7 1) (EQ s10 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33 steps with 1 reset in 0 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-12 finished in 659 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:29:02] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-21 16:29:02] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:29:02] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-21 16:29:02] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2022-05-21 16:29:02] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:29:02] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:29:02] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s23 1) (EQ s30 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-14 finished in 398 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(p0)))&&G(F(p1)))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:29:02] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-21 16:29:02] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:29:02] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:29:02] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 50 cols
[2022-05-21 16:29:02] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 16:29:02] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (EQ s16 1) (EQ s27 1)) (AND (EQ s19 1) (EQ s25 1))), p0:(OR (EQ s19 0) (EQ s25 0) (EQ s29 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 1 reset in 0 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-15 finished in 587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0) U !F(p1))))'
[2022-05-21 16:29:03] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2791569071865952749
[2022-05-21 16:29:03] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2022-05-21 16:29:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:29:03] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2022-05-21 16:29:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:29:03] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2022-05-21 16:29:03] [INFO ] Applying decomposition
[2022-05-21 16:29:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:29:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2791569071865952749
Running compilation step : cd /tmp/ltsmin2791569071865952749;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 16:29:03] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11118879326286096525.txt' '-o' '/tmp/graph11118879326286096525.bin' '-w' '/tmp/graph11118879326286096525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11118879326286096525.bin' '-l' '-1' '-v' '-w' '/tmp/graph11118879326286096525.weights' '-q' '0' '-e' '0.001'
[2022-05-21 16:29:03] [INFO ] Decomposing Gal with order
[2022-05-21 16:29:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 16:29:03] [INFO ] Removed a total of 178 redundant transitions.
[2022-05-21 16:29:03] [INFO ] Flatten gal took : 49 ms
[2022-05-21 16:29:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-21 16:29:03] [INFO ] Time to serialize gal into /tmp/LTLFireability11734321496252611784.gal : 3 ms
[2022-05-21 16:29:03] [INFO ] Time to serialize properties into /tmp/LTLFireability4367712740416148883.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11734321496252611784.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4367712740416148883.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i2.i0.u8.F34==1)&&(i0.u11.T44==1))&&(i3.i1.u15.T54==1))"))U(!(F("((((i2.i0.u8.F34==1)&&(i0.u11.T44==1))&&(i3.i1.u15.T54==1...227
Formula 0 simplified : !F(G"(((i2.i0.u8.F34==1)&&(i0.u11.T44==1))&&(i3.i1.u15.T54==1))" U !F"((((i2.i0.u8.F34==1)&&(i0.u11.T44==1))&&(i3.i1.u15.T54==1))||(...217
Compilation finished in 366 ms.
Running link step : cd /tmp/ltsmin2791569071865952749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2791569071865952749;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true)) U !<>((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t6, t7, t10, t11, t12, t13, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t2...737
Computing Next relation with stutter on 504 deadlock states
LTSmin run took 751316 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 845480 ms.

BK_STOP 1653151295449

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-SqrNC5x5"
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-SqrNC5x5, 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 r240-smll-165303241700388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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