Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r073-smll-167814399400307.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ClientsAndServers-PT-N0050P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399400307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 13:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 13:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 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 ClientsAndServers-PT-N0050P0-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678392444102

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0050P0
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 20:07:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 20:07:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:07:27] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-09 20:07:27] [INFO ] Transformed 25 places.
[2023-03-09 20:07:27] [INFO ] Transformed 18 transitions.
[2023-03-09 20:07:27] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 15 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-09 20:07:27] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-09 20:07:27] [INFO ] Implicit Places using invariants in 170 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 221 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 237 ms. Remains : 23/25 places, 18/18 transitions.
Support contains 17 out of 23 places after structural reductions.
[2023-03-09 20:07:27] [INFO ] Flatten gal took : 23 ms
[2023-03-09 20:07:27] [INFO ] Flatten gal took : 6 ms
[2023-03-09 20:07:27] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10093 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=219 ) properties (out of 24) seen :21
Finished Best-First random walk after 3236 steps, including 0 resets, run visited all 3 properties in 24 ms. (steps per millisecond=134 )
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((F(p1)&&F(G(p2))))||p0))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 17 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 13 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 3 with 2 rules applied. Total rules applied 20 place count 12 transition count 9
Applied a total of 20 rules in 19 ms. Remains 12 /23 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-09 20:07:28] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 20:07:28] [INFO ] Implicit Places using invariants in 47 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/23 places, 9/18 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 8
Applied a total of 2 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-09 20:07:28] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 20:07:28] [INFO ] Implicit Places using invariants in 34 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/23 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 106 ms. Remains : 9/23 places, 8/18 transitions.
Stuttering acceptance computed with spot in 298 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s1), p0:(OR (LEQ 2 s5) (LEQ 1 s7)), p2:(AND (LEQ 1 s1) (LEQ 2 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 12 reset in 342 ms.
Product exploration explored 100000 steps with 12 reset in 275 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10036 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=557 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 9 cols
[2023-03-09 20:07:29] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 20:07:29] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 8 factoid took 423 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-09 20:07:30] [INFO ] Invariant cache hit.
[2023-03-09 20:07:30] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 20:07:30] [INFO ] Invariant cache hit.
[2023-03-09 20:07:30] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-09 20:07:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:07:30] [INFO ] Invariant cache hit.
[2023-03-09 20:07:30] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 9/9 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7 reset in 118 ms.
Product exploration explored 100000 steps with 10 reset in 310 ms.
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 6
Applied a total of 4 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-09 20:07:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 20:07:31] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-09 20:07:31] [INFO ] Invariant cache hit.
[2023-03-09 20:07:31] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-09 20:07:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:07:31] [INFO ] Invariant cache hit.
[2023-03-09 20:07:31] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 6/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 7/9 places, 6/8 transitions.
Treatment of property ClientsAndServers-PT-N0050P0-LTLCardinality-03 finished in 3564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)&&G(p1)))&&(p2 U X(p3))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 20:07:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 20:07:31] [INFO ] Implicit Places using invariants in 37 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p3) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3), (NOT p0), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 1 s15), p2:(LEQ s16 s5), p3:(LEQ 1 s2), p0:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-LTLCardinality-06 finished in 339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||X(F((p0&&F(p1))))) U p1)&&X(G(p2))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 20:07:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 20:07:32] [INFO ] Implicit Places using invariants in 43 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 2 s7), p0:(LEQ s13 s1), p2:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-LTLCardinality-07 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2023-03-09 20:07:32] [INFO ] Invariant cache hit.
[2023-03-09 20:07:32] [INFO ] Implicit Places using invariants in 35 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s19), p1:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 298 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1714 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=857 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 9
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 9 transition count 7
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 3 with 2 rules applied. Total rules applied 24 place count 8 transition count 6
Applied a total of 24 rules in 9 ms. Remains 8 /20 variables (removed 12) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-09 20:07:33] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 20:07:33] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 20:07:33] [INFO ] Invariant cache hit.
[2023-03-09 20:07:34] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-09 20:07:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:07:34] [INFO ] Invariant cache hit.
[2023-03-09 20:07:34] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/20 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 8/20 places, 6/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Finished random walk after 805 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=805 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
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 0 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-09 20:07:34] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 20:07:34] [INFO ] Implicit Places using invariants in 46 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8 places, 4/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 51 ms. Remains : 5/8 places, 4/6 transitions.
Treatment of property ClientsAndServers-PT-N0050P0-LTLCardinality-09 finished in 2518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&(G(p1)||(p2 U p3))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 0 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 20:07:35] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 20:07:35] [INFO ] Implicit Places using invariants in 36 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 3 s7), p3:(LEQ s13 s8), p2:(LEQ s4 s8), p0:(LEQ s8 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30 reset in 164 ms.
Product exploration explored 100000 steps with 7 reset in 206 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 p2 p0), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 16 factoid took 715 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND p3 (NOT p0)), (AND p3 (NOT p0)), (NOT p0)]
Incomplete random walk after 10091 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=1681 ) properties (out of 2) seen :1
Finished Best-First random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) p3 p2 p0), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p3)), (F (NOT p0))]
Knowledge based reduction with 16 factoid took 780 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND p3 (NOT p0)), (AND p3 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(AND p3 (NOT p0)), (AND p3 (NOT p0)), (NOT p0)]
Support contains 3 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 20:07:37] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 20:07:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-09 20:07:37] [INFO ] Invariant cache hit.
[2023-03-09 20:07:37] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-09 20:07:37] [INFO ] Invariant cache hit.
[2023-03-09 20:07:37] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p0), (X p3)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p3 p0), (X p3)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 251 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10 reset in 175 ms.
Product exploration explored 100000 steps with 17 reset in 238 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 16 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 16 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 15 transition count 13
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 22 rules in 10 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2023-03-09 20:07:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2023-03-09 20:07:39] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 20:07:39] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/20 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 15/20 places, 13/18 transitions.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 20:07:39] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 20:07:39] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 20:07:39] [INFO ] Invariant cache hit.
[2023-03-09 20:07:39] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-09 20:07:39] [INFO ] Invariant cache hit.
[2023-03-09 20:07:39] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0050P0-LTLCardinality-10 finished in 4498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 0 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 20:07:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 20:07:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 20:07:39] [INFO ] Invariant cache hit.
[2023-03-09 20:07:39] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-09 20:07:39] [INFO ] Invariant cache hit.
[2023-03-09 20:07:39] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 3 s3), p0:(LEQ 3 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1440 reset in 106 ms.
Stack based approach found an accepted trace after 65010 steps with 979 reset with depth 91 and stack size 91 in 80 ms.
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0050P0-LTLCardinality-12 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p2||X(p2))&&p1)))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 20:07:39] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 20:07:40] [INFO ] Implicit Places using invariants in 37 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ 3 s7), p0:(LEQ 3 s19), p1:(AND (LEQ s20 s2) (LEQ 3 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-LTLCardinality-14 finished in 218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 13
Reduce places removed 5 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 17 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 15 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 15 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 20 place count 12 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 10 transition count 7
Applied a total of 24 rules in 5 ms. Remains 10 /23 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-09 20:07:40] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 20:07:40] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 20:07:40] [INFO ] Invariant cache hit.
[2023-03-09 20:07:40] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-09 20:07:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:07:40] [INFO ] Invariant cache hit.
[2023-03-09 20:07:40] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/23 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 10/23 places, 7/18 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ 3 s8) (LEQ 2 s5)), p0:(LEQ s6 s1)], 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 2013 reset in 105 ms.
Stack based approach found an accepted trace after 839 steps with 19 reset with depth 218 and stack size 216 in 2 ms.
FORMULA ClientsAndServers-PT-N0050P0-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0050P0-LTLCardinality-15 finished in 298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((F(p1)&&F(G(p2))))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&(G(p1)||(p2 U p3))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0050P0-LTLCardinality-10
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p0)]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 19 transition count 12
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 15 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 14 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 13 transition count 11
Applied a total of 17 rules in 4 ms. Remains 13 /23 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-09 20:07:41] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 20:07:41] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 20:07:41] [INFO ] Invariant cache hit.
[2023-03-09 20:07:41] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-09 20:07:41] [INFO ] Invariant cache hit.
[2023-03-09 20:07:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/23 places, 11/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 93 ms. Remains : 13/23 places, 11/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 3 s6), p3:(LEQ s9 s7), p2:(LEQ s3 s7), p0:(LEQ s7 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 103 reset in 117 ms.
Stack based approach found an accepted trace after 910 steps with 9 reset with depth 766 and stack size 766 in 1 ms.
Treatment of property ClientsAndServers-PT-N0050P0-LTLCardinality-10 finished in 575 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-09 20:07:41] [INFO ] Flatten gal took : 4 ms
[2023-03-09 20:07:41] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-09 20:07:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 18 transitions and 48 arcs took 1 ms.
Total runtime 14356 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1285/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1285/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1285/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ClientsAndServers-PT-N0050P0-LTLCardinality-03
Could not compute solution for formula : ClientsAndServers-PT-N0050P0-LTLCardinality-09
Could not compute solution for formula : ClientsAndServers-PT-N0050P0-LTLCardinality-10

