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-162132108000196.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-400080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108000196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 63M
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 12 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 12 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 12 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.4K May 11 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 11 17:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 17:33 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 62M 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-400080-00
FORMULA_NAME ServersAndClients-PT-400080-01
FORMULA_NAME ServersAndClients-PT-400080-02
FORMULA_NAME ServersAndClients-PT-400080-03
FORMULA_NAME ServersAndClients-PT-400080-04
FORMULA_NAME ServersAndClients-PT-400080-05
FORMULA_NAME ServersAndClients-PT-400080-06
FORMULA_NAME ServersAndClients-PT-400080-07
FORMULA_NAME ServersAndClients-PT-400080-08
FORMULA_NAME ServersAndClients-PT-400080-09
FORMULA_NAME ServersAndClients-PT-400080-10
FORMULA_NAME ServersAndClients-PT-400080-11
FORMULA_NAME ServersAndClients-PT-400080-12
FORMULA_NAME ServersAndClients-PT-400080-13
FORMULA_NAME ServersAndClients-PT-400080-14
FORMULA_NAME ServersAndClients-PT-400080-15

=== Now, execution of the tool begins

BK_START 1621447743410

Running Version 0
[2021-05-19 18:09:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-19 18:09:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 18:09:06] [INFO ] Load time of PNML (sax parser for PT used): 1678 ms
[2021-05-19 18:09:06] [INFO ] Transformed 33681 places.
[2021-05-19 18:09:06] [INFO ] Transformed 64800 transitions.
[2021-05-19 18:09:06] [INFO ] Found NUPN structural information;
[2021-05-19 18:09:07] [INFO ] Parsed PT model containing 33681 places and 64800 transitions in 1963 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 18:09:07] [INFO ] Initial state test concluded for 1 properties.
FORMULA ServersAndClients-PT-400080-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 33681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 559 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:09:09] [INFO ] Computed 881 place invariants in 1369 ms
[2021-05-19 18:09:14] [INFO ] Implicit Places using invariants in 6535 ms returned []
Implicit Place search using SMT only with invariants took 6560 ms to find 0 implicit places.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:09:15] [INFO ] Computed 881 place invariants in 1135 ms
[2021-05-19 18:09:20] [INFO ] Dead Transitions using invariants and state equation in 5829 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33681/33681 places, 64800/64800 transitions.
[2021-05-19 18:09:22] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-19 18:09:23] [INFO ] Flatten gal took : 2418 ms
FORMULA ServersAndClients-PT-400080-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 18:09:25] [INFO ] Flatten gal took : 2012 ms
[2021-05-19 18:09:29] [INFO ] Input system was already deterministic with 64800 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 12029 ms. (steps per millisecond=8 ) properties (out of 15) seen :5
Running SMT prover for 10 properties.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:09:43] [INFO ] Computed 881 place invariants in 1179 ms
[2021-05-19 18:09:58] [INFO ] [Real]Absence check using 481 positive place invariants in 2070 ms returned sat
[2021-05-19 18:09:59] [INFO ] [Real]Absence check using 481 positive and 400 generalized place invariants in 1210 ms returned sat
[2021-05-19 18:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 18:11:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 33681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 391 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:11:25] [INFO ] Computed 881 place invariants in 1381 ms
[2021-05-19 18:11:29] [INFO ] Implicit Places using invariants in 6248 ms returned []
Implicit Place search using SMT only with invariants took 6258 ms to find 0 implicit places.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:11:30] [INFO ] Computed 881 place invariants in 992 ms
[2021-05-19 18:11:35] [INFO ] Dead Transitions using invariants and state equation in 5343 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400080-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s11881 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 timeout after 91890 steps with 1 reset in 10001 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 5 ms.
FORMULA ServersAndClients-PT-400080-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-01 finished in 22333 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 33681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31999 transitions
Trivial Post-agglo rules discarded 31999 transitions
Performed 31999 trivial Post agglomeration. Transition count delta: 31999
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 33681 transition count 32801
Reduce places removed 32078 places and 0 transitions.
Ensure Unique test removed 31200 transitions
Reduce isomorphic transitions removed 31200 transitions.
Iterating post reduction 1 with 63278 rules applied. Total rules applied 95277 place count 1603 transition count 1601
Drop transitions removed 399 transitions
Redundant transition composition rules discarded 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 95676 place count 1603 transition count 1202
Discarding 399 places :
Implicit places reduction removed 399 places
Drop transitions removed 798 transitions
Trivial Post-agglo rules discarded 798 transitions
Performed 798 trivial Post agglomeration. Transition count delta: 798
Iterating post reduction 2 with 1197 rules applied. Total rules applied 96873 place count 1204 transition count 404
Reduce places removed 1197 places and 0 transitions.
Ensure Unique test removed 398 transitions
Reduce isomorphic transitions removed 398 transitions.
Iterating post reduction 3 with 1595 rules applied. Total rules applied 98468 place count 7 transition count 6
Applied a total of 98468 rules in 1163 ms. Remains 7 /33681 variables (removed 33674) and now considering 6/64800 (removed 64794) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 18:11:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-19 18:11:46] [INFO ] Implicit Places using invariants in 13 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 15 ms to find 3 implicit places.
[2021-05-19 18:11:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 18:11:46] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-19 18:11:46] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 4/33681 places, 6/64800 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 3 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 4 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 18:11:46] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 18:11:46] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-19 18:11:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 18:11:46] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/33681 places, 3/64800 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400080-03 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:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-400080-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-03 finished in 1330 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 33681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 225 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:11:48] [INFO ] Computed 881 place invariants in 1024 ms
[2021-05-19 18:11:52] [INFO ] Implicit Places using invariants in 5450 ms returned []
Implicit Place search using SMT only with invariants took 5453 ms to find 0 implicit places.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:11:53] [INFO ] Computed 881 place invariants in 970 ms
[2021-05-19 18:11:57] [INFO ] Dead Transitions using invariants and state equation in 5230 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ServersAndClients-PT-400080-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s3680 0) (EQ s29567 1)), p0:(AND (EQ s24251 0) (OR (EQ s21162 0) (EQ s33423 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 94040 steps with 0 reset in 10001 ms.
Entered a terminal (fully accepting) state of product in 20146 steps with 0 reset in 2104 ms.
FORMULA ServersAndClients-PT-400080-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-04 finished in 23323 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 33681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31998 transitions
Trivial Post-agglo rules discarded 31998 transitions
Performed 31998 trivial Post agglomeration. Transition count delta: 31998
Iterating post reduction 0 with 31998 rules applied. Total rules applied 31998 place count 33681 transition count 32802
Reduce places removed 32076 places and 0 transitions.
Ensure Unique test removed 30800 transitions
Reduce isomorphic transitions removed 30800 transitions.
Iterating post reduction 1 with 62876 rules applied. Total rules applied 94874 place count 1605 transition count 2002
Drop transitions removed 798 transitions
Redundant transition composition rules discarded 798 transitions
Iterating global reduction 2 with 798 rules applied. Total rules applied 95672 place count 1605 transition count 1204
Discarding 398 places :
Implicit places reduction removed 398 places
Drop transitions removed 796 transitions
Trivial Post-agglo rules discarded 796 transitions
Performed 796 trivial Post agglomeration. Transition count delta: 796
Iterating post reduction 2 with 1194 rules applied. Total rules applied 96866 place count 1207 transition count 408
Reduce places removed 1194 places and 0 transitions.
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Iterating post reduction 3 with 1591 rules applied. Total rules applied 98457 place count 13 transition count 11
Applied a total of 98457 rules in 869 ms. Remains 13 /33681 variables (removed 33668) and now considering 11/64800 (removed 64789) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-19 18:12:11] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-19 18:12:11] [INFO ] Implicit Places using invariants in 27 ms returned [0, 1, 2, 3, 9, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 28 ms to find 6 implicit places.
[2021-05-19 18:12:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 7 cols
[2021-05-19 18:12:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 18:12:11] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 7/33681 places, 11/64800 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 1 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 18:12:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 18:12:11] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-19 18:12:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 18:12:11] [INFO ] Implicit Places using invariants and state equation in 10 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 : 3/33681 places, 5/64800 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400080-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 3 in 0 ms.
FORMULA ServersAndClients-PT-400080-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-07 finished in 1159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X((X((F(p1) U G(p2))) U (p3&&X((F(p1) U G(p2))))))||p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 33681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 217 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:12:12] [INFO ] Computed 881 place invariants in 950 ms
[2021-05-19 18:12:16] [INFO ] Implicit Places using invariants in 5252 ms returned []
Implicit Place search using SMT only with invariants took 5255 ms to find 0 implicit places.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:12:17] [INFO ] Computed 881 place invariants in 1042 ms
[2021-05-19 18:12:22] [INFO ] Dead Transitions using invariants and state equation in 5994 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-400080-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s29716 0) (EQ s33373 1)), p3:(OR (EQ s29716 0) (EQ s33373 1)), p2:(OR (EQ s21059 0) (EQ s4341 1)), p1:(OR (EQ s16300 0) (EQ s14539 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 60550 steps with 7205 reset in 10001 ms.
Product exploration timeout after 38280 steps with 12760 reset in 10004 ms.
Knowledge obtained : [p0, p3, p2, p1]
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p1)]
Product exploration timeout after 44140 steps with 11330 reset in 10013 ms.
Stack based approach found an accepted trace after 17315 steps with 1283 reset with depth 13467 and stack size 4006 in 2611 ms.
FORMULA ServersAndClients-PT-400080-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-10 finished in 44868 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 33681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 279 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:12:57] [INFO ] Computed 881 place invariants in 1058 ms
[2021-05-19 18:13:02] [INFO ] Implicit Places using invariants in 5415 ms returned []
Implicit Place search using SMT only with invariants took 5421 ms to find 0 implicit places.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:13:03] [INFO ] Computed 881 place invariants in 975 ms
[2021-05-19 18:13:07] [INFO ] Dead Transitions using invariants and state equation in 5315 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400080-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 s17934 0)], 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 timeout after 27270 steps with 13635 reset in 10001 ms.
Product exploration timeout after 27100 steps with 13550 reset in 10003 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 27440 steps with 13720 reset in 10002 ms.
Product exploration timeout after 27490 steps with 13745 reset in 10002 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 33681 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Performed 31999 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 33681 transition count 64800
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 32077 place count 33603 transition count 33600
Deduced a syphon composed of 31999 places in 8 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 32155 place count 33603 transition count 33600
Deduced a syphon composed of 31999 places in 13 ms
Applied a total of 32155 rules in 21510 ms. Remains 33603 /33681 variables (removed 78) and now considering 33600/64800 (removed 31200) transitions.
[2021-05-19 18:14:09] [INFO ] Flow matrix only has 33201 transitions (discarded 399 similar events)
// Phase 1: matrix 33201 rows 33603 cols
[2021-05-19 18:14:24] [INFO ] Computed 803 place invariants in 15091 ms
[2021-05-19 18:14:27] [INFO ] Dead Transitions using invariants and state equation in 18061 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33603/33681 places, 33600/64800 transitions.
Product exploration timeout after 5290 steps with 2645 reset in 10019 ms.
Product exploration timeout after 5000 steps with 2500 reset in 10018 ms.
[2021-05-19 18:14:51] [INFO ] Flatten gal took : 2231 ms
[2021-05-19 18:14:53] [INFO ] Flatten gal took : 1866 ms
[2021-05-19 18:14:53] [INFO ] Time to serialize gal into /tmp/LTL8449309765166868971.gal : 414 ms
[2021-05-19 18:14:53] [INFO ] Time to serialize properties into /tmp/LTL16428948715699784921.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/LTL8449309765166868971.gal, -t, CGAL, -LTL, /tmp/LTL16428948715699784921.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/LTL8449309765166868971.gal -t CGAL -LTL /tmp/LTL16428948715699784921.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Detected timeout of ITS tools.
[2021-05-19 18:15:11] [INFO ] Flatten gal took : 1853 ms
[2021-05-19 18:15:11] [INFO ] Applying decomposition
[2021-05-19 18:15:12] [INFO ] Flatten gal took : 1754 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7961555219446785979.txt, -o, /tmp/graph7961555219446785979.bin, -w, /tmp/graph7961555219446785979.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7961555219446785979.bin, -l, -1, -v, -w, /tmp/graph7961555219446785979.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 18:15:17] [INFO ] Decomposing Gal with order
[2021-05-19 18:15:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 18:15:44] [INFO ] Removed a total of 64604 redundant transitions.
[2021-05-19 18:15:45] [INFO ] Flatten gal took : 10951 ms
[2021-05-19 18:15:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 1251 ms.
[2021-05-19 18:15:48] [INFO ] Time to serialize gal into /tmp/LTL14563460437366513830.gal : 330 ms
[2021-05-19 18:15:48] [INFO ] Time to serialize properties into /tmp/LTL13390104506117690442.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/LTL14563460437366513830.gal, -t, CGAL, -LTL, /tmp/LTL13390104506117690442.ltl, -c, -stutter-deadlock], 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/LTL14563460437366513830.gal -t CGAL -LTL /tmp/LTL13390104506117690442.ltl -c -stutter-deadlock
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17399045889022140180
[2021-05-19 18:16:03] [INFO ] Built C files in 647ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17399045889022140180
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17399045889022140180]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17399045889022140180] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17399045889022140180] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ServersAndClients-PT-400080-12 finished in 188705 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((X(p2)&&p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 33681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 295 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:16:06] [INFO ] Computed 881 place invariants in 1273 ms
[2021-05-19 18:16:13] [INFO ] Implicit Places using invariants in 8508 ms returned []
Implicit Place search using SMT only with invariants took 8522 ms to find 0 implicit places.
// Phase 1: matrix 64800 rows 33681 cols
[2021-05-19 18:16:15] [INFO ] Computed 881 place invariants in 1096 ms
[2021-05-19 18:16:19] [INFO ] Dead Transitions using invariants and state equation in 5638 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : ServersAndClients-PT-400080-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s13859 0) (EQ s23262 1)), p1:(AND (EQ s23825 1) (OR (EQ s13859 0) (EQ s23262 1) (AND (EQ s23262 0) (EQ s13859 1)))), p2:(AND (NEQ s32037 0) (NEQ s26537 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 96000 steps with 0 reset in 10001 ms.
Entered a terminal (fully accepting) state of product in 71418 steps with 0 reset in 8040 ms.
FORMULA ServersAndClients-PT-400080-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-13 finished in 32792 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 33681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31999 transitions
Trivial Post-agglo rules discarded 31999 transitions
Performed 31999 trivial Post agglomeration. Transition count delta: 31999
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 33681 transition count 32801
Reduce places removed 32078 places and 0 transitions.
Ensure Unique test removed 31200 transitions
Reduce isomorphic transitions removed 31200 transitions.
Iterating post reduction 1 with 63278 rules applied. Total rules applied 95277 place count 1603 transition count 1601
Drop transitions removed 399 transitions
Redundant transition composition rules discarded 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 95676 place count 1603 transition count 1202
Discarding 399 places :
Implicit places reduction removed 399 places
Drop transitions removed 798 transitions
Trivial Post-agglo rules discarded 798 transitions
Performed 798 trivial Post agglomeration. Transition count delta: 798
Iterating post reduction 2 with 1197 rules applied. Total rules applied 96873 place count 1204 transition count 404
Reduce places removed 1197 places and 0 transitions.
Ensure Unique test removed 398 transitions
Reduce isomorphic transitions removed 398 transitions.
Iterating post reduction 3 with 1595 rules applied. Total rules applied 98468 place count 7 transition count 6
Applied a total of 98468 rules in 763 ms. Remains 7 /33681 variables (removed 33674) and now considering 6/64800 (removed 64794) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 18:16:38] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-19 18:16:38] [INFO ] Implicit Places using invariants in 11 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 11 ms to find 3 implicit places.
[2021-05-19 18:16:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 18:16:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 18:16:38] [INFO ] Dead Transitions using invariants and state equation in 349 ms returned []
Starting structural reductions, iteration 1 : 4/33681 places, 6/64800 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 1 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 18:16:38] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 18:16:38] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-19 18:16:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 18:16:38] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/33681 places, 3/64800 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400080-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 56 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 2 in 1 ms.
FORMULA ServersAndClients-PT-400080-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-14 finished in 1274 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 33681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31999 transitions
Trivial Post-agglo rules discarded 31999 transitions
Performed 31999 trivial Post agglomeration. Transition count delta: 31999
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 33681 transition count 32801
Reduce places removed 32078 places and 0 transitions.
Ensure Unique test removed 31200 transitions
Reduce isomorphic transitions removed 31200 transitions.
Iterating post reduction 1 with 63278 rules applied. Total rules applied 95277 place count 1603 transition count 1601
Drop transitions removed 399 transitions
Redundant transition composition rules discarded 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 95676 place count 1603 transition count 1202
Discarding 399 places :
Implicit places reduction removed 399 places
Drop transitions removed 798 transitions
Trivial Post-agglo rules discarded 798 transitions
Performed 798 trivial Post agglomeration. Transition count delta: 798
Iterating post reduction 2 with 1197 rules applied. Total rules applied 96873 place count 1204 transition count 404
Reduce places removed 1197 places and 0 transitions.
Ensure Unique test removed 398 transitions
Reduce isomorphic transitions removed 398 transitions.
Iterating post reduction 3 with 1595 rules applied. Total rules applied 98468 place count 7 transition count 6
Applied a total of 98468 rules in 747 ms. Remains 7 /33681 variables (removed 33674) and now considering 6/64800 (removed 64794) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 18:16:39] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-19 18:16:39] [INFO ] Implicit Places using invariants in 10 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 10 ms to find 3 implicit places.
[2021-05-19 18:16:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 18:16:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 18:16:39] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 4/33681 places, 6/64800 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 18:16:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 18:16:39] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-19 18:16:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 18:16:39] [INFO ] Implicit Places using invariants and state equation in 7 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 : 2/33681 places, 3/64800 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400080-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:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-400080-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-15 finished in 874 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18131012648357835371
[2021-05-19 18:16:40] [INFO ] Too many transitions (64800) to apply POR reductions. Disabling POR matrices.
[2021-05-19 18:16:41] [INFO ] Built C files in 583ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18131012648357835371
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18131012648357835371]
[2021-05-19 18:16:42] [INFO ] Applying decomposition
[2021-05-19 18:16:45] [INFO ] Flatten gal took : 2264 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17969882617372637186.txt, -o, /tmp/graph17969882617372637186.bin, -w, /tmp/graph17969882617372637186.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17969882617372637186.bin, -l, -1, -v, -w, /tmp/graph17969882617372637186.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 18:16:49] [INFO ] Decomposing Gal with order
[2021-05-19 18:16:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 18:17:18] [INFO ] Removed a total of 64568 redundant transitions.
[2021-05-19 18:17:19] [INFO ] Flatten gal took : 11327 ms
[2021-05-19 18:17:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 436 labels/synchronizations in 844 ms.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18131012648357835371] killed by timeout after 40 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18131012648357835371] killed by timeout after 40 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-19 18:17:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality6369058614030321758.gal : 275 ms
[2021-05-19 18:17:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality7272005428810869393.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/LTLCardinality6369058614030321758.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7272005428810869393.ltl, -c, -stutter-deadlock], 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/LTLCardinality6369058614030321758.gal -t CGAL -LTL /tmp/LTLCardinality7272005428810869393.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(u292.sv40_c292==0)"))))
Formula 0 simplified : !XF"(u292.sv40_c292==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
113008 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,1165.5,2636996,1,0,494057,853297,260784,482697,1598,2.04951e+06,1
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ServersAndClients-PT-400080-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1621449416982

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

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

Sequence of Actions to be Executed by the VM

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

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

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