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.r169-tall-167838855300083.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 Echo-PT-d03r03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855300083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 114K 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 Echo-PT-d03r03-LTLCardinality-00
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-01
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-02
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-03
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-04
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-05
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-06
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-07
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-08
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-09
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-10
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-11
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-12
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-13
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-14
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678476377922

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=Echo-PT-d03r03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 19:26:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 19:26:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 19:26:19] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-10 19:26:19] [INFO ] Transformed 265 places.
[2023-03-10 19:26:19] [INFO ] Transformed 206 transitions.
[2023-03-10 19:26:19] [INFO ] Found NUPN structural information;
[2023-03-10 19:26:19] [INFO ] Parsed PT model containing 265 places and 206 transitions and 1252 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Echo-PT-d03r03-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 206/206 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 244 transition count 206
Applied a total of 21 rules in 27 ms. Remains 244 /265 variables (removed 21) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 244 cols
[2023-03-10 19:26:19] [INFO ] Computed 114 place invariants in 40 ms
[2023-03-10 19:26:20] [INFO ] Implicit Places using invariants in 783 ms returned []
[2023-03-10 19:26:20] [INFO ] Invariant cache hit.
[2023-03-10 19:26:21] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
[2023-03-10 19:26:21] [INFO ] Invariant cache hit.
[2023-03-10 19:26:21] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 244/265 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1633 ms. Remains : 244/265 places, 206/206 transitions.
Support contains 33 out of 244 places after structural reductions.
[2023-03-10 19:26:21] [INFO ] Flatten gal took : 52 ms
[2023-03-10 19:26:21] [INFO ] Flatten gal took : 30 ms
[2023-03-10 19:26:21] [INFO ] Input system was already deterministic with 206 transitions.
Support contains 31 out of 244 places (down from 33) after GAL structural reductions.
Finished random walk after 404 steps, including 7 resets, run visited all 19 properties in 86 ms. (steps per millisecond=4 )
FORMULA Echo-PT-d03r03-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Echo-PT-d03r03-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 244 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 244 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(G(p0))||G(p1))))'
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 238 transition count 206
Applied a total of 6 rules in 12 ms. Remains 238 /244 variables (removed 6) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2023-03-10 19:26:21] [INFO ] Computed 108 place invariants in 33 ms
[2023-03-10 19:26:22] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-10 19:26:22] [INFO ] Invariant cache hit.
[2023-03-10 19:26:23] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
[2023-03-10 19:26:23] [INFO ] Invariant cache hit.
[2023-03-10 19:26:23] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/244 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1461 ms. Remains : 238/244 places, 206/206 transitions.
Stuttering acceptance computed with spot in 332 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (EQ s129 0) (EQ s195 1)), p1:(AND (EQ s195 0) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 459 steps with 8 reset in 10 ms.
FORMULA Echo-PT-d03r03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLCardinality-00 finished in 1863 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((!p0&&X(p1))) U p2))'
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 240 transition count 206
Applied a total of 4 rules in 8 ms. Remains 240 /244 variables (removed 4) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 240 cols
[2023-03-10 19:26:23] [INFO ] Computed 110 place invariants in 17 ms
[2023-03-10 19:26:24] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-10 19:26:24] [INFO ] Invariant cache hit.
[2023-03-10 19:26:24] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2023-03-10 19:26:24] [INFO ] Invariant cache hit.
[2023-03-10 19:26:25] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1273 ms. Remains : 240/244 places, 206/206 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s55 1), p0:(OR (EQ s160 0) (EQ s0 1)), p1:(OR (EQ s237 0) (EQ s14 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 81 steps with 1 reset in 3 ms.
FORMULA Echo-PT-d03r03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLCardinality-07 finished in 1465 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(X(F(p0)))))'
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 238 transition count 206
Applied a total of 6 rules in 7 ms. Remains 238 /244 variables (removed 6) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2023-03-10 19:26:25] [INFO ] Computed 108 place invariants in 25 ms
[2023-03-10 19:26:25] [INFO ] Implicit Places using invariants in 626 ms returned []
[2023-03-10 19:26:25] [INFO ] Invariant cache hit.
[2023-03-10 19:26:26] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2023-03-10 19:26:26] [INFO ] Invariant cache hit.
[2023-03-10 19:26:26] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/244 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1451 ms. Remains : 238/244 places, 206/206 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s24 0) (EQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 521 ms.
Product exploration explored 100000 steps with 25000 reset in 292 ms.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-10 19:26:28] [INFO ] Invariant cache hit.
[2023-03-10 19:26:29] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-10 19:26:29] [INFO ] Invariant cache hit.
[2023-03-10 19:26:29] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
[2023-03-10 19:26:29] [INFO ] Invariant cache hit.
[2023-03-10 19:26:30] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1319 ms. Remains : 238/238 places, 206/206 transitions.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 238 ms.
Product exploration explored 100000 steps with 25000 reset in 264 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 29 ms. Remains 231 /238 variables (removed 7) and now considering 205/206 (removed 1) transitions.
[2023-03-10 19:26:31] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 205 rows 231 cols
[2023-03-10 19:26:31] [INFO ] Computed 102 place invariants in 16 ms
[2023-03-10 19:26:32] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/238 places, 205/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 231/238 places, 205/206 transitions.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2023-03-10 19:26:32] [INFO ] Computed 108 place invariants in 16 ms
[2023-03-10 19:26:32] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-10 19:26:32] [INFO ] Invariant cache hit.
[2023-03-10 19:26:33] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2023-03-10 19:26:33] [INFO ] Invariant cache hit.
[2023-03-10 19:26:33] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1430 ms. Remains : 238/238 places, 206/206 transitions.
Treatment of property Echo-PT-d03r03-LTLCardinality-08 finished in 8451 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(((G(p1)&&X(F(p2)))||p0)))'
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 240 transition count 206
Applied a total of 4 rules in 3 ms. Remains 240 /244 variables (removed 4) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 240 cols
[2023-03-10 19:26:33] [INFO ] Computed 110 place invariants in 21 ms
[2023-03-10 19:26:34] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-10 19:26:34] [INFO ] Invariant cache hit.
[2023-03-10 19:26:34] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2023-03-10 19:26:34] [INFO ] Invariant cache hit.
[2023-03-10 19:26:34] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1213 ms. Remains : 240/244 places, 206/206 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(EQ s168 0), p0:(OR (EQ s189 0) (EQ s114 1)), p2:(OR (EQ s154 0) (EQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Computed a total of 240 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 240 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 10 factoid took 170 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLCardinality-09 finished in 2108 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(G(F((X((X(p1) U p1))&&p0)))))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 238 transition count 206
Applied a total of 6 rules in 7 ms. Remains 238 /244 variables (removed 6) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2023-03-10 19:26:35] [INFO ] Computed 108 place invariants in 17 ms
[2023-03-10 19:26:36] [INFO ] Implicit Places using invariants in 524 ms returned []
[2023-03-10 19:26:36] [INFO ] Invariant cache hit.
[2023-03-10 19:26:36] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
[2023-03-10 19:26:36] [INFO ] Invariant cache hit.
[2023-03-10 19:26:37] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/244 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1384 ms. Remains : 238/244 places, 206/206 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s229 0) (EQ s68 1)) (OR (EQ s138 0) (EQ s218 1))), p1:(OR (EQ s138 0) (EQ s218 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3914 reset in 472 ms.
Product exploration explored 100000 steps with 3904 reset in 539 ms.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 433 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false]
Incomplete random walk after 10000 steps, including 181 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 19:26:39] [INFO ] Invariant cache hit.
[2023-03-10 19:26:39] [INFO ] After 52ms 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 p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 459 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
[2023-03-10 19:26:39] [INFO ] Invariant cache hit.
[2023-03-10 19:26:41] [INFO ] [Real]Absence check using 0 positive and 108 generalized place invariants in 1466 ms returned sat
[2023-03-10 19:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:26:43] [INFO ] [Real]Absence check using state equation in 1552 ms returned sat
[2023-03-10 19:26:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:26:44] [INFO ] [Nat]Absence check using 0 positive and 108 generalized place invariants in 1049 ms returned sat
[2023-03-10 19:26:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:26:45] [INFO ] [Nat]Absence check using state equation in 1248 ms returned sat
[2023-03-10 19:26:45] [INFO ] Computed and/alt/rep : 126/606/126 causal constraints (skipped 79 transitions) in 24 ms.
[2023-03-10 19:26:46] [INFO ] Added : 64 causal constraints over 16 iterations in 978 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-10 19:26:46] [INFO ] Invariant cache hit.
[2023-03-10 19:26:47] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-10 19:26:47] [INFO ] Invariant cache hit.
[2023-03-10 19:26:47] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-03-10 19:26:47] [INFO ] Invariant cache hit.
[2023-03-10 19:26:47] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1346 ms. Remains : 238/238 places, 206/206 transitions.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
Finished random walk after 18 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 342 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
[2023-03-10 19:26:49] [INFO ] Invariant cache hit.
[2023-03-10 19:26:50] [INFO ] [Real]Absence check using 0 positive and 108 generalized place invariants in 1393 ms returned sat
[2023-03-10 19:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:26:52] [INFO ] [Real]Absence check using state equation in 1602 ms returned sat
[2023-03-10 19:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:26:53] [INFO ] [Nat]Absence check using 0 positive and 108 generalized place invariants in 1092 ms returned sat
[2023-03-10 19:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:26:54] [INFO ] [Nat]Absence check using state equation in 1278 ms returned sat
[2023-03-10 19:26:54] [INFO ] Computed and/alt/rep : 126/606/126 causal constraints (skipped 79 transitions) in 14 ms.
[2023-03-10 19:26:55] [INFO ] Added : 64 causal constraints over 16 iterations in 982 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
Product exploration explored 100000 steps with 3679 reset in 559 ms.
Product exploration explored 100000 steps with 3723 reset in 500 ms.
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 11 ms. Remains 237 /238 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 237 cols
[2023-03-10 19:26:57] [INFO ] Computed 108 place invariants in 16 ms
[2023-03-10 19:26:57] [INFO ] Implicit Places using invariants in 422 ms returned [16, 163, 182, 204, 212, 223, 231]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 425 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/238 places, 205/206 transitions.
Applied a total of 0 rules in 11 ms. Remains 230 /230 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 447 ms. Remains : 230/238 places, 205/206 transitions.
Treatment of property Echo-PT-d03r03-LTLCardinality-10 finished in 21786 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)||(p1 U p2))&&(F(p0)||G(p1))))))'
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Graph (complete) has 773 edges and 244 vertex of which 231 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.12 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 19 ms. Remains 230 /244 variables (removed 14) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 230 cols
[2023-03-10 19:26:57] [INFO ] Computed 102 place invariants in 16 ms
[2023-03-10 19:26:58] [INFO ] Implicit Places using invariants in 434 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 437 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/244 places, 204/206 transitions.
Applied a total of 0 rules in 16 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 472 ms. Remains : 224/244 places, 204/206 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s125 1), p1:(OR (EQ s39 0) (EQ s184 1)), p2:(OR (EQ s189 0) (EQ s4 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2057 reset in 442 ms.
Product exploration explored 100000 steps with 2063 reset in 440 ms.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 512 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Finished random walk after 124 steps, including 2 resets, run visited all 4 properties in 5 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 10 factoid took 582 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 8 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
// Phase 1: matrix 204 rows 224 cols
[2023-03-10 19:27:00] [INFO ] Computed 96 place invariants in 16 ms
[2023-03-10 19:27:01] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-10 19:27:01] [INFO ] Invariant cache hit.
[2023-03-10 19:27:01] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2023-03-10 19:27:01] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-10 19:27:01] [INFO ] Invariant cache hit.
[2023-03-10 19:27:01] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1059 ms. Remains : 224/224 places, 204/204 transitions.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 625 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Finished random walk after 446 steps, including 8 resets, run visited all 4 properties in 7 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 10 factoid took 602 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2039 reset in 423 ms.
Product exploration explored 100000 steps with 2058 reset in 441 ms.
Support contains 5 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 8 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-10 19:27:04] [INFO ] Invariant cache hit.
[2023-03-10 19:27:05] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-10 19:27:05] [INFO ] Invariant cache hit.
[2023-03-10 19:27:05] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
[2023-03-10 19:27:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 19:27:05] [INFO ] Invariant cache hit.
[2023-03-10 19:27:05] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1112 ms. Remains : 224/224 places, 204/204 transitions.
Treatment of property Echo-PT-d03r03-LTLCardinality-11 finished in 8323 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(p0)))'
Support contains 1 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Graph (complete) has 773 edges and 244 vertex of which 232 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 11 ms. Remains 231 /244 variables (removed 13) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 231 cols
[2023-03-10 19:27:05] [INFO ] Computed 103 place invariants in 12 ms
[2023-03-10 19:27:06] [INFO ] Implicit Places using invariants in 416 ms returned [16, 182, 204, 212, 217, 225]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 417 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 225/244 places, 204/206 transitions.
Applied a total of 0 rules in 11 ms. Remains 225 /225 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 439 ms. Remains : 225/244 places, 204/206 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r03-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLCardinality-12 finished in 492 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(G(p0)))'
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 239 transition count 206
Applied a total of 5 rules in 2 ms. Remains 239 /244 variables (removed 5) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 239 cols
[2023-03-10 19:27:06] [INFO ] Computed 109 place invariants in 18 ms
[2023-03-10 19:27:06] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-10 19:27:06] [INFO ] Invariant cache hit.
[2023-03-10 19:27:07] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
[2023-03-10 19:27:07] [INFO ] Invariant cache hit.
[2023-03-10 19:27:07] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/244 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1288 ms. Remains : 239/244 places, 206/206 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s149 0) (EQ s7 1) (EQ s90 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLCardinality-15 finished in 1377 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(X(F(p0)))))'
Found a Shortening insensitive property : Echo-PT-d03r03-LTLCardinality-08
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Graph (complete) has 773 edges and 244 vertex of which 231 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.4 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 12 ms. Remains 230 /244 variables (removed 14) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 230 cols
[2023-03-10 19:27:08] [INFO ] Computed 102 place invariants in 18 ms
[2023-03-10 19:27:08] [INFO ] Implicit Places using invariants in 387 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 389 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 224/244 places, 204/206 transitions.
Applied a total of 0 rules in 8 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 409 ms. Remains : 224/244 places, 204/206 transitions.
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s23 0) (EQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24194 reset in 250 ms.
Product exploration explored 100000 steps with 24214 reset in 273 ms.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
// Phase 1: matrix 204 rows 224 cols
[2023-03-10 19:27:09] [INFO ] Computed 96 place invariants in 13 ms
[2023-03-10 19:27:10] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-10 19:27:10] [INFO ] Invariant cache hit.
[2023-03-10 19:27:10] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2023-03-10 19:27:10] [INFO ] Invariant cache hit.
[2023-03-10 19:27:10] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1027 ms. Remains : 224/224 places, 204/204 transitions.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24144 reset in 253 ms.
Product exploration explored 100000 steps with 24155 reset in 270 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 13 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-10 19:27:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 19:27:12] [INFO ] Invariant cache hit.
[2023-03-10 19:27:12] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 224/224 places, 204/204 transitions.
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-10 19:27:12] [INFO ] Invariant cache hit.
[2023-03-10 19:27:13] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-10 19:27:13] [INFO ] Invariant cache hit.
[2023-03-10 19:27:13] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2023-03-10 19:27:13] [INFO ] Invariant cache hit.
[2023-03-10 19:27:13] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 991 ms. Remains : 224/224 places, 204/204 transitions.
Treatment of property Echo-PT-d03r03-LTLCardinality-08 finished in 5871 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(G(F((X((X(p1) U p1))&&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' '!(F(G(((F(p0)||(p1 U p2))&&(F(p0)||G(p1))))))'
[2023-03-10 19:27:13] [INFO ] Flatten gal took : 21 ms
[2023-03-10 19:27:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 19:27:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 206 transitions and 1172 arcs took 5 ms.
Total runtime 54490 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1767/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1767/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1767/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Echo-PT-d03r03-LTLCardinality-08
Could not compute solution for formula : Echo-PT-d03r03-LTLCardinality-10
Could not compute solution for formula : Echo-PT-d03r03-LTLCardinality-11

BK_STOP 1678476435622

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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 Echo-PT-d03r03-LTLCardinality-08
ltl formula formula --ltl=/tmp/1767/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 244 places, 206 transitions and 1172 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.050 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1767/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1767/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1767/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1767/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
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)
ltl formula name Echo-PT-d03r03-LTLCardinality-10
ltl formula formula --ltl=/tmp/1767/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 244 places, 206 transitions and 1172 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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.040 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1767/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1767/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1767/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1767/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
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)
ltl formula name Echo-PT-d03r03-LTLCardinality-11
ltl formula formula --ltl=/tmp/1767/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 244 places, 206 transitions and 1172 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1767/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1767/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1767/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1767/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
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:
malloc_consolidate(): invalid chunk size

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="Echo-PT-d03r03"
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 Echo-PT-d03r03, 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 r169-tall-167838855300083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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