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

About the Execution of LoLa+red for CircularTrains-PT-024

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
359.852 41879.00 59005.00 1031.50 TFTFTFFTFTFFTFFF 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.r071-smll-167814397600156.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 CircularTrains-PT-024, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397600156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.5K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 04:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 19K 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 CircularTrains-PT-024-LTLFireability-00
FORMULA_NAME CircularTrains-PT-024-LTLFireability-01
FORMULA_NAME CircularTrains-PT-024-LTLFireability-02
FORMULA_NAME CircularTrains-PT-024-LTLFireability-03
FORMULA_NAME CircularTrains-PT-024-LTLFireability-04
FORMULA_NAME CircularTrains-PT-024-LTLFireability-05
FORMULA_NAME CircularTrains-PT-024-LTLFireability-06
FORMULA_NAME CircularTrains-PT-024-LTLFireability-07
FORMULA_NAME CircularTrains-PT-024-LTLFireability-08
FORMULA_NAME CircularTrains-PT-024-LTLFireability-09
FORMULA_NAME CircularTrains-PT-024-LTLFireability-10
FORMULA_NAME CircularTrains-PT-024-LTLFireability-11
FORMULA_NAME CircularTrains-PT-024-LTLFireability-12
FORMULA_NAME CircularTrains-PT-024-LTLFireability-13
FORMULA_NAME CircularTrains-PT-024-LTLFireability-14
FORMULA_NAME CircularTrains-PT-024-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678249375866

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=CircularTrains-PT-024
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:22:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 04:22:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:22:59] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-08 04:22:59] [INFO ] Transformed 48 places.
[2023-03-08 04:22:59] [INFO ] Transformed 24 transitions.
[2023-03-08 04:22:59] [INFO ] Parsed PT model containing 48 places and 24 transitions and 96 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CircularTrains-PT-024-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 21 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2023-03-08 04:23:00] [INFO ] Computed 25 place invariants in 10 ms
[2023-03-08 04:23:00] [INFO ] Implicit Places using invariants in 284 ms returned [6, 10, 30, 46]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 341 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 364 ms. Remains : 44/48 places, 24/24 transitions.
Support contains 28 out of 44 places after structural reductions.
[2023-03-08 04:23:00] [INFO ] Flatten gal took : 34 ms
[2023-03-08 04:23:00] [INFO ] Flatten gal took : 13 ms
[2023-03-08 04:23:00] [INFO ] Input system was already deterministic with 24 transitions.
Finished random walk after 31 steps, including 0 resets, run visited all 16 properties in 20 ms. (steps per millisecond=1 )
FORMULA CircularTrains-PT-024-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CircularTrains-PT-024-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))||X(p2)))'
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 44 cols
[2023-03-08 04:23:01] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-08 04:23:01] [INFO ] Implicit Places using invariants in 102 ms returned [36, 38, 43]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 103 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/44 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 41/44 places, 24/24 transitions.
Stuttering acceptance computed with spot in 445 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s7 1) (GEQ s28 1)), p1:(AND (GEQ s4 1) (GEQ s38 1)), p2:(AND (GEQ s22 1) (GEQ s30 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CircularTrains-PT-024-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-01 finished in 652 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||G(p1)))))'
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-08 04:23:01] [INFO ] Invariant cache hit.
[2023-03-08 04:23:01] [INFO ] Implicit Places using invariants in 140 ms returned [4, 36, 43]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 143 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/44 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 41/44 places, 24/24 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s26 1) (GEQ s36 1)), p0:(AND (GEQ s2 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5820 reset in 644 ms.
Product exploration explored 100000 steps with 5757 reset in 309 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 222 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 29 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 24 rows 41 cols
[2023-03-08 04:23:03] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-08 04:23:03] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-08 04:23:03] [INFO ] [Real]Absence check using 14 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 04:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:23:03] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 04:23:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:23:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-08 04:23:04] [INFO ] [Nat]Absence check using 14 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 04:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:23:04] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-08 04:23:04] [INFO ] Computed and/alt/rep : 16/24/16 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 04:23:04] [INFO ] Added : 13 causal constraints over 3 iterations in 54 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-08 04:23:04] [INFO ] Invariant cache hit.
[2023-03-08 04:23:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 04:23:04] [INFO ] Invariant cache hit.
[2023-03-08 04:23:04] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-08 04:23:04] [INFO ] Invariant cache hit.
[2023-03-08 04:23:04] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 41/41 places, 24/24 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 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 441 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 372 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 04:23:05] [INFO ] Invariant cache hit.
[2023-03-08 04:23:05] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-08 04:23:05] [INFO ] [Real]Absence check using 14 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 04:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:23:05] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-08 04:23:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:23:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-08 04:23:05] [INFO ] [Nat]Absence check using 14 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 04:23:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:23:05] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-08 04:23:05] [INFO ] Computed and/alt/rep : 16/24/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 04:23:05] [INFO ] Added : 13 causal constraints over 3 iterations in 42 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5748 reset in 411 ms.
Product exploration explored 100000 steps with 5800 reset in 424 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 24/24 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 41 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 41 transition count 24
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 41 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 41 transition count 24
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 12 ms. Remains 41 /41 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-08 04:23:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 41 cols
[2023-03-08 04:23:07] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-08 04:23:07] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/41 places, 24/24 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 41/41 places, 24/24 transitions.
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 41 cols
[2023-03-08 04:23:07] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-08 04:23:07] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 04:23:07] [INFO ] Invariant cache hit.
[2023-03-08 04:23:07] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-08 04:23:07] [INFO ] Invariant cache hit.
[2023-03-08 04:23:07] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 41/41 places, 24/24 transitions.
Treatment of property CircularTrains-PT-024-LTLFireability-04 finished in 5559 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 G(p1))))'
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 44 cols
[2023-03-08 04:23:07] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-08 04:23:07] [INFO ] Implicit Places using invariants in 83 ms returned [4, 36, 38, 43]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/44 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 40/44 places, 24/24 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p1), true, (AND p1 p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, 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}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s15 1) (GEQ s30 1)), p0:(OR (AND (GEQ s15 1) (GEQ s30 1)) (AND (GEQ s21 1) (GEQ s29 1)))], 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]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-024-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-06 finished in 344 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)||X(p1))))'
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-08 04:23:07] [INFO ] Invariant cache hit.
[2023-03-08 04:23:07] [INFO ] Implicit Places using invariants in 74 ms returned [4, 36, 38, 43]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 75 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/44 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 40/44 places, 24/24 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 : CircularTrains-PT-024-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, 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:(AND (GEQ s7 1) (GEQ s20 1)), p1:(OR (AND (GEQ s3 1) (GEQ s28 1) (GEQ s7 1) (GEQ s20 1)) (AND (GEQ s3 1) (GEQ s28 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 20495 reset in 364 ms.
Product exploration explored 100000 steps with 20421 reset in 418 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 311 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 494 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 40 cols
[2023-03-08 04:23:09] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-08 04:23:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 04:23:09] [INFO ] Invariant cache hit.
[2023-03-08 04:23:10] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-08 04:23:10] [INFO ] Invariant cache hit.
[2023-03-08 04:23:10] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 40/40 places, 24/24 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 (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 291 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 367 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20436 reset in 265 ms.
Product exploration explored 100000 steps with 20543 reset in 306 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 24/24 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 40 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 6 place count 40 transition count 24
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 40 transition count 24
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 9 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-08 04:23:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 40 cols
[2023-03-08 04:23:12] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-08 04:23:12] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/40 places, 24/24 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 40/40 places, 24/24 transitions.
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 40 cols
[2023-03-08 04:23:12] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-08 04:23:12] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 04:23:12] [INFO ] Invariant cache hit.
[2023-03-08 04:23:12] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-08 04:23:12] [INFO ] Invariant cache hit.
[2023-03-08 04:23:12] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 40/40 places, 24/24 transitions.
Treatment of property CircularTrains-PT-024-LTLFireability-07 finished in 4644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 44 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 40 transition count 20
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 0 with 8 rules applied. Total rules applied 16 place count 36 transition count 16
Applied a total of 16 rules in 9 ms. Remains 36 /44 variables (removed 8) and now considering 16/24 (removed 8) transitions.
// Phase 1: matrix 16 rows 36 cols
[2023-03-08 04:23:12] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-08 04:23:12] [INFO ] Implicit Places using invariants in 66 ms returned [3, 31, 33, 35]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 67 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/44 places, 16/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 32/44 places, 16/24 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 351 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 1 ms.
FORMULA CircularTrains-PT-024-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-08 finished in 506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G((X((F(!p0)||p2))||p1))))))'
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 44 cols
[2023-03-08 04:23:12] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-08 04:23:12] [INFO ] Implicit Places using invariants in 86 ms returned [4, 36, 43]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 88 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/44 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 41/44 places, 24/24 transitions.
Stuttering acceptance computed with spot in 285 ms :[false, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(AND (GEQ s26 1) (GEQ s36 1)), p1:(OR (LT s25 1) (LT s39 1)), p2:(OR (LT s26 1) (LT s36 1))], 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 9506 reset in 159 ms.
Product exploration explored 100000 steps with 9708 reset in 389 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 2 factoid took 323 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[false, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false]
Finished random walk after 30 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 688 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[false, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 276 ms :[false, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false]
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 41 cols
[2023-03-08 04:23:15] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-08 04:23:15] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 04:23:15] [INFO ] Invariant cache hit.
[2023-03-08 04:23:15] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-08 04:23:15] [INFO ] Invariant cache hit.
[2023-03-08 04:23:15] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 41/41 places, 24/24 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 (NOT p0) (NOT p1) p2), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 2 factoid took 305 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[false, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false]
Finished random walk after 4 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 642 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[false, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 271 ms :[false, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 271 ms :[false, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 9577 reset in 254 ms.
Product exploration explored 100000 steps with 9805 reset in 282 ms.
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-08 04:23:18] [INFO ] Invariant cache hit.
[2023-03-08 04:23:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 04:23:18] [INFO ] Invariant cache hit.
[2023-03-08 04:23:18] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-08 04:23:18] [INFO ] Invariant cache hit.
[2023-03-08 04:23:18] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 41/41 places, 24/24 transitions.
Treatment of property CircularTrains-PT-024-LTLFireability-09 finished in 5896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(F(p1))))'
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 44 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 41 transition count 21
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 0 with 4 rules applied. Total rules applied 10 place count 39 transition count 19
Applied a total of 10 rules in 12 ms. Remains 39 /44 variables (removed 5) and now considering 19/24 (removed 5) transitions.
// Phase 1: matrix 19 rows 39 cols
[2023-03-08 04:23:18] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-08 04:23:18] [INFO ] Implicit Places using invariants in 64 ms returned [3, 34, 36]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/44 places, 19/24 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 36 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 18
Applied a total of 2 rules in 4 ms. Remains 35 /36 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 35 cols
[2023-03-08 04:23:18] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-08 04:23:18] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 04:23:18] [INFO ] Invariant cache hit.
[2023-03-08 04:23:19] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/44 places, 18/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 246 ms. Remains : 35/44 places, 18/24 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s34 1)), p0:(OR (NOT (AND (GEQ s12 1) (GEQ s30 1))) (AND (GEQ s11 1) (GEQ s21 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14121 reset in 273 ms.
Product exploration explored 100000 steps with 14224 reset in 301 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 573 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 3 factoid took 469 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-08 04:23:21] [INFO ] Invariant cache hit.
[2023-03-08 04:23:21] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-08 04:23:21] [INFO ] [Real]Absence check using 15 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 04:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:23:21] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 04:23:21] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:23:21] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 04:23:21] [INFO ] Invariant cache hit.
[2023-03-08 04:23:21] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 04:23:21] [INFO ] Invariant cache hit.
[2023-03-08 04:23:21] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-08 04:23:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:23:21] [INFO ] Invariant cache hit.
[2023-03-08 04:23:21] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 35/35 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 468 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 3 factoid took 554 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-08 04:23:22] [INFO ] Invariant cache hit.
[2023-03-08 04:23:23] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-08 04:23:23] [INFO ] [Real]Absence check using 15 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 04:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:23:23] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 04:23:23] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 04:23:23] [INFO ] Added : 7 causal constraints over 2 iterations in 24 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 14247 reset in 266 ms.
Product exploration explored 100000 steps with 14271 reset in 288 ms.
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 04:23:23] [INFO ] Invariant cache hit.
[2023-03-08 04:23:23] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 04:23:23] [INFO ] Invariant cache hit.
[2023-03-08 04:23:23] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-08 04:23:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:23:23] [INFO ] Invariant cache hit.
[2023-03-08 04:23:23] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 35/35 places, 18/18 transitions.
Treatment of property CircularTrains-PT-024-LTLFireability-12 finished in 5175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0))&&F(((X(!p1)&&G(!p2))||G(!p1))))))'
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 44 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 22
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 39 transition count 19
Applied a total of 10 rules in 4 ms. Remains 39 /44 variables (removed 5) and now considering 19/24 (removed 5) transitions.
// Phase 1: matrix 19 rows 39 cols
[2023-03-08 04:23:23] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-08 04:23:24] [INFO ] Implicit Places using invariants in 50 ms returned [34, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/44 places, 19/24 transitions.
Applied a total of 0 rules in 8 ms. Remains 37 /37 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 37/44 places, 19/24 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR p1 p0), p0, p1, p1, (AND p2 p1)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={1} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p1 p2), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={1} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s32 1)), p1:(AND (GEQ s2 1) (GEQ s14 1)), p0:(AND (GEQ s4 1) (GEQ s34 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 211 ms.
Stack based approach found an accepted trace after 199 steps with 1 reset with depth 196 and stack size 196 in 1 ms.
FORMULA CircularTrains-PT-024-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-15 finished in 488 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||G(p1)))))'
Found a Shortening insensitive property : CircularTrains-PT-024-LTLFireability-04
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 44 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 41 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 38 transition count 18
Applied a total of 12 rules in 9 ms. Remains 38 /44 variables (removed 6) and now considering 18/24 (removed 6) transitions.
// Phase 1: matrix 18 rows 38 cols
[2023-03-08 04:23:24] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-08 04:23:24] [INFO ] Implicit Places using invariants in 83 ms returned [3, 32, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 86 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 35/44 places, 18/24 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 35 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 34 transition count 17
Applied a total of 2 rules in 4 ms. Remains 34 /35 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 34 cols
[2023-03-08 04:23:24] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-08 04:23:24] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 04:23:24] [INFO ] Invariant cache hit.
[2023-03-08 04:23:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 34/44 places, 17/24 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 249 ms. Remains : 34/44 places, 17/24 transitions.
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s24 1) (GEQ s32 1)), p0:(AND (GEQ s1 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10650 reset in 291 ms.
Product exploration explored 100000 steps with 10666 reset in 319 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 299 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 348 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 04:23:26] [INFO ] Invariant cache hit.
[2023-03-08 04:23:26] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-08 04:23:26] [INFO ] [Real]Absence check using 14 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 04:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:23:26] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-08 04:23:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:23:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-08 04:23:26] [INFO ] [Nat]Absence check using 14 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 04:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:23:26] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-08 04:23:26] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 04:23:26] [INFO ] Added : 7 causal constraints over 2 iterations in 23 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-08 04:23:26] [INFO ] Invariant cache hit.
[2023-03-08 04:23:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 04:23:26] [INFO ] Invariant cache hit.
[2023-03-08 04:23:26] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-08 04:23:26] [INFO ] Invariant cache hit.
[2023-03-08 04:23:26] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 34/34 places, 17/17 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 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 290 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 20 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 350 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 04:23:27] [INFO ] Invariant cache hit.
[2023-03-08 04:23:27] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-08 04:23:27] [INFO ] [Real]Absence check using 14 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 04:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:23:28] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-08 04:23:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:23:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-08 04:23:28] [INFO ] [Nat]Absence check using 14 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 04:23:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:23:28] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 04:23:28] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 04:23:28] [INFO ] Added : 7 causal constraints over 2 iterations in 22 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10674 reset in 312 ms.
Product exploration explored 100000 steps with 10630 reset in 304 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-08 04:23:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:23:28] [INFO ] Invariant cache hit.
[2023-03-08 04:23:29] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36 ms. Remains : 34/34 places, 17/17 transitions.
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-08 04:23:29] [INFO ] Invariant cache hit.
[2023-03-08 04:23:29] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 04:23:29] [INFO ] Invariant cache hit.
[2023-03-08 04:23:29] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-08 04:23:29] [INFO ] Invariant cache hit.
[2023-03-08 04:23:29] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 34/34 places, 17/17 transitions.
Treatment of property CircularTrains-PT-024-LTLFireability-04 finished in 4726 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)||X(p1))))'
Found a Shortening insensitive property : CircularTrains-PT-024-LTLFireability-07
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 44 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 41 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 38 transition count 18
Applied a total of 12 rules in 7 ms. Remains 38 /44 variables (removed 6) and now considering 18/24 (removed 6) transitions.
// Phase 1: matrix 18 rows 38 cols
[2023-03-08 04:23:29] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-08 04:23:29] [INFO ] Implicit Places using invariants in 63 ms returned [3, 32, 34, 37]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 34/44 places, 18/24 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 34 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 17
Applied a total of 2 rules in 5 ms. Remains 33 /34 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 33 cols
[2023-03-08 04:23:29] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-08 04:23:29] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 04:23:29] [INFO ] Invariant cache hit.
[2023-03-08 04:23:29] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 33/44 places, 17/24 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 218 ms. Remains : 33/44 places, 17/24 transitions.
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, 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:(AND (GEQ s5 1) (GEQ s18 1)), p1:(OR (AND (GEQ s2 1) (GEQ s26 1) (GEQ s5 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s26 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 24931 reset in 278 ms.
Product exploration explored 100000 steps with 24600 reset in 304 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 298 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 357 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-08 04:23:31] [INFO ] Invariant cache hit.
[2023-03-08 04:23:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 04:23:31] [INFO ] Invariant cache hit.
[2023-03-08 04:23:31] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-08 04:23:31] [INFO ] Invariant cache hit.
[2023-03-08 04:23:31] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 33/33 places, 17/17 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 (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 291 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 343 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24753 reset in 276 ms.
Product exploration explored 100000 steps with 24517 reset in 304 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-08 04:23:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:23:33] [INFO ] Invariant cache hit.
[2023-03-08 04:23:33] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 33/33 places, 17/17 transitions.
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-08 04:23:33] [INFO ] Invariant cache hit.
[2023-03-08 04:23:33] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 04:23:33] [INFO ] Invariant cache hit.
[2023-03-08 04:23:33] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-08 04:23:33] [INFO ] Invariant cache hit.
[2023-03-08 04:23:33] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 33/33 places, 17/17 transitions.
Treatment of property CircularTrains-PT-024-LTLFireability-07 finished in 4350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G((X((F(!p0)||p2))||p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(F(p1))))'
[2023-03-08 04:23:33] [INFO ] Flatten gal took : 8 ms
[2023-03-08 04:23:33] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-08 04:23:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 44 places, 24 transitions and 88 arcs took 1 ms.
Total runtime 34199 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CircularTrains-PT-024
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA CircularTrains-PT-024-LTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-024-LTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-024-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-024-LTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678249417745

