Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038291700261.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 ClientsAndServers-PT-N5000P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291700261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K May 5 16:51 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 ClientsAndServers-PT-N5000P0-00
FORMULA_NAME ClientsAndServers-PT-N5000P0-01
FORMULA_NAME ClientsAndServers-PT-N5000P0-02
FORMULA_NAME ClientsAndServers-PT-N5000P0-03
FORMULA_NAME ClientsAndServers-PT-N5000P0-04
FORMULA_NAME ClientsAndServers-PT-N5000P0-05
FORMULA_NAME ClientsAndServers-PT-N5000P0-06
FORMULA_NAME ClientsAndServers-PT-N5000P0-07
FORMULA_NAME ClientsAndServers-PT-N5000P0-08
FORMULA_NAME ClientsAndServers-PT-N5000P0-09
FORMULA_NAME ClientsAndServers-PT-N5000P0-10
FORMULA_NAME ClientsAndServers-PT-N5000P0-11
FORMULA_NAME ClientsAndServers-PT-N5000P0-12
FORMULA_NAME ClientsAndServers-PT-N5000P0-13
FORMULA_NAME ClientsAndServers-PT-N5000P0-14
FORMULA_NAME ClientsAndServers-PT-N5000P0-15

=== Now, execution of the tool begins

BK_START 1620573607412

