About the Execution of ITS-Tools for UtilityControlRoom-PT-Z4T4N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1996.468 | 57868.00 | 160026.00 | 552.50 | FFFTFTTTFFFFTTFF | 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.r485-tall-167912700401219.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 UtilityControlRoom-PT-Z4T4N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912700401219
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 55K Feb 26 14:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 271K Feb 26 14:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 26 14:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 525K Feb 26 14:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 132K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 71K Feb 26 15:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 329K Feb 26 15:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 141K Feb 26 15:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 477K Feb 26 15:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 319K 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 UtilityControlRoom-PT-Z4T4N10-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679325219906
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=UtilityControlRoom-PT-Z4T4N10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-20 15:13:41] [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-20 15:13:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 15:13:41] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-20 15:13:41] [INFO ] Transformed 376 places.
[2023-03-20 15:13:41] [INFO ] Transformed 750 transitions.
[2023-03-20 15:13:41] [INFO ] Parsed PT model containing 376 places and 750 transitions and 2410 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 167 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 29 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 15:13:41] [INFO ] Computed 23 place invariants in 13 ms
[2023-03-20 15:13:42] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-20 15:13:42] [INFO ] Invariant cache hit.
[2023-03-20 15:13:42] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2023-03-20 15:13:42] [INFO ] Invariant cache hit.
[2023-03-20 15:13:42] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 748 ms. Remains : 256/376 places, 470/590 transitions.
Support contains 167 out of 256 places after structural reductions.
[2023-03-20 15:13:42] [INFO ] Flatten gal took : 64 ms
[2023-03-20 15:13:42] [INFO ] Flatten gal took : 30 ms
[2023-03-20 15:13:42] [INFO ] Input system was already deterministic with 470 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 31) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 15:13:43] [INFO ] Invariant cache hit.
[2023-03-20 15:13:43] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 15:13:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-20 15:13:43] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 20 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 256 transition count 430
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 216 transition count 430
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 180 place count 166 transition count 380
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 220 place count 166 transition count 340
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 223 place count 163 transition count 220
Ensure Unique test removed 1 places
Iterating global reduction 1 with 4 rules applied. Total rules applied 227 place count 162 transition count 220
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 257 place count 132 transition count 190
Iterating global reduction 1 with 30 rules applied. Total rules applied 287 place count 132 transition count 190
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 317 place count 102 transition count 130
Iterating global reduction 1 with 30 rules applied. Total rules applied 347 place count 102 transition count 130
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 377 place count 72 transition count 100
Iterating global reduction 1 with 30 rules applied. Total rules applied 407 place count 72 transition count 100
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 437 place count 72 transition count 70
Applied a total of 437 rules in 52 ms. Remains 72 /256 variables (removed 184) and now considering 70/470 (removed 400) transitions.
// Phase 1: matrix 70 rows 72 cols
[2023-03-20 15:13:43] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-20 15:13:43] [INFO ] Implicit Places using invariants in 42 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/256 places, 70/470 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 61 transition count 60
Applied a total of 20 rules in 3 ms. Remains 61 /71 variables (removed 10) and now considering 60/70 (removed 10) transitions.
// Phase 1: matrix 60 rows 61 cols
[2023-03-20 15:13:43] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-20 15:13:44] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-20 15:13:44] [INFO ] Invariant cache hit.
[2023-03-20 15:13:44] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/256 places, 60/470 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 61/256 places, 60/470 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-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 (GT 3 (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50)) (GT 2 (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39)))], 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 5480 reset in 315 ms.
Stack based approach found an accepted trace after 1741 steps with 97 reset with depth 26 and stack size 26 in 5 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-00 finished in 752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 15 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 15:13:44] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-20 15:13:44] [INFO ] Implicit Places using invariants in 100 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/256 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 255/256 places, 470/470 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s205 s206 s207 s208 s209 s210 s211 s212 s213 s214) (ADD s0 s1 s2 s3)), p1:(OR (GT 2 s184) (LEQ (ADD s205 s206 s207 s208 s209 s210 s211 s212 s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 299 ms.
Product exploration explored 100000 steps with 50000 reset in 287 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 p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-03 finished in 963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))||X((F(G(p2))||G(p3)))))'
Support contains 55 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-20 15:13:45] [INFO ] Invariant cache hit.
[2023-03-20 15:13:45] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-20 15:13:45] [INFO ] Invariant cache hit.
[2023-03-20 15:13:45] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-20 15:13:45] [INFO ] Invariant cache hit.
[2023-03-20 15:13:46] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 471 ms. Remains : 256/256 places, 470/470 transitions.
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=2 dest: 1}, { cond=(AND p0 p3), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 1}, { cond=(AND p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=p2, acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 (ADD s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 353 ms.
Product exploration explored 100000 steps with 0 reset in 403 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p3), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p0 p3))), (X (NOT (AND p1 p3))), (X (AND (NOT p1) p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p1) (NOT p0) p3)), (X (NOT (AND p1 (NOT p0) p3))), (X (X p2)), (X (X p3)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3))))]
Knowledge based reduction with 27 factoid took 1166 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Finished random walk after 266 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p3), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p0 p3))), (X (NOT (AND p1 p3))), (X (AND (NOT p1) p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p1) (NOT p0) p3)), (X (NOT (AND p1 (NOT p0) p3))), (X (X p2)), (X (X p3)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (F (NOT p3)), (F (NOT p2))]
Knowledge based reduction with 27 factoid took 1244 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Support contains 54 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-20 15:13:49] [INFO ] Invariant cache hit.
[2023-03-20 15:13:50] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-20 15:13:50] [INFO ] Invariant cache hit.
[2023-03-20 15:13:50] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-20 15:13:50] [INFO ] Invariant cache hit.
[2023-03-20 15:13:50] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 256/256 places, 470/470 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 p3 p2), (X p3), (X (X p2)), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Finished random walk after 225 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p3 p2), (X p3), (X (X p2)), (X (X p3))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 348 ms.
Product exploration explored 100000 steps with 0 reset in 508 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Support contains 54 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 256 transition count 500
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 90 place count 256 transition count 460
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 90 rules in 40 ms. Remains 256 /256 variables (removed 0) and now considering 460/470 (removed 10) transitions.
[2023-03-20 15:13:52] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 460 rows 256 cols
[2023-03-20 15:13:52] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-20 15:13:52] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 256/256 places, 460/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 256/256 places, 460/470 transitions.
Built C files in :
/tmp/ltsmin4190541334402034150
[2023-03-20 15:13:52] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4190541334402034150
Running compilation step : cd /tmp/ltsmin4190541334402034150;'/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 890 ms.
Running link step : cd /tmp/ltsmin4190541334402034150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4190541334402034150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6424833564045872485.hoa' '--buchi-type=spotba'
LTSmin run took 294 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-04 finished in 8326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(((G(p2)&&X(p3))||p1)))))'
Support contains 140 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 15:13:53] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-20 15:13:54] [INFO ] Implicit Places using invariants in 104 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/256 places, 470/470 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 255/256 places, 470/470 transitions.
Stuttering acceptance computed with spot in 677 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p2), (AND p2 (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 12}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 13}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=8 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 5}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=10 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=12 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=13 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=13 dest: 8}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=13 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=14 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=14 dest: 8}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=14 dest: 12}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=14 dest: 13}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p0:(LEQ (ADD s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 581 ms.
Product exploration explored 100000 steps with 33333 reset in 571 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 (NOT p2) (NOT p3)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 (NOT p2) (NOT p3))
Knowledge based reduction with 8 factoid took 287 ms. Reduced automaton from 15 states, 37 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-05 finished in 2260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 51 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-20 15:13:56] [INFO ] Invariant cache hit.
[2023-03-20 15:13:56] [INFO ] Implicit Places using invariants in 102 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/256 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 255/256 places, 470/470 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT 2 s184), p0:(AND (GT 3 (ADD s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-06 finished in 886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 14 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 256 transition count 430
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 216 transition count 430
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 200 place count 156 transition count 370
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 240 place count 156 transition count 330
Applied a total of 240 rules in 26 ms. Remains 156 /256 variables (removed 100) and now considering 330/470 (removed 140) transitions.
// Phase 1: matrix 330 rows 156 cols
[2023-03-20 15:13:57] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-20 15:13:57] [INFO ] Implicit Places using invariants in 142 ms returned [94, 95]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 143 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/256 places, 330/470 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 154/256 places, 330/470 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-07 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 (LEQ 1 (ADD s0 s1 s2 s3)) (LEQ 1 (ADD s94 s95 s96 s97 s98 s99 s100 s101 s102 s103)))], 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 1383 reset in 268 ms.
Product exploration explored 100000 steps with 1330 reset in 271 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 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 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 116 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=38 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 14 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 330/330 transitions.
Applied a total of 0 rules in 10 ms. Remains 154 /154 variables (removed 0) and now considering 330/330 (removed 0) transitions.
// Phase 1: matrix 330 rows 154 cols
[2023-03-20 15:13:58] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-20 15:13:58] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-20 15:13:58] [INFO ] Invariant cache hit.
[2023-03-20 15:13:58] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-20 15:13:58] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 15:13:58] [INFO ] Invariant cache hit.
[2023-03-20 15:13:58] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 154/154 places, 330/330 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 199 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 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1356 reset in 264 ms.
Product exploration explored 100000 steps with 1367 reset in 270 ms.
Built C files in :
/tmp/ltsmin15739245921746151586
[2023-03-20 15:13:59] [INFO ] Computing symmetric may disable matrix : 330 transitions.
[2023-03-20 15:13:59] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 15:13:59] [INFO ] Computing symmetric may enable matrix : 330 transitions.
[2023-03-20 15:13:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 15:13:59] [INFO ] Computing Do-Not-Accords matrix : 330 transitions.
[2023-03-20 15:13:59] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 15:13:59] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15739245921746151586
Running compilation step : cd /tmp/ltsmin15739245921746151586;'/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 616 ms.
Running link step : cd /tmp/ltsmin15739245921746151586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15739245921746151586;'/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/stateBased9278917068327940353.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 14 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 330/330 transitions.
Applied a total of 0 rules in 12 ms. Remains 154 /154 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2023-03-20 15:14:15] [INFO ] Invariant cache hit.
[2023-03-20 15:14:15] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-20 15:14:15] [INFO ] Invariant cache hit.
[2023-03-20 15:14:15] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-20 15:14:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 15:14:15] [INFO ] Invariant cache hit.
[2023-03-20 15:14:15] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 326 ms. Remains : 154/154 places, 330/330 transitions.
Built C files in :
/tmp/ltsmin6816245606699052712
[2023-03-20 15:14:15] [INFO ] Computing symmetric may disable matrix : 330 transitions.
[2023-03-20 15:14:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 15:14:15] [INFO ] Computing symmetric may enable matrix : 330 transitions.
[2023-03-20 15:14:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 15:14:15] [INFO ] Computing Do-Not-Accords matrix : 330 transitions.
[2023-03-20 15:14:15] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 15:14:15] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6816245606699052712
Running compilation step : cd /tmp/ltsmin6816245606699052712;'/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 607 ms.
Running link step : cd /tmp/ltsmin6816245606699052712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6816245606699052712;'/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/stateBased14337873783239224677.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 15:14:30] [INFO ] Flatten gal took : 17 ms
[2023-03-20 15:14:30] [INFO ] Flatten gal took : 17 ms
[2023-03-20 15:14:30] [INFO ] Time to serialize gal into /tmp/LTL13350245656818419855.gal : 5 ms
[2023-03-20 15:14:30] [INFO ] Time to serialize properties into /tmp/LTL17708444257502279666.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13350245656818419855.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11153046487976246923.hoa' '-atoms' '/tmp/LTL17708444257502279666.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17708444257502279666.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11153046487976246923.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
130 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.35629,61312,1,0,15,287174,24,1,4695,107720,39
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-07 finished in 35072 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||(p1&&G(p2))))))'
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 39 Pre rules applied. Total rules applied 0 place count 256 transition count 431
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 217 transition count 431
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 0 with 118 rules applied. Total rules applied 196 place count 158 transition count 372
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 236 place count 158 transition count 332
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 238 place count 156 transition count 252
Iterating global reduction 1 with 2 rules applied. Total rules applied 240 place count 156 transition count 252
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 260 place count 136 transition count 232
Iterating global reduction 1 with 20 rules applied. Total rules applied 280 place count 136 transition count 232
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 299 place count 117 transition count 194
Iterating global reduction 1 with 19 rules applied. Total rules applied 318 place count 117 transition count 194
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 337 place count 98 transition count 156
Iterating global reduction 1 with 19 rules applied. Total rules applied 356 place count 98 transition count 156
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 375 place count 98 transition count 137
Applied a total of 375 rules in 30 ms. Remains 98 /256 variables (removed 158) and now considering 137/470 (removed 333) transitions.
// Phase 1: matrix 137 rows 98 cols
[2023-03-20 15:14:32] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-20 15:14:32] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 15:14:32] [INFO ] Invariant cache hit.
[2023-03-20 15:14:32] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-20 15:14:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 15:14:32] [INFO ] Invariant cache hit.
[2023-03-20 15:14:32] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/256 places, 137/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 98/256 places, 137/470 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s57 s0), p0:(GT 1 s56), p2:(LEQ s78 s54)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 282 ms.
Stack based approach found an accepted trace after 25300 steps with 0 reset with depth 25301 and stack size 25294 in 67 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-08 finished in 758 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(X(F(!p0)))) U G((p1&&F(p2)))))'
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 15:14:32] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-20 15:14:33] [INFO ] Implicit Places using invariants in 115 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/256 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 255/256 places, 470/470 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), p0, p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p2) p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 1 s184), p2:(LEQ 2 s3), p0:(AND (LEQ 2 s3) (LEQ s149 s232))], nbAcceptance=1, 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]]
Product exploration explored 100000 steps with 633 reset in 281 ms.
Product exploration explored 100000 steps with 692 reset in 273 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 p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND p1 (NOT p2))), (X p1), true, (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 414 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), p0, p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 470 rows 255 cols
[2023-03-20 15:14:34] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-20 15:14:34] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND p1 (NOT p2))), (X p1), true, (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (G (NOT (AND (NOT p2) p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 9 factoid took 588 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), (AND (NOT p1) p0), p0, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), (AND (NOT p1) p0), p0, p0, (AND p0 (NOT p1))]
[2023-03-20 15:14:35] [INFO ] Invariant cache hit.
[2023-03-20 15:14:36] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND p1 (NOT p2))), (X p1), true, (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (G (NOT (AND (NOT p2) p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) p1))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 9 factoid took 262 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-10 finished in 3451 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 U !p1)&&G(p2))))'
Support contains 3 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 9 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 15:14:36] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-20 15:14:36] [INFO ] Implicit Places using invariants in 124 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/256 places, 470/470 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 255/256 places, 470/470 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (OR (NOT p2) p1), true, (OR (NOT p2) p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(LEQ 1 s182), p1:(OR (LEQ 3 s1) (GT 1 s170)), p0:(GT 3 s1)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-11 finished in 287 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)))'
Support contains 1 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 2 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-20 15:14:36] [INFO ] Invariant cache hit.
[2023-03-20 15:14:36] [INFO ] Implicit Places using invariants in 115 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/256 places, 470/470 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 255/256 places, 470/470 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s31)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 749 steps with 0 reset in 9 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-15 finished in 221 ms.
All properties solved by simple procedures.
Total runtime 55458 ms.
BK_STOP 1679325277774
--------------------
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="UtilityControlRoom-PT-Z4T4N10"
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 UtilityControlRoom-PT-Z4T4N10, 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 r485-tall-167912700401219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z4T4N10.tgz
mv UtilityControlRoom-PT-Z4T4N10 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 ;