fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r240-smll-165303241600274
Last Updated
Jun 22, 2022

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
536.220 59187.00 77318.00 321.90 FTTFFTTTTTFTFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r240-smll-165303241600274.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmartHome-PT-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241600274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 7.2K Apr 29 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 15:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 15:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 09:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 71K May 10 09:34 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-11-CTLFireability-00
FORMULA_NAME SmartHome-PT-11-CTLFireability-01
FORMULA_NAME SmartHome-PT-11-CTLFireability-02
FORMULA_NAME SmartHome-PT-11-CTLFireability-03
FORMULA_NAME SmartHome-PT-11-CTLFireability-04
FORMULA_NAME SmartHome-PT-11-CTLFireability-05
FORMULA_NAME SmartHome-PT-11-CTLFireability-06
FORMULA_NAME SmartHome-PT-11-CTLFireability-07
FORMULA_NAME SmartHome-PT-11-CTLFireability-08
FORMULA_NAME SmartHome-PT-11-CTLFireability-09
FORMULA_NAME SmartHome-PT-11-CTLFireability-10
FORMULA_NAME SmartHome-PT-11-CTLFireability-11
FORMULA_NAME SmartHome-PT-11-CTLFireability-12
FORMULA_NAME SmartHome-PT-11-CTLFireability-13
FORMULA_NAME SmartHome-PT-11-CTLFireability-14
FORMULA_NAME SmartHome-PT-11-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1653108379723

