About the Execution of LoLa+red for CircularTrains-PT-048
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 762.867 | 51394.00 | 63020.00 | 834.40 | FTTFFF?FFFFFTFTF | 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-167814397600163.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-048, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397600163
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.5K Feb 26 04:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 04:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.9K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 15K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K 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.8K 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 37K 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-048-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678249658415
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-048
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:27:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 04:27:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:27:41] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-08 04:27:41] [INFO ] Transformed 96 places.
[2023-03-08 04:27:41] [INFO ] Transformed 48 transitions.
[2023-03-08 04:27:41] [INFO ] Parsed PT model containing 96 places and 48 transitions and 192 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CircularTrains-PT-048-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 48/48 transitions.
Applied a total of 0 rules in 36 ms. Remains 96 /96 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 96 cols
[2023-03-08 04:27:41] [INFO ] Computed 49 place invariants in 16 ms
[2023-03-08 04:27:42] [INFO ] Implicit Places using invariants in 387 ms returned [3, 13, 22, 63, 64, 81, 84, 90, 91, 92, 94]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 452 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/96 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 494 ms. Remains : 85/96 places, 48/48 transitions.
Support contains 33 out of 85 places after structural reductions.
[2023-03-08 04:27:42] [INFO ] Flatten gal took : 34 ms
[2023-03-08 04:27:42] [INFO ] Flatten gal took : 15 ms
[2023-03-08 04:27:42] [INFO ] Input system was already deterministic with 48 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=13 ) properties (out of 26) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 48 rows 85 cols
[2023-03-08 04:27:43] [INFO ] Computed 38 place invariants in 11 ms
[2023-03-08 04:27:44] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-08 04:27:44] [INFO ] [Real]Absence check using 30 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-08 04:27:44] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CircularTrains-PT-048-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircularTrains-PT-048-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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||G(F(p1))))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 48/48 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 85 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 78 transition count 41
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 14 place count 78 transition count 38
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 75 transition count 38
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 2 with 6 rules applied. Total rules applied 26 place count 72 transition count 35
Applied a total of 26 rules in 22 ms. Remains 72 /85 variables (removed 13) and now considering 35/48 (removed 13) transitions.
// Phase 1: matrix 35 rows 72 cols
[2023-03-08 04:27:44] [INFO ] Computed 38 place invariants in 3 ms
[2023-03-08 04:27:44] [INFO ] Implicit Places using invariants in 135 ms returned [0, 11, 68, 70]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 137 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/85 places, 35/48 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 67 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 67 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 66 transition count 33
Applied a total of 4 rules in 8 ms. Remains 66 /68 variables (removed 2) and now considering 33/35 (removed 2) transitions.
// Phase 1: matrix 33 rows 66 cols
[2023-03-08 04:27:44] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-08 04:27:44] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 04:27:44] [INFO ] Invariant cache hit.
[2023-03-08 04:27:45] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/85 places, 33/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 416 ms. Remains : 66/85 places, 33/48 transitions.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s56 s44), p1:(LEQ 1 s53)], 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 153 reset in 667 ms.
Product exploration explored 100000 steps with 180 reset in 622 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 321 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=107 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 04:27:47] [INFO ] Invariant cache hit.
[2023-03-08 04:27:47] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 04:27:47] [INFO ] Invariant cache hit.
[2023-03-08 04:27:47] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-08 04:27:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:27:47] [INFO ] Invariant cache hit.
[2023-03-08 04:27:47] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 66/66 places, 33/33 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)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 172 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 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))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 149 reset in 230 ms.
Product exploration explored 100000 steps with 162 reset in 251 ms.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 04:27:48] [INFO ] Invariant cache hit.
[2023-03-08 04:27:48] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-08 04:27:49] [INFO ] Invariant cache hit.
[2023-03-08 04:27:49] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-08 04:27:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:27:49] [INFO ] Invariant cache hit.
[2023-03-08 04:27:49] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 366 ms. Remains : 66/66 places, 33/33 transitions.
Treatment of property CircularTrains-PT-048-LTLCardinality-01 finished in 4712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p1))))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 85 cols
[2023-03-08 04:27:49] [INFO ] Computed 38 place invariants in 3 ms
[2023-03-08 04:27:49] [INFO ] Implicit Places using invariants in 126 ms returned [1, 14, 53, 82]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 128 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/85 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 81/85 places, 48/48 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (GT 3 s74) (LEQ s26 s28)), p1:(LEQ s30 s9)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 461 ms.
Product exploration explored 100000 steps with 50000 reset in 311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-048-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-048-LTLCardinality-02 finished in 1218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&G(p2))))'
Support contains 6 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-08 04:27:50] [INFO ] Invariant cache hit.
[2023-03-08 04:27:50] [INFO ] Implicit Places using invariants in 89 ms returned [1, 14, 53, 77, 82]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 90 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/85 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 80/85 places, 48/48 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(GT s2 s3), p1:(OR (AND (GT 1 s71) (GT s4 s17)) (GT 1 s20)), p0:(GT s4 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-04 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' '!(G((p0||X(G((G(F(p0)) U p1))))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-08 04:27:50] [INFO ] Invariant cache hit.
[2023-03-08 04:27:51] [INFO ] Implicit Places using invariants in 171 ms returned [1, 14, 53, 77, 82]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 174 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/85 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 80/85 places, 48/48 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s47 s75), p1:(LEQ 1 s66)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1645 reset in 471 ms.
Product exploration explored 100000 steps with 1603 reset in 512 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 468 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 125 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 565 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2023-03-08 04:27:54] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-08 04:27:54] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 04:27:54] [INFO ] Invariant cache hit.
[2023-03-08 04:27:54] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-08 04:27:54] [INFO ] Invariant cache hit.
[2023-03-08 04:27:54] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 80/80 places, 48/48 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 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 561 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 38 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 627 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1575 reset in 387 ms.
Product exploration explored 100000 steps with 1611 reset in 400 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 80 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 13 place count 80 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 80 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 15 rules in 11 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-08 04:27:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 48 rows 80 cols
[2023-03-08 04:27:58] [INFO ] Computed 33 place invariants in 5 ms
[2023-03-08 04:27:58] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/80 places, 48/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 80/80 places, 48/48 transitions.
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2023-03-08 04:27:58] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-08 04:27:58] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 04:27:58] [INFO ] Invariant cache hit.
[2023-03-08 04:27:58] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-08 04:27:58] [INFO ] Invariant cache hit.
[2023-03-08 04:27:58] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 368 ms. Remains : 80/80 places, 48/48 transitions.
Treatment of property CircularTrains-PT-048-LTLCardinality-06 finished in 7799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 85 cols
[2023-03-08 04:27:58] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-08 04:27:58] [INFO ] Implicit Places using invariants in 113 ms returned [1, 14, 53, 77, 82]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 117 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/85 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 80/85 places, 48/48 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 1 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-08 finished in 299 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)) U ((X(X(p0))&&G(p1))||X(X(G(p0))))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-08 04:27:58] [INFO ] Invariant cache hit.
[2023-03-08 04:27:59] [INFO ] Implicit Places using invariants in 154 ms returned [1, 14, 53, 77, 82]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 155 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/85 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 80/85 places, 48/48 transitions.
Stuttering acceptance computed with spot in 391 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}]], initial=2, aps=[p0:(LEQ s50 s0), p1:(GT 1 s29)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 73 steps with 18 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-11 finished in 588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 48/48 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 85 transition count 41
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 78 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 77 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 77 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 74 transition count 37
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 3 with 6 rules applied. Total rules applied 28 place count 71 transition count 34
Applied a total of 28 rules in 14 ms. Remains 71 /85 variables (removed 14) and now considering 34/48 (removed 14) transitions.
// Phase 1: matrix 34 rows 71 cols
[2023-03-08 04:27:59] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-08 04:27:59] [INFO ] Implicit Places using invariants in 139 ms returned [0, 11, 48, 67, 69]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 142 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/85 places, 34/48 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 33
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 65 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 64 transition count 32
Applied a total of 4 rules in 11 ms. Remains 64 /66 variables (removed 2) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 64 cols
[2023-03-08 04:27:59] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-08 04:27:59] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-08 04:27:59] [INFO ] Invariant cache hit.
[2023-03-08 04:27:59] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/85 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 454 ms. Remains : 64/85 places, 32/48 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s21), p1:(LEQ 1 s8)], nbAcceptance=2, 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 417 ms.
Stack based approach found an accepted trace after 41419 steps with 0 reset with depth 41420 and stack size 8455 in 241 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-15 finished in 1191 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||G(F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G((G(F(p0)) U p1))))))'
Found a Lengthening insensitive property : CircularTrains-PT-048-LTLCardinality-06
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 85/85 places, 48/48 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 42
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 79 transition count 42
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 79 transition count 38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 75 transition count 38
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 2 with 6 rules applied. Total rules applied 26 place count 72 transition count 35
Applied a total of 26 rules in 12 ms. Remains 72 /85 variables (removed 13) and now considering 35/48 (removed 13) transitions.
// Phase 1: matrix 35 rows 72 cols
[2023-03-08 04:28:01] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-08 04:28:01] [INFO ] Implicit Places using invariants in 141 ms returned [0, 11, 48, 67, 70]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 143 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 67/85 places, 35/48 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 65 transition count 33
Applied a total of 4 rules in 6 ms. Remains 65 /67 variables (removed 2) and now considering 33/35 (removed 2) transitions.
// Phase 1: matrix 33 rows 65 cols
[2023-03-08 04:28:01] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-08 04:28:01] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-08 04:28:01] [INFO ] Invariant cache hit.
[2023-03-08 04:28:01] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 65/85 places, 33/48 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 435 ms. Remains : 65/85 places, 33/48 transitions.
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s40 s62), p1:(LEQ 1 s56)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2377 reset in 409 ms.
Product exploration explored 100000 steps with 2358 reset in 344 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 480 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 34 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 566 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 04:28:04] [INFO ] Invariant cache hit.
[2023-03-08 04:28:04] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 04:28:04] [INFO ] Invariant cache hit.
[2023-03-08 04:28:04] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-08 04:28:04] [INFO ] Invariant cache hit.
[2023-03-08 04:28:04] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 65/65 places, 33/33 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)), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 515 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 623 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2369 reset in 407 ms.
Product exploration explored 100000 steps with 2378 reset in 473 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 33/33 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 04:28:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:28:08] [INFO ] Invariant cache hit.
[2023-03-08 04:28:08] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 65/65 places, 33/33 transitions.
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 04:28:08] [INFO ] Invariant cache hit.
[2023-03-08 04:28:08] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-08 04:28:08] [INFO ] Invariant cache hit.
[2023-03-08 04:28:08] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-08 04:28:08] [INFO ] Invariant cache hit.
[2023-03-08 04:28:08] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 65/65 places, 33/33 transitions.
Treatment of property CircularTrains-PT-048-LTLCardinality-06 finished in 7586 ms.
[2023-03-08 04:28:08] [INFO ] Flatten gal took : 14 ms
[2023-03-08 04:28:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-08 04:28:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 48 transitions and 170 arcs took 2 ms.
Total runtime 27268 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CircularTrains-PT-048
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality
FORMULA CircularTrains-PT-048-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678249709809
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 CircularTrains-PT-048-LTLCardinality-01
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CircularTrains-PT-048-LTLCardinality-01
lola: result : true
lola: markings : 1327
lola: fired transitions : 1460
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 CircularTrains-PT-048-LTLCardinality-06
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLCardinality-01: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-048-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3600 12/32 CircularTrains-PT-048-LTLCardinality-06 1799267 m, 359853 m/sec, 4419666 t fired, .
Time elapsed: 5 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLCardinality-01: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-048-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3600 23/32 CircularTrains-PT-048-LTLCardinality-06 3442896 m, 328725 m/sec, 8876784 t fired, .
Time elapsed: 10 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLCardinality-01: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-048-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3600 32/32 CircularTrains-PT-048-LTLCardinality-06 4809965 m, 273413 m/sec, 13460265 t fired, .
Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for CircularTrains-PT-048-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLCardinality-01: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-048-LTLCardinality-06: 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: 2
lola: Portfolio finished: no open tasks 2
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLCardinality-01: LTL true LTL model checker
CircularTrains-PT-048-LTLCardinality-06: 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="CircularTrains-PT-048"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is CircularTrains-PT-048, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397600163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-048.tgz
mv CircularTrains-PT-048 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;