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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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 26K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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.1K 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-N0020P0-00
FORMULA_NAME ClientsAndServers-PT-N0020P0-01
FORMULA_NAME ClientsAndServers-PT-N0020P0-02
FORMULA_NAME ClientsAndServers-PT-N0020P0-03
FORMULA_NAME ClientsAndServers-PT-N0020P0-04
FORMULA_NAME ClientsAndServers-PT-N0020P0-05
FORMULA_NAME ClientsAndServers-PT-N0020P0-06
FORMULA_NAME ClientsAndServers-PT-N0020P0-07
FORMULA_NAME ClientsAndServers-PT-N0020P0-08
FORMULA_NAME ClientsAndServers-PT-N0020P0-09
FORMULA_NAME ClientsAndServers-PT-N0020P0-10
FORMULA_NAME ClientsAndServers-PT-N0020P0-11
FORMULA_NAME ClientsAndServers-PT-N0020P0-12
FORMULA_NAME ClientsAndServers-PT-N0020P0-13
FORMULA_NAME ClientsAndServers-PT-N0020P0-14
FORMULA_NAME ClientsAndServers-PT-N0020P0-15

=== Now, execution of the tool begins

BK_START 1620566029305

Running Version 0
[2021-05-09 13:13:51] [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:13:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 13:13:51] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2021-05-09 13:13:51] [INFO ] Transformed 25 places.
[2021-05-09 13:13:51] [INFO ] Transformed 18 transitions.
[2021-05-09 13:13:51] [INFO ] Parsed PT model containing 25 places and 18 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 13:13:51] [INFO ] Initial state test concluded for 3 properties.
FORMULA ClientsAndServers-PT-N0020P0-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-01 FALSE 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.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 8 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:13:51] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-09 13:13:51] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:13:51] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-09 13:13:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:13:51] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-09 13:13:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
[2021-05-09 13:13:51] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-09 13:13:51] [INFO ] Flatten gal took : 15 ms
FORMULA ClientsAndServers-PT-N0020P0-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 13:13:51] [INFO ] Flatten gal took : 4 ms
[2021-05-09 13:13:51] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 1514 steps, including 0 resets, run visited all 18 properties in 3 ms. (steps per millisecond=504 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(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 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:13:52] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:13:52] [INFO ] Implicit Places using invariants in 30 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:13:52] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-09 13:13:52] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 20/24 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 13:13:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:13:52] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-00 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 1 s3)], 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 6 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P0-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-00 finished in 344 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 20 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 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 12 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 14 place count 16 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 18 place count 14 transition count 10
Applied a total of 18 rules in 26 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2021-05-09 13:13:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 13:13:52] [INFO ] Implicit Places using invariants in 17 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
[2021-05-09 13:13:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2021-05-09 13:13:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:13:52] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 13/24 places, 10/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 12 transition count 8
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 4 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 9 transition count 7
Applied a total of 7 rules in 2 ms. Remains 9 /13 variables (removed 4) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 13:13:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:13:52] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 13:13:52] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-09 13:13:52] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(GT 1 s7), p1:(LEQ s4 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P0-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-02 finished in 232 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((F(p2)||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 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:13:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 13:13:52] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:13:52] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:13:52] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 21/24 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 13:13:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:13:52] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-03 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(LEQ s19 s6), p1:(OR (LEQ s19 s6) (LEQ s14 s10)), p0:(LEQ s14 s10)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 216 ms.
Product exploration explored 100000 steps with 0 reset in 263 ms.
Knowledge obtained : [p2, p1, (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Stack based approach found an accepted trace after 51418 steps with 0 reset with depth 51419 and stack size 5911 in 119 ms.
FORMULA ClientsAndServers-PT-N0020P0-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-03 finished in 1373 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(F(p0)) U G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:13:53] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 13:13:53] [INFO ] Implicit Places using invariants in 21 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:13:53] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:13:53] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 13:13:54] [INFO ] Computed 4 place invariants in 8 ms
[2021-05-09 13:13:54] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT 3 s12), p0:(LEQ s19 s9)], 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 131 ms.
Stack based approach found an accepted trace after 83447 steps with 0 reset with depth 83448 and stack size 73874 in 189 ms.
FORMULA ClientsAndServers-PT-N0020P0-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-07 finished in 692 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -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 3 places :
Implicit places reduction removed 3 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 8 rules applied. Total rules applied 8 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 13 place count 16 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 16 transition count 10
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 19 place count 13 transition count 10
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 21 place count 12 transition count 9
Applied a total of 21 rules in 2 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 13:13:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:13:54] [INFO ] Implicit Places using invariants in 13 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
[2021-05-09 13:13:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 13:13:54] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:13:54] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 11/24 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 11 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 9 transition count 7
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 9 transition count 6
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 8 transition count 6
Applied a total of 6 rules in 1 ms. Remains 8 /11 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:13:54] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:13:54] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:13:54] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-09 13:13:54] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-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}]], initial=1, aps=[p0:(LEQ s2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P0-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-08 finished in 338 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0))||G((p1||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
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 21 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 17 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 16 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 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 3 with 2 rules applied. Total rules applied 15 place count 15 transition count 12
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 17 place count 14 transition count 11
Applied a total of 17 rules in 3 ms. Remains 14 /24 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-09 13:13:54] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:13:54] [INFO ] Implicit Places using invariants in 32 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
[2021-05-09 13:13:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-09 13:13:54] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:13:55] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 13/24 places, 11/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 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Applied a total of 2 rules in 2 ms. Remains 12 /13 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 13:13:55] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:13:55] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 13:13:55] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:13:55] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 12/24 places, 10/18 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 s5), p2:(LEQ s0 s6), p0:(AND (LEQ s11 s10) (GT s0 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 26 reset in 211 ms.
Stack based approach found an accepted trace after 3538 steps with 1 reset with depth 3522 and stack size 3522 in 6 ms.
FORMULA ClientsAndServers-PT-N0020P0-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-11 finished in 503 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||G(p1))))))], 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 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:13:55] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 13:13:55] [INFO ] Implicit Places using invariants in 59 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:13:55] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 13:13:55] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 21/24 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 13:13:55] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-09 13:13:55] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(LEQ s17 s14), p0:(LEQ 2 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1074 reset in 137 ms.
Product exploration explored 100000 steps with 1080 reset in 101 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1068 reset in 97 ms.
Product exploration explored 100000 steps with 1073 reset in 163 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 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 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 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 6 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 18 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 18 transition count 15
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 18 place count 18 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 17 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 17 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 20 rules in 7 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-09 13:13:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2021-05-09 13:13:56] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:13:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/21 places, 14/18 transitions.
Product exploration explored 100000 steps with 3073 reset in 152 ms.
Product exploration explored 100000 steps with 3145 reset in 111 ms.
[2021-05-09 13:13:56] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:13:56] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:13:56] [INFO ] Time to serialize gal into /tmp/LTL13056093441174778781.gal : 1 ms
[2021-05-09 13:13:56] [INFO ] Time to serialize properties into /tmp/LTL8476058548487365186.ltl : 11 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/LTL13056093441174778781.gal, -t, CGAL, -LTL, /tmp/LTL8476058548487365186.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/LTL13056093441174778781.gal -t CGAL -LTL /tmp/LTL8476058548487365186.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(SwA>=2)")||(G("(SwA<=Si)")))))))
Formula 0 simplified : !XXF("(SwA>=2)" | G"(SwA<=Si)")
Detected timeout of ITS tools.
[2021-05-09 13:14:12] [INFO ] Flatten gal took : 4 ms
[2021-05-09 13:14:12] [INFO ] Applying decomposition
[2021-05-09 13:14:12] [INFO ] Flatten gal took : 2 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/graph12630501575627504921.txt, -o, /tmp/graph12630501575627504921.bin, -w, /tmp/graph12630501575627504921.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/graph12630501575627504921.bin, -l, -1, -v, -w, /tmp/graph12630501575627504921.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:14:12] [INFO ] Decomposing Gal with order
[2021-05-09 13:14:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:14:12] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-09 13:14:12] [INFO ] Flatten gal took : 50 ms
[2021-05-09 13:14:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-09 13:14:12] [INFO ] Time to serialize gal into /tmp/LTL13955010196460643041.gal : 1 ms
[2021-05-09 13:14:12] [INFO ] Time to serialize properties into /tmp/LTL3156771250251660518.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/LTL13955010196460643041.gal, -t, CGAL, -LTL, /tmp/LTL3156771250251660518.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/LTL13955010196460643041.gal -t CGAL -LTL /tmp/LTL3156771250251660518.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(gu6.SwA>=2)")||(G("(gu6.SwA<=gu6.Si)")))))))
Formula 0 simplified : !XXF("(gu6.SwA>=2)" | G"(gu6.SwA<=gu6.Si)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10915404649262989782
[2021-05-09 13:14:27] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10915404649262989782
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/ltsmin10915404649262989782]
Compilation finished in 199 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10915404649262989782]
Link finished in 43 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)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10915404649262989782]
LTSmin run took 424 ms.
FORMULA ClientsAndServers-PT-N0020P0-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P0-12 finished in 32538 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||(p0&&G(F(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:14:27] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:14:28] [INFO ] Implicit Places using invariants in 19 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:14:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:14:28] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 3 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 13:14:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:14:28] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-13 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(GT s10 s18), p0:(GT s8 s19)], 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 87 reset in 128 ms.
Stack based approach found an accepted trace after 61555 steps with 77 reset with depth 47 and stack size 47 in 74 ms.
FORMULA ClientsAndServers-PT-N0020P0-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-13 finished in 458 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], 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
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 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 19 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 18 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 18 transition count 13
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 13 place count 16 transition count 13
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 17 place count 14 transition count 11
Applied a total of 17 rules in 5 ms. Remains 14 /24 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-09 13:14:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:14:28] [INFO ] Implicit Places using invariants in 32 ms returned [9, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
[2021-05-09 13:14:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-09 13:14:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 13:14:28] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 12/24 places, 11/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 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 11 transition count 9
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 4 place count 10 transition count 9
Applied a total of 4 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-09 13:14:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:14:28] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-09 13:14:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:14:28] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/24 places, 9/18 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT s8 s3), p0:(OR (GT s5 s2) (GT s8 s3))], 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 13501 reset in 96 ms.
Stack based approach found an accepted trace after 53917 steps with 7031 reset with depth 1775 and stack size 1772 in 47 ms.
FORMULA ClientsAndServers-PT-N0020P0-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-15 finished in 344 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620566069100

--------------------
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-N0020P0"
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-N0020P0, 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-162038291500172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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