Running Version 202205111006
[2022-05-21 04:46:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 04:46:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:46:22] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2022-05-21 04:46:22] [INFO ] Transformed 290 places.
[2022-05-21 04:46:22] [INFO ] Transformed 315 transitions.
[2022-05-21 04:46:22] [INFO ] Found NUPN structural information;
[2022-05-21 04:46:22] [INFO ] Parsed PT model containing 290 places and 315 transitions in 303 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Deduced a syphon composed of 66 places in 7 ms
Reduce places removed 66 places and 55 transitions.
Support contains 50 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 260/260 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 215 transition count 260
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 51 place count 173 transition count 218
Iterating global reduction 1 with 42 rules applied. Total rules applied 93 place count 173 transition count 218
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 98 place count 173 transition count 213
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 168 transition count 208
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 168 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 165 transition count 205
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 165 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 165 transition count 204
Applied a total of 115 rules in 71 ms. Remains 165 /224 variables (removed 59) and now considering 204/260 (removed 56) transitions.
// Phase 1: matrix 204 rows 165 cols
[2022-05-21 04:46:22] [INFO ] Computed 3 place invariants in 21 ms
[2022-05-21 04:46:23] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 204 rows 165 cols
[2022-05-21 04:46:23] [INFO ] Computed 3 place invariants in 12 ms
[2022-05-21 04:46:23] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
// Phase 1: matrix 204 rows 165 cols
[2022-05-21 04:46:23] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 04:46:23] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/224 places, 204/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/224 places, 204/260 transitions.
Support contains 50 out of 165 places after structural reductions.
[2022-05-21 04:46:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-21 04:46:23] [INFO ] Flatten gal took : 71 ms
[2022-05-21 04:46:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-11-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 04:46:23] [INFO ] Flatten gal took : 30 ms
[2022-05-21 04:46:23] [INFO ] Input system was already deterministic with 204 transitions.
Support contains 41 out of 165 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 770 ms. (steps per millisecond=12 ) properties (out of 39) seen :35
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 204 rows 165 cols
[2022-05-21 04:46:25] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:46:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-21 04:46:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:46:25] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-05-21 04:46:25] [INFO ] After 178ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-21 04:46:25] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-21 04:46:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-21 04:46:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:46:25] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-21 04:46:25] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-05-21 04:46:25] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 165/165 places, 204/204 transitions.
Graph (trivial) has 161 edges and 165 vertex of which 79 / 165 are part of one of the 6 SCC in 5 ms
Free SCC test removed 73 places
Drop transitions removed 105 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 106 transitions.
Graph (complete) has 137 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 90 transition count 60
Reduce places removed 36 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 44 rules applied. Total rules applied 84 place count 54 transition count 52
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 50 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 50 transition count 51
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 49 transition count 51
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 99 place count 40 transition count 42
Iterating global reduction 3 with 9 rules applied. Total rules applied 108 place count 40 transition count 42
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 142 place count 23 transition count 24
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 35 edges and 23 vertex of which 18 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 153 place count 18 transition count 14
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 155 place count 18 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 17 transition count 11
Reduce places removed 4 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 5 with 6 rules applied. Total rules applied 162 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 164 place count 11 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 164 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 168 place count 9 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 169 place count 8 transition count 6
Applied a total of 169 rules in 36 ms. Remains 8 /165 variables (removed 157) and now considering 6/204 (removed 198) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/165 places, 6/204 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=5 )
[2022-05-21 04:46:25] [INFO ] Flatten gal took : 17 ms
[2022-05-21 04:46:25] [INFO ] Flatten gal took : 15 ms
[2022-05-21 04:46:25] [INFO ] Input system was already deterministic with 204 transitions.
Computed a total of 50 stabilizing places and 49 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 146 transition count 185
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 146 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 146 transition count 184
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 139 transition count 177
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 139 transition count 177
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 133 transition count 171
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 133 transition count 171
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 131 transition count 169
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 131 transition count 169
Applied a total of 69 rules in 41 ms. Remains 131 /165 variables (removed 34) and now considering 169/204 (removed 35) transitions.
// Phase 1: matrix 169 rows 131 cols
[2022-05-21 04:46:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:46:26] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 169 rows 131 cols
[2022-05-21 04:46:26] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 04:46:26] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
// Phase 1: matrix 169 rows 131 cols
[2022-05-21 04:46:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:46:26] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/165 places, 169/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/165 places, 169/204 transitions.
[2022-05-21 04:46:26] [INFO ] Flatten gal took : 21 ms
[2022-05-21 04:46:26] [INFO ] Flatten gal took : 17 ms
[2022-05-21 04:46:26] [INFO ] Input system was already deterministic with 169 transitions.
[2022-05-21 04:46:26] [INFO ] Flatten gal took : 16 ms
[2022-05-21 04:46:26] [INFO ] Flatten gal took : 16 ms
[2022-05-21 04:46:26] [INFO ] Time to serialize gal into /tmp/CTLFireability795556955348360579.gal : 6 ms
[2022-05-21 04:46:26] [INFO ] Time to serialize properties into /tmp/CTLFireability10309403747331501288.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability795556955348360579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10309403747331501288.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.78045e+09,0.282208,10124,2,1741,5,24218,6,0,689,26640,0


