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-162038291600204.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-N0020P4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291600204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.7K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 14K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:33 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-N0020P4-00
FORMULA_NAME ClientsAndServers-PT-N0020P4-01
FORMULA_NAME ClientsAndServers-PT-N0020P4-02
FORMULA_NAME ClientsAndServers-PT-N0020P4-03
FORMULA_NAME ClientsAndServers-PT-N0020P4-04
FORMULA_NAME ClientsAndServers-PT-N0020P4-05
FORMULA_NAME ClientsAndServers-PT-N0020P4-06
FORMULA_NAME ClientsAndServers-PT-N0020P4-07
FORMULA_NAME ClientsAndServers-PT-N0020P4-08
FORMULA_NAME ClientsAndServers-PT-N0020P4-09
FORMULA_NAME ClientsAndServers-PT-N0020P4-10
FORMULA_NAME ClientsAndServers-PT-N0020P4-11
FORMULA_NAME ClientsAndServers-PT-N0020P4-12
FORMULA_NAME ClientsAndServers-PT-N0020P4-13
FORMULA_NAME ClientsAndServers-PT-N0020P4-14
FORMULA_NAME ClientsAndServers-PT-N0020P4-15

=== Now, execution of the tool begins

BK_START 1620567212375

Running Version 0
[2021-05-09 13:33:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 13:33:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 13:33:34] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-09 13:33:34] [INFO ] Transformed 25 places.
[2021-05-09 13:33:34] [INFO ] Transformed 18 transitions.
[2021-05-09 13:33:34] [INFO ] Parsed PT model containing 25 places and 18 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 13:33:34] [INFO ] Initial state test concluded for 1 properties.
FORMULA ClientsAndServers-PT-N0020P4-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-03 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 42 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 13:33:34] [INFO ] Computed 8 place invariants in 6 ms
[2021-05-09 13:33:34] [INFO ] Implicit Places using invariants in 77 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:33:34] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 13:33:34] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 24/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:33:34] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-09 13:33:34] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 24/25 places, 18/18 transitions.
[2021-05-09 13:33:34] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 13:33:35] [INFO ] Flatten gal took : 23 ms
FORMULA ClientsAndServers-PT-N0020P4-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 13:33:35] [INFO ] Flatten gal took : 4 ms
[2021-05-09 13:33:35] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100032 steps, including 24 resets, run finished after 118 ms. (steps per millisecond=847 ) properties (out of 21) seen :19
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:33:35] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 13:33:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 13:33:35] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 4 ms returned unsat
[2021-05-09 13:33:35] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 20 transition count 8
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 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 24 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 26 place count 9 transition count 7
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 2 with 4 rules applied. Total rules applied 30 place count 7 transition count 5
Applied a total of 30 rules in 7 ms. Remains 7 /24 variables (removed 17) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-09 13:33:35] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:33:35] [INFO ] Implicit Places using invariants in 22 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
[2021-05-09 13:33:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:33:35] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:33:35] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 6/24 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-09 13:33:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:33:35] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:33:35] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 6/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 22938 steps with 0 reset in 61 ms.
FORMULA ClientsAndServers-PT-N0020P4-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-01 finished in 463 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(p0) U p1)&&X(X(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:35] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:35] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:33:35] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GT s15 s10), p0:(LEQ s3 s0), p2:(LEQ s15 s16)], 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]]
Product exploration explored 100000 steps with 19404 reset in 132 ms.
Product exploration explored 100000 steps with 19512 reset in 181 ms.
Knowledge obtained : [(NOT p1), p0, p2]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 19896 reset in 101 ms.
Product exploration explored 100000 steps with 19851 reset in 158 ms.
Applying partial POR strategy [false, false, true, true, false, true]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Support contains 5 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 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 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 5 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 20 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 20 transition count 17
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 12 place count 20 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 14 rules in 4 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 13:33:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 13:33:37] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 13:33:37] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 15943 reset in 263 ms.
Stack based approach found an accepted trace after 59 steps with 12 reset with depth 13 and stack size 10 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-04 finished in 1891 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 3 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:37] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:37] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:37] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 13:33:37] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:33:37] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 7143 reset in 73 ms.
Product exploration explored 100000 steps with 7150 reset in 106 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7141 reset in 67 ms.
Stack based approach found an accepted trace after 75450 steps with 5383 reset with depth 24 and stack size 24 in 95 ms.
FORMULA ClientsAndServers-PT-N0020P4-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-05 finished in 694 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:33:38] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:33:38] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:33:38] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:33:38] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:33:38] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:33:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(GT s1 s3)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-06 finished in 199 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(F((p1 U ((p1&&G(p2))||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:38] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:38] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:33:38] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:38] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={1} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s19 s9), p2:(LEQ 2 s20), p1:(GT 3 s12)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-07 finished in 362 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 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:38] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:38] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:38] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-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:(GT s14 s19)], 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 447 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P4-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-08 finished in 167 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:33:39] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:33:39] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:33:39] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:33:39] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:33:39] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:33:39] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-09 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s15 s10)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-09 finished in 172 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1)||F(((!p0&&F(p2))||G(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:33:39] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:33:39] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:33:39] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:33:39] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:33:39] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:33:39] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-10 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(GT s18 s6), p1:(GT s15 s17), p0:(LEQ s0 s4)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 3070 reset in 76 ms.
Product exploration explored 100000 steps with 3041 reset in 98 ms.
Knowledge obtained : [(NOT p2), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3041 reset in 63 ms.
Product exploration explored 100000 steps with 3059 reset in 69 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 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 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 20 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 20 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 19 transition count 17
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 19 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 19 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 18 transition count 16
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 18 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 3 ms. Remains 18 /20 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 13:33:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 18 cols
[2021-05-09 13:33:40] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:33:40] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/20 places, 16/18 transitions.
Product exploration explored 100000 steps with 8738 reset in 69 ms.
Product exploration explored 100000 steps with 8815 reset in 71 ms.
[2021-05-09 13:33:40] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:33:40] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:33:40] [INFO ] Time to serialize gal into /tmp/LTL8413306304202380124.gal : 1 ms
[2021-05-09 13:33:40] [INFO ] Time to serialize properties into /tmp/LTL10948794067833479154.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/LTL8413306304202380124.gal, -t, CGAL, -LTL, /tmp/LTL10948794067833479154.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/LTL8413306304202380124.gal -t CGAL -LTL /tmp/LTL10948794067833479154.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(Uf<=CA)")||(G("(StR>SpA)")))||(F((("(Uf>CA)")&&(F("(Cb>StF)")))||(G(F("(Cb>StF)"))))))))
Formula 0 simplified : !X("(Uf<=CA)" | G"(StR>SpA)" | F(("(Uf>CA)" & F"(Cb>StF)") | GF"(Cb>StF)"))
Detected timeout of ITS tools.
[2021-05-09 13:33:55] [INFO ] Flatten gal took : 3 ms
[2021-05-09 13:33:55] [INFO ] Applying decomposition
[2021-05-09 13:33:55] [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/graph11673535991396801906.txt, -o, /tmp/graph11673535991396801906.bin, -w, /tmp/graph11673535991396801906.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/graph11673535991396801906.bin, -l, -1, -v, -w, /tmp/graph11673535991396801906.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:33:55] [INFO ] Decomposing Gal with order
[2021-05-09 13:33:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:33:55] [INFO ] Flatten gal took : 26 ms
[2021-05-09 13:33:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 13:33:55] [INFO ] Time to serialize gal into /tmp/LTL10998956638763232859.gal : 2 ms
[2021-05-09 13:33:55] [INFO ] Time to serialize properties into /tmp/LTL5658890839302487214.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/LTL10998956638763232859.gal, -t, CGAL, -LTL, /tmp/LTL5658890839302487214.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/LTL10998956638763232859.gal -t CGAL -LTL /tmp/LTL5658890839302487214.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(gu1.Uf<=gu1.CA)")||(G("(gu6.StR>gu6.SpA)")))||(F((("(gu1.Uf>gu1.CA)")&&(F("(gu7.Cb>gu7.StF)")))||(G(F("(gu7.Cb>gu7.StF)"))))))))
Formula 0 simplified : !X("(gu1.Uf<=gu1.CA)" | G"(gu6.StR>gu6.SpA)" | F(("(gu1.Uf>gu1.CA)" & F"(gu7.Cb>gu7.StF)") | GF"(gu7.Cb>gu7.StF)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2896849474305880501
[2021-05-09 13:34:10] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2896849474305880501
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/ltsmin2896849474305880501]
Compilation finished in 253 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2896849474305880501]
Link finished in 52 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))||<>(((!(LTLAPp0==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2896849474305880501]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0020P4-10 finished in 46490 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 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 20 transition count 9
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 11 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 11 transition count 7
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 26 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 28 place count 8 transition count 6
Applied a total of 28 rules in 1 ms. Remains 8 /24 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:34:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:34:25] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:34:25] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:34:25] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2021-05-09 13:34:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:34:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:34:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-11 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:(LEQ s7 s6)], 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 11 reset in 62 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-11 finished in 267 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 20 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 12 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 12 transition count 7
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 26 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 28 place count 8 transition count 6
Applied a total of 28 rules in 2 ms. Remains 8 /24 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:34:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:34:26] [INFO ] Implicit Places using invariants in 29 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
[2021-05-09 13:34:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 13:34:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:34:26] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 7/24 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-09 13:34:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 13:34:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:34:26] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s4 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7394 steps with 0 reset in 7 ms.
FORMULA ClientsAndServers-PT-N0020P4-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-12 finished in 202 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p0 U p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 20 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 17 place count 14 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 13 transition count 10
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 20 place count 12 transition count 10
Applied a total of 20 rules in 5 ms. Remains 12 /24 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 13:34:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:34:26] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 13:34:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:34:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2021-05-09 13:34:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 13:34:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:34:26] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/24 places, 10/18 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-13 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s5 s11), p1:(LEQ s7 s10), p0:(LEQ 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 19 reset in 150 ms.
Product exploration explored 100000 steps with 18 reset in 104 ms.
Knowledge obtained : [p2, p1, (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 18 reset in 112 ms.
Stack based approach found an accepted trace after 31536 steps with 6 reset with depth 5882 and stack size 5878 in 36 ms.
FORMULA ClientsAndServers-PT-N0020P4-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-13 finished in 979 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 20 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 12 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 12 transition count 7
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 26 place count 9 transition count 7
Applied a total of 26 rules in 4 ms. Remains 9 /24 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 13:34:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:34:27] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 13:34:27] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:34:27] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2021-05-09 13:34:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 13:34:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:34:27] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 61 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-14 finished in 198 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-09 13:34:27] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin11732014922261703472
[2021-05-09 13:34:27] [INFO ] Flatten gal took : 1 ms
[2021-05-09 13:34:27] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-09 13:34:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 13:34:27] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-09 13:34:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 13:34:27] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-09 13:34:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 13:34:27] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11732014922261703472
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/ltsmin11732014922261703472]
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/graph3486054764018750454.txt, -o, /tmp/graph3486054764018750454.bin, -w, /tmp/graph3486054764018750454.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/graph3486054764018750454.bin, -l, -1, -v, -w, /tmp/graph3486054764018750454.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:34:27] [INFO ] Decomposing Gal with order
[2021-05-09 13:34:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:34:27] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:34:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 13:34:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality15679072341851656559.gal : 11 ms
[2021-05-09 13:34:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality4548211446806809117.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/LTLCardinality15679072341851656559.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4548211446806809117.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/LTLCardinality15679072341851656559.gal -t CGAL -LTL /tmp/LTLCardinality4548211446806809117.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(gu2.Uf<=gu2.CA)")||(G("(gu6.StR>gu6.SpA)")))||((F("(gu3.Cb>gu3.StF)"))U((("(gu2.Uf>gu2.CA)")&&(F("(gu3.Cb>gu3.StF)")))||(G(F("(gu3.Cb>gu3.StF)"))))))))
Formula 0 simplified : !X("(gu2.Uf<=gu2.CA)" | G"(gu6.StR>gu6.SpA)" | (F"(gu3.Cb>gu3.StF)" U (("(gu2.Uf>gu2.CA)" & F"(gu3.Cb>gu3.StF)") | GF"(gu3.Cb>gu3.StF)")))
Compilation finished in 215 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11732014922261703472]
Link finished in 45 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))||<>(((!(LTLAPp0==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11732014922261703472]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||[]((LTLAPp1==true))||<>(((!(LTLAPp0==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11732014922261703472]
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||[]((LTLAPp1==true))||<>(((!(LTLAPp0==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11732014922261703472]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.027: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.045: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.045: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: LTL layer: formula: X(((LTLAPp0==true)||[]((LTLAPp1==true))||<>(((!(LTLAPp0==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true)))))))
pins2lts-mc-linux64( 4/ 8), 0.057: "X(((LTLAPp0==true)||[]((LTLAPp1==true))||<>(((!(LTLAPp0==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.057: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.057: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.072: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.072: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.057: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.071: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.071: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.057: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.057: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.059: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.059: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.072: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.072: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.058: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.058: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.082: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.162: DFS-FIFO for weak LTL, using special progress label 22
pins2lts-mc-linux64( 0/ 8), 0.162: There are 23 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.162: State length is 25, there are 24 groups
pins2lts-mc-linux64( 0/ 8), 0.162: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.162: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.162: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.162: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 12.114: ~107 levels ~960 states ~5592 transitions
pins2lts-mc-linux64( 2/ 8), 12.971: ~206 levels ~1920 states ~11256 transitions
pins2lts-mc-linux64( 2/ 8), 13.608: ~419 levels ~3840 states ~24720 transitions
pins2lts-mc-linux64( 2/ 8), 13.613: ~836 levels ~7680 states ~51504 transitions
pins2lts-mc-linux64( 2/ 8), 13.615: ~1065 levels ~15360 states ~74232 transitions
pins2lts-mc-linux64( 2/ 8), 13.619: ~1065 levels ~30720 states ~105672 transitions
pins2lts-mc-linux64( 2/ 8), 13.719: ~1065 levels ~61440 states ~173200 transitions
pins2lts-mc-linux64( 2/ 8), 13.819: ~1065 levels ~122880 states ~326960 transitions
pins2lts-mc-linux64( 2/ 8), 14.056: ~1065 levels ~245760 states ~639296 transitions
pins2lts-mc-linux64( 2/ 8), 14.972: ~1065 levels ~491520 states ~1299536 transitions
pins2lts-mc-linux64( 2/ 8), 16.091: ~1065 levels ~983040 states ~2714944 transitions
pins2lts-mc-linux64( 2/ 8), 18.944: ~1065 levels ~1966080 states ~5587040 transitions
pins2lts-mc-linux64( 2/ 8), 22.207: ~1065 levels ~3932160 states ~12017456 transitions
pins2lts-mc-linux64( 2/ 8), 25.767: ~1065 levels ~7864320 states ~25079888 transitions
pins2lts-mc-linux64( 2/ 8), 34.075: ~1065 levels ~15728640 states ~51341968 transitions
pins2lts-mc-linux64( 2/ 8), 48.680: ~1065 levels ~31457280 states ~108261648 transitions
pins2lts-mc-linux64( 2/ 8), 73.993: ~1065 levels ~62914560 states ~224295576 transitions
pins2lts-mc-linux64( 2/ 8), 137.889: ~1065 levels ~125829120 states ~454690336 transitions
pins2lts-mc-linux64( 2/ 8), 294.761: ~1065 levels ~251658240 states ~931182992 transitions
pins2lts-mc-linux64( 2/ 8), 372.268: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 372.298:
pins2lts-mc-linux64( 0/ 8), 372.298: mean standard work distribution: 264.6% (states) 264.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 372.298:
pins2lts-mc-linux64( 0/ 8), 372.298: Explored 33312681 states 123420850 transitions, fanout: 3.705
pins2lts-mc-linux64( 0/ 8), 372.298: Total exploration time 372.090 sec (372.020 sec minimum, 372.066 sec on average)
pins2lts-mc-linux64( 0/ 8), 372.298: States per second: 89529, Transitions per second: 331696
pins2lts-mc-linux64( 0/ 8), 372.298:
pins2lts-mc-linux64( 0/ 8), 372.298: Progress states detected: 1
pins2lts-mc-linux64( 0/ 8), 372.298: Redundant explorations: -0.0193
pins2lts-mc-linux64( 0/ 8), 372.299:
pins2lts-mc-linux64( 0/ 8), 372.299: Queue width: 8B, total height: 1075, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 372.299: Tree memory: 510.2MB, 16.1 B/state, compr.: 15.7%
pins2lts-mc-linux64( 0/ 8), 372.299: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 372.299: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 372.299: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 372.299: Est. total memory use: 510.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||[]((LTLAPp1==true))||<>(((!(LTLAPp0==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11732014922261703472]
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, --when, --ltl, X(((LTLAPp0==true)||[]((LTLAPp1==true))||<>(((!(LTLAPp0==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11732014922261703472]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 13:54:44] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:54:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality12663052020656968799.gal : 1 ms
[2021-05-09 13:54:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality4888442080505856581.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/LTLCardinality12663052020656968799.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4888442080505856581.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/LTLCardinality12663052020656968799.gal -t CGAL -LTL /tmp/LTLCardinality4888442080505856581.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(Uf<=CA)")||(G("(StR>SpA)")))||((F("(Cb>StF)"))U((("(Uf>CA)")&&(F("(Cb>StF)")))||(G(F("(Cb>StF)"))))))))
Formula 0 simplified : !X("(Uf<=CA)" | G"(StR>SpA)" | (F"(Cb>StF)" U (("(Uf>CA)" & F"(Cb>StF)") | GF"(Cb>StF)")))
Detected timeout of ITS tools.
[2021-05-09 14:15:01] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:15:01] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-09 14:15:01] [INFO ] Transformed 24 places.
[2021-05-09 14:15:01] [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]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 14:15:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality7505871191104554599.gal : 1 ms
[2021-05-09 14:15:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality11390374178039401503.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/LTLCardinality7505871191104554599.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11390374178039401503.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/LTLCardinality7505871191104554599.gal -t CGAL -LTL /tmp/LTLCardinality11390374178039401503.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((("(Uf<=CA)")||(G("(StR>SpA)")))||((F("(Cb>StF)"))U((("(Uf>CA)")&&(F("(Cb>StF)")))||(G(F("(Cb>StF)"))))))))
Formula 0 simplified : !X("(Uf<=CA)" | G"(StR>SpA)" | (F"(Cb>StF)" U (("(Uf>CA)" & F"(Cb>StF)") | GF"(Cb>StF)")))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-N0020P4"
export BK_EXAMINATION="LTLCardinality"
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-N0020P4, examination is LTLCardinality"
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-162038291600204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0020P4.tgz
mv ClientsAndServers-PT-N0020P4 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;