fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r204-oct2-165281599300459
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ServersAndClients-PT-100020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
770.220 20675.00 40669.00 120.30 TFFTFTTTTFFFFTTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 8.7K Apr 29 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 4.1M May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-00
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-01
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-02
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-03
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-04
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-05
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-06
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-07
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-08
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-09
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-10
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-11
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-12
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-13
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-14
FORMULA_NAME ServersAndClients-PT-100020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652972934037

Running Version 202205111006
[2022-05-19 15:08:55] [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]
[2022-05-19 15:08:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:08:55] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2022-05-19 15:08:55] [INFO ] Transformed 2421 places.
[2022-05-19 15:08:55] [INFO ] Transformed 4200 transitions.
[2022-05-19 15:08:55] [INFO ] Found NUPN structural information;
[2022-05-19 15:08:55] [INFO ] Parsed PT model containing 2421 places and 4200 transitions in 439 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ServersAndClients-PT-100020-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 2421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 324 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2421 cols
[2022-05-19 15:08:56] [INFO ] Computed 221 place invariants in 77 ms
[2022-05-19 15:08:57] [INFO ] Implicit Places using invariants in 1383 ms returned [1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 145, 147, 149, 151, 153, 155, 157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181, 183, 185, 187, 189, 193, 195, 197, 199]
Discarding 99 places :
Implicit Place search using SMT only with invariants took 1431 ms to find 99 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2322/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 286 ms. Remains 2322 /2322 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2322/2421 places, 4200/4200 transitions.
Support contains 16 out of 2322 places after structural reductions.
[2022-05-19 15:08:58] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 15:08:58] [INFO ] Flatten gal took : 400 ms
FORMULA ServersAndClients-PT-100020-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 15:08:58] [INFO ] Flatten gal took : 162 ms
[2022-05-19 15:08:59] [INFO ] Input system was already deterministic with 4200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 821 ms. (steps per millisecond=12 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4200 rows 2322 cols
[2022-05-19 15:09:00] [INFO ] Computed 122 place invariants in 68 ms
[2022-05-19 15:09:01] [INFO ] After 516ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA ServersAndClients-PT-100020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Drop transitions removed 1999 transitions
Trivial Post-agglo rules discarded 1999 transitions
Performed 1999 trivial Post agglomeration. Transition count delta: 1999
Iterating post reduction 0 with 1999 rules applied. Total rules applied 1999 place count 2322 transition count 2201
Reduce places removed 2018 places and 0 transitions.
Ensure Unique test removed 1800 transitions
Reduce isomorphic transitions removed 1800 transitions.
Iterating post reduction 1 with 3818 rules applied. Total rules applied 5817 place count 304 transition count 401
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 6015 place count 205 transition count 302
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 6114 place count 205 transition count 203
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 2 with 101 rules applied. Total rules applied 6215 place count 204 transition count 103
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 297 rules applied. Total rules applied 6512 place count 5 transition count 5
Applied a total of 6512 rules in 75 ms. Remains 5 /2322 variables (removed 2317) and now considering 5/4200 (removed 4195) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-19 15:09:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:09:01] [INFO ] Implicit Places using invariants in 16 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/2322 places, 5/4200 transitions.
Graph (trivial) has 3 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 3 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:09:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:01] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:09:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:01] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/2322 places, 3/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/2322 places, 3/4200 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLCardinality-00 automaton TGBA Formula[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:(EQ s1 0)], 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 14325 reset in 258 ms.
Product exploration explored 100000 steps with 14135 reset in 207 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:09:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:02] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:09:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:02] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2022-05-19 15:09:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:09:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:02] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 3/3 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14260 reset in 112 ms.
Product exploration explored 100000 steps with 14452 reset in 78 ms.
Built C files in :
/tmp/ltsmin18074710197259304413
[2022-05-19 15:09:03] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2022-05-19 15:09:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:09:03] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2022-05-19 15:09:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:09:03] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2022-05-19 15:09:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:09:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18074710197259304413
Running compilation step : cd /tmp/ltsmin18074710197259304413;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 237 ms.
Running link step : cd /tmp/ltsmin18074710197259304413;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18074710197259304413;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4819648300374274679.hoa' '--buchi-type=spotba'
LTSmin run took 123 ms.
FORMULA ServersAndClients-PT-100020-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-100020-LTLCardinality-00 finished in 2614 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 2 out of 2322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Drop transitions removed 1979 transitions
Trivial Post-agglo rules discarded 1979 transitions
Performed 1979 trivial Post agglomeration. Transition count delta: 1979
Iterating post reduction 0 with 1979 rules applied. Total rules applied 1979 place count 2322 transition count 2221
Reduce places removed 1979 places and 0 transitions.
Iterating post reduction 1 with 1979 rules applied. Total rules applied 3958 place count 343 transition count 2221
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 4154 place count 245 transition count 2123
Applied a total of 4154 rules in 161 ms. Remains 245 /2322 variables (removed 2077) and now considering 2123/4200 (removed 2077) transitions.
[2022-05-19 15:09:04] [INFO ] Flow matrix only has 243 transitions (discarded 1880 similar events)
// Phase 1: matrix 243 rows 245 cols
[2022-05-19 15:09:04] [INFO ] Computed 122 place invariants in 1 ms
[2022-05-19 15:09:05] [INFO ] Implicit Places using invariants in 1511 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 204, 206, 209, 211, 213, 215, 217, 219, 221, 223, 225, 227, 229, 231, 233, 235, 237, 239, 241, 243]
Discarding 121 places :
Ensure Unique test removed 1880 transitions
Reduce isomorphic transitions removed 1880 transitions.
Implicit Place search using SMT only with invariants took 1516 ms to find 121 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/2322 places, 243/4200 transitions.
Graph (trivial) has 220 edges and 124 vertex of which 101 / 124 are part of one of the 1 SCC in 0 ms
Free SCC test removed 100 places
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 5 transition count 26
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 5 transition count 26
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 20 rules applied. Total rules applied 59 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 4 transition count 6
Applied a total of 60 rules in 3 ms. Remains 4 /124 variables (removed 120) and now considering 6/243 (removed 237) transitions.
// Phase 1: matrix 6 rows 4 cols
[2022-05-19 15:09:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:05] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-19 15:09:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:05] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/2322 places, 6/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/2322 places, 6/4200 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLCardinality-02 finished in 1791 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(p0))))'
Support contains 2 out of 2322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Applied a total of 0 rules in 119 ms. Remains 2322 /2322 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2322 cols
[2022-05-19 15:09:05] [INFO ] Computed 122 place invariants in 47 ms
[2022-05-19 15:09:08] [INFO ] Implicit Places using invariants in 2232 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 605, 706, 807, 908, 1009, 1110, 1211, 1312, 1413, 1514, 1615, 1716, 1817, 1918, 2019, 2120, 2221]
Discarding 118 places :
Implicit Place search using SMT only with invariants took 2244 ms to find 118 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2204/2322 places, 4200/4200 transitions.
Discarding 1698 places :
Symmetric choice reduction at 0 with 1698 rule applications. Total rules 1698 place count 506 transition count 2502
Iterating global reduction 0 with 1698 rules applied. Total rules applied 3396 place count 506 transition count 2502
Ensure Unique test removed 1599 transitions
Reduce isomorphic transitions removed 1599 transitions.
Iterating post reduction 0 with 1599 rules applied. Total rules applied 4995 place count 506 transition count 903
Discarding 395 places :
Symmetric choice reduction at 1 with 395 rule applications. Total rules 5390 place count 111 transition count 508
Iterating global reduction 1 with 395 rules applied. Total rules applied 5785 place count 111 transition count 508
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 5882 place count 14 transition count 120
Iterating global reduction 1 with 97 rules applied. Total rules applied 5979 place count 14 transition count 120
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 6076 place count 14 transition count 23
Applied a total of 6076 rules in 87 ms. Remains 14 /2204 variables (removed 2190) and now considering 23/4200 (removed 4177) transitions.
// Phase 1: matrix 23 rows 14 cols
[2022-05-19 15:09:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 15:09:08] [INFO ] Implicit Places using invariants in 156 ms returned [5, 8, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 160 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/2322 places, 23/4200 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 8 transition count 20
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 8 transition count 20
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 14 place count 8 transition count 12
Applied a total of 14 rules in 1 ms. Remains 8 /11 variables (removed 3) and now considering 12/23 (removed 11) transitions.
// Phase 1: matrix 12 rows 8 cols
[2022-05-19 15:09:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:08] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2022-05-19 15:09:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:08] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 8/2322 places, 12/4200 transitions.
Finished structural reductions, in 3 iterations. Remains : 8/2322 places, 12/4200 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ServersAndClients-PT-100020-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100020-LTLCardinality-05 finished in 3043 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)&&(F(p1)||p1)))))'
Support contains 3 out of 2322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Applied a total of 0 rules in 241 ms. Remains 2322 /2322 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2322 cols
[2022-05-19 15:09:09] [INFO ] Computed 122 place invariants in 50 ms
[2022-05-19 15:09:11] [INFO ] Implicit Places using invariants in 2275 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 504, 605, 706, 807, 908, 1009, 1110, 1211, 1312, 1413, 1514, 1615, 1716, 1817, 1918, 2019, 2120, 2221]
Discarding 119 places :
Implicit Place search using SMT only with invariants took 2281 ms to find 119 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2203/2322 places, 4200/4200 transitions.
Discarding 1796 places :
Symmetric choice reduction at 0 with 1796 rule applications. Total rules 1796 place count 407 transition count 2404
Iterating global reduction 0 with 1796 rules applied. Total rules applied 3592 place count 407 transition count 2404
Ensure Unique test removed 1697 transitions
Reduce isomorphic transitions removed 1697 transitions.
Iterating post reduction 0 with 1697 rules applied. Total rules applied 5289 place count 407 transition count 707
Discarding 297 places :
Symmetric choice reduction at 1 with 297 rule applications. Total rules 5586 place count 110 transition count 410
Iterating global reduction 1 with 297 rules applied. Total rules applied 5883 place count 110 transition count 410
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 5979 place count 14 transition count 122
Iterating global reduction 1 with 96 rules applied. Total rules applied 6075 place count 14 transition count 122
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 6171 place count 14 transition count 26
Applied a total of 6171 rules in 57 ms. Remains 14 /2203 variables (removed 2189) and now considering 26/4200 (removed 4174) transitions.
// Phase 1: matrix 26 rows 14 cols
[2022-05-19 15:09:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:09:11] [INFO ] Implicit Places using invariants in 49 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 12/2322 places, 26/4200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 10 transition count 24
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 10 transition count 24
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 12 place count 10 transition count 16
Applied a total of 12 rules in 0 ms. Remains 10 /12 variables (removed 2) and now considering 16/26 (removed 10) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-19 15:09:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:09:11] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2022-05-19 15:09:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:09:11] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 10/2322 places, 16/4200 transitions.
Finished structural reductions, in 3 iterations. Remains : 10/2322 places, 16/4200 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s9 0) (NEQ s7 1)), p1:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLCardinality-09 finished in 2949 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(F(p0))))))'
Support contains 1 out of 2322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Drop transitions removed 1999 transitions
Trivial Post-agglo rules discarded 1999 transitions
Performed 1999 trivial Post agglomeration. Transition count delta: 1999
Iterating post reduction 0 with 1999 rules applied. Total rules applied 1999 place count 2322 transition count 2201
Reduce places removed 2018 places and 0 transitions.
Ensure Unique test removed 1800 transitions
Reduce isomorphic transitions removed 1800 transitions.
Iterating post reduction 1 with 3818 rules applied. Total rules applied 5817 place count 304 transition count 401
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 6015 place count 205 transition count 302
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 6114 place count 205 transition count 203
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 2 with 101 rules applied. Total rules applied 6215 place count 204 transition count 103
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 297 rules applied. Total rules applied 6512 place count 5 transition count 5
Applied a total of 6512 rules in 96 ms. Remains 5 /2322 variables (removed 2317) and now considering 5/4200 (removed 4195) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-19 15:09:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 15:09:11] [INFO ] Implicit Places using invariants in 41 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/2322 places, 5/4200 transitions.
Graph (trivial) has 3 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:09:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:09:11] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:09:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:09:11] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/2322 places, 3/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/2322 places, 3/4200 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLCardinality-11 automaton TGBA Formula[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:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLCardinality-11 finished in 307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(F(p1))))'
Support contains 4 out of 2322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2322/2322 places, 4200/4200 transitions.
Applied a total of 0 rules in 123 ms. Remains 2322 /2322 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2322 cols
[2022-05-19 15:09:12] [INFO ] Computed 122 place invariants in 101 ms
[2022-05-19 15:09:14] [INFO ] Implicit Places using invariants in 2245 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 302, 403, 504, 605, 706, 807, 908, 1009, 1110, 1211, 1312, 1413, 1514, 1615, 1716, 1817, 1918, 2019, 2120, 2221]
Discarding 121 places :
Implicit Place search using SMT only with invariants took 2261 ms to find 121 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2201/2322 places, 4200/4200 transitions.
Discarding 1996 places :
Symmetric choice reduction at 0 with 1996 rule applications. Total rules 1996 place count 205 transition count 2204
Iterating global reduction 0 with 1996 rules applied. Total rules applied 3992 place count 205 transition count 2204
Ensure Unique test removed 1897 transitions
Reduce isomorphic transitions removed 1897 transitions.
Iterating post reduction 0 with 1897 rules applied. Total rules applied 5889 place count 205 transition count 307
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 5988 place count 106 transition count 208
Iterating global reduction 1 with 99 rules applied. Total rules applied 6087 place count 106 transition count 208
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 6182 place count 11 transition count 113
Iterating global reduction 1 with 95 rules applied. Total rules applied 6277 place count 11 transition count 113
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 6372 place count 11 transition count 18
Applied a total of 6372 rules in 19 ms. Remains 11 /2201 variables (removed 2190) and now considering 18/4200 (removed 4182) transitions.
// Phase 1: matrix 18 rows 11 cols
[2022-05-19 15:09:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:14] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 18 rows 11 cols
[2022-05-19 15:09:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:09:14] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/2322 places, 18/4200 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/2322 places, 18/4200 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLCardinality-12 automaton TGBA Formula[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=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s8 0) (EQ s10 1)), p1:(OR (EQ s5 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLCardinality-12 finished in 2643 ms.
All properties solved by simple procedures.
Total runtime 19451 ms.

BK_STOP 1652972954712

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

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

Sequence of Actions to be Executed by the VM

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

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

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