Running Version 0
[2021-05-09 15:20:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 15:20:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:20:09] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-09 15:20:09] [INFO ] Transformed 25 places.
[2021-05-09 15:20:09] [INFO ] Transformed 18 transitions.
[2021-05-09 15:20:09] [INFO ] Parsed PT model containing 25 places and 18 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:20:09] [INFO ] Initial state test concluded for 3 properties.
FORMULA ClientsAndServers-PT-N5000P0-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N5000P0-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 9 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 15:20:09] [INFO ] Computed 8 place invariants in 5 ms
[2021-05-09 15:20:09] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 15:20:09] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-09 15:20:09] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 15:20:09] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-09 15:20:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 18/18 transitions.
[2021-05-09 15:20:09] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 15:20:09] [INFO ] Flatten gal took : 19 ms
FORMULA ClientsAndServers-PT-N5000P0-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N5000P0-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:20:09] [INFO ] Flatten gal took : 4 ms
[2021-05-09 15:20:09] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 120005 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=3077 ) properties (out of 14) seen :2
Running SMT prover for 12 properties.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 15:20:09] [INFO ] Computed 8 place invariants in 6 ms
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 15:20:09] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:20:09] [INFO ] Added : 12 causal constraints over 3 iterations in 19 ms. Result :sat
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 15:20:09] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:20:09] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-09 15:20:09] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:20:09] [INFO ] Added : 16 causal constraints over 4 iterations in 13 ms. Result :sat
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 15:20:09] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:20:09] [INFO ] Added : 13 causal constraints over 3 iterations in 21 ms. Result :sat
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-09 15:20:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:20:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:09] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 15:20:09] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:20:09] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 15:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:09] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:20:09] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:20:09] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 15:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:20:10] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:20:10] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-09 15:20:10] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:20:10] [INFO ] Added : 15 causal constraints over 3 iterations in 12 ms. Result :sat
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-09 15:20:10] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:20:10] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-09 15:20:10] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:20:10] [INFO ] Added : 13 causal constraints over 3 iterations in 9 ms. Result :sat
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-09 15:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 15:20:10] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:20:10] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:20:10] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:20:10] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:20:10] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 9
Applied a total of 22 rules in 6 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 15:20:10] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:20:10] [INFO ] Implicit Places using invariants in 13 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 15 ms to find 2 implicit places.
[2021-05-09 15:20:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-09 15:20:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:20:10] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 10/25 places, 9/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 8
Applied a total of 2 rules in 4 ms. Remains 9 /10 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 15:20:10] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:20:10] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 15:20:10] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:20:10] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s8 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2039 reset in 172 ms.
Stack based approach found an accepted trace after 4273 steps with 85 reset with depth 77 and stack size 77 in 6 ms.
FORMULA ClientsAndServers-PT-N5000P0-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-00 finished in 431 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((X(X(G(p0))) U (p0&&X(X(G(p0)))))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:20:10] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:20:10] [INFO ] Implicit Places using invariants in 19 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:20:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:20:10] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:20:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:20:10] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p0:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-02 finished in 239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:20:10] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 15:20:10] [INFO ] Implicit Places using invariants in 14 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:20:10] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:20:10] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:20:10] [INFO ] Computed 4 place invariants in 5 ms
[2021-05-09 15:20:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s18 1)), p1:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-03 finished in 185 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 11 place count 18 transition count 11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 13 transition count 9
Applied a total of 21 rules in 5 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2021-05-09 15:20:11] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 15:20:11] [INFO ] Implicit Places using invariants in 12 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
[2021-05-09 15:20:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 15:20:11] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:20:11] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 12/25 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2021-05-09 15:20:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 15:20:11] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:20:11] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/25 places, 9/18 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s8 1)) (AND (GEQ s6 1) (GEQ s11 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]]
Product exploration explored 100000 steps with 10277 reset in 108 ms.
Product exploration explored 100000 steps with 10258 reset in 112 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10199 reset in 79 ms.
Product exploration explored 100000 steps with 10275 reset in 108 ms.
[2021-05-09 15:20:11] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:20:11] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:20:11] [INFO ] Time to serialize gal into /tmp/LTL7141007801883150513.gal : 0 ms
[2021-05-09 15:20:11] [INFO ] Time to serialize properties into /tmp/LTL17188103365390903031.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7141007801883150513.gal, -t, CGAL, -LTL, /tmp/LTL17188103365390903031.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7141007801883150513.gal -t CGAL -LTL /tmp/LTL17188103365390903031.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(((SF>=1)&&(Mi>=1))||((SG>=1)&&(SwG>=1)))")))
Formula 0 simplified : !F"(((SF>=1)&&(Mi>=1))||((SG>=1)&&(SwG>=1)))"
Detected timeout of ITS tools.
[2021-05-09 15:20:26] [INFO ] Flatten gal took : 10 ms
[2021-05-09 15:20:26] [INFO ] Applying decomposition
[2021-05-09 15:20:26] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7693506253751029887.txt, -o, /tmp/graph7693506253751029887.bin, -w, /tmp/graph7693506253751029887.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7693506253751029887.bin, -l, -1, -v, -w, /tmp/graph7693506253751029887.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:20:26] [INFO ] Decomposing Gal with order
[2021-05-09 15:20:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:20:26] [INFO ] Flatten gal took : 29 ms
[2021-05-09 15:20:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:20:26] [INFO ] Time to serialize gal into /tmp/LTL480606449866342358.gal : 1 ms
[2021-05-09 15:20:26] [INFO ] Time to serialize properties into /tmp/LTL11071925239531768451.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL480606449866342358.gal, -t, CGAL, -LTL, /tmp/LTL11071925239531768451.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL480606449866342358.gal -t CGAL -LTL /tmp/LTL11071925239531768451.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("(((u0.SF>=1)&&(i1.u1.Mi>=1))||((i1.u2.SG>=1)&&(u3.SwG>=1)))")))
Formula 0 simplified : !F"(((u0.SF>=1)&&(i1.u1.Mi>=1))||((i1.u2.SG>=1)&&(u3.SwG>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9751903196055200979
[2021-05-09 15:20:41] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9751903196055200979
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9751903196055200979]
Compilation finished in 919 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9751903196055200979]
Link finished in 127 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin9751903196055200979]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N5000P0-04 finished in 45825 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(p0)&&(!p0||F(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:20:56] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:20:56] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:20:56] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:20:56] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:20:56] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-09 15:20:56] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s18 1), p1:(OR (LT s8 1) (LT s14 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N5000P0-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-05 finished in 255 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((!p0||G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Applied a total of 20 rules in 5 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2021-05-09 15:20:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:20:57] [INFO ] Implicit Places using invariants in 23 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
[2021-05-09 15:20:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 15:20:57] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:20:57] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 12/25 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 7
Applied a total of 6 rules in 1 ms. Remains 9 /12 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 15:20:57] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:20:57] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 15:20:57] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-09 15:20:57] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s6 1)), p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50 reset in 95 ms.
Stack based approach found an accepted trace after 1948 steps with 3 reset with depth 930 and stack size 923 in 2 ms.
FORMULA ClientsAndServers-PT-N5000P0-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-07 finished in 243 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:20:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:20:57] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:20:57] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 15:20:57] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:20:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:20:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s2 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-08 finished in 145 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:20:57] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 15:20:57] [INFO ] Implicit Places using invariants in 13 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:20:57] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:20:57] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:20:57] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-09 15:20:57] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1211 reset in 83 ms.
Product exploration explored 100000 steps with 1204 reset in 122 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1198 reset in 81 ms.
Product exploration explored 100000 steps with 1201 reset in 88 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 16 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 23 rules in 7 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2021-05-09 15:20:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-09 15:20:58] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:20:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/20 places, 13/18 transitions.
Product exploration explored 100000 steps with 7735 reset in 191 ms.
Product exploration explored 100000 steps with 7749 reset in 169 ms.
[2021-05-09 15:20:58] [INFO ] Flatten gal took : 14 ms
[2021-05-09 15:20:58] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:20:58] [INFO ] Time to serialize gal into /tmp/LTL4167206088326602520.gal : 8 ms
[2021-05-09 15:20:58] [INFO ] Time to serialize properties into /tmp/LTL11744625575906274943.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4167206088326602520.gal, -t, CGAL, -LTL, /tmp/LTL11744625575906274943.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4167206088326602520.gal -t CGAL -LTL /tmp/LTL11744625575906274943.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(SpA>=1)")))))
Formula 0 simplified : !XXF"(SpA>=1)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-09 15:20:58] [INFO ] Flatten gal took : 4 ms
[2021-05-09 15:20:58] [INFO ] Applying decomposition
[2021-05-09 15:20:59] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6426668170581776826.txt, -o, /tmp/graph6426668170581776826.bin, -w, /tmp/graph6426668170581776826.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6426668170581776826.bin, -l, -1, -v, -w, /tmp/graph6426668170581776826.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:20:59] [INFO ] Decomposing Gal with order
[2021-05-09 15:20:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:20:59] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:20:59] [INFO ] Flatten gal took : 3 ms
[2021-05-09 15:20:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:20:59] [INFO ] Time to serialize gal into /tmp/LTL7644166317757613273.gal : 1 ms
[2021-05-09 15:20:59] [INFO ] Time to serialize properties into /tmp/LTL9658030594595009123.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7644166317757613273.gal, -t, CGAL, -LTL, /tmp/LTL9658030594595009123.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7644166317757613273.gal -t CGAL -LTL /tmp/LTL9658030594595009123.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(u0.SpA>=1)")))))
Formula 0 simplified : !XXF"(u0.SpA>=1)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin12369325107864263895
[2021-05-09 15:20:59] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12369325107864263895
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12369325107864263895]
Compilation finished in 112 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12369325107864263895]
Link finished in 77 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12369325107864263895]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N5000P0-09 finished in 16567 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||(F(G(p0))&&(!p0 U (p1||G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 13 transition count 9
Applied a total of 21 rules in 3 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2021-05-09 15:21:14] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 15:21:14] [INFO ] Implicit Places using invariants in 36 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
[2021-05-09 15:21:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 15:21:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:21:14] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 12/25 places, 9/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 9 transition count 6
Applied a total of 6 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 15:21:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:21:14] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 15:21:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:21:14] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (AND p0 (NOT p1)), true]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s6 1), p1:(AND (LT s6 1) (OR (LT s2 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 67 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 72 in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-12 finished in 356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 16 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 9
Applied a total of 22 rules in 2 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 15:21:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:21:14] [INFO ] Implicit Places using invariants in 25 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
[2021-05-09 15:21:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-09 15:21:14] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:21:14] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 10/25 places, 9/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Applied a total of 4 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 8 cols
[2021-05-09 15:21:14] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:21:14] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-09 15:21:14] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:21:14] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13363 reset in 51 ms.
Product exploration explored 100000 steps with 13349 reset in 67 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13846 reset in 49 ms.
Product exploration explored 100000 steps with 13650 reset in 65 ms.
[2021-05-09 15:21:15] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:21:15] [INFO ] Flatten gal took : 0 ms
[2021-05-09 15:21:15] [INFO ] Time to serialize gal into /tmp/LTL521723101534515350.gal : 0 ms
[2021-05-09 15:21:15] [INFO ] Time to serialize properties into /tmp/LTL2219728641825355877.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL521723101534515350.gal, -t, CGAL, -LTL, /tmp/LTL2219728641825355877.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL521723101534515350.gal -t CGAL -LTL /tmp/LTL2219728641825355877.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((MpA>=1)||(Cb>=1))"))))
Formula 0 simplified : !GF"((MpA>=1)||(Cb>=1))"
Detected timeout of ITS tools.
[2021-05-09 15:21:30] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:21:30] [INFO ] Applying decomposition
[2021-05-09 15:21:30] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4487417247581281054.txt, -o, /tmp/graph4487417247581281054.bin, -w, /tmp/graph4487417247581281054.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4487417247581281054.bin, -l, -1, -v, -w, /tmp/graph4487417247581281054.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:21:30] [INFO ] Decomposing Gal with order
[2021-05-09 15:21:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:21:30] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:21:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:21:30] [INFO ] Time to serialize gal into /tmp/LTL4173471189827641606.gal : 1 ms
[2021-05-09 15:21:30] [INFO ] Time to serialize properties into /tmp/LTL8016525043910202330.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4173471189827641606.gal, -t, CGAL, -LTL, /tmp/LTL8016525043910202330.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4173471189827641606.gal -t CGAL -LTL /tmp/LTL8016525043910202330.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((u2.MpA>=1)||(u1.Cb>=1))"))))
Formula 0 simplified : !GF"((u2.MpA>=1)||(u1.Cb>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3382047873884591674
[2021-05-09 15:21:45] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3382047873884591674
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3382047873884591674]
Compilation finished in 102 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3382047873884591674]
Link finished in 64 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3382047873884591674]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N5000P0-13 finished in 45749 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 0 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:22:00] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:22:00] [INFO ] Implicit Places using invariants in 37 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:22:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:22:00] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:22:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:22:00] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s8 1) (LT s14 1)), p0:(AND (GEQ s5 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2645 reset in 86 ms.
Product exploration explored 100000 steps with 2606 reset in 88 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 2600 reset in 128 ms.
Product exploration explored 100000 steps with 2628 reset in 113 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 61 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 3 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 20 transition count 18
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 15 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 15 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 15 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 14 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 14 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 24 rules in 2 ms. Remains 14 /20 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2021-05-09 15:22:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 14 cols
[2021-05-09 15:22:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:22:01] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/20 places, 12/18 transitions.
Product exploration explored 100000 steps with 10237 reset in 143 ms.
Product exploration explored 100000 steps with 10184 reset in 161 ms.
[2021-05-09 15:22:01] [INFO ] Flatten gal took : 6 ms
[2021-05-09 15:22:01] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:22:01] [INFO ] Time to serialize gal into /tmp/LTL6476129719295453254.gal : 0 ms
[2021-05-09 15:22:01] [INFO ] Time to serialize properties into /tmp/LTL13739676629629839634.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6476129719295453254.gal, -t, CGAL, -LTL, /tmp/LTL13739676629629839634.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
ITS-tools command line returned an error code 134

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6476129719295453254.gal -t CGAL -LTL /tmp/LTL13739676629629839634.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((CR>=1)&&(Si>=1))"))||("((CF>=1)&&(Si>=1))")))))
Formula 0 simplified : !XF("((CF>=1)&&(Si>=1))" | G"((CR>=1)&&(Si>=1))")
terminate called after throwing an instance of 'char const*'
[2021-05-09 15:22:01] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:22:01] [INFO ] Applying decomposition
[2021-05-09 15:22:01] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4168055157508828685.txt, -o, /tmp/graph4168055157508828685.bin, -w, /tmp/graph4168055157508828685.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4168055157508828685.bin, -l, -1, -v, -w, /tmp/graph4168055157508828685.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:22:01] [INFO ] Decomposing Gal with order
[2021-05-09 15:22:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:22:01] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:22:01] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:22:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:22:01] [INFO ] Time to serialize gal into /tmp/LTL1338007456535523273.gal : 3 ms
[2021-05-09 15:22:01] [INFO ] Time to serialize properties into /tmp/LTL3186732499368704029.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1338007456535523273.gal, -t, CGAL, -LTL, /tmp/LTL3186732499368704029.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
ITS-tools command line returned an error code 134

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1338007456535523273.gal -t CGAL -LTL /tmp/LTL3186732499368704029.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((u2.CR>=1)&&(u1.Si>=1))"))||("((u3.CF>=1)&&(u1.Si>=1))")))))
Formula 0 simplified : !XF("((u3.CF>=1)&&(u1.Si>=1))" | G"((u2.CR>=1)&&(u1.Si>=1))")
terminate called after throwing an instance of 'char const*'
Built C files in :
/tmp/ltsmin11900243578259713628
[2021-05-09 15:22:01] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11900243578259713628
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11900243578259713628]
Compilation finished in 118 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11900243578259713628]
Link finished in 63 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp0==true))||(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin11900243578259713628]
LTSmin run took 2648 ms.
FORMULA ClientsAndServers-PT-N5000P0-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N5000P0-14 finished in 4171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G((X(!p0)||F(p1))))||(X(G(p3))&&p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 0 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:22:04] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:22:04] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:22:04] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:22:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:22:04] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:22:04] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3)))]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-15 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p2:(AND (GEQ s0 1) (GEQ s13 1)), p0:(OR (LT s2 1) (LT s14 1)), p1:(GEQ s20 1), p3:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 226 ms.
Knowledge obtained : [(NOT p2), p0, p1, (NOT p3)]
Stuttering acceptance computed with spot in 177 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 0 reset in 120 ms.
Product exploration explored 100000 steps with 0 reset in 290 ms.
Applying partial POR strategy [false, true, true, true, false]
Stuttering acceptance computed with spot in 286 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3)))]
Support contains 6 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 21 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 21 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 20 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 20 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 3 ms. Remains 20 /21 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2021-05-09 15:22:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2021-05-09 15:22:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:22:06] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/21 places, 17/18 transitions.
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 111 ms.
[2021-05-09 15:22:06] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:22:06] [INFO ] Flatten gal took : 0 ms
[2021-05-09 15:22:06] [INFO ] Time to serialize gal into /tmp/LTL3556943993266986841.gal : 0 ms
[2021-05-09 15:22:06] [INFO ] Time to serialize properties into /tmp/LTL7693749527909199293.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3556943993266986841.gal, -t, CGAL, -LTL, /tmp/LTL7693749527909199293.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3556943993266986841.gal -t CGAL -LTL /tmp/LTL7693749527909199293.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F(G((X("((SF>=1)&&(Mi>=1))"))||(F("(Ci>=1)")))))||(("((Uf>=1)&&(MwU>=1))")&&(X(G("(SpA>=1)")))))))
Formula 0 simplified : !X(FG(X"((SF>=1)&&(Mi>=1))" | F"(Ci>=1)") | ("((Uf>=1)&&(MwU>=1))" & XG"(SpA>=1)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-09 15:22:06] [INFO ] Flatten gal took : 6 ms
[2021-05-09 15:22:06] [INFO ] Applying decomposition
[2021-05-09 15:22:06] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6660445853673437914.txt, -o, /tmp/graph6660445853673437914.bin, -w, /tmp/graph6660445853673437914.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6660445853673437914.bin, -l, -1, -v, -w, /tmp/graph6660445853673437914.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:22:06] [INFO ] Decomposing Gal with order
[2021-05-09 15:22:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:22:06] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:22:06] [INFO ] Flatten gal took : 4 ms
[2021-05-09 15:22:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:22:06] [INFO ] Time to serialize gal into /tmp/LTL14188124292895693841.gal : 1 ms
[2021-05-09 15:22:06] [INFO ] Time to serialize properties into /tmp/LTL4569914563993555147.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14188124292895693841.gal, -t, CGAL, -LTL, /tmp/LTL4569914563993555147.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14188124292895693841.gal -t CGAL -LTL /tmp/LTL4569914563993555147.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F(G((X("((u3.SF>=1)&&(i1.u4.Mi>=1))"))||(F("(i2.u1.Ci>=1)")))))||(("((i1.u0.Uf>=1)&&(i1.u4.MwU>=1))")&&(X(G("(u7.SpA>=1)")))))))
Formula 0 simplified : !X(FG(X"((u3.SF>=1)&&(i1.u4.Mi>=1))" | F"(i2.u1.Ci>=1)") | ("((i1.u0.Uf>=1)&&(i1.u4.MwU>=1))" & XG"(u7.SpA>=1)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin16095724850786420301
[2021-05-09 15:22:06] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16095724850786420301
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16095724850786420301]
Compilation finished in 124 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16095724850786420301]
Link finished in 51 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>([]((X((LTLAPp0==true))||<>((LTLAPp1==true)))))||(X([]((LTLAPp3==true)))&&(LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin16095724850786420301]
LTSmin run took 2654 ms.
FORMULA ClientsAndServers-PT-N5000P0-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N5000P0-15 finished in 4989 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3726207278684019890
[2021-05-09 15:22:09] [INFO ] Applying decomposition
[2021-05-09 15:22:09] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-09 15:22:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 15:22:09] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-09 15:22:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 15:22:09] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-09 15:22:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 15:22:09] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3726207278684019890
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3726207278684019890]
[2021-05-09 15:22:09] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12312260658750216949.txt, -o, /tmp/graph12312260658750216949.bin, -w, /tmp/graph12312260658750216949.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12312260658750216949.bin, -l, -1, -v, -w, /tmp/graph12312260658750216949.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:22:09] [INFO ] Decomposing Gal with order
[2021-05-09 15:22:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:22:09] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:22:09] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:22:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:22:09] [INFO ] Time to serialize gal into /tmp/LTLFireability14148580536018921497.gal : 0 ms
[2021-05-09 15:22:09] [INFO ] Time to serialize properties into /tmp/LTLFireability10170563525478842422.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability14148580536018921497.gal, -t, CGAL, -LTL, /tmp/LTLFireability10170563525478842422.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

