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

About the Execution of ITS-Tools for SmartHome-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
379.436 16293.00 33453.00 482.70 TFFTTFTFFFFFFFFT 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.r453-smll-167912645200291.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 SmartHome-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645200291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 5.9K Feb 26 05:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 05:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 26 05:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 05:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 05:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 05:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 05:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 05:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 159K 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 SmartHome-PT-18-LTLCardinality-00
FORMULA_NAME SmartHome-PT-18-LTLCardinality-01
FORMULA_NAME SmartHome-PT-18-LTLCardinality-02
FORMULA_NAME SmartHome-PT-18-LTLCardinality-03
FORMULA_NAME SmartHome-PT-18-LTLCardinality-04
FORMULA_NAME SmartHome-PT-18-LTLCardinality-05
FORMULA_NAME SmartHome-PT-18-LTLCardinality-06
FORMULA_NAME SmartHome-PT-18-LTLCardinality-07
FORMULA_NAME SmartHome-PT-18-LTLCardinality-08
FORMULA_NAME SmartHome-PT-18-LTLCardinality-09
FORMULA_NAME SmartHome-PT-18-LTLCardinality-10
FORMULA_NAME SmartHome-PT-18-LTLCardinality-11
FORMULA_NAME SmartHome-PT-18-LTLCardinality-12
FORMULA_NAME SmartHome-PT-18-LTLCardinality-13
FORMULA_NAME SmartHome-PT-18-LTLCardinality-14
FORMULA_NAME SmartHome-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679249887775

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=SmartHome-PT-18
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 18:18:10] [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-19 18:18:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 18:18:11] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2023-03-19 18:18:11] [INFO ] Transformed 653 places.
[2023-03-19 18:18:11] [INFO ] Transformed 706 transitions.
[2023-03-19 18:18:11] [INFO ] Found NUPN structural information;
[2023-03-19 18:18:11] [INFO ] Parsed PT model containing 653 places and 706 transitions and 1618 arcs in 557 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 206 places in 13 ms
Reduce places removed 206 places and 176 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-18-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 530/530 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 430 transition count 530
Discarding 112 places :
Symmetric choice reduction at 1 with 112 rule applications. Total rules 129 place count 318 transition count 418
Iterating global reduction 1 with 112 rules applied. Total rules applied 241 place count 318 transition count 418
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 250 place count 318 transition count 409
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 268 place count 300 transition count 391
Iterating global reduction 2 with 18 rules applied. Total rules applied 286 place count 300 transition count 391
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 301 place count 285 transition count 376
Iterating global reduction 2 with 15 rules applied. Total rules applied 316 place count 285 transition count 376
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 318 place count 285 transition count 374
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 322 place count 281 transition count 370
Iterating global reduction 3 with 4 rules applied. Total rules applied 326 place count 281 transition count 370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 327 place count 280 transition count 369
Iterating global reduction 3 with 1 rules applied. Total rules applied 328 place count 280 transition count 369
Applied a total of 328 rules in 196 ms. Remains 280 /447 variables (removed 167) and now considering 369/530 (removed 161) transitions.
// Phase 1: matrix 369 rows 280 cols
[2023-03-19 18:18:12] [INFO ] Computed 3 place invariants in 27 ms
[2023-03-19 18:18:12] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-19 18:18:12] [INFO ] Invariant cache hit.
[2023-03-19 18:18:12] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
[2023-03-19 18:18:12] [INFO ] Invariant cache hit.
[2023-03-19 18:18:13] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/447 places, 369/530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1430 ms. Remains : 280/447 places, 369/530 transitions.
Support contains 31 out of 280 places after structural reductions.
[2023-03-19 18:18:13] [INFO ] Flatten gal took : 98 ms
[2023-03-19 18:18:13] [INFO ] Flatten gal took : 36 ms
[2023-03-19 18:18:13] [INFO ] Input system was already deterministic with 369 transitions.
Support contains 30 out of 280 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 18:18:14] [INFO ] Invariant cache hit.
[2023-03-19 18:18:14] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:18:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:18:14] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 18:18:14] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:18:14] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-19 18:18:14] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 8 ms.
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 369/369 transitions.
Graph (trivial) has 293 edges and 280 vertex of which 155 / 280 are part of one of the 13 SCC in 9 ms
Free SCC test removed 142 places
Drop transitions removed 211 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 215 transitions.
Graph (complete) has 207 edges and 138 vertex of which 124 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 124 transition count 93
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 75 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 73 transition count 89
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 109 place count 73 transition count 84
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 119 place count 68 transition count 84
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 128 place count 59 transition count 75
Iterating global reduction 3 with 9 rules applied. Total rules applied 137 place count 59 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 59 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 58 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 58 transition count 72
Performed 31 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 203 place count 27 transition count 38
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 42 edges and 27 vertex of which 20 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 18 rules applied. Total rules applied 221 place count 20 transition count 21
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 222 place count 20 transition count 20
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 225 place count 20 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 226 place count 19 transition count 17
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 227 place count 19 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 228 place count 19 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 229 place count 18 transition count 15
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 5 rules applied. Total rules applied 234 place count 15 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 236 place count 13 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 236 place count 13 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 238 place count 12 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 239 place count 11 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 239 place count 11 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 241 place count 10 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 242 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 243 place count 9 transition count 10
Applied a total of 243 rules in 64 ms. Remains 9 /280 variables (removed 271) and now considering 10/369 (removed 359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 9/280 places, 10/369 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
FORMULA SmartHome-PT-18-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 60 stabilizing places and 59 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 369/369 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 260 transition count 349
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 260 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 260 transition count 347
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 250 transition count 337
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 250 transition count 337
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 70 place count 242 transition count 329
Iterating global reduction 1 with 8 rules applied. Total rules applied 78 place count 242 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 241 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 241 transition count 328
Applied a total of 80 rules in 58 ms. Remains 241 /280 variables (removed 39) and now considering 328/369 (removed 41) transitions.
// Phase 1: matrix 328 rows 241 cols
[2023-03-19 18:18:15] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 18:18:15] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-19 18:18:15] [INFO ] Invariant cache hit.
[2023-03-19 18:18:15] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-19 18:18:15] [INFO ] Invariant cache hit.
[2023-03-19 18:18:16] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/280 places, 328/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 241/280 places, 328/369 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-18-LTLCardinality-00 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 s175 0) (EQ s28 0) (EQ s128 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 422 ms.
Product exploration explored 100000 steps with 50000 reset in 359 ms.
Computed a total of 41 stabilizing places and 40 stable transitions
Computed a total of 41 stabilizing places and 40 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 SmartHome-PT-18-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-18-LTLCardinality-00 finished in 1913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 369/369 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 259 transition count 348
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 259 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 259 transition count 346
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 247 transition count 334
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 247 transition count 334
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 77 place count 238 transition count 325
Iterating global reduction 1 with 9 rules applied. Total rules applied 86 place count 238 transition count 325
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 236 transition count 323
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 236 transition count 323
Applied a total of 90 rules in 31 ms. Remains 236 /280 variables (removed 44) and now considering 323/369 (removed 46) transitions.
// Phase 1: matrix 323 rows 236 cols
[2023-03-19 18:18:17] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 18:18:17] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-19 18:18:17] [INFO ] Invariant cache hit.
[2023-03-19 18:18:17] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-19 18:18:17] [INFO ] Invariant cache hit.
[2023-03-19 18:18:17] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/280 places, 323/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 236/280 places, 323/369 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-18-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s114 0) (EQ s182 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]]
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-18-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLCardinality-01 finished in 718 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(p0) U ((p1&&X(p0))||X(G(p0)))))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 369/369 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 259 transition count 348
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 259 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 259 transition count 346
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 55 place count 248 transition count 335
Iterating global reduction 1 with 11 rules applied. Total rules applied 66 place count 248 transition count 335
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 74 place count 240 transition count 327
Iterating global reduction 1 with 8 rules applied. Total rules applied 82 place count 240 transition count 327
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 238 transition count 325
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 238 transition count 325
Applied a total of 86 rules in 63 ms. Remains 238 /280 variables (removed 42) and now considering 325/369 (removed 44) transitions.
// Phase 1: matrix 325 rows 238 cols
[2023-03-19 18:18:18] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-19 18:18:18] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-19 18:18:18] [INFO ] Invariant cache hit.
[2023-03-19 18:18:18] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-19 18:18:18] [INFO ] Invariant cache hit.
[2023-03-19 18:18:18] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/280 places, 325/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 681 ms. Remains : 238/280 places, 325/369 transitions.
Stuttering acceptance computed with spot in 354 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : SmartHome-PT-18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s114 1), p1:(NEQ s172 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLCardinality-02 finished in 1061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 369/369 transitions.
Graph (trivial) has 296 edges and 280 vertex of which 157 / 280 are part of one of the 14 SCC in 1 ms
Free SCC test removed 143 places
Ensure Unique test removed 191 transitions
Reduce isomorphic transitions removed 191 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 136 transition count 125
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 60 rules applied. Total rules applied 113 place count 84 transition count 117
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 118 place count 80 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 79 transition count 116
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 119 place count 79 transition count 113
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 125 place count 76 transition count 113
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 135 place count 66 transition count 101
Iterating global reduction 4 with 10 rules applied. Total rules applied 145 place count 66 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 66 transition count 99
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 65 transition count 98
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 65 transition count 98
Performed 33 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 215 place count 32 transition count 64
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 217 place count 30 transition count 57
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 30 transition count 57
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 236 place count 30 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 238 place count 28 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 238 place count 28 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 240 place count 27 transition count 39
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 242 place count 25 transition count 35
Iterating global reduction 6 with 2 rules applied. Total rules applied 244 place count 25 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 24 transition count 34
Applied a total of 245 rules in 55 ms. Remains 24 /280 variables (removed 256) and now considering 34/369 (removed 335) transitions.
[2023-03-19 18:18:19] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
// Phase 1: matrix 26 rows 24 cols
[2023-03-19 18:18:19] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 18:18:19] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 18:18:19] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
[2023-03-19 18:18:19] [INFO ] Invariant cache hit.
[2023-03-19 18:18:19] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-19 18:18:19] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 18:18:19] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
[2023-03-19 18:18:19] [INFO ] Invariant cache hit.
[2023-03-19 18:18:19] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/280 places, 34/369 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 24/280 places, 34/369 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-18-LTLCardinality-05 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 s4 0) (EQ s3 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]]
Stuttering criterion allowed to conclude after 40 steps with 1 reset in 1 ms.
FORMULA SmartHome-PT-18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLCardinality-05 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||G(p1)))&&(F(p2) U p3))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 369/369 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 262 transition count 351
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 262 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 262 transition count 349
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 253 transition count 340
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 253 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 246 transition count 333
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 246 transition count 333
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 244 transition count 331
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 244 transition count 331
Applied a total of 74 rules in 28 ms. Remains 244 /280 variables (removed 36) and now considering 331/369 (removed 38) transitions.
// Phase 1: matrix 331 rows 244 cols
[2023-03-19 18:18:19] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 18:18:19] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-19 18:18:19] [INFO ] Invariant cache hit.
[2023-03-19 18:18:19] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-19 18:18:19] [INFO ] Invariant cache hit.
[2023-03-19 18:18:20] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 244/280 places, 331/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 642 ms. Remains : 244/280 places, 331/369 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p3), true, (NOT p1)]
Running random walk in product with property : SmartHome-PT-18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s54 0), p2:(OR (EQ s188 0) (EQ s101 1)), p0:(AND (EQ s101 0) (EQ s188 1)), p1:(EQ s207 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLCardinality-07 finished in 951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(((!p1||F(!p2)) U (G((!p1||F(!p2)))||(X(G(p3))&&(!p1||F(!p2)))))))))'
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 369/369 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 263 transition count 352
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 263 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 263 transition count 350
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 254 transition count 341
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 254 transition count 341
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 248 transition count 335
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 248 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 247 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 247 transition count 334
Applied a total of 68 rules in 23 ms. Remains 247 /280 variables (removed 33) and now considering 334/369 (removed 35) transitions.
// Phase 1: matrix 334 rows 247 cols
[2023-03-19 18:18:20] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 18:18:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-19 18:18:20] [INFO ] Invariant cache hit.
[2023-03-19 18:18:20] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-19 18:18:20] [INFO ] Invariant cache hit.
[2023-03-19 18:18:20] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 247/280 places, 334/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 247/280 places, 334/369 transitions.
Stuttering acceptance computed with spot in 659 ms :[(AND (NOT p0) p1 p2), (AND p1 p2), (AND (NOT p0) p1 p2), (AND p1 p2), p2, (AND p2 p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND p2 (NOT p1) (NOT p3)), (AND p2 p1 (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 p3)), (AND p2 (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : SmartHome-PT-18-LTLCardinality-08 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: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=(AND p1 p2 p3), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 8}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=8 dest: 9}, { cond=(AND p0 p1 p2 p3), acceptance={} source=8 dest: 10}], [{ cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 p3)), acceptance={} source=9 dest: 4}, { cond=(OR (AND p0 (NOT p1) p2) (AND p0 p2 p3)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=10 dest: 7}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (EQ s140 0) (EQ s14 1)), p1:(OR (EQ s81 0) (EQ s80 1)), p2:(OR (EQ s82 0) (EQ s223 1)), p3:(NEQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 510 steps with 5 reset in 6 ms.
FORMULA SmartHome-PT-18-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLCardinality-08 finished in 1270 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((G(p1)||p0))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 369/369 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 260 transition count 349
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 260 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 260 transition count 347
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 249 transition count 336
Iterating global reduction 1 with 11 rules applied. Total rules applied 64 place count 249 transition count 336
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 72 place count 241 transition count 328
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 241 transition count 328
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 239 transition count 326
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 239 transition count 326
Applied a total of 84 rules in 30 ms. Remains 239 /280 variables (removed 41) and now considering 326/369 (removed 43) transitions.
// Phase 1: matrix 326 rows 239 cols
[2023-03-19 18:18:21] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 18:18:21] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-19 18:18:21] [INFO ] Invariant cache hit.
[2023-03-19 18:18:22] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-19 18:18:22] [INFO ] Invariant cache hit.
[2023-03-19 18:18:22] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/280 places, 326/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 239/280 places, 326/369 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s126 0) (EQ s50 1)), p0:(OR (EQ s50 0) (EQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 687 steps with 2 reset in 4 ms.
FORMULA SmartHome-PT-18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLCardinality-09 finished in 976 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 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 369/369 transitions.
Graph (trivial) has 293 edges and 280 vertex of which 155 / 280 are part of one of the 13 SCC in 2 ms
Free SCC test removed 142 places
Ensure Unique test removed 189 transitions
Reduce isomorphic transitions removed 189 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 137 transition count 130
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 88 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 86 transition count 126
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 105 place count 86 transition count 122
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 113 place count 82 transition count 122
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 123 place count 72 transition count 110
Iterating global reduction 3 with 10 rules applied. Total rules applied 133 place count 72 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 72 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 71 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 71 transition count 107
Performed 36 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 209 place count 35 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 212 place count 32 transition count 57
Iterating global reduction 4 with 3 rules applied. Total rules applied 215 place count 32 transition count 57
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 231 place count 32 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 31 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 232 place count 31 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 30 transition count 40
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 236 place count 28 transition count 36
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 28 transition count 36
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 239 place count 28 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 240 place count 27 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 26 transition count 35
Applied a total of 241 rules in 71 ms. Remains 26 /280 variables (removed 254) and now considering 35/369 (removed 334) transitions.
[2023-03-19 18:18:22] [INFO ] Flow matrix only has 29 transitions (discarded 6 similar events)
// Phase 1: matrix 29 rows 26 cols
[2023-03-19 18:18:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 18:18:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 18:18:22] [INFO ] Flow matrix only has 29 transitions (discarded 6 similar events)
[2023-03-19 18:18:22] [INFO ] Invariant cache hit.
[2023-03-19 18:18:22] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-19 18:18:22] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-19 18:18:22] [INFO ] Flow matrix only has 29 transitions (discarded 6 similar events)
[2023-03-19 18:18:22] [INFO ] Invariant cache hit.
[2023-03-19 18:18:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/280 places, 35/369 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 26/280 places, 35/369 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-18-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s21 0) (NEQ s2 1) (OR (EQ s4 0) (EQ s8 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 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLCardinality-10 finished in 321 ms.
All properties solved by simple procedures.
Total runtime 12053 ms.

BK_STOP 1679249904068

--------------------
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="SmartHome-PT-18"
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 SmartHome-PT-18, 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 r453-smll-167912645200291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-18.tgz
mv SmartHome-PT-18 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;