--------------------
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/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/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 CircularTrains-PT-024-LTLFireability-07
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CircularTrains-PT-024-LTLFireability-07
lola: result : true
lola: markings : 97066
lola: fired transitions : 685268
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 CircularTrains-PT-024-LTLFireability-09
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for CircularTrains-PT-024-LTLFireability-09
lola: result : true
lola: markings : 159794
lola: fired transitions : 681192
lola: time used : 1.000000
lola: memory pages used : 2
lola: LAUNCH task # 1 (type EXCL) for 0 CircularTrains-PT-024-LTLFireability-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CircularTrains-PT-024-LTLFireability-04
lola: result : true
lola: markings : 69743
lola: fired transitions : 494750
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 CircularTrains-PT-024-LTLFireability-12
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for CircularTrains-PT-024-LTLFireability-12
lola: result : true
lola: markings : 686
lola: fired transitions : 1219
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-024-LTLFireability-04: LTL true LTL model checker
CircularTrains-PT-024-LTLFireability-07: LTL true LTL model checker
CircularTrains-PT-024-LTLFireability-09: LTL true LTL model checker
CircularTrains-PT-024-LTLFireability-12: LTL true LTL model checker


Time elapsed: 2 secs. Pages in use: 2

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="CircularTrains-PT-024"
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 CircularTrains-PT-024, 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-167814397600156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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