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.r071-smll-167814397500068.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 CSRepetitions-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397500068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 36K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 175K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 202K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 91K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 381K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 504K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 87K 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 CSRepetitions-PT-04-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678232829279

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-07 23:47:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-07 23:47:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 23:47:12] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-07 23:47:13] [INFO ] Transformed 117 places.
[2023-03-07 23:47:13] [INFO ] Transformed 176 transitions.
[2023-03-07 23:47:13] [INFO ] Parsed PT model containing 117 places and 176 transitions and 624 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CSRepetitions-PT-04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 117 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 23 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2023-03-07 23:47:13] [INFO ] Computed 20 place invariants in 26 ms
[2023-03-07 23:47:13] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-07 23:47:13] [INFO ] Invariant cache hit.
[2023-03-07 23:47:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:47:13] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2023-03-07 23:47:13] [INFO ] Invariant cache hit.
[2023-03-07 23:47:14] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 802 ms. Remains : 117/117 places, 176/176 transitions.
Support contains 117 out of 117 places after structural reductions.
[2023-03-07 23:47:14] [INFO ] Flatten gal took : 102 ms
[2023-03-07 23:47:14] [INFO ] Flatten gal took : 63 ms
[2023-03-07 23:47:14] [INFO ] Input system was already deterministic with 176 transitions.
Finished random walk after 744 steps, including 16 resets, run visited all 19 properties in 318 ms. (steps per millisecond=2 )
Computed a total of 0 stabilizing places and 16 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((X(p1)&&p0))||(X(p2)&&F(!p2)))))'
Support contains 33 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:47:15] [INFO ] Invariant cache hit.
[2023-03-07 23:47:16] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-07 23:47:16] [INFO ] Invariant cache hit.
[2023-03-07 23:47:16] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:47:16] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2023-03-07 23:47:16] [INFO ] Invariant cache hit.
[2023-03-07 23:47:16] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 796 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 677 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), p2, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (OR (LT s95 1) (LT s115 1)) (OR (LT s34 1) (LT s115 1)) (OR (LT s5 1) (LT s115 1)) (OR (LT s54 1) (LT s115 1)) (OR (LT s11 1) (LT s115 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8361 reset in 799 ms.
Stack based approach found an accepted trace after 8050 steps with 676 reset with depth 6 and stack size 6 in 38 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-00 finished in 2433 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)))'
Support contains 80 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:47:18] [INFO ] Invariant cache hit.
[2023-03-07 23:47:18] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-07 23:47:18] [INFO ] Invariant cache hit.
[2023-03-07 23:47:18] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:47:18] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-07 23:47:18] [INFO ] Invariant cache hit.
[2023-03-07 23:47:18] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s18 1) (GEQ s62 1)) (AND (GEQ s17 1) (GEQ s50 1)) (AND (GEQ s34 1) (GEQ s81 1)) (AND (GEQ s13 1) (GEQ s61 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][false, false]]
Stuttering criterion allowed to conclude after 18091 steps with 1666 reset in 182 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-01 finished in 779 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)||X(X(F(p1))))))'
Support contains 32 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:47:18] [INFO ] Invariant cache hit.
[2023-03-07 23:47:19] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-07 23:47:19] [INFO ] Invariant cache hit.
[2023-03-07 23:47:19] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:47:19] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-07 23:47:19] [INFO ] Invariant cache hit.
[2023-03-07 23:47:19] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 680 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (GEQ s0 1) (GEQ s32 1) (GEQ s100 1) (GEQ s68 1) (GEQ s106 1) (GEQ s107 1) (GEQ s75 1) (GEQ s74 1) (GEQ s14 1) (GEQ s46 1) (GEQ s109 1) (GEQ s80 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14635 reset in 430 ms.
Product exploration explored 100000 steps with 14588 reset in 422 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 26 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 288 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 32 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:47:22] [INFO ] Invariant cache hit.
[2023-03-07 23:47:22] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-07 23:47:22] [INFO ] Invariant cache hit.
[2023-03-07 23:47:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:47:22] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-07 23:47:22] [INFO ] Invariant cache hit.
[2023-03-07 23:47:22] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 749 ms. Remains : 117/117 places, 176/176 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 50 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 228 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14599 reset in 446 ms.
Product exploration explored 100000 steps with 14634 reset in 594 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 32 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:47:25] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-07 23:47:25] [INFO ] Invariant cache hit.
[2023-03-07 23:47:26] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 303 ms. Remains : 117/117 places, 176/176 transitions.
Support contains 32 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:47:26] [INFO ] Invariant cache hit.
[2023-03-07 23:47:26] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-07 23:47:26] [INFO ] Invariant cache hit.
[2023-03-07 23:47:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:47:26] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2023-03-07 23:47:26] [INFO ] Invariant cache hit.
[2023-03-07 23:47:26] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 748 ms. Remains : 117/117 places, 176/176 transitions.
Treatment of property CSRepetitions-PT-04-LTLFireability-02 finished in 8163 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(((!p1||X(G(!p1)))&&p0))))'
Support contains 80 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:47:27] [INFO ] Invariant cache hit.
[2023-03-07 23:47:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-07 23:47:27] [INFO ] Invariant cache hit.
[2023-03-07 23:47:27] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:47:27] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-07 23:47:27] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-07 23:47:27] [INFO ] Invariant cache hit.
[2023-03-07 23:47:27] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 489 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s18 1) (GEQ s62 1)) (AND (GEQ s17 1) (GEQ s50 1)) (AND (GEQ s34 1) (GEQ s81 1)) (AND (GEQ s13 1) (GEQ s61 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1833 reset in 1974 ms.
Stack based approach found an accepted trace after 3502 steps with 61 reset with depth 10 and stack size 10 in 58 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-03 finished in 2664 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))))'
Support contains 80 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:47:29] [INFO ] Invariant cache hit.
[2023-03-07 23:47:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-07 23:47:29] [INFO ] Invariant cache hit.
[2023-03-07 23:47:29] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:47:29] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-07 23:47:29] [INFO ] Invariant cache hit.
[2023-03-07 23:47:30] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 122 ms :[p0, p0, p0]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s18 1) (GEQ s62 1)) (AND (GEQ s17 1) (GEQ s50 1)) (AND (GEQ s34 1) (GEQ s81 1)) (AND (GEQ s13 1) (GEQ s61 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 532 ms.
Product exploration explored 100000 steps with 33333 reset in 461 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-04-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-04-LTLFireability-04 finished in 1564 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(X((X((!(p1 U p2)||!p1))&&p0)))))'
Support contains 32 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:47:31] [INFO ] Invariant cache hit.
[2023-03-07 23:47:31] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-07 23:47:31] [INFO ] Invariant cache hit.
[2023-03-07 23:47:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:47:31] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-07 23:47:31] [INFO ] Invariant cache hit.
[2023-03-07 23:47:31] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 617 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 314 ms :[true, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) p2), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-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: 2}], [{ cond=(OR (NOT p0) (AND p1 p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(AND (LT s64 1) (LT s99 1) (LT s98 1) (LT s3 1) (LT s39 1) (LT s8 1) (LT s15 1) (LT s114 1) (LT s113 1) (LT s53 1) (LT s52 1) (LT s116 1) (LT s57 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-05 finished in 961 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) U (X(G(X(p0)))||X(p0))))'
Support contains 20 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:47:32] [INFO ] Invariant cache hit.
[2023-03-07 23:47:32] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-07 23:47:32] [INFO ] Invariant cache hit.
[2023-03-07 23:47:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:47:32] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-07 23:47:32] [INFO ] Invariant cache hit.
[2023-03-07 23:47:32] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 690 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-06 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 p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s74 1) (GEQ s97 1)) (AND (GEQ s9 1) (GEQ s74 1)) (AND (GEQ s9 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s25 1)) (AND (GEQ s9 1) (GEQ s80 1)) (...], 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 CSRepetitions-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-06 finished in 882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 87 transition count 161
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 101 place count 31 transition count 105
Iterating global reduction 0 with 56 rules applied. Total rules applied 157 place count 31 transition count 105
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 167 place count 21 transition count 55
Iterating global reduction 0 with 10 rules applied. Total rules applied 177 place count 21 transition count 55
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 187 place count 21 transition count 45
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 195 place count 17 transition count 41
Applied a total of 195 rules in 42 ms. Remains 17 /117 variables (removed 100) and now considering 41/176 (removed 135) transitions.
[2023-03-07 23:47:33] [INFO ] Flow matrix only has 26 transitions (discarded 15 similar events)
// Phase 1: matrix 26 rows 17 cols
[2023-03-07 23:47:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-07 23:47:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-07 23:47:33] [INFO ] Flow matrix only has 26 transitions (discarded 15 similar events)
[2023-03-07 23:47:33] [INFO ] Invariant cache hit.
[2023-03-07 23:47:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-07 23:47:33] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-07 23:47:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 23:47:33] [INFO ] Flow matrix only has 26 transitions (discarded 15 similar events)
[2023-03-07 23:47:33] [INFO ] Invariant cache hit.
[2023-03-07 23:47:33] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/117 places, 41/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 17/117 places, 41/176 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s12 1), p0:(AND (GEQ s4 1) (GEQ s16 1))], 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 74 steps with 5 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-09 finished in 347 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(F(p1)))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 85 transition count 160
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 108 place count 25 transition count 100
Iterating global reduction 0 with 60 rules applied. Total rules applied 168 place count 25 transition count 100
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 179 place count 14 transition count 45
Iterating global reduction 0 with 11 rules applied. Total rules applied 190 place count 14 transition count 45
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 201 place count 14 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 207 place count 10 transition count 32
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 8 edges and 10 vertex of which 5 / 10 are part of one of the 1 SCC in 4 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 213 place count 6 transition count 27
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 229 place count 6 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 6 transition count 10
Applied a total of 230 rules in 35 ms. Remains 6 /117 variables (removed 111) and now considering 10/176 (removed 166) transitions.
// Phase 1: matrix 10 rows 6 cols
[2023-03-07 23:47:33] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 23:47:33] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-07 23:47:33] [INFO ] Invariant cache hit.
[2023-03-07 23:47:33] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-07 23:47:33] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-07 23:47:33] [INFO ] Invariant cache hit.
[2023-03-07 23:47:33] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/117 places, 10/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 6/117 places, 10/176 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s4 1)), p1:(AND (GEQ s1 1) (GEQ s4 1))], 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 61 steps with 4 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-10 finished in 305 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((F((p1 U (p2||G(p1))))&&p0)))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2023-03-07 23:47:33] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-07 23:47:33] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-07 23:47:33] [INFO ] Invariant cache hit.
[2023-03-07 23:47:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:47:34] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-07 23:47:34] [INFO ] Invariant cache hit.
[2023-03-07 23:47:34] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 629 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s95 1) (GEQ s115 1)), p2:(AND (NOT (AND (GEQ s34 1) (GEQ s84 1))) (LT s98 1)), p1:(LT s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 141 steps with 5 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-12 finished in 895 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))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 87 transition count 161
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 101 place count 31 transition count 105
Iterating global reduction 0 with 56 rules applied. Total rules applied 157 place count 31 transition count 105
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 168 place count 20 transition count 50
Iterating global reduction 0 with 11 rules applied. Total rules applied 179 place count 20 transition count 50
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 190 place count 20 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 198 place count 16 transition count 35
Applied a total of 198 rules in 20 ms. Remains 16 /117 variables (removed 101) and now considering 35/176 (removed 141) transitions.
[2023-03-07 23:47:34] [INFO ] Flow matrix only has 23 transitions (discarded 12 similar events)
// Phase 1: matrix 23 rows 16 cols
[2023-03-07 23:47:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-07 23:47:34] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-07 23:47:34] [INFO ] Flow matrix only has 23 transitions (discarded 12 similar events)
[2023-03-07 23:47:34] [INFO ] Invariant cache hit.
[2023-03-07 23:47:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-07 23:47:34] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-07 23:47:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 23:47:34] [INFO ] Flow matrix only has 23 transitions (discarded 12 similar events)
[2023-03-07 23:47:34] [INFO ] Invariant cache hit.
[2023-03-07 23:47:34] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/117 places, 35/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 16/117 places, 35/176 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-13 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 87 transition count 161
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 101 place count 31 transition count 105
Iterating global reduction 0 with 56 rules applied. Total rules applied 157 place count 31 transition count 105
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 169 place count 19 transition count 45
Iterating global reduction 0 with 12 rules applied. Total rules applied 181 place count 19 transition count 45
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 193 place count 19 transition count 33
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 201 place count 15 transition count 29
Applied a total of 201 rules in 19 ms. Remains 15 /117 variables (removed 102) and now considering 29/176 (removed 147) transitions.
[2023-03-07 23:47:35] [INFO ] Flow matrix only has 20 transitions (discarded 9 similar events)
// Phase 1: matrix 20 rows 15 cols
[2023-03-07 23:47:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-07 23:47:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-07 23:47:35] [INFO ] Flow matrix only has 20 transitions (discarded 9 similar events)
[2023-03-07 23:47:35] [INFO ] Invariant cache hit.
[2023-03-07 23:47:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-07 23:47:35] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-07 23:47:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 23:47:35] [INFO ] Flow matrix only has 20 transitions (discarded 9 similar events)
[2023-03-07 23:47:35] [INFO ] Invariant cache hit.
[2023-03-07 23:47:35] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/117 places, 29/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 15/117 places, 29/176 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5069 reset in 352 ms.
Stack based approach found an accepted trace after 390 steps with 20 reset with depth 11 and stack size 9 in 3 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-14 finished in 640 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(!p0)||G(p1))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2023-03-07 23:47:35] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-07 23:47:35] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-07 23:47:35] [INFO ] Invariant cache hit.
[2023-03-07 23:47:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:47:35] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-07 23:47:35] [INFO ] Invariant cache hit.
[2023-03-07 23:47:36] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), p0, (AND p0 (NOT p1)), (NOT p0), true]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s15 1), p1:(AND (GEQ s102 1) (GEQ s108 1))], 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 93 steps with 9 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-15 finished in 817 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)||X(X(F(p1))))))'
[2023-03-07 23:47:36] [INFO ] Flatten gal took : 31 ms
[2023-03-07 23:47:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2023-03-07 23:47:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 176 transitions and 624 arcs took 5 ms.
Total runtime 24028 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CSRepetitions-PT-04
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
LTLFireability

BK_STOP 1678232878163

--------------------
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 LTLFireability -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/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 CSRepetitions-PT-04-LTLFireability-02
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
CSRepetitions-PT-04-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 8/32 CSRepetitions-PT-04-LTLFireability-02 1132177 m, 226435 m/sec, 2001017 t fired, .

Time elapsed: 5 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CSRepetitions-PT-04-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 17/32 CSRepetitions-PT-04-LTLFireability-02 2368029 m, 247170 m/sec, 4178830 t fired, .

Time elapsed: 10 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CSRepetitions-PT-04-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 25/32 CSRepetitions-PT-04-LTLFireability-02 3603302 m, 247054 m/sec, 6392099 t fired, .

Time elapsed: 15 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for CSRepetitions-PT-04-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CSRepetitions-PT-04-LTLFireability-02: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 20 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
CSRepetitions-PT-04-LTLFireability-02: LTL unknown AGGR


Time elapsed: 20 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="CSRepetitions-PT-04"
export BK_EXAMINATION="LTLFireability"
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 CSRepetitions-PT-04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397500068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-04.tgz
mv CSRepetitions-PT-04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;