Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r311-tall-162132107900141.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ServersAndClients-PT-100080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132107900141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 15K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 12 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 12 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 12 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.2K May 11 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 11 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 11 17:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 11 17:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 16M May 12 08:13 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-100080-00
FORMULA_NAME ServersAndClients-PT-100080-01
FORMULA_NAME ServersAndClients-PT-100080-02
FORMULA_NAME ServersAndClients-PT-100080-03
FORMULA_NAME ServersAndClients-PT-100080-04
FORMULA_NAME ServersAndClients-PT-100080-05
FORMULA_NAME ServersAndClients-PT-100080-06
FORMULA_NAME ServersAndClients-PT-100080-07
FORMULA_NAME ServersAndClients-PT-100080-08
FORMULA_NAME ServersAndClients-PT-100080-09
FORMULA_NAME ServersAndClients-PT-100080-10
FORMULA_NAME ServersAndClients-PT-100080-11
FORMULA_NAME ServersAndClients-PT-100080-12
FORMULA_NAME ServersAndClients-PT-100080-13
FORMULA_NAME ServersAndClients-PT-100080-14
FORMULA_NAME ServersAndClients-PT-100080-15

=== Now, execution of the tool begins

BK_START 1621437455147

Running Version 0
[2021-05-19 15:17:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-19 15:17:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 15:17:37] [INFO ] Load time of PNML (sax parser for PT used): 483 ms
[2021-05-19 15:17:37] [INFO ] Transformed 8481 places.
[2021-05-19 15:17:37] [INFO ] Transformed 16200 transitions.
[2021-05-19 15:17:37] [INFO ] Found NUPN structural information;
[2021-05-19 15:17:37] [INFO ] Parsed PT model containing 8481 places and 16200 transitions in 594 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 15:17:37] [INFO ] Initial state test concluded for 3 properties.
FORMULA ServersAndClients-PT-100080-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1974 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:17:39] [INFO ] Computed 281 place invariants in 260 ms
[2021-05-19 15:17:40] [INFO ] Implicit Places using invariants in 1570 ms returned []
Implicit Place search using SMT only with invariants took 1593 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:17:41] [INFO ] Computed 281 place invariants in 111 ms
[2021-05-19 15:17:42] [INFO ] Dead Transitions using invariants and state equation in 1288 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
[2021-05-19 15:17:43] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-19 15:17:43] [INFO ] Flatten gal took : 716 ms
FORMULA ServersAndClients-PT-100080-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 15:17:43] [INFO ] Flatten gal took : 538 ms
[2021-05-19 15:17:44] [INFO ] Input system was already deterministic with 16200 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2988 ms. (steps per millisecond=33 ) properties (out of 26) seen :23
Running SMT prover for 3 properties.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:17:48] [INFO ] Computed 281 place invariants in 99 ms
[2021-05-19 15:17:50] [INFO ] [Real]Absence check using 181 positive place invariants in 421 ms returned sat
[2021-05-19 15:17:50] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 129 ms returned sat
[2021-05-19 15:17:50] [INFO ] SMT Verify possible in real domain returnedunsat :1 sat :0 real:2
[2021-05-19 15:17:52] [INFO ] [Nat]Absence check using 181 positive place invariants in 465 ms returned sat
[2021-05-19 15:17:52] [INFO ] [Nat]Absence check using 181 positive and 100 generalized place invariants in 128 ms returned sat
[2021-05-19 15:17:52] [INFO ] SMT Verify possible in nat domain returned unsat :2 sat :1
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2021-05-19 15:17:52] [INFO ] Initial state test concluded for 1 properties.
FORMULA ServersAndClients-PT-100080-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((G(p1)&&p0) U ((G(p1)&&p2)||G(p3))) U X(p4)))], workingDir=/home/mcc/execution]
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2056 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:17:54] [INFO ] Computed 281 place invariants in 105 ms
[2021-05-19 15:17:55] [INFO ] Implicit Places using invariants in 1326 ms returned []
Implicit Place search using SMT only with invariants took 1328 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:17:55] [INFO ] Computed 281 place invariants in 102 ms
[2021-05-19 15:17:57] [INFO ] Dead Transitions using invariants and state equation in 1291 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 459 ms :[(NOT p4), (NOT p4), (AND (NOT p3) (NOT p1) (NOT p4)), (NOT p4), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p4)), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : ServersAndClients-PT-100080-00 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1 p3), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 p1) (AND p1 p0) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p1) p3)), acceptance={} source=0 dest: 5}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p1 (NOT p3) p0)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p4), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p4)), acceptance={} source=2 dest: 7}, { cond=(AND p1 (NOT p3) (NOT p4)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p1) p3 (NOT p4)), acceptance={} source=2 dest: 9}, { cond=(AND p1 p3 (NOT p4)), acceptance={} source=2 dest: 10}], [{ cond=(OR (AND (NOT p2) (NOT p3) (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), acceptance={} source=3 dest: 1}, { cond=(AND p2 p1 p3 (NOT p4)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p2 p1 (NOT p4)) (AND p1 p0 (NOT p4)) (AND p3 (NOT p4))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p0 (NOT p4)), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p2) p3 (NOT p0) (NOT p4)) (AND (NOT p1) p3 (NOT p4))), acceptance={} source=3 dest: 5}, { cond=(OR (AND p2 p1 (NOT p3) (NOT p4)) (AND p1 (NOT p3) p0 (NOT p4))), acceptance={} source=3 dest: 6}], [{ cond=(OR (AND (NOT p2) (NOT p3) (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), acceptance={} source=4 dest: 7}, { cond=(OR (AND p2 p1 (NOT p3) (NOT p4)) (AND p1 (NOT p3) p0 (NOT p4))), acceptance={} source=4 dest: 8}, { cond=(OR (AND (NOT p2) p3 (NOT p0) (NOT p4)) (AND (NOT p1) p3 (NOT p4))), acceptance={} source=4 dest: 9}, { cond=(AND p2 p1 p3 (NOT p4)), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p2) p1 p0 (NOT p4)), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={} source=5 dest: 7}, { cond=(AND p3 (NOT p4)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p1) (NOT p4)), acceptance={} source=6 dest: 7}, { cond=(AND p1 (NOT p4)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(NOT p3), acceptance={} source=9 dest: 7}, { cond=p3, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=10 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p1) p3), acceptance={} source=10 dest: 9}, { cond=(AND p1 p3), acceptance={} source=10 dest: 10}], [{ cond=(OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p3))), acceptance={} source=11 dest: 7}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p1 (NOT p3) p0)), acceptance={} source=11 dest: 8}, { cond=(OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p1) p3)), acceptance={} source=11 dest: 9}, { cond=(AND p2 p1 p3), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p2) p1 p3 p0), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(AND (NEQ s5528 1) (NEQ s379 0) (NEQ s2926 0)), p3:(AND (EQ s379 1) (EQ s2926 1) (NEQ s379 0) (NEQ s2926 0)), p0:(AND (NEQ s379 0) (NEQ s2926 0)), p1:(AND (EQ s379 1) (EQ s2926 1)), p4:(EQ s5528 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA ServersAndClients-PT-100080-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-00 finished in 5244 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7998 transitions
Trivial Post-agglo rules discarded 7998 transitions
Performed 7998 trivial Post agglomeration. Transition count delta: 7998
Iterating post reduction 0 with 7998 rules applied. Total rules applied 7998 place count 8481 transition count 8202
Reduce places removed 8076 places and 0 transitions.
Ensure Unique test removed 7700 transitions
Reduce isomorphic transitions removed 7700 transitions.
Iterating post reduction 1 with 15776 rules applied. Total rules applied 23774 place count 405 transition count 502
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 2 with 198 rules applied. Total rules applied 23972 place count 405 transition count 304
Discarding 98 places :
Implicit places reduction removed 98 places
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 2 with 294 rules applied. Total rules applied 24266 place count 307 transition count 108
Reduce places removed 294 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 391 rules applied. Total rules applied 24657 place count 13 transition count 11
Applied a total of 24657 rules in 210 ms. Remains 13 /8481 variables (removed 8468) and now considering 11/16200 (removed 16189) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-19 15:17:57] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-19 15:17:57] [INFO ] Implicit Places using invariants in 14 ms returned [0, 1, 2, 3, 9, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 15 ms to find 6 implicit places.
[2021-05-19 15:17:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 7 cols
[2021-05-19 15:17:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:17:57] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 7/8481 places, 11/16200 transitions.
Graph (trivial) has 7 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 3 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 4 ms. Remains 3 /7 variables (removed 4) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-19 15:17:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:17:57] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-19 15:17:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:17:57] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3/8481 places, 5/16200 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100080-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s2 1), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6621 reset in 215 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 5 in 0 ms.
FORMULA ServersAndClients-PT-100080-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-01 finished in 551 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1990 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:18:00] [INFO ] Computed 281 place invariants in 94 ms
[2021-05-19 15:18:01] [INFO ] Implicit Places using invariants in 1131 ms returned []
Implicit Place search using SMT only with invariants took 1132 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:18:01] [INFO ] Computed 281 place invariants in 93 ms
[2021-05-19 15:18:02] [INFO ] Dead Transitions using invariants and state equation in 1227 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100080-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s5995 1), p0:(AND (EQ s255 1) (EQ s2623 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2 reset in 2510 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-100080-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-02 finished in 6962 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0 U p1) U p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7997 transitions
Trivial Post-agglo rules discarded 7997 transitions
Performed 7997 trivial Post agglomeration. Transition count delta: 7997
Iterating post reduction 0 with 7997 rules applied. Total rules applied 7997 place count 8481 transition count 8203
Reduce places removed 8074 places and 0 transitions.
Ensure Unique test removed 7600 transitions
Reduce isomorphic transitions removed 7600 transitions.
Iterating post reduction 1 with 15674 rules applied. Total rules applied 23671 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 23968 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 24259 place count 310 transition count 112
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 387 rules applied. Total rules applied 24646 place count 19 transition count 16
Applied a total of 24646 rules in 142 ms. Remains 19 /8481 variables (removed 8462) and now considering 16/16200 (removed 16184) transitions.
// Phase 1: matrix 16 rows 19 cols
[2021-05-19 15:18:05] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-19 15:18:05] [INFO ] Implicit Places using invariants in 16 ms returned [0, 1, 2, 3, 4, 5, 13, 15, 17]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 17 ms to find 9 implicit places.
[2021-05-19 15:18:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2021-05-19 15:18:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:18:05] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 10/8481 places, 16/16200 transitions.
Graph (trivial) has 10 edges and 10 vertex of which 7 / 10 are part of one of the 1 SCC in 0 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 0 ms. Remains 4 /10 variables (removed 6) and now considering 7/16 (removed 9) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-19 15:18:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:18:05] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-19 15:18:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:18:05] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/8481 places, 7/16200 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100080-03 automaton TGBA [mat=[[{ cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s2 1), p1:(EQ s3 0), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100080-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-03 finished in 301 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(G((p1||F(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7820 transitions
Trivial Post-agglo rules discarded 7820 transitions
Performed 7820 trivial Post agglomeration. Transition count delta: 7820
Iterating post reduction 0 with 7820 rules applied. Total rules applied 7820 place count 8481 transition count 8380
Reduce places removed 7820 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 7899 rules applied. Total rules applied 15719 place count 661 transition count 8301
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 7700 transitions
Reduce isomorphic transitions removed 7700 transitions.
Iterating post reduction 2 with 7857 rules applied. Total rules applied 23576 place count 504 transition count 601
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 3 with 98 rules applied. Total rules applied 23674 place count 504 transition count 503
Applied a total of 23674 rules in 170 ms. Remains 504 /8481 variables (removed 7977) and now considering 503/16200 (removed 15697) transitions.
[2021-05-19 15:18:05] [INFO ] Flow matrix only has 502 transitions (discarded 1 similar events)
// Phase 1: matrix 502 rows 504 cols
[2021-05-19 15:18:05] [INFO ] Computed 203 place invariants in 3 ms
[2021-05-19 15:18:05] [INFO ] Implicit Places using invariants in 353 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 401]
Discarding 201 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT only with invariants took 359 ms to find 201 implicit places.
[2021-05-19 15:18:06] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 502 rows 303 cols
[2021-05-19 15:18:06] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-19 15:18:06] [INFO ] Dead Transitions using invariants and state equation in 213 ms returned []
Starting structural reductions, iteration 1 : 303/8481 places, 502/16200 transitions.
Graph (trivial) has 298 edges and 303 vertex of which 199 / 303 are part of one of the 1 SCC in 5 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 7 transition count 108
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 7 transition count 108
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 5 transition count 8
Applied a total of 299 rules in 13 ms. Remains 5 /303 variables (removed 298) and now considering 8/502 (removed 494) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-19 15:18:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:18:06] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-19 15:18:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:18:06] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/8481 places, 8/16200 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100080-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s3 1)), p1:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100080-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-05 finished in 947 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0||G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7821 transitions
Trivial Post-agglo rules discarded 7821 transitions
Performed 7821 trivial Post agglomeration. Transition count delta: 7821
Iterating post reduction 0 with 7821 rules applied. Total rules applied 7821 place count 8481 transition count 8379
Reduce places removed 7821 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 7900 rules applied. Total rules applied 15721 place count 660 transition count 8300
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 2 with 7958 rules applied. Total rules applied 23679 place count 502 transition count 500
Applied a total of 23679 rules in 112 ms. Remains 502 /8481 variables (removed 7979) and now considering 500/16200 (removed 15700) transitions.
// Phase 1: matrix 500 rows 502 cols
[2021-05-19 15:18:06] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-19 15:18:06] [INFO ] Implicit Places using invariants in 311 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 312 ms to find 200 implicit places.
[2021-05-19 15:18:06] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 500 rows 302 cols
[2021-05-19 15:18:06] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-19 15:18:07] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Starting structural reductions, iteration 1 : 302/8481 places, 500/16200 transitions.
Graph (trivial) has 298 edges and 302 vertex of which 199 / 302 are part of one of the 1 SCC in 0 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 6 transition count 106
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 4 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 4 transition count 6
Applied a total of 299 rules in 10 ms. Remains 4 /302 variables (removed 298) and now considering 6/500 (removed 494) transitions.
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 15:18:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:18:07] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 15:18:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:18:07] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/8481 places, 6/16200 transitions.
Stuttering acceptance computed with spot in 607 ms :[false, (NOT p0), true]
Running random walk in product with property : ServersAndClients-PT-100080-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s0 1) (NEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100080-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-06 finished in 1314 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((!p0||X(p0)) U X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2088 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:18:09] [INFO ] Computed 281 place invariants in 94 ms
[2021-05-19 15:18:11] [INFO ] Implicit Places using invariants in 1268 ms returned []
Implicit Place search using SMT only with invariants took 1271 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:18:11] [INFO ] Computed 281 place invariants in 93 ms
[2021-05-19 15:18:12] [INFO ] Dead Transitions using invariants and state equation in 1251 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100080-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (NEQ s239 1) (NEQ s3835 1)), p1:(EQ s5230 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 321 steps with 105 reset in 22 ms.
FORMULA ServersAndClients-PT-100080-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-07 finished in 4751 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0)) U (p1||X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2032 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:18:14] [INFO ] Computed 281 place invariants in 92 ms
[2021-05-19 15:18:15] [INFO ] Implicit Places using invariants in 1236 ms returned []
Implicit Place search using SMT only with invariants took 1236 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:18:15] [INFO ] Computed 281 place invariants in 104 ms
[2021-05-19 15:18:16] [INFO ] Dead Transitions using invariants and state equation in 1238 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s309 1) (EQ s4239 1)), p0:(AND (EQ s207 1) (EQ s5249 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 248 reset in 2524 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-100080-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-11 finished in 7143 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2074 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:18:21] [INFO ] Computed 281 place invariants in 93 ms
[2021-05-19 15:18:22] [INFO ] Implicit Places using invariants in 1240 ms returned []
Implicit Place search using SMT only with invariants took 1241 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:18:23] [INFO ] Computed 281 place invariants in 95 ms
[2021-05-19 15:18:24] [INFO ] Dead Transitions using invariants and state equation in 1252 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1344 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6 reset in 2556 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-100080-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-12 finished in 7198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2263 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:18:29] [INFO ] Computed 281 place invariants in 92 ms
[2021-05-19 15:18:30] [INFO ] Implicit Places using invariants in 1262 ms returned []
Implicit Place search using SMT only with invariants took 1262 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:18:30] [INFO ] Computed 281 place invariants in 93 ms
[2021-05-19 15:18:31] [INFO ] Dead Transitions using invariants and state equation in 1243 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s8181 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5934 steps with 0 reset in 152 ms.
FORMULA ServersAndClients-PT-100080-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-13 finished in 5025 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((!p0||G((p1&&F(G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7820 transitions
Trivial Post-agglo rules discarded 7820 transitions
Performed 7820 trivial Post agglomeration. Transition count delta: 7820
Iterating post reduction 0 with 7820 rules applied. Total rules applied 7820 place count 8481 transition count 8380
Reduce places removed 7820 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 7899 rules applied. Total rules applied 15719 place count 661 transition count 8301
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 7700 transitions
Reduce isomorphic transitions removed 7700 transitions.
Iterating post reduction 2 with 7857 rules applied. Total rules applied 23576 place count 504 transition count 601
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 3 with 98 rules applied. Total rules applied 23674 place count 504 transition count 503
Applied a total of 23674 rules in 122 ms. Remains 504 /8481 variables (removed 7977) and now considering 503/16200 (removed 15697) transitions.
[2021-05-19 15:18:31] [INFO ] Flow matrix only has 502 transitions (discarded 1 similar events)
// Phase 1: matrix 502 rows 504 cols
[2021-05-19 15:18:31] [INFO ] Computed 203 place invariants in 2 ms
[2021-05-19 15:18:32] [INFO ] Implicit Places using invariants in 341 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 502]
Discarding 201 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT only with invariants took 342 ms to find 201 implicit places.
[2021-05-19 15:18:32] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 502 rows 303 cols
[2021-05-19 15:18:32] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-19 15:18:32] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Starting structural reductions, iteration 1 : 303/8481 places, 502/16200 transitions.
Graph (trivial) has 298 edges and 303 vertex of which 199 / 303 are part of one of the 1 SCC in 0 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 7 transition count 108
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 7 transition count 108
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 5 transition count 8
Applied a total of 299 rules in 4 ms. Remains 5 /303 variables (removed 298) and now considering 8/502 (removed 494) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-19 15:18:32] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:18:32] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-19 15:18:32] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:18:32] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/8481 places, 8/16200 transitions.
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : ServersAndClients-PT-100080-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(NEQ s4 1), p0:(OR (NEQ s0 1) (NEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13979 reset in 88 ms.
Stack based approach found an accepted trace after 6 steps with 1 reset with depth 3 and stack size 2 in 0 ms.
FORMULA ServersAndClients-PT-100080-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-14 finished in 831 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7999 transitions
Trivial Post-agglo rules discarded 7999 transitions
Performed 7999 trivial Post agglomeration. Transition count delta: 7999
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8481 transition count 8201
Reduce places removed 8078 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 1 with 15878 rules applied. Total rules applied 23877 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 23976 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 24273 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 24668 place count 7 transition count 6
Applied a total of 24668 rules in 102 ms. Remains 7 /8481 variables (removed 8474) and now considering 6/16200 (removed 16194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 15:18:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-19 15:18:32] [INFO ] Implicit Places using invariants in 8 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 9 ms to find 3 implicit places.
[2021-05-19 15:18:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 15:18:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:18:32] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Starting structural reductions, iteration 1 : 4/8481 places, 6/16200 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
[2021-05-19 15:18:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:18:32] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-19 15:18:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:18:32] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/8481 places, 3/16200 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14219 reset in 84 ms.
Product exploration explored 100000 steps with 14127 reset in 96 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14200 reset in 76 ms.
Product exploration explored 100000 steps with 14304 reset in 91 ms.
[2021-05-19 15:18:33] [INFO ] Flatten gal took : 1 ms
[2021-05-19 15:18:33] [INFO ] Flatten gal took : 0 ms
[2021-05-19 15:18:33] [INFO ] Time to serialize gal into /tmp/LTL548350798505444188.gal : 1 ms
[2021-05-19 15:18:33] [INFO ] Time to serialize properties into /tmp/LTL14367278318981064282.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL548350798505444188.gal, -t, CGAL, -LTL, /tmp/LTL14367278318981064282.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL548350798505444188.gal -t CGAL -LTL /tmp/LTL14367278318981064282.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(sv1_c72==0)"))))
Formula 0 simplified : !GF"(sv1_c72==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.014402,15968,1,0,6,18,24,0,44,10,19
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ServersAndClients-PT-100080-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ServersAndClients-PT-100080-15 finished in 1093 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621437514701

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ServersAndClients-PT-100080"
export BK_EXAMINATION="LTLFireability"
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-100080, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-162132107900141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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