ITS-tools command line returned an error code 134
its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability14148580536018921497.gal -t CGAL -LTL /tmp/LTLFireability10170563525478842422.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((F("(((u3.SF>=1)&&(i0.u1.Mi>=1))||((i0.u0.SG>=1)&&(i2.u5.SwG>=1)))")))
Formula 0 simplified : !F"(((u3.SF>=1)&&(i0.u1.Mi>=1))||((i0.u0.SG>=1)&&(i2.u5.SwG>=1)))"
terminate called after throwing an instance of 'char const*'
[2021-05-09 15:22:09] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:22:09] [INFO ] Time to serialize gal into /tmp/LTLFireability13778149540803084020.gal : 1 ms
[2021-05-09 15:22:09] [INFO ] Time to serialize properties into /tmp/LTLFireability2794708507307295385.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability13778149540803084020.gal, -t, CGAL, -LTL, /tmp/LTLFireability2794708507307295385.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability13778149540803084020.gal -t CGAL -LTL /tmp/LTLFireability2794708507307295385.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((F("(((SF>=1)&&(Mi>=1))||((SG>=1)&&(SwG>=1)))")))
Formula 0 simplified : !F"(((SF>=1)&&(Mi>=1))||((SG>=1)&&(SwG>=1)))"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-09 15:22:09] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:22:09] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-09 15:22:09] [INFO ] Transformed 25 places.
[2021-05-09 15:22:09] [INFO ] Transformed 18 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Compilation finished in 169 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3726207278684019890]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 15:22:09] [INFO ] Time to serialize gal into /tmp/LTLFireability16028380606833341093.gal : 1 ms
[2021-05-09 15:22:09] [INFO ] Time to serialize properties into /tmp/LTLFireability8699521097624600463.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability16028380606833341093.gal, -t, CGAL, -LTL, /tmp/LTLFireability8699521097624600463.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16028380606833341093.gal -t CGAL -LTL /tmp/LTLFireability8699521097624600463.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
ITS-tools command line returned an error code 134
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F("(((SF>=1)&&(Mi>=1))||((SG>=1)&&(SwG>=1)))")))
Formula 0 simplified : !F"(((SF>=1)&&(Mi>=1))||((SG>=1)&&(SwG>=1)))"
terminate called after throwing an instance of 'char const*'
Link finished in 48 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin3726207278684019890]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.017: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.321: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.319: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.321: LTL layer: formula: <>((LTLAPp0==true))
pins2lts-mc-linux64( 3/ 8), 0.321: "<>((LTLAPp0==true))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.321: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.349: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.348: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.348: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.336: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.350: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.350: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.350: Initializing POR dependencies: labels 21, guards 18
pins2lts-mc-linux64( 0/ 8), 0.361: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.517: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.607: There are 23 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.607: State length is 26, there are 19 groups
pins2lts-mc-linux64( 0/ 8), 0.607: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.607: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.607: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.607: Visible groups: 7 / 19, labels: 1 / 23
pins2lts-mc-linux64( 0/ 8), 0.607: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.607: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.786: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 4/ 8), 0.849: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 4/ 8), 0.938: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 5/ 8), 1.032: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 4/ 8), 1.089: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 2/ 8), 1.111: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 5/ 8), 1.129: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 7/ 8), 1.163: [Blue] ~15360 levels ~122880 states ~122880 transitions
pins2lts-mc-linux64( 5/ 8), 1.250: [Blue] ~30720 levels ~245760 states ~245760 transitions
pins2lts-mc-linux64( 4/ 8), 1.471: [Blue] ~60722 levels ~491520 states ~693800 transitions
pins2lts-mc-linux64( 4/ 8), 1.968: [Blue] ~79986 levels ~983040 states ~1411592 transitions
pins2lts-mc-linux64( 4/ 8), 3.100: [Blue] ~79986 levels ~1966080 states ~3002960 transitions
pins2lts-mc-linux64( 4/ 8), 5.427: [Blue] ~79986 levels ~3932160 states ~6312720 transitions
pins2lts-mc-linux64( 4/ 8), 10.337: [Blue] ~79986 levels ~7864320 states ~13218168 transitions
pins2lts-mc-linux64( 4/ 8), 20.498: [Blue] ~79986 levels ~15728640 states ~27472856 transitions
pins2lts-mc-linux64( 4/ 8), 43.699: [Blue] ~79986 levels ~31457280 states ~57134280 transitions
pins2lts-mc-linux64( 4/ 8), 54.696: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 54.746:
pins2lts-mc-linux64( 0/ 8), 54.746: Explored 24363938 states 53039081 transitions, fanout: 2.177
pins2lts-mc-linux64( 0/ 8), 54.746: Total exploration time 54.120 sec (54.070 sec minimum, 54.083 sec on average)
pins2lts-mc-linux64( 0/ 8), 54.746: States per second: 450184, Transitions per second: 980027
pins2lts-mc-linux64( 0/ 8), 54.746:
pins2lts-mc-linux64( 0/ 8), 54.746: State space has 13467084 states, 12473387 are accepting
pins2lts-mc-linux64( 0/ 8), 54.746: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 54.746: blue states: 24363938 (180.91%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 54.746: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 54.746: all-red states: 12473387 (92.62%), bogus 9870150 (73.29%)
pins2lts-mc-linux64( 0/ 8), 54.746:
pins2lts-mc-linux64( 0/ 8), 54.746: Total memory used for local state coloring: 9.8MB
pins2lts-mc-linux64( 0/ 8), 54.746:
pins2lts-mc-linux64( 0/ 8), 54.746: Queue width: 8B, total height: 639162, memory: 4.88MB
pins2lts-mc-linux64( 0/ 8), 54.746: Tree memory: 358.7MB, 27.9 B/state, compr.: 26.4%
pins2lts-mc-linux64( 0/ 8), 54.746: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 54.746: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 54.746: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 54.746: Est. total memory use: 363.6MB (~1028.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin3726207278684019890]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin3726207278684019890]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)

BK_STOP 1620573784810

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N5000P0"
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 ClientsAndServers-PT-N5000P0, 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 r045-oct2-162038291700261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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