Converting to forward existential form...Done !
original formula: AG((AG(EX(EX((p95==0)))) * A(E(EX((p86==1)) U EF((p196==1))) U !(EX(A((p106==1) U (p39==1)))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * !(EX(EX((p95==0)))))] = FALSE * ([((EY((FwdU(FwdU(Init,TRUE),!(!(EX(!((E(!((p39=...458
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t35, t64, t67, t84, t88, t109, t112, t124, t143, t146, t149, t151, t155, Inter...249
(forward)formula 0,0,8.49291,232596,1,0,559,1.41013e+06,369,324,3816,1.58888e+06,717
FORMULA SmartHome-PT-11-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Graph (trivial) has 157 edges and 165 vertex of which 61 / 165 are part of one of the 5 SCC in 2 ms
Free SCC test removed 56 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 108 transition count 86
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 55 rules applied. Total rules applied 101 place count 63 transition count 76
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 106 place count 58 transition count 76
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 106 place count 58 transition count 74
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 56 transition count 74
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 120 place count 46 transition count 64
Iterating global reduction 3 with 10 rules applied. Total rules applied 130 place count 46 transition count 64
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 164 place count 29 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 166 place count 29 transition count 44
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 169 place count 28 transition count 42
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 171 place count 27 transition count 41
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 181 place count 27 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 183 place count 25 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 183 place count 25 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 185 place count 24 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 186 place count 23 transition count 29
Applied a total of 186 rules in 26 ms. Remains 23 /165 variables (removed 142) and now considering 29/204 (removed 175) transitions.
[2022-05-21 04:46:35] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 04:46:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:46:35] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-21 04:46:35] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 04:46:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:46:35] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-21 04:46:35] [INFO ] Redundant transitions in 25 ms returned []
[2022-05-21 04:46:35] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 04:46:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:46:35] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 23/165 places, 29/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/165 places, 29/204 transitions.
[2022-05-21 04:46:35] [INFO ] Flatten gal took : 3 ms
[2022-05-21 04:46:35] [INFO ] Flatten gal took : 3 ms
[2022-05-21 04:46:35] [INFO ] Input system was already deterministic with 29 transitions.
[2022-05-21 04:46:35] [INFO ] Flatten gal took : 2 ms
[2022-05-21 04:46:35] [INFO ] Flatten gal took : 2 ms
[2022-05-21 04:46:35] [INFO ] Time to serialize gal into /tmp/CTLFireability8961678600365657314.gal : 1 ms
[2022-05-21 04:46:35] [INFO ] Time to serialize properties into /tmp/CTLFireability6113286154948415495.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8961678600365657314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6113286154948415495.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,15552,0.006741,4540,2,83,5,380,6,0,108,337,0


Converting to forward existential form...Done !
original formula: AF(((EF(AG((p85==0))) * (p86==0)) * EF((p215==0))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U !(E(TRUE U !((p85==0))))) * (p86==0)) * E(TRUE U (p215==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t11, t12, t22, t23, Intersection with reachable at each step enabled. (destroyed/reverse...183
(forward)formula 0,1,0.030742,5504,1,0,68,5591,83,36,643,5680,80
FORMULA SmartHome-PT-11-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Graph (trivial) has 162 edges and 165 vertex of which 79 / 165 are part of one of the 6 SCC in 1 ms
Free SCC test removed 73 places
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 91 transition count 72
Reduce places removed 37 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 45 rules applied. Total rules applied 83 place count 54 transition count 64
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 50 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 87 place count 50 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 48 transition count 62
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 100 place count 39 transition count 53
Iterating global reduction 3 with 9 rules applied. Total rules applied 109 place count 39 transition count 53
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 141 place count 23 transition count 36
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 150 place count 23 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 151 place count 22 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 20 transition count 25
Applied a total of 153 rules in 23 ms. Remains 20 /165 variables (removed 145) and now considering 25/204 (removed 179) transitions.
[2022-05-21 04:46:35] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 20 cols
[2022-05-21 04:46:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-21 04:46:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-21 04:46:35] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 20 cols
[2022-05-21 04:46:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:46:35] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-21 04:46:35] [INFO ] Redundant transitions in 28 ms returned []
[2022-05-21 04:46:35] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 20 cols
[2022-05-21 04:46:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-21 04:46:35] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 20/165 places, 25/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/165 places, 25/204 transitions.
[2022-05-21 04:46:35] [INFO ] Flatten gal took : 2 ms
[2022-05-21 04:46:35] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:46:35] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA SmartHome-PT-11-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 148 transition count 187
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 148 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 148 transition count 186
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 138 transition count 176
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 138 transition count 176
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 131 transition count 169
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 131 transition count 169
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 128 transition count 166
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 128 transition count 166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 127 transition count 165
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 127 transition count 165
Applied a total of 77 rules in 23 ms. Remains 127 /165 variables (removed 38) and now considering 165/204 (removed 39) transitions.
// Phase 1: matrix 165 rows 127 cols
[2022-05-21 04:46:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:46:35] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 165 rows 127 cols
[2022-05-21 04:46:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:46:35] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
// Phase 1: matrix 165 rows 127 cols
[2022-05-21 04:46:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:46:35] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/165 places, 165/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/165 places, 165/204 transitions.
[2022-05-21 04:46:35] [INFO ] Flatten gal took : 14 ms
[2022-05-21 04:46:35] [INFO ] Flatten gal took : 14 ms
[2022-05-21 04:46:36] [INFO ] Input system was already deterministic with 165 transitions.
[2022-05-21 04:46:36] [INFO ] Flatten gal took : 14 ms
[2022-05-21 04:46:36] [INFO ] Flatten gal took : 13 ms
[2022-05-21 04:46:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12964901901398916297.gal : 5 ms
[2022-05-21 04:46:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13533591816936643902.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12964901901398916297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13533591816936643902.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44125e+10,0.135376,8384,2,1476,5,17284,6,0,669,18736,0


Converting to forward existential form...Done !
original formula: AX((!(E((!(E(((p2==1)&&(p227==1)) U ((p2==1)&&(p227==1)))) + (p222!=1)) U (((p143==1) * AF((p29==1))) * EG((p85==1))))) * ((AF((p238==1))...215
=> equivalent forward existential formula: ([FwdG((FwdU(EY(Init),(!(E(((p2==1)&&(p227==1)) U ((p2==1)&&(p227==1)))) + (p222!=1))) * ((p143==1) * !(EG(!((p2...409
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t61, t64, t81, t84, t101, t104, t105, t106, t119, t139, t142, t147, t1...259
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 163/0/2
(forward)formula 0,0,13.4844,348656,1,0,1182,1.83186e+06,397,744,4333,2.71794e+06,1550
FORMULA SmartHome-PT-11-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 145 transition count 184
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 145 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 145 transition count 183
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 139 transition count 177
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 139 transition count 177
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 135 transition count 173
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 135 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 134 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 134 transition count 172
Applied a total of 63 rules in 14 ms. Remains 134 /165 variables (removed 31) and now considering 172/204 (removed 32) transitions.
// Phase 1: matrix 172 rows 134 cols
[2022-05-21 04:46:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:46:49] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 172 rows 134 cols
[2022-05-21 04:46:49] [INFO ] Computed 3 place invariants in 10 ms
[2022-05-21 04:46:49] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
// Phase 1: matrix 172 rows 134 cols
[2022-05-21 04:46:49] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:46:50] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/165 places, 172/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/165 places, 172/204 transitions.
[2022-05-21 04:46:50] [INFO ] Flatten gal took : 11 ms
[2022-05-21 04:46:50] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:46:50] [INFO ] Input system was already deterministic with 172 transitions.
[2022-05-21 04:46:50] [INFO ] Flatten gal took : 12 ms
[2022-05-21 04:46:50] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:46:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12724810905241756997.gal : 22 ms
[2022-05-21 04:46:50] [INFO ] Time to serialize properties into /tmp/CTLFireability7639467791682957811.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12724810905241756997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7639467791682957811.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24569e+10,0.235119,9452,2,1483,5,20202,6,0,704,22708,0


Converting to forward existential form...Done !
original formula: A((E(!(A(((p131==1)&&(p43==1)) U EG(((p286==1)&&(p289==1))))) U AF((p97==1))) + (p89==1)) U EF(((EX(AG((p101==1))) * (EX((p34==1)) + (p35...207
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((EX(!(E(TRUE U !((p101==1))))) * (EX((p34==1)) + (p35==1))) * (!(E(TRUE U !((p173==1)...653
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t29, t34, t64, t67, t84, t87, t105, t110, t122, t127, t146, t149, t152, t154, t158, ...255
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.8417,333948,1,0,968,1.91927e+06,393,633,4317,2.52574e+06,1152
FORMULA SmartHome-PT-11-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Graph (trivial) has 161 edges and 165 vertex of which 76 / 165 are part of one of the 6 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 94 transition count 75
Reduce places removed 38 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 46 rules applied. Total rules applied 85 place count 56 transition count 67
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 89 place count 52 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 89 place count 52 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 50 transition count 65
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 103 place count 40 transition count 55
Iterating global reduction 3 with 10 rules applied. Total rules applied 113 place count 40 transition count 55
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 145 place count 24 transition count 38
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 155 place count 24 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 22 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 157 place count 22 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 21 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 20 transition count 26
Applied a total of 160 rules in 15 ms. Remains 20 /165 variables (removed 145) and now considering 26/204 (removed 178) transitions.
[2022-05-21 04:47:02] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 20 cols
[2022-05-21 04:47:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:47:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-21 04:47:02] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 20 cols
[2022-05-21 04:47:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:47:02] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-21 04:47:02] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-21 04:47:02] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 20 cols
[2022-05-21 04:47:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:47:02] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 20/165 places, 26/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/165 places, 26/204 transitions.
[2022-05-21 04:47:02] [INFO ] Flatten gal took : 2 ms
[2022-05-21 04:47:02] [INFO ] Flatten gal took : 1 ms
[2022-05-21 04:47:02] [INFO ] Input system was already deterministic with 26 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
FORMULA SmartHome-PT-11-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 145 transition count 184
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 145 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 145 transition count 183
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 137 transition count 175
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 137 transition count 175
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 130 transition count 168
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 130 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 128 transition count 166
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 128 transition count 166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 127 transition count 165
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 127 transition count 165
Applied a total of 77 rules in 13 ms. Remains 127 /165 variables (removed 38) and now considering 165/204 (removed 39) transitions.
// Phase 1: matrix 165 rows 127 cols
[2022-05-21 04:47:02] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:47:02] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 165 rows 127 cols
[2022-05-21 04:47:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:02] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 165 rows 127 cols
[2022-05-21 04:47:02] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-21 04:47:02] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/165 places, 165/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/165 places, 165/204 transitions.
[2022-05-21 04:47:02] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:47:02] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:47:02] [INFO ] Input system was already deterministic with 165 transitions.
[2022-05-21 04:47:02] [INFO ] Flatten gal took : 13 ms
[2022-05-21 04:47:02] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:47:02] [INFO ] Time to serialize gal into /tmp/CTLFireability11303938046367778788.gal : 2 ms
[2022-05-21 04:47:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17680919025970453859.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11303938046367778788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17680919025970453859.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.69258e+09,0.118394,8184,2,1287,5,15391,6,0,669,16496,0


Converting to forward existential form...Done !
original formula: AG((((p2==0)||(p227==0)) + EG(EX(((p42==0)||(p120==0))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p2==0)||(p227==0)))) * !(EG(EX(((p42==0)||(p120==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t79, t84, t101, t104, t116, t119, t139, t142, t145, t147, t151, ...255
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.02839,36068,1,0,246,168460,356,167,3923,160426,380
FORMULA SmartHome-PT-11-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 143 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 143 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 143 transition count 181
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 133 transition count 171
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 133 transition count 171
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 125 transition count 163
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 125 transition count 163
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 122 transition count 160
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 121 transition count 159
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 121 transition count 159
Applied a total of 89 rules in 13 ms. Remains 121 /165 variables (removed 44) and now considering 159/204 (removed 45) transitions.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:47:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:03] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:47:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:04] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:47:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:04] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/165 places, 159/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/165 places, 159/204 transitions.
[2022-05-21 04:47:04] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:47:04] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:47:04] [INFO ] Input system was already deterministic with 159 transitions.
[2022-05-21 04:47:04] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:47:04] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:47:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13326618626995126832.gal : 2 ms
[2022-05-21 04:47:04] [INFO ] Time to serialize properties into /tmp/CTLFireability3490007365750982872.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13326618626995126832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3490007365750982872.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.55823e+09,0.233468,10452,2,1747,5,25965,6,0,639,27348,0


Converting to forward existential form...Done !
original formula: EF(AX((p112==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((p112==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t79, t82, t99, t102, t114, t133, t136, t139, t141, t145, Inters...248
(forward)formula 0,1,1.39809,39012,1,0,205,170991,335,139,3460,179479,325
FORMULA SmartHome-PT-11-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 143 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 143 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 143 transition count 181
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 134 transition count 172
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 134 transition count 172
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 126 transition count 164
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 126 transition count 164
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 123 transition count 161
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 123 transition count 161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 122 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 122 transition count 160
Applied a total of 87 rules in 11 ms. Remains 122 /165 variables (removed 43) and now considering 160/204 (removed 44) transitions.
// Phase 1: matrix 160 rows 122 cols
[2022-05-21 04:47:05] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:05] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 160 rows 122 cols
[2022-05-21 04:47:05] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:47:05] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 122 cols
[2022-05-21 04:47:05] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:05] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/165 places, 160/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/165 places, 160/204 transitions.
[2022-05-21 04:47:06] [INFO ] Flatten gal took : 12 ms
[2022-05-21 04:47:06] [INFO ] Flatten gal took : 12 ms
[2022-05-21 04:47:06] [INFO ] Input system was already deterministic with 160 transitions.
[2022-05-21 04:47:06] [INFO ] Flatten gal took : 12 ms
[2022-05-21 04:47:06] [INFO ] Flatten gal took : 12 ms
[2022-05-21 04:47:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6903819148295855847.gal : 3 ms
[2022-05-21 04:47:06] [INFO ] Time to serialize properties into /tmp/CTLFireability8759893162080779187.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6903819148295855847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8759893162080779187.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.06211e+09,0.302365,10496,2,1720,5,25375,6,0,644,26921,0


Converting to forward existential form...Done !
original formula: AG(EF(AX((p207==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((p207==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t28, t31, t60, t63, t80, t83, t100, t103, t115, t134, t137, t140, t142, t146, Inter...249
(forward)formula 0,1,1.65068,43328,1,0,208,195519,342,141,3673,192315,334
FORMULA SmartHome-PT-11-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 144 transition count 183
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 144 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 144 transition count 182
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 136 transition count 174
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 136 transition count 174
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 129 transition count 167
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 129 transition count 167
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 127 transition count 165
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 127 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 126 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 126 transition count 164
Applied a total of 79 rules in 11 ms. Remains 126 /165 variables (removed 39) and now considering 164/204 (removed 40) transitions.
// Phase 1: matrix 164 rows 126 cols
[2022-05-21 04:47:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:07] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 164 rows 126 cols
[2022-05-21 04:47:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:07] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 126 cols
[2022-05-21 04:47:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:08] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/165 places, 164/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/165 places, 164/204 transitions.
[2022-05-21 04:47:08] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:47:08] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:47:08] [INFO ] Input system was already deterministic with 164 transitions.
[2022-05-21 04:47:08] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:47:08] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:47:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15113883883897493695.gal : 1 ms
[2022-05-21 04:47:08] [INFO ] Time to serialize properties into /tmp/CTLFireability11530492375307974695.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15113883883897493695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11530492375307974695.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.85112e+09,0.15038,8796,2,1423,5,18893,6,0,664,20111,0


Converting to forward existential form...Done !
original formula: AG(!(A(EG((p207==1)) U ((p186==1) + EX((p135==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((p186==1) + EX((p135==1))))))) * !(E(!(((p186==1) + EX((p135==1)))) U (!(EG((p207==...205
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t28, t31, t60, t64, t84, t87, t104, t107, t119, t138, t141, t144, t146, t150, Inter...249
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.98363,201728,1,0,620,1.2139e+06,358,414,3896,1.4318e+06,721
FORMULA SmartHome-PT-11-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Graph (trivial) has 149 edges and 165 vertex of which 55 / 165 are part of one of the 4 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 113 transition count 92
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 56 rules applied. Total rules applied 102 place count 68 transition count 81
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 62 transition count 81
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 108 place count 62 transition count 77
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 116 place count 58 transition count 77
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 127 place count 47 transition count 66
Iterating global reduction 3 with 11 rules applied. Total rules applied 138 place count 47 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 47 transition count 65
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 46 transition count 64
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 46 transition count 64
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 173 place count 30 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 175 place count 30 transition count 45
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 177 place count 29 transition count 44
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 183 place count 29 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 184 place count 28 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 184 place count 28 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 186 place count 27 transition count 37
Applied a total of 186 rules in 19 ms. Remains 27 /165 variables (removed 138) and now considering 37/204 (removed 167) transitions.
[2022-05-21 04:47:15] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 27 cols
[2022-05-21 04:47:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:47:15] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-05-21 04:47:15] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 27 cols
[2022-05-21 04:47:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:47:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-21 04:47:15] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-05-21 04:47:15] [INFO ] Redundant transitions in 22 ms returned []
[2022-05-21 04:47:15] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 27 cols
[2022-05-21 04:47:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-21 04:47:15] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 27/165 places, 37/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/165 places, 37/204 transitions.
[2022-05-21 04:47:15] [INFO ] Flatten gal took : 2 ms
[2022-05-21 04:47:15] [INFO ] Flatten gal took : 2 ms
[2022-05-21 04:47:15] [INFO ] Input system was already deterministic with 37 transitions.
[2022-05-21 04:47:15] [INFO ] Flatten gal took : 2 ms
[2022-05-21 04:47:15] [INFO ] Flatten gal took : 3 ms
[2022-05-21 04:47:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1369877735173021969.gal : 1 ms
[2022-05-21 04:47:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2162367820370483484.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1369877735173021969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2162367820370483484.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,43201,0.009435,4564,2,89,5,494,6,0,136,427,0


Converting to forward existential form...Done !
original formula: EF(EG(((EF(((p2==1)&&(p55==1))) + (p117==1)) + ((p192==1)||(p42==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((E(TRUE U ((p2==1)&&(p55==1))) + (p117==1)) + ((p192==1)||(p42==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t7, t9, t16, t19, t21, t30, t33, Intersection with reachable at each step en...209
(forward)formula 0,1,0.034642,5968,1,0,91,5604,99,48,866,5480,92
FORMULA SmartHome-PT-11-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Graph (trivial) has 163 edges and 165 vertex of which 79 / 165 are part of one of the 6 SCC in 1 ms
Free SCC test removed 73 places
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 92 transition count 73
Reduce places removed 37 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 45 rules applied. Total rules applied 83 place count 55 transition count 65
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 51 transition count 65
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 87 place count 51 transition count 63
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 49 transition count 63
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 101 place count 39 transition count 53
Iterating global reduction 3 with 10 rules applied. Total rules applied 111 place count 39 transition count 53
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 145 place count 22 transition count 35
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 155 place count 22 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 20 transition count 25
Applied a total of 157 rules in 13 ms. Remains 20 /165 variables (removed 145) and now considering 25/204 (removed 179) transitions.
[2022-05-21 04:47:15] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 20 cols
[2022-05-21 04:47:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:47:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-21 04:47:15] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 20 cols
[2022-05-21 04:47:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:47:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-21 04:47:15] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-21 04:47:15] [INFO ] Redundant transitions in 37 ms returned []
[2022-05-21 04:47:15] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 20 cols
[2022-05-21 04:47:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:47:15] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 20/165 places, 25/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/165 places, 25/204 transitions.
[2022-05-21 04:47:15] [INFO ] Flatten gal took : 2 ms
[2022-05-21 04:47:15] [INFO ] Flatten gal took : 1 ms
[2022-05-21 04:47:15] [INFO ] Input system was already deterministic with 25 transitions.
[2022-05-21 04:47:15] [INFO ] Flatten gal took : 1 ms
[2022-05-21 04:47:15] [INFO ] Flatten gal took : 1 ms
[2022-05-21 04:47:15] [INFO ] Time to serialize gal into /tmp/CTLFireability13099766356034731714.gal : 1 ms
[2022-05-21 04:47:15] [INFO ] Time to serialize properties into /tmp/CTLFireability11703524682101500276.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13099766356034731714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11703524682101500276.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4481,0.010021,4512,2,71,5,368,6,0,95,422,0


Converting to forward existential form...Done !
original formula: EF(AG((p231==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p231==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t9, t11, t14, t16, t20, Intersection with reachable at each step enabled. (d...199
(forward)formula 0,0,0.024997,5064,1,0,62,2279,66,28,572,1972,54
FORMULA SmartHome-PT-11-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 143 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 143 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 143 transition count 181
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 134 transition count 172
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 134 transition count 172
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 70 place count 127 transition count 165
Iterating global reduction 1 with 7 rules applied. Total rules applied 77 place count 127 transition count 165
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 124 transition count 162
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 124 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 123 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 123 transition count 161
Applied a total of 85 rules in 8 ms. Remains 123 /165 variables (removed 42) and now considering 161/204 (removed 43) transitions.
// Phase 1: matrix 161 rows 123 cols
[2022-05-21 04:47:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:15] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 161 rows 123 cols
[2022-05-21 04:47:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:15] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 123 cols
[2022-05-21 04:47:15] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:47:16] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/165 places, 161/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/165 places, 161/204 transitions.
[2022-05-21 04:47:16] [INFO ] Flatten gal took : 11 ms
[2022-05-21 04:47:16] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:47:16] [INFO ] Input system was already deterministic with 161 transitions.
[2022-05-21 04:47:16] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:47:16] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:47:16] [INFO ] Time to serialize gal into /tmp/CTLFireability7085912946630616935.gal : 2 ms
[2022-05-21 04:47:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8528367699114284595.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7085912946630616935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8528367699114284595.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.56944e+09,0.15718,8804,2,1410,5,17938,6,0,649,19598,0


Converting to forward existential form...Done !
original formula: EX((p230==1))
=> equivalent forward existential formula: [(EY(Init) * (p230==1))] != FALSE
(forward)formula 0,0,0.164079,9188,1,0,8,17938,8,1,796,19598,2
FORMULA SmartHome-PT-11-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 204/204 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 143 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 143 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 143 transition count 181
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 133 transition count 171
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 133 transition count 171
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 125 transition count 163
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 125 transition count 163
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 122 transition count 160
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 121 transition count 159
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 121 transition count 159
Applied a total of 89 rules in 13 ms. Remains 121 /165 variables (removed 44) and now considering 159/204 (removed 45) transitions.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:47:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:16] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:47:16] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 04:47:16] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:47:16] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:47:16] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/165 places, 159/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/165 places, 159/204 transitions.
[2022-05-21 04:47:16] [INFO ] Flatten gal took : 11 ms
[2022-05-21 04:47:16] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:47:16] [INFO ] Input system was already deterministic with 159 transitions.
[2022-05-21 04:47:16] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:47:16] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:47:16] [INFO ] Time to serialize gal into /tmp/CTLFireability65135044083094999.gal : 2 ms
[2022-05-21 04:47:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11148613599663553966.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability65135044083094999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11148613599663553966.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.55823e+09,0.203575,10324,2,1747,5,25965,6,0,639,27348,0


Converting to forward existential form...Done !
original formula: AG(EF(EX((p163==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX((p163==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t79, t82, t99, t102, t114, t133, t136, t139, t141, t145, Inters...248
(forward)formula 0,0,2.09069,48852,1,0,209,237114,339,141,3642,219968,332
FORMULA SmartHome-PT-11-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2022-05-21 04:47:18] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:47:18] [INFO ] Flatten gal took : 7 ms
Total runtime 56586 ms.

BK_STOP 1653108438910

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-11"
export BK_EXAMINATION="CTLFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-11, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-smll-165303241600274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-11.tgz
mv SmartHome-PT-11 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;