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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 8.4K Apr 29 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 29 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:45 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 20M 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-100320-LTLCardinality-00
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-01
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-02
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-03
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-04
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-05
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-06
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-07
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-08
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-09
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-10
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-11
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-12
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-13
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-14
FORMULA_NAME ServersAndClients-PT-100320-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652974405241

Running Version 202205111006
[2022-05-19 15:33:26] [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:33:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:33:28] [INFO ] Load time of PNML (sax parser for PT used): 1398 ms
[2022-05-19 15:33:28] [INFO ] Transformed 32721 places.
[2022-05-19 15:33:28] [INFO ] Transformed 64200 transitions.
[2022-05-19 15:33:28] [INFO ] Parsed PT model containing 32721 places and 64200 transitions in 1823 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ServersAndClients-PT-100320-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100320-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100320-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100320-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100320-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 611 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:33:30] [INFO ] Computed 521 place invariants in 927 ms
[2022-05-19 15:33:34] [INFO ] Implicit Places using invariants in 4175 ms returned []
Implicit Place search using SMT only with invariants took 4273 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:33:34] [INFO ] Computed 521 place invariants in 510 ms
[2022-05-19 15:33:37] [INFO ] Dead Transitions using invariants and state equation in 3540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Support contains 46 out of 32721 places after structural reductions.
[2022-05-19 15:33:40] [INFO ] Flatten gal took : 2168 ms
[2022-05-19 15:33:42] [INFO ] Flatten gal took : 1844 ms
[2022-05-19 15:33:45] [INFO ] Input system was already deterministic with 64200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1671 ms. (steps per millisecond=5 ) properties (out of 27) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:33:48] [INFO ] Computed 521 place invariants in 625 ms
[2022-05-19 15:34:01] [INFO ] After 13101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-19 15:34:17] [INFO ] [Nat]Absence check using 421 positive place invariants in 2180 ms returned sat
[2022-05-19 15:34:17] [INFO ] [Nat]Absence check using 421 positive and 100 generalized place invariants in 437 ms returned sat
[2022-05-19 15:34:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 15:34:27] [INFO ] After 25213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:24
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31970 transitions
Trivial Post-agglo rules discarded 31970 transitions
Performed 31970 trivial Post agglomeration. Transition count delta: 31970
Iterating post reduction 0 with 31970 rules applied. Total rules applied 31970 place count 32721 transition count 32230
Reduce places removed 32263 places and 0 transitions.
Ensure Unique test removed 29200 transitions
Reduce isomorphic transitions removed 29200 transitions.
Iterating post reduction 1 with 61463 rules applied. Total rules applied 93433 place count 458 transition count 3030
Drop transitions removed 2670 transitions
Redundant transition composition rules discarded 2670 transitions
Iterating global reduction 2 with 2670 rules applied. Total rules applied 96103 place count 458 transition count 360
Discarding 78 places :
Implicit places reduction removed 78 places
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 2 with 234 rules applied. Total rules applied 96337 place count 380 transition count 204
Reduce places removed 234 places and 0 transitions.
Drop transitions removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 3 with 312 rules applied. Total rules applied 96649 place count 146 transition count 126
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 4 with 22 rules applied. Total rules applied 96671 place count 146 transition count 126
Applied a total of 96671 rules in 856 ms. Remains 146 /32721 variables (removed 32575) and now considering 126/64200 (removed 64074) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/32721 places, 126/64200 transitions.
Finished random walk after 364 steps, including 0 resets, run visited all 17 properties in 9 ms. (steps per millisecond=40 )
FORMULA ServersAndClients-PT-100320-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ServersAndClients-PT-100320-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ServersAndClients-PT-100320-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100320-LTLCardinality-09 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' '!(F(((!F(p0) U X(p0))&&(p1 U G(p2)))))'
Support contains 6 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 628 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:34:29] [INFO ] Computed 521 place invariants in 584 ms
[2022-05-19 15:34:32] [INFO ] Implicit Places using invariants in 3622 ms returned []
Implicit Place search using SMT only with invariants took 3623 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:34:33] [INFO ] Computed 521 place invariants in 642 ms
[2022-05-19 15:34:36] [INFO ] Dead Transitions using invariants and state equation in 3674 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 658 ms :[(OR (NOT p2) (NOT p0)), false, (NOT p0), (NOT p2), (NOT p2), (NOT p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100320-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={1} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 4}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0, 1} source=0 dest: 5}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=4 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=4 dest: 10}, { cond=(AND p0 p2 p1), acceptance={0} source=4 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={1} source=5 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=5 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={1} source=6 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=6 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 p2 p1), acceptance={0} source=7 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=8 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=8 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=8 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=8 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=8 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=8 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=8 dest: 9}, { cond=(AND p0 p2 p1), acceptance={0} source=8 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=9 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=9 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=9 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=10 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=10 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p0) p2), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=11 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=11 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=11 dest: 10}]], initial=0, aps=[p2:(LEQ s20031 s7864), p1:(LEQ s26099 s11818), p0:(LEQ s9339 s19607)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8698 ms.
Stack based approach found an accepted trace after 45358 steps with 0 reset with depth 45359 and stack size 2473 in 3973 ms.
FORMULA ServersAndClients-PT-100320-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100320-LTLCardinality-01 finished in 21476 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(!(p0 U (p1 U p0))))))'
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 645 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:34:51] [INFO ] Computed 521 place invariants in 515 ms
[2022-05-19 15:34:55] [INFO ] Implicit Places using invariants in 4863 ms returned []
Implicit Place search using SMT only with invariants took 4883 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:34:56] [INFO ] Computed 521 place invariants in 709 ms
[2022-05-19 15:34:58] [INFO ] Dead Transitions using invariants and state equation in 3455 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : ServersAndClients-PT-100320-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s32375 s835), p1:(GT 1 s4171)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 6 ms.
FORMULA ServersAndClients-PT-100320-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLCardinality-02 finished in 9338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)||p1))||(p2 U p3)||F(p0))))'
Support contains 7 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31993 transitions
Trivial Post-agglo rules discarded 31993 transitions
Performed 31993 trivial Post agglomeration. Transition count delta: 31993
Iterating post reduction 0 with 31993 rules applied. Total rules applied 31993 place count 32721 transition count 32207
Reduce places removed 32306 places and 0 transitions.
Ensure Unique test removed 31200 transitions
Reduce isomorphic transitions removed 31200 transitions.
Iterating post reduction 1 with 63506 rules applied. Total rules applied 95499 place count 415 transition count 1007
Drop transitions removed 693 transitions
Redundant transition composition rules discarded 693 transitions
Iterating global reduction 2 with 693 rules applied. Total rules applied 96192 place count 415 transition count 314
Discarding 93 places :
Implicit places reduction removed 93 places
Drop transitions removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 2 with 279 rules applied. Total rules applied 96471 place count 322 transition count 128
Reduce places removed 279 places and 0 transitions.
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 3 with 371 rules applied. Total rules applied 96842 place count 43 transition count 36
Applied a total of 96842 rules in 691 ms. Remains 43 /32721 variables (removed 32678) and now considering 36/64200 (removed 64164) transitions.
// Phase 1: matrix 36 rows 43 cols
[2022-05-19 15:34:59] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 15:35:00] [INFO ] Implicit Places using invariants in 273 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 29, 31, 33, 35, 37, 39, 41]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 279 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32721 places, 36/64200 transitions.
Graph (trivial) has 22 edges and 22 vertex of which 15 / 22 are part of one of the 1 SCC in 7 ms
Free SCC test removed 14 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Applied a total of 1 rules in 7 ms. Remains 8 /22 variables (removed 14) and now considering 15/36 (removed 21) transitions.
// Phase 1: matrix 15 rows 8 cols
[2022-05-19 15:35:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:35:00] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 15 rows 8 cols
[2022-05-19 15:35:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:35:00] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/32721 places, 15/64200 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/32721 places, 15/64200 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ServersAndClients-PT-100320-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(LEQ s1 s3), p2:(LEQ s7 s2), p0:(LEQ 1 s5), p1:(LEQ s6 s4)], 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 0 reset in 198 ms.
Product exploration explored 100000 steps with 0 reset in 85 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p2 (NOT p0) p1), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 399 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 15 rows 8 cols
[2022-05-19 15:35:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:35:01] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 15:35:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-19 15:35:01] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 p2 (NOT p0) p1), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p1) (NOT p0)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))
Knowledge based reduction with 7 factoid took 304 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ServersAndClients-PT-100320-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100320-LTLCardinality-05 finished in 2752 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(X((F(p0)||p1)))))))'
Support contains 2 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 516 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:03] [INFO ] Computed 521 place invariants in 858 ms
[2022-05-19 15:35:05] [INFO ] Implicit Places using invariants in 3464 ms returned []
Implicit Place search using SMT only with invariants took 3466 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:06] [INFO ] Computed 521 place invariants in 571 ms
[2022-05-19 15:35:08] [INFO ] Dead Transitions using invariants and state equation in 2794 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100320-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LEQ 1 s14293), p1:(LEQ 1 s19944)], 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, null, null, null][false, false, false, false, false]]
Product exploration timeout after 87540 steps with 2 reset in 10001 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 6 ms.
FORMULA ServersAndClients-PT-100320-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100320-LTLCardinality-10 finished in 17167 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 406 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:20] [INFO ] Computed 521 place invariants in 518 ms
[2022-05-19 15:35:24] [INFO ] Implicit Places using invariants in 4468 ms returned []
Implicit Place search using SMT only with invariants took 4469 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:24] [INFO ] Computed 521 place invariants in 530 ms
[2022-05-19 15:35:27] [INFO ] Dead Transitions using invariants and state equation in 3171 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s30137 s24977)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8438 ms.
Product exploration timeout after 74160 steps with 0 reset in 10001 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), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be false thanks to negative knowledge :(X (X (NOT p0)))
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA ServersAndClients-PT-100320-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100320-LTLCardinality-11 finished in 27154 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p0)||(!F(p1) U G(p1))))))'
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 351 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:47] [INFO ] Computed 521 place invariants in 581 ms
[2022-05-19 15:35:49] [INFO ] Implicit Places using invariants in 2759 ms returned []
Implicit Place search using SMT only with invariants took 2761 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:50] [INFO ] Computed 521 place invariants in 579 ms
[2022-05-19 15:35:52] [INFO ] Dead Transitions using invariants and state equation in 2673 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : ServersAndClients-PT-100320-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(LEQ s20658 s20056), p0:(GT 1 s21223)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 90810 steps with 0 reset in 10001 ms.
Product exploration explored 100000 steps with 0 reset in 9344 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 6 states, 13 edges and 2 AP to 6 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1628 ms. (steps per millisecond=6 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:36:15] [INFO ] Computed 521 place invariants in 514 ms
[2022-05-19 15:36:22] [INFO ] [Real]Absence check using 421 positive place invariants in 2038 ms returned sat
[2022-05-19 15:36:23] [INFO ] [Real]Absence check using 421 positive and 100 generalized place invariants in 459 ms returned sat
[2022-05-19 15:36:40] [INFO ] After 16086ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:2
[2022-05-19 15:36:40] [INFO ] After 16141ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 15:36:40] [INFO ] After 25075ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 15:36:50] [INFO ] [Nat]Absence check using 421 positive place invariants in 2299 ms returned sat
[2022-05-19 15:36:51] [INFO ] [Nat]Absence check using 421 positive and 100 generalized place invariants in 438 ms returned sat
[2022-05-19 15:37:05] [INFO ] After 13022ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-19 15:37:05] [INFO ] After 13023ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-19 15:37:05] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31997 transitions
Trivial Post-agglo rules discarded 31997 transitions
Performed 31997 trivial Post agglomeration. Transition count delta: 31997
Iterating post reduction 0 with 31997 rules applied. Total rules applied 31997 place count 32721 transition count 32203
Reduce places removed 32314 places and 0 transitions.
Ensure Unique test removed 31600 transitions
Reduce isomorphic transitions removed 31600 transitions.
Iterating post reduction 1 with 63914 rules applied. Total rules applied 95911 place count 407 transition count 603
Drop transitions removed 297 transitions
Redundant transition composition rules discarded 297 transitions
Iterating global reduction 2 with 297 rules applied. Total rules applied 96208 place count 407 transition count 306
Discarding 97 places :
Implicit places reduction removed 97 places
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 2 with 291 rules applied. Total rules applied 96499 place count 310 transition count 112
Reduce places removed 291 places and 0 transitions.
Drop transitions removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 388 rules applied. Total rules applied 96887 place count 19 transition count 15
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 96890 place count 19 transition count 15
Applied a total of 96890 rules in 596 ms. Remains 19 /32721 variables (removed 32702) and now considering 15/64200 (removed 64185) transitions.
Finished structural reductions, in 1 iterations. Remains : 19/32721 places, 15/64200 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 468 ms. Reduced automaton from 6 states, 12 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 198 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 257 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:37:07] [INFO ] Computed 521 place invariants in 450 ms
[2022-05-19 15:37:09] [INFO ] Implicit Places using invariants in 2779 ms returned []
Implicit Place search using SMT only with invariants took 2800 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:37:10] [INFO ] Computed 521 place invariants in 600 ms
[2022-05-19 15:37:13] [INFO ] Dead Transitions using invariants and state equation in 3368 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 226 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 275 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1047 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 3879 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3879 steps, saw 1385 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:37:19] [INFO ] Computed 521 place invariants in 656 ms
[2022-05-19 15:37:24] [INFO ] After 5982ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 15:37:32] [INFO ] [Nat]Absence check using 421 positive place invariants in 2220 ms returned sat
[2022-05-19 15:37:32] [INFO ] [Nat]Absence check using 421 positive and 100 generalized place invariants in 447 ms returned sat
[2022-05-19 15:37:50] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31997 transitions
Trivial Post-agglo rules discarded 31997 transitions
Performed 31997 trivial Post agglomeration. Transition count delta: 31997
Iterating post reduction 0 with 31997 rules applied. Total rules applied 31997 place count 32721 transition count 32203
Reduce places removed 32314 places and 0 transitions.
Ensure Unique test removed 31600 transitions
Reduce isomorphic transitions removed 31600 transitions.
Iterating post reduction 1 with 63914 rules applied. Total rules applied 95911 place count 407 transition count 603
Drop transitions removed 297 transitions
Redundant transition composition rules discarded 297 transitions
Iterating global reduction 2 with 297 rules applied. Total rules applied 96208 place count 407 transition count 306
Discarding 97 places :
Implicit places reduction removed 97 places
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 2 with 291 rules applied. Total rules applied 96499 place count 310 transition count 112
Reduce places removed 291 places and 0 transitions.
Drop transitions removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 388 rules applied. Total rules applied 96887 place count 19 transition count 15
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 96890 place count 19 transition count 15
Applied a total of 96890 rules in 512 ms. Remains 19 /32721 variables (removed 32702) and now considering 15/64200 (removed 64185) transitions.
Finished structural reductions, in 1 iterations. Remains : 19/32721 places, 15/64200 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 197 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 209 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 205 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 81540 steps with 0 reset in 10001 ms.
Product exploration timeout after 79660 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, false, false, true, false, false]
Stuttering acceptance computed with spot in 256 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Performed 31997 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31997 rules applied. Total rules applied 31997 place count 32721 transition count 64200
Discarding 316 places :
Symmetric choice reduction at 1 with 316 rule applications. Total rules 32313 place count 32405 transition count 32600
Deduced a syphon composed of 31997 places in 13 ms
Iterating global reduction 1 with 316 rules applied. Total rules applied 32629 place count 32405 transition count 32600
Deduced a syphon composed of 31997 places in 7 ms
Applied a total of 32629 rules in 26847 ms. Remains 32405 /32721 variables (removed 316) and now considering 32600/64200 (removed 31600) transitions.
[2022-05-19 15:38:38] [INFO ] Flow matrix only has 32303 transitions (discarded 297 similar events)
// Phase 1: matrix 32303 rows 32405 cols
[2022-05-19 15:38:51] [INFO ] Computed 205 place invariants in 13200 ms
[2022-05-19 15:38:53] [INFO ] Dead Transitions using invariants and state equation in 15287 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32405/32721 places, 32600/64200 transitions.
Finished structural reductions, in 1 iterations. Remains : 32405/32721 places, 32600/64200 transitions.
Product exploration explored 100000 steps with 0 reset in 8132 ms.
Entered a terminal (fully accepting) state of product in 85544 steps with 0 reset in 7246 ms.
FORMULA ServersAndClients-PT-100320-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLCardinality-13 finished in 203199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0)||p1))&&!p0)))'
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31996 transitions
Trivial Post-agglo rules discarded 31996 transitions
Performed 31996 trivial Post agglomeration. Transition count delta: 31996
Iterating post reduction 0 with 31996 rules applied. Total rules applied 31996 place count 32721 transition count 32204
Reduce places removed 32313 places and 0 transitions.
Ensure Unique test removed 31600 transitions
Reduce isomorphic transitions removed 31600 transitions.
Iterating post reduction 1 with 63913 rules applied. Total rules applied 95909 place count 408 transition count 604
Drop transitions removed 296 transitions
Redundant transition composition rules discarded 296 transitions
Iterating global reduction 2 with 296 rules applied. Total rules applied 96205 place count 408 transition count 308
Discarding 96 places :
Implicit places reduction removed 96 places
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 2 with 288 rules applied. Total rules applied 96493 place count 312 transition count 116
Reduce places removed 288 places and 0 transitions.
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 3 with 383 rules applied. Total rules applied 96876 place count 24 transition count 21
Applied a total of 96876 rules in 537 ms. Remains 24 /32721 variables (removed 32697) and now considering 21/64200 (removed 64179) transitions.
// Phase 1: matrix 21 rows 24 cols
[2022-05-19 15:39:10] [INFO ] Computed 12 place invariants in 9 ms
[2022-05-19 15:39:10] [INFO ] Implicit Places using invariants in 332 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 17, 20, 22]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 333 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/32721 places, 21/64200 transitions.
Graph (trivial) has 13 edges and 13 vertex of which 9 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Applied a total of 1 rules in 3 ms. Remains 5 /13 variables (removed 8) and now considering 9/21 (removed 12) transitions.
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:39:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:39:10] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:39:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:39:10] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/32721 places, 9/64200 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/32721 places, 9/64200 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100320-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s1 s4), p1:(GT s3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100320-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLCardinality-15 finished in 1078 ms.
All properties solved by simple procedures.
Total runtime 343972 ms.

BK_STOP 1652974750630

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-100320"
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-100320, 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-165281599300491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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