fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r167-tall-167838852800243
Last Updated
May 14, 2023

About the Execution of LoLa+red for FMS-PT-00500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
815.876 26323.00 33634.00 647.80 FTF?FFFFFFFTFFFF normal

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.r167-tall-167838852800243.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 lolaxred
Input is FMS-PT-00500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852800243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.3K Feb 25 20:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 20:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 20:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 20:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-00500-LTLCardinality-00
FORMULA_NAME FMS-PT-00500-LTLCardinality-01
FORMULA_NAME FMS-PT-00500-LTLCardinality-02
FORMULA_NAME FMS-PT-00500-LTLCardinality-03
FORMULA_NAME FMS-PT-00500-LTLCardinality-04
FORMULA_NAME FMS-PT-00500-LTLCardinality-05
FORMULA_NAME FMS-PT-00500-LTLCardinality-06
FORMULA_NAME FMS-PT-00500-LTLCardinality-07
FORMULA_NAME FMS-PT-00500-LTLCardinality-08
FORMULA_NAME FMS-PT-00500-LTLCardinality-09
FORMULA_NAME FMS-PT-00500-LTLCardinality-10
FORMULA_NAME FMS-PT-00500-LTLCardinality-11
FORMULA_NAME FMS-PT-00500-LTLCardinality-12
FORMULA_NAME FMS-PT-00500-LTLCardinality-13
FORMULA_NAME FMS-PT-00500-LTLCardinality-14
FORMULA_NAME FMS-PT-00500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678446795101

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-00500
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 11:13:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 11:13:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 11:13:16] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-10 11:13:16] [INFO ] Transformed 22 places.
[2023-03-10 11:13:16] [INFO ] Transformed 20 transitions.
[2023-03-10 11:13:16] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FMS-PT-00500-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 7 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:13:17] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-10 11:13:17] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-10 11:13:17] [INFO ] Invariant cache hit.
[2023-03-10 11:13:17] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-10 11:13:17] [INFO ] Invariant cache hit.
[2023-03-10 11:13:17] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 20 out of 22 places after structural reductions.
[2023-03-10 11:13:17] [INFO ] Flatten gal took : 15 ms
[2023-03-10 11:13:17] [INFO ] Flatten gal took : 5 ms
[2023-03-10 11:13:17] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10117 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=289 ) properties (out of 28) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :2
Finished Best-First random walk after 6360 steps, including 1 resets, run visited all 5 properties in 17 ms. (steps per millisecond=374 )
FORMULA FMS-PT-00500-LTLCardinality-07 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' '!(X((G(F(p0))&&(p1||F(G(p1))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:18] [INFO ] Invariant cache hit.
[2023-03-10 11:13:18] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 11:13:18] [INFO ] Invariant cache hit.
[2023-03-10 11:13:18] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-10 11:13:18] [INFO ] Invariant cache hit.
[2023-03-10 11:13:18] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : FMS-PT-00500-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s6 s3), p1:(LEQ s14 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3365 reset in 314 ms.
Stack based approach found an accepted trace after 339 steps with 7 reset with depth 54 and stack size 54 in 1 ms.
FORMULA FMS-PT-00500-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00500-LTLCardinality-00 finished in 905 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&&F(p1))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:19] [INFO ] Invariant cache hit.
[2023-03-10 11:13:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 11:13:19] [INFO ] Invariant cache hit.
[2023-03-10 11:13:19] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-10 11:13:19] [INFO ] Invariant cache hit.
[2023-03-10 11:13:19] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-00500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LEQ 3 s4), p0:(LEQ s20 s15)], 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 10 reset in 198 ms.
Stack based approach found an accepted trace after 428 steps with 0 reset with depth 429 and stack size 429 in 1 ms.
FORMULA FMS-PT-00500-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00500-LTLCardinality-02 finished in 552 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(F((p0&&((p1 U X((!p0&&X(p2))))||G(p2))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:19] [INFO ] Invariant cache hit.
[2023-03-10 11:13:19] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-10 11:13:19] [INFO ] Invariant cache hit.
[2023-03-10 11:13:19] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-10 11:13:19] [INFO ] Invariant cache hit.
[2023-03-10 11:13:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : FMS-PT-00500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={0} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(GT 3 s0), p1:(LEQ 2 s6), p2:(LEQ 2 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 409 reset in 163 ms.
Product exploration explored 100000 steps with 427 reset in 271 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 (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 813 ms. Reduced automaton from 9 states, 41 edges and 3 AP (stutter sensitive) to 9 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 2576 steps, including 0 resets, run visited all 13 properties in 2 ms. (steps per millisecond=1288 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 p0 p2)), (F (AND p1 p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 19 factoid took 1036 ms. Reduced automaton from 9 states, 41 edges and 3 AP (stutter sensitive) to 9 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 469 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:23] [INFO ] Invariant cache hit.
[2023-03-10 11:13:23] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 11:13:23] [INFO ] Invariant cache hit.
[2023-03-10 11:13:23] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-10 11:13:23] [INFO ] Invariant cache hit.
[2023-03-10 11:13:23] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 22/22 places, 20/20 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 p0 (NOT p1) p2), (X (AND (NOT p1) p0 p2)), (X p0), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 784 ms. Reduced automaton from 9 states, 41 edges and 3 AP (stutter sensitive) to 9 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10098 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1009 ) properties (out of 13) seen :10
Finished Best-First random walk after 2817 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=256 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p0 p2)), (X p0), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (AND p2 p0 p1)), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) (NOT p0))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p2 p0 (NOT p1)))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 19 factoid took 1021 ms. Reduced automaton from 9 states, 41 edges and 3 AP (stutter sensitive) to 9 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 415 reset in 159 ms.
Product exploration explored 100000 steps with 445 reset in 160 ms.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:27] [INFO ] Invariant cache hit.
[2023-03-10 11:13:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 11:13:27] [INFO ] Invariant cache hit.
[2023-03-10 11:13:27] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-10 11:13:27] [INFO ] Invariant cache hit.
[2023-03-10 11:13:27] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 22/22 places, 20/20 transitions.
Treatment of property FMS-PT-00500-LTLCardinality-03 finished in 7936 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)||G(p1))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 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 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 9 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 2 ms
Free SCC test 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 1 with 10 rules applied. Total rules applied 15 place count 13 transition count 13
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 11 transition count 10
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 21 place count 10 transition count 10
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 25 place count 8 transition count 8
Applied a total of 25 rules in 15 ms. Remains 8 /22 variables (removed 14) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-10 11:13:27] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 11:13:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 11:13:27] [INFO ] Invariant cache hit.
[2023-03-10 11:13:27] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-10 11:13:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:13:27] [INFO ] Invariant cache hit.
[2023-03-10 11:13:27] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 8/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 8/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-00500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s5), p1:(GT s3 s4)], nbAcceptance=2, 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 16 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00500-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLCardinality-04 finished in 132 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(G(p0))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:13:27] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-10 11:13:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 11:13:27] [INFO ] Invariant cache hit.
[2023-03-10 11:13:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-10 11:13:27] [INFO ] Invariant cache hit.
[2023-03-10 11:13:27] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00500-LTLCardinality-05 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s7 s17)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00500-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLCardinality-05 finished in 215 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) U p1)&&F(p2))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:27] [INFO ] Invariant cache hit.
[2023-03-10 11:13:28] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-10 11:13:28] [INFO ] Invariant cache hit.
[2023-03-10 11:13:28] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-10 11:13:28] [INFO ] Invariant cache hit.
[2023-03-10 11:13:28] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : FMS-PT-00500-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s13), p0:(LEQ 2 s0), p2:(OR (GT s6 s4) (LEQ s4 s10))], 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 FMS-PT-00500-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLCardinality-06 finished in 340 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((p0||F(p1))))||G(p2)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:28] [INFO ] Invariant cache hit.
[2023-03-10 11:13:28] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 11:13:28] [INFO ] Invariant cache hit.
[2023-03-10 11:13:28] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-10 11:13:28] [INFO ] Invariant cache hit.
[2023-03-10 11:13:28] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FMS-PT-00500-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(LEQ 2 s19), p0:(LEQ 1 s16), p2:(LEQ 2 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 603 reset in 187 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA FMS-PT-00500-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00500-LTLCardinality-08 finished in 636 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(F((p0&&X(p1))))&&F(p2)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:28] [INFO ] Invariant cache hit.
[2023-03-10 11:13:28] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-10 11:13:28] [INFO ] Invariant cache hit.
[2023-03-10 11:13:29] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-10 11:13:29] [INFO ] Invariant cache hit.
[2023-03-10 11:13:29] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : FMS-PT-00500-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 2 s0), p0:(LEQ 1 s12), p1:(LEQ 2 s4)], nbAcceptance=0, 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 1321 reset in 121 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA FMS-PT-00500-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00500-LTLCardinality-09 finished in 367 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 U p1))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
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 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 7 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 1 ms
Free SCC test 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 1 with 9 rules applied. Total rules applied 13 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 19 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 21 place count 10 transition count 10
Applied a total of 21 rules in 6 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 10 cols
[2023-03-10 11:13:29] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 11:13:29] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:13:29] [INFO ] Invariant cache hit.
[2023-03-10 11:13:29] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-10 11:13:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:13:29] [INFO ] Invariant cache hit.
[2023-03-10 11:13:29] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 10/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 10/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-00500-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s0 s5), p0:(LEQ s1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLCardinality-10 finished in 171 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||G(p1)||G(p2))))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 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 22 transition count 19
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 21 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4 place count 20 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 13 place count 15 transition count 14
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 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 18 place count 12 transition count 12
Applied a total of 18 rules in 4 ms. Remains 12 /22 variables (removed 10) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-03-10 11:13:29] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 11:13:29] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 11:13:29] [INFO ] Invariant cache hit.
[2023-03-10 11:13:29] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-10 11:13:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:13:29] [INFO ] Invariant cache hit.
[2023-03-10 11:13:29] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 12/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 12/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : FMS-PT-00500-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GT s8 s9) (GT s11 s5)), p0:(LEQ 1 s6), p2:(GT 2 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00500-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLCardinality-13 finished in 132 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((!p0||X(p1))) U p2)&&X(p3)))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:13:29] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-10 11:13:29] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-10 11:13:29] [INFO ] Invariant cache hit.
[2023-03-10 11:13:29] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-10 11:13:29] [INFO ] Invariant cache hit.
[2023-03-10 11:13:29] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (AND p0 (NOT p1)), (NOT p2), (NOT p3), true]
Running random walk in product with property : FMS-PT-00500-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 2 s2), p0:(GT 3 s0), p1:(LEQ 2 s17), p3:(GT s19 s14)], 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 1 ms.
FORMULA FMS-PT-00500-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLCardinality-14 finished in 357 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||X(G(p1)))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:29] [INFO ] Invariant cache hit.
[2023-03-10 11:13:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 11:13:29] [INFO ] Invariant cache hit.
[2023-03-10 11:13:30] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-10 11:13:30] [INFO ] Invariant cache hit.
[2023-03-10 11:13:30] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FMS-PT-00500-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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s9 s14), p1:(GT s12 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00500-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLCardinality-15 finished in 240 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(F((p0&&((p1 U X((!p0&&X(p2))))||G(p2))))))'
[2023-03-10 11:13:30] [INFO ] Flatten gal took : 6 ms
[2023-03-10 11:13:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-10 11:13:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 50 arcs took 0 ms.
Total runtime 13783 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FMS-PT-00500
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1678446821424

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 FMS-PT-00500-LTLCardinality-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FMS-PT-00500-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 20/32 FMS-PT-00500-LTLCardinality-03 2960532 m, 592106 m/sec, 7179044 t fired, .

Time elapsed: 5 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for FMS-PT-00500-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FMS-PT-00500-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FMS-PT-00500-LTLCardinality-03: LTL unknown AGGR


Time elapsed: 10 secs. Pages in use: 32

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="FMS-PT-00500"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is FMS-PT-00500, 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 r167-tall-167838852800243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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