BK_STOP 1678392462626

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ClientsAndServers-PT-N0050P0-LTLCardinality-03
ltl formula formula --ltl=/tmp/1285/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 48 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1285/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1285/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1285/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1285/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5647a14e43f4]
1: pnml2lts-mc(+0xa2496) [0x5647a14e4496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f83a66f1140]
3: pnml2lts-mc(+0x405b30) [0x5647a1847b30]
4: pnml2lts-mc(+0x16b3f9) [0x5647a15ad3f9]
5: pnml2lts-mc(+0x164ac4) [0x5647a15a6ac4]
6: pnml2lts-mc(+0x272e0a) [0x5647a16b4e0a]
7: pnml2lts-mc(+0xb61f0) [0x5647a14f81f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f83a65444d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f83a654467a]
10: pnml2lts-mc(+0xa1581) [0x5647a14e3581]
11: pnml2lts-mc(+0xa1910) [0x5647a14e3910]
12: pnml2lts-mc(+0xa32a2) [0x5647a14e52a2]
13: pnml2lts-mc(+0xa50f4) [0x5647a14e70f4]
14: pnml2lts-mc(+0xa516b) [0x5647a14e716b]
15: pnml2lts-mc(+0x3f34b3) [0x5647a18354b3]
16: pnml2lts-mc(+0x7c63d) [0x5647a14be63d]
17: pnml2lts-mc(+0x67d86) [0x5647a14a9d86]
18: pnml2lts-mc(+0x60a8a) [0x5647a14a2a8a]
19: pnml2lts-mc(+0x5eb15) [0x5647a14a0b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f83a652cd0a]
21: pnml2lts-mc(+0x6075e) [0x5647a14a275e]
ltl formula name ClientsAndServers-PT-N0050P0-LTLCardinality-09
ltl formula formula --ltl=/tmp/1285/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 48 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1285/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1285/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1285/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1285/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name ClientsAndServers-PT-N0050P0-LTLCardinality-10
ltl formula formula --ltl=/tmp/1285/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 48 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1285/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1285/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 13 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1285/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1285/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ClientsAndServers-PT-N0050P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ClientsAndServers-PT-N0050P0, 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 r073-smll-167814399400307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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