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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 7.7K Apr 29 17:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 17:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 17:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 17:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K 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 9.9M 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-200080-LTLCardinality-00
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-01
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-02
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-03
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-04
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-05
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-06
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-07
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-08
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-09
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-10
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-11
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-12
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-13
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-14
FORMULA_NAME ServersAndClients-PT-200080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652975148131

Running Version 202205111006
[2022-05-19 15:45:49] [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:45:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:45:50] [INFO ] Load time of PNML (sax parser for PT used): 741 ms
[2022-05-19 15:45:50] [INFO ] Transformed 16881 places.
[2022-05-19 15:45:50] [INFO ] Transformed 32400 transitions.
[2022-05-19 15:45:50] [INFO ] Parsed PT model containing 16881 places and 32400 transitions in 1129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ServersAndClients-PT-200080-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 16881 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 275 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2022-05-19 15:45:51] [INFO ] Computed 481 place invariants in 577 ms
[2022-05-19 15:45:53] [INFO ] Implicit Places using invariants in 2640 ms returned []
Implicit Place search using SMT only with invariants took 2679 ms to find 0 implicit places.
// Phase 1: matrix 32400 rows 16881 cols
[2022-05-19 15:45:54] [INFO ] Computed 481 place invariants in 348 ms
[2022-05-19 15:45:55] [INFO ] Dead Transitions using invariants and state equation in 1982 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16881/16881 places, 32400/32400 transitions.
Support contains 37 out of 16881 places after structural reductions.
[2022-05-19 15:45:57] [INFO ] Flatten gal took : 1238 ms
[2022-05-19 15:45:58] [INFO ] Flatten gal took : 917 ms
[2022-05-19 15:46:00] [INFO ] Input system was already deterministic with 32400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1437 ms. (steps per millisecond=6 ) properties (out of 23) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 32400 rows 16881 cols
[2022-05-19 15:46:03] [INFO ] Computed 481 place invariants in 387 ms
[2022-05-19 15:46:08] [INFO ] After 5683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-19 15:46:16] [INFO ] [Nat]Absence check using 281 positive place invariants in 2431 ms returned sat
[2022-05-19 15:46:16] [INFO ] [Nat]Absence check using 281 positive and 200 generalized place invariants in 449 ms returned sat
[2022-05-19 15:46:33] [INFO ] After 13009ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :14
[2022-05-19 15:46:33] [INFO ] After 13055ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :14
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-19 15:46:33] [INFO ] After 25088ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :14
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 26 out of 16881 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Drop transitions removed 15974 transitions
Trivial Post-agglo rules discarded 15974 transitions
Performed 15974 trivial Post agglomeration. Transition count delta: 15974
Iterating post reduction 0 with 15974 rules applied. Total rules applied 15974 place count 16881 transition count 16426
Reduce places removed 16029 places and 0 transitions.
Ensure Unique test removed 10800 transitions
Reduce isomorphic transitions removed 10800 transitions.
Iterating post reduction 1 with 26829 rules applied. Total rules applied 42803 place count 852 transition count 5626
Drop transitions removed 4974 transitions
Redundant transition composition rules discarded 4974 transitions
Iterating global reduction 2 with 4974 rules applied. Total rules applied 47777 place count 852 transition count 652
Discarding 175 places :
Implicit places reduction removed 175 places
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 2 with 525 rules applied. Total rules applied 48302 place count 677 transition count 302
Reduce places removed 525 places and 0 transitions.
Drop transitions removed 175 transitions
Reduce isomorphic transitions removed 175 transitions.
Iterating post reduction 3 with 700 rules applied. Total rules applied 49002 place count 152 transition count 127
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 49027 place count 152 transition count 127
Applied a total of 49027 rules in 599 ms. Remains 152 /16881 variables (removed 16729) and now considering 127/32400 (removed 32273) transitions.
Finished structural reductions, in 1 iterations. Remains : 152/16881 places, 127/32400 transitions.
Finished random walk after 362 steps, including 0 resets, run visited all 15 properties in 9 ms. (steps per millisecond=40 )
FORMULA ServersAndClients-PT-200080-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA ServersAndClients-PT-200080-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&X(F(G(X(!(p0 U false)))))))'
Support contains 2 out of 16881 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 107 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2022-05-19 15:46:35] [INFO ] Computed 481 place invariants in 255 ms
[2022-05-19 15:46:36] [INFO ] Implicit Places using invariants in 1822 ms returned []
Implicit Place search using SMT only with invariants took 1823 ms to find 0 implicit places.
// Phase 1: matrix 32400 rows 16881 cols
[2022-05-19 15:46:37] [INFO ] Computed 481 place invariants in 243 ms
[2022-05-19 15:46:38] [INFO ] Dead Transitions using invariants and state equation in 1693 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16881/16881 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s3966 s1632)], 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 timeout after 62290 steps with 31145 reset in 10001 ms.
Product exploration timeout after 66430 steps with 33215 reset in 10002 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 155 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ServersAndClients-PT-200080-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-200080-LTLCardinality-02 finished in 24261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(p1)&&p0))||G(p2))))'
Support contains 4 out of 16881 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 110 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2022-05-19 15:46:59] [INFO ] Computed 481 place invariants in 255 ms
[2022-05-19 15:47:00] [INFO ] Implicit Places using invariants in 1457 ms returned []
Implicit Place search using SMT only with invariants took 1477 ms to find 0 implicit places.
// Phase 1: matrix 32400 rows 16881 cols
[2022-05-19 15:47:00] [INFO ] Computed 481 place invariants in 246 ms
[2022-05-19 15:47:02] [INFO ] Dead Transitions using invariants and state equation in 2135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16881/16881 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 369 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (AND (NOT p2) p0), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200080-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=6 dest: 5}]], initial=0, aps=[p2:(GT s15817 s7752), p0:(AND (OR (LEQ s15817 s7752) (LEQ s13440 s8792)) (LEQ s13440 s8792)), p1:(GT s13440 s8792)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ServersAndClients-PT-200080-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-LTLCardinality-03 finished in 4196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0)) U p1) U G(p2)))'
Support contains 5 out of 16881 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 112 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2022-05-19 15:47:03] [INFO ] Computed 481 place invariants in 242 ms
[2022-05-19 15:47:05] [INFO ] Implicit Places using invariants in 1742 ms returned []
Implicit Place search using SMT only with invariants took 1744 ms to find 0 implicit places.
// Phase 1: matrix 32400 rows 16881 cols
[2022-05-19 15:47:05] [INFO ] Computed 481 place invariants in 323 ms
[2022-05-19 15:47:08] [INFO ] Dead Transitions using invariants and state equation in 3217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16881/16881 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-200080-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s3313), p1:(LEQ s9050 s10108), p0:(LEQ s10173 s14842)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5199 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 3 ms.
FORMULA ServersAndClients-PT-200080-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200080-LTLCardinality-05 finished in 10683 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||X(X(p0))))&&F(X(p0))))'
Support contains 2 out of 16881 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Drop transitions removed 15998 transitions
Trivial Post-agglo rules discarded 15998 transitions
Performed 15998 trivial Post agglomeration. Transition count delta: 15998
Iterating post reduction 0 with 15998 rules applied. Total rules applied 15998 place count 16881 transition count 16402
Reduce places removed 16076 places and 0 transitions.
Ensure Unique test removed 15400 transitions
Reduce isomorphic transitions removed 15400 transitions.
Iterating post reduction 1 with 31476 rules applied. Total rules applied 47474 place count 805 transition count 1002
Drop transitions removed 398 transitions
Redundant transition composition rules discarded 398 transitions
Iterating global reduction 2 with 398 rules applied. Total rules applied 47872 place count 805 transition count 604
Discarding 198 places :
Implicit places reduction removed 198 places
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 2 with 594 rules applied. Total rules applied 48466 place count 607 transition count 208
Reduce places removed 594 places and 0 transitions.
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 3 with 791 rules applied. Total rules applied 49257 place count 13 transition count 11
Applied a total of 49257 rules in 260 ms. Remains 13 /16881 variables (removed 16868) and now considering 11/32400 (removed 32389) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 15:47:14] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-19 15:47:14] [INFO ] Implicit Places using invariants in 213 ms returned [0, 1, 2, 3, 9, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 215 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/16881 places, 11/32400 transitions.
Graph (trivial) has 7 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Applied a total of 1 rules in 3 ms. Remains 3 /7 variables (removed 4) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:47:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:47:14] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:47:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:47:14] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/16881 places, 5/32400 transitions.
Finished structural reductions, in 2 iterations. Remains : 3/16881 places, 5/32400 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLCardinality-06 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:(LEQ s1 s2)], 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 9080 reset in 83 ms.
Product exploration explored 100000 steps with 9091 reset in 71 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 188 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 117 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
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 192 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:47:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:47:15] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:47:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:47:15] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-19 15:47:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:47:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:47:15] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/3 places, 5/5 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 121 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 60 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 203 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 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9109 reset in 65 ms.
Product exploration explored 100000 steps with 9172 reset in 62 ms.
Built C files in :
/tmp/ltsmin698511556093878064
[2022-05-19 15:47:16] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-19 15:47:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:47:16] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-19 15:47:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:47:16] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-19 15:47:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:47:16] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin698511556093878064
Running compilation step : cd /tmp/ltsmin698511556093878064;'/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 241 ms.
Running link step : cd /tmp/ltsmin698511556093878064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin698511556093878064;'/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/stateBased16909753867984483178.hoa' '--buchi-type=spotba'
LTSmin run took 105 ms.
FORMULA ServersAndClients-PT-200080-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-200080-LTLCardinality-06 finished in 2898 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(p0)))'
Support contains 2 out of 16881 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Drop transitions removed 15998 transitions
Trivial Post-agglo rules discarded 15998 transitions
Performed 15998 trivial Post agglomeration. Transition count delta: 15998
Iterating post reduction 0 with 15998 rules applied. Total rules applied 15998 place count 16881 transition count 16402
Reduce places removed 16076 places and 0 transitions.
Ensure Unique test removed 15400 transitions
Reduce isomorphic transitions removed 15400 transitions.
Iterating post reduction 1 with 31476 rules applied. Total rules applied 47474 place count 805 transition count 1002
Drop transitions removed 398 transitions
Redundant transition composition rules discarded 398 transitions
Iterating global reduction 2 with 398 rules applied. Total rules applied 47872 place count 805 transition count 604
Discarding 198 places :
Implicit places reduction removed 198 places
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 2 with 594 rules applied. Total rules applied 48466 place count 607 transition count 208
Reduce places removed 594 places and 0 transitions.
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 3 with 791 rules applied. Total rules applied 49257 place count 13 transition count 11
Applied a total of 49257 rules in 259 ms. Remains 13 /16881 variables (removed 16868) and now considering 11/32400 (removed 32389) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 15:47:17] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-19 15:47:17] [INFO ] Implicit Places using invariants in 56 ms returned [0, 1, 2, 3, 9, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 57 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/16881 places, 11/32400 transitions.
Graph (trivial) has 7 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Applied a total of 1 rules in 0 ms. Remains 3 /7 variables (removed 4) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:47:17] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-19 15:47:17] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:47:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:47:17] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/16881 places, 5/32400 transitions.
Finished structural reductions, in 2 iterations. Remains : 3/16881 places, 5/32400 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200080-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-LTLCardinality-07 finished in 454 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||p1)))))'
Support contains 3 out of 16881 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Drop transitions removed 15997 transitions
Trivial Post-agglo rules discarded 15997 transitions
Performed 15997 trivial Post agglomeration. Transition count delta: 15997
Iterating post reduction 0 with 15997 rules applied. Total rules applied 15997 place count 16881 transition count 16403
Reduce places removed 16074 places and 0 transitions.
Ensure Unique test removed 15200 transitions
Reduce isomorphic transitions removed 15200 transitions.
Iterating post reduction 1 with 31274 rules applied. Total rules applied 47271 place count 807 transition count 1203
Drop transitions removed 597 transitions
Redundant transition composition rules discarded 597 transitions
Iterating global reduction 2 with 597 rules applied. Total rules applied 47868 place count 807 transition count 606
Discarding 197 places :
Implicit places reduction removed 197 places
Drop transitions removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 2 with 591 rules applied. Total rules applied 48459 place count 610 transition count 212
Reduce places removed 591 places and 0 transitions.
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 787 rules applied. Total rules applied 49246 place count 19 transition count 16
Applied a total of 49246 rules in 268 ms. Remains 19 /16881 variables (removed 16862) and now considering 16/32400 (removed 32384) transitions.
// Phase 1: matrix 16 rows 19 cols
[2022-05-19 15:47:17] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 15:47:18] [INFO ] Implicit Places using invariants in 521 ms returned [0, 1, 2, 3, 4, 5, 13, 15, 17]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 522 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/16881 places, 16/32400 transitions.
Graph (trivial) has 10 edges and 10 vertex of which 7 / 10 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Applied a total of 1 rules in 3 ms. Remains 4 /10 variables (removed 6) and now considering 7/16 (removed 9) transitions.
// Phase 1: matrix 7 rows 4 cols
[2022-05-19 15:47:18] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:47:18] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-19 15:47:18] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:47:18] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/16881 places, 7/32400 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/16881 places, 7/32400 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-200080-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT 1 s1) (GT s3 s2)), p0:(GT s3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200080-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-LTLCardinality-11 finished in 929 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U p2)))))'
Support contains 5 out of 16881 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Drop transitions removed 15995 transitions
Trivial Post-agglo rules discarded 15995 transitions
Performed 15995 trivial Post agglomeration. Transition count delta: 15995
Iterating post reduction 0 with 15995 rules applied. Total rules applied 15995 place count 16881 transition count 16405
Reduce places removed 16070 places and 0 transitions.
Ensure Unique test removed 14800 transitions
Reduce isomorphic transitions removed 14800 transitions.
Iterating post reduction 1 with 30870 rules applied. Total rules applied 46865 place count 811 transition count 1605
Drop transitions removed 995 transitions
Redundant transition composition rules discarded 995 transitions
Iterating global reduction 2 with 995 rules applied. Total rules applied 47860 place count 811 transition count 610
Discarding 195 places :
Implicit places reduction removed 195 places
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 2 with 585 rules applied. Total rules applied 48445 place count 616 transition count 220
Reduce places removed 585 places and 0 transitions.
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 3 with 779 rules applied. Total rules applied 49224 place count 31 transition count 26
Applied a total of 49224 rules in 311 ms. Remains 31 /16881 variables (removed 16850) and now considering 26/32400 (removed 32374) transitions.
// Phase 1: matrix 26 rows 31 cols
[2022-05-19 15:47:18] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-19 15:47:18] [INFO ] Implicit Places using invariants in 354 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 21, 23, 25, 27, 29]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 356 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/16881 places, 26/32400 transitions.
Graph (trivial) has 16 edges and 16 vertex of which 11 / 16 are part of one of the 1 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Applied a total of 1 rules in 2 ms. Remains 6 /16 variables (removed 10) and now considering 11/26 (removed 15) transitions.
// Phase 1: matrix 11 rows 6 cols
[2022-05-19 15:47:18] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:47:18] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 11 rows 6 cols
[2022-05-19 15:47:18] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:47:18] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/16881 places, 11/32400 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/16881 places, 11/32400 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 1 s5), p0:(LEQ s4 s3), p1:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200080-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-LTLCardinality-13 finished in 866 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((true U p0)))))'
Support contains 1 out of 16881 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Drop transitions removed 15999 transitions
Trivial Post-agglo rules discarded 15999 transitions
Performed 15999 trivial Post agglomeration. Transition count delta: 15999
Iterating post reduction 0 with 15999 rules applied. Total rules applied 15999 place count 16881 transition count 16401
Reduce places removed 16078 places and 0 transitions.
Ensure Unique test removed 15600 transitions
Reduce isomorphic transitions removed 15600 transitions.
Iterating post reduction 1 with 31678 rules applied. Total rules applied 47677 place count 803 transition count 801
Drop transitions removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 2 with 199 rules applied. Total rules applied 47876 place count 803 transition count 602
Discarding 199 places :
Implicit places reduction removed 199 places
Drop transitions removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 2 with 597 rules applied. Total rules applied 48473 place count 604 transition count 204
Reduce places removed 597 places and 0 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 795 rules applied. Total rules applied 49268 place count 7 transition count 6
Applied a total of 49268 rules in 217 ms. Remains 7 /16881 variables (removed 16874) and now considering 6/32400 (removed 32394) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-19 15:47:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 15:47:19] [INFO ] Implicit Places using invariants in 23 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/16881 places, 6/32400 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:47:19] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:47:19] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:47:19] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:47:19] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/16881 places, 3/32400 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/16881 places, 3/32400 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLCardinality-14 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:(GT 1 s1)], 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 14349 reset in 49 ms.
Product exploration explored 100000 steps with 14306 reset in 50 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 100 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 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
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 116 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 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:47:19] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:47:19] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:47:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:47:20] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-19 15:47:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:47:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:47:20] [INFO ] Dead Transitions using invariants and state equation in 46 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 121 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 103 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
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 148 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 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14360 reset in 48 ms.
Product exploration explored 100000 steps with 14312 reset in 55 ms.
Built C files in :
/tmp/ltsmin4473857749071249534
[2022-05-19 15:47:20] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2022-05-19 15:47:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:47:20] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2022-05-19 15:47:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:47:20] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2022-05-19 15:47:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:47:20] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4473857749071249534
Running compilation step : cd /tmp/ltsmin4473857749071249534;'/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 54 ms.
Running link step : cd /tmp/ltsmin4473857749071249534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 20 ms.
Running LTSmin : cd /tmp/ltsmin4473857749071249534;'/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/stateBased6000959820217909054.hoa' '--buchi-type=spotba'
LTSmin run took 228 ms.
FORMULA ServersAndClients-PT-200080-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-200080-LTLCardinality-14 finished in 2088 ms.
All properties solved by simple procedures.
Total runtime 91719 ms.

BK_STOP 1652975241254

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

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