About the Execution of ITS-Tools for Parking-PT-208
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 344.319 | 19926.00 | 35546.00 | 557.10 | FFFTFFFTFFFTTTTF | 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.r261-smll-167863536300419.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 itstools
Input is Parking-PT-208, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536300419
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 49K Mar 5 18:23 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 Parking-PT-208-LTLCardinality-00
FORMULA_NAME Parking-PT-208-LTLCardinality-01
FORMULA_NAME Parking-PT-208-LTLCardinality-02
FORMULA_NAME Parking-PT-208-LTLCardinality-03
FORMULA_NAME Parking-PT-208-LTLCardinality-04
FORMULA_NAME Parking-PT-208-LTLCardinality-05
FORMULA_NAME Parking-PT-208-LTLCardinality-06
FORMULA_NAME Parking-PT-208-LTLCardinality-07
FORMULA_NAME Parking-PT-208-LTLCardinality-08
FORMULA_NAME Parking-PT-208-LTLCardinality-09
FORMULA_NAME Parking-PT-208-LTLCardinality-10
FORMULA_NAME Parking-PT-208-LTLCardinality-11
FORMULA_NAME Parking-PT-208-LTLCardinality-12
FORMULA_NAME Parking-PT-208-LTLCardinality-13
FORMULA_NAME Parking-PT-208-LTLCardinality-14
FORMULA_NAME Parking-PT-208-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678920798277
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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-15 22:53:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 22:53:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:53:21] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-15 22:53:21] [INFO ] Transformed 137 places.
[2023-03-15 22:53:21] [INFO ] Transformed 201 transitions.
[2023-03-15 22:53:21] [INFO ] Found NUPN structural information;
[2023-03-15 22:53:21] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 136 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 136 transition count 116
Applied a total of 2 rules in 56 ms. Remains 136 /137 variables (removed 1) and now considering 116/117 (removed 1) transitions.
// Phase 1: matrix 116 rows 136 cols
[2023-03-15 22:53:22] [INFO ] Computed 34 place invariants in 14 ms
[2023-03-15 22:53:22] [INFO ] Implicit Places using invariants in 408 ms returned [28, 36, 44, 52, 64, 66, 93, 101, 109, 117, 129, 131]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 448 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/137 places, 116/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 112
Applied a total of 8 rules in 17 ms. Remains 120 /124 variables (removed 4) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 120 cols
[2023-03-15 22:53:22] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-15 22:53:22] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-15 22:53:22] [INFO ] Invariant cache hit.
[2023-03-15 22:53:22] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:53:22] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 120/137 places, 112/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 948 ms. Remains : 120/137 places, 112/117 transitions.
Support contains 34 out of 120 places after structural reductions.
[2023-03-15 22:53:23] [INFO ] Flatten gal took : 50 ms
[2023-03-15 22:53:23] [INFO ] Flatten gal took : 23 ms
[2023-03-15 22:53:23] [INFO ] Input system was already deterministic with 112 transitions.
Support contains 33 out of 120 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 287 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 22:53:24] [INFO ] Invariant cache hit.
[2023-03-15 22:53:24] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 22:53:24] [INFO ] [Nat]Absence check using 22 positive place invariants in 21 ms returned sat
[2023-03-15 22:53:24] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 22:53:24] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:53:24] [INFO ] After 24ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 22:53:24] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 5 ms to minimize.
[2023-03-15 22:53:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-15 22:53:24] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-15 22:53:24] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 4 ms.
FORMULA Parking-PT-208-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Parking-PT-208-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Parking-PT-208-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 112/112 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 116 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 116 transition count 104
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 16 place count 112 transition count 104
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 107 transition count 99
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 107 transition count 99
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 99 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 98 transition count 110
Applied a total of 44 rules in 57 ms. Remains 98 /120 variables (removed 22) and now considering 110/112 (removed 2) transitions.
// Phase 1: matrix 110 rows 98 cols
[2023-03-15 22:53:24] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-15 22:53:25] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-15 22:53:25] [INFO ] Invariant cache hit.
[2023-03-15 22:53:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-15 22:53:25] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-15 22:53:25] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 22:53:25] [INFO ] Invariant cache hit.
[2023-03-15 22:53:25] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/120 places, 110/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 98/120 places, 110/112 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6672 reset in 773 ms.
Product exploration explored 100000 steps with 6572 reset in 363 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 251 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 110/110 transitions.
Applied a total of 0 rules in 9 ms. Remains 98 /98 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-15 22:53:27] [INFO ] Invariant cache hit.
[2023-03-15 22:53:27] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-15 22:53:27] [INFO ] Invariant cache hit.
[2023-03-15 22:53:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-15 22:53:27] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-15 22:53:27] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 22:53:27] [INFO ] Invariant cache hit.
[2023-03-15 22:53:27] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 491 ms. Remains : 98/98 places, 110/110 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6694 reset in 394 ms.
Product exploration explored 100000 steps with 6595 reset in 643 ms.
Built C files in :
/tmp/ltsmin1229825425411640709
[2023-03-15 22:53:29] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2023-03-15 22:53:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:53:29] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2023-03-15 22:53:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:53:29] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2023-03-15 22:53:29] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:53:29] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1229825425411640709
Running compilation step : cd /tmp/ltsmin1229825425411640709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 625 ms.
Running link step : cd /tmp/ltsmin1229825425411640709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin1229825425411640709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4377729905681812642.hoa' '--buchi-type=spotba'
LTSmin run took 215 ms.
FORMULA Parking-PT-208-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-208-LTLCardinality-00 finished in 5918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U ((p1 U !p2)&&X(p1))))'
Support contains 6 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 112/112 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 116 transition count 108
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 116 transition count 108
Applied a total of 8 rules in 9 ms. Remains 116 /120 variables (removed 4) and now considering 108/112 (removed 4) transitions.
// Phase 1: matrix 108 rows 116 cols
[2023-03-15 22:53:30] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:53:30] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-15 22:53:30] [INFO ] Invariant cache hit.
[2023-03-15 22:53:30] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:53:31] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-15 22:53:31] [INFO ] Invariant cache hit.
[2023-03-15 22:53:31] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/120 places, 108/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 116/120 places, 108/112 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), p2, true, p2]
Running random walk in product with property : Parking-PT-208-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(OR (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s51 0) (EQ s56 1)), p1:(OR (EQ s11 0) (EQ s33 1)), p0:(OR (EQ s28 0) (EQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4120 steps with 244 reset in 25 ms.
FORMULA Parking-PT-208-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-01 finished in 787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 115 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 115 transition count 103
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 111 transition count 103
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 106 transition count 98
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 106 transition count 98
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 40 place count 99 transition count 91
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 99 transition count 91
Applied a total of 41 rules in 40 ms. Remains 99 /120 variables (removed 21) and now considering 91/112 (removed 21) transitions.
// Phase 1: matrix 91 rows 99 cols
[2023-03-15 22:53:31] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-15 22:53:31] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-15 22:53:31] [INFO ] Invariant cache hit.
[2023-03-15 22:53:31] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-15 22:53:31] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 22:53:31] [INFO ] Invariant cache hit.
[2023-03-15 22:53:31] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/120 places, 91/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 464 ms. Remains : 99/120 places, 91/112 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s25 0) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 397 steps with 10 reset in 1 ms.
FORMULA Parking-PT-208-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-05 finished in 590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((p1 U p2))))))'
Support contains 5 out of 120 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 112/112 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 116 transition count 108
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 116 transition count 108
Applied a total of 8 rules in 4 ms. Remains 116 /120 variables (removed 4) and now considering 108/112 (removed 4) transitions.
// Phase 1: matrix 108 rows 116 cols
[2023-03-15 22:53:32] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:53:32] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-15 22:53:32] [INFO ] Invariant cache hit.
[2023-03-15 22:53:32] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:53:32] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-15 22:53:32] [INFO ] Invariant cache hit.
[2023-03-15 22:53:32] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/120 places, 108/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 116/120 places, 108/112 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-208-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s112 0) (EQ s79 1)) (OR (EQ s51 0) (EQ s102 1))), p2:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 350 ms.
Product exploration explored 100000 steps with 33333 reset in 654 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/116 stabilizing places and 1/108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p2)))))
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-208-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLCardinality-07 finished in 1594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 112/112 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 115 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 115 transition count 107
Applied a total of 10 rules in 5 ms. Remains 115 /120 variables (removed 5) and now considering 107/112 (removed 5) transitions.
// Phase 1: matrix 107 rows 115 cols
[2023-03-15 22:53:33] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:53:33] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-15 22:53:33] [INFO ] Invariant cache hit.
[2023-03-15 22:53:33] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:53:33] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-15 22:53:33] [INFO ] Invariant cache hit.
[2023-03-15 22:53:34] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/120 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 115/120 places, 107/112 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s40 0) (EQ s78 1)), p1:(AND (NEQ s33 0) (NEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-08 finished in 490 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)||F(G((p1||F(p2))))))'
Support contains 6 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 112/112 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 116 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 116 transition count 104
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 109 transition count 101
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 109 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 36 place count 102 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 38 place count 101 transition count 113
Applied a total of 38 rules in 38 ms. Remains 101 /120 variables (removed 19) and now considering 113/112 (removed -1) transitions.
// Phase 1: matrix 113 rows 101 cols
[2023-03-15 22:53:34] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:53:34] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-15 22:53:34] [INFO ] Invariant cache hit.
[2023-03-15 22:53:34] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 22:53:34] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-03-15 22:53:34] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 22:53:34] [INFO ] Invariant cache hit.
[2023-03-15 22:53:34] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/120 places, 113/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 580 ms. Remains : 101/120 places, 113/112 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-208-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s28 0) (EQ s98 1)), p1:(AND (EQ s68 0) (EQ s0 1)), p2:(AND (EQ s18 0) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 87 steps with 2 reset in 0 ms.
FORMULA Parking-PT-208-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-10 finished in 762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 112/112 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 115 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 115 transition count 107
Applied a total of 10 rules in 3 ms. Remains 115 /120 variables (removed 5) and now considering 107/112 (removed 5) transitions.
// Phase 1: matrix 107 rows 115 cols
[2023-03-15 22:53:34] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:53:35] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-15 22:53:35] [INFO ] Invariant cache hit.
[2023-03-15 22:53:35] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:53:35] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-15 22:53:35] [INFO ] Invariant cache hit.
[2023-03-15 22:53:35] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/120 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 115/120 places, 107/112 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s53 0) (AND (EQ s105 0) (EQ s83 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 380 ms.
Product exploration explored 100000 steps with 50000 reset in 559 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-208-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLCardinality-11 finished in 1706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 115 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 115 transition count 103
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 16 place count 111 transition count 103
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 106 transition count 98
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 106 transition count 98
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 98 transition count 90
Applied a total of 42 rules in 23 ms. Remains 98 /120 variables (removed 22) and now considering 90/112 (removed 22) transitions.
// Phase 1: matrix 90 rows 98 cols
[2023-03-15 22:53:36] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:53:36] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-15 22:53:36] [INFO ] Invariant cache hit.
[2023-03-15 22:53:37] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-15 22:53:37] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 22:53:37] [INFO ] Invariant cache hit.
[2023-03-15 22:53:37] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/120 places, 90/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 507 ms. Remains : 98/120 places, 90/112 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-15 finished in 636 ms.
All properties solved by simple procedures.
Total runtime 15884 ms.
BK_STOP 1678920818203
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="Parking-PT-208"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Parking-PT-208, 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 r261-smll-167863536300419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 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 ;