Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475300356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DES-PT-00b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475300356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 15:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 66K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-00b-LTLFireability-00
FORMULA_NAME DES-PT-00b-LTLFireability-01
FORMULA_NAME DES-PT-00b-LTLFireability-02
FORMULA_NAME DES-PT-00b-LTLFireability-03
FORMULA_NAME DES-PT-00b-LTLFireability-04
FORMULA_NAME DES-PT-00b-LTLFireability-05
FORMULA_NAME DES-PT-00b-LTLFireability-06
FORMULA_NAME DES-PT-00b-LTLFireability-07
FORMULA_NAME DES-PT-00b-LTLFireability-08
FORMULA_NAME DES-PT-00b-LTLFireability-09
FORMULA_NAME DES-PT-00b-LTLFireability-10
FORMULA_NAME DES-PT-00b-LTLFireability-11
FORMULA_NAME DES-PT-00b-LTLFireability-12
FORMULA_NAME DES-PT-00b-LTLFireability-13
FORMULA_NAME DES-PT-00b-LTLFireability-14
FORMULA_NAME DES-PT-00b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678258862864

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-00b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 07:01:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 07:01:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 07:01:04] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-08 07:01:04] [INFO ] Transformed 271 places.
[2023-03-08 07:01:04] [INFO ] Transformed 230 transitions.
[2023-03-08 07:01:04] [INFO ] Found NUPN structural information;
[2023-03-08 07:01:04] [INFO ] Parsed PT model containing 271 places and 230 transitions and 658 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DES-PT-00b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 230/230 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 269 transition count 230
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 248 transition count 209
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 248 transition count 209
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 236 transition count 197
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 236 transition count 197
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 77 place count 236 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 235 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 235 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 235 transition count 186
Applied a total of 80 rules in 57 ms. Remains 235 /271 variables (removed 36) and now considering 186/230 (removed 44) transitions.
// Phase 1: matrix 186 rows 235 cols
[2023-03-08 07:01:04] [INFO ] Computed 57 place invariants in 22 ms
[2023-03-08 07:01:05] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-08 07:01:05] [INFO ] Invariant cache hit.
[2023-03-08 07:01:05] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2023-03-08 07:01:05] [INFO ] Invariant cache hit.
[2023-03-08 07:01:05] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/271 places, 186/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 858 ms. Remains : 235/271 places, 186/230 transitions.
Support contains 27 out of 235 places after structural reductions.
[2023-03-08 07:01:05] [INFO ] Flatten gal took : 43 ms
[2023-03-08 07:01:05] [INFO ] Flatten gal took : 16 ms
[2023-03-08 07:01:05] [INFO ] Input system was already deterministic with 186 transitions.
Finished random walk after 2386 steps, including 22 resets, run visited all 22 properties in 248 ms. (steps per millisecond=9 )
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 421 edges and 235 vertex of which 233 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Graph (complete) has 421 edges and 235 vertex of which 233 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 232 transition count 166
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 215 transition count 166
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 215 transition count 155
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 57 place count 204 transition count 155
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 197 transition count 148
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 197 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 197 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 74 place count 197 transition count 144
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 196 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 195 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 195 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 195 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 195 transition count 141
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 81 place count 194 transition count 141
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 225 place count 122 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 229 place count 120 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 118 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 233 place count 116 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 115 transition count 68
Applied a total of 235 rules in 66 ms. Remains 115 /235 variables (removed 120) and now considering 68/186 (removed 118) transitions.
// Phase 1: matrix 68 rows 115 cols
[2023-03-08 07:01:06] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-08 07:01:06] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 07:01:06] [INFO ] Invariant cache hit.
[2023-03-08 07:01:06] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-08 07:01:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:01:06] [INFO ] Invariant cache hit.
[2023-03-08 07:01:06] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/235 places, 68/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 328 ms. Remains : 115/235 places, 68/186 transitions.
Stuttering acceptance computed with spot in 366 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s35 0) (EQ s109 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7527 reset in 304 ms.
Product exploration explored 100000 steps with 7780 reset in 235 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 68/68 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 07:01:07] [INFO ] Invariant cache hit.
[2023-03-08 07:01:08] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-08 07:01:08] [INFO ] Invariant cache hit.
[2023-03-08 07:01:08] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-08 07:01:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:01:08] [INFO ] Invariant cache hit.
[2023-03-08 07:01:08] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 115/115 places, 68/68 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7683 reset in 183 ms.
Product exploration explored 100000 steps with 7608 reset in 236 ms.
Built C files in :
/tmp/ltsmin4561137047953514639
[2023-03-08 07:01:09] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2023-03-08 07:01:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:01:09] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2023-03-08 07:01:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:01:09] [INFO ] Computing Do-Not-Accords matrix : 68 transitions.
[2023-03-08 07:01:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:01:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4561137047953514639
Running compilation step : cd /tmp/ltsmin4561137047953514639;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin4561137047953514639;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4561137047953514639;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14131812676686739045.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 68/68 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 07:01:24] [INFO ] Invariant cache hit.
[2023-03-08 07:01:24] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 07:01:24] [INFO ] Invariant cache hit.
[2023-03-08 07:01:24] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-08 07:01:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:01:24] [INFO ] Invariant cache hit.
[2023-03-08 07:01:24] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 115/115 places, 68/68 transitions.
Built C files in :
/tmp/ltsmin17322302701051233217
[2023-03-08 07:01:24] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2023-03-08 07:01:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:01:24] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2023-03-08 07:01:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:01:24] [INFO ] Computing Do-Not-Accords matrix : 68 transitions.
[2023-03-08 07:01:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:01:24] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17322302701051233217
Running compilation step : cd /tmp/ltsmin17322302701051233217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 176 ms.
Running link step : cd /tmp/ltsmin17322302701051233217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17322302701051233217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13351640920148292214.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 07:01:39] [INFO ] Flatten gal took : 7 ms
[2023-03-08 07:01:39] [INFO ] Flatten gal took : 7 ms
[2023-03-08 07:01:39] [INFO ] Time to serialize gal into /tmp/LTL6239780763828395765.gal : 1 ms
[2023-03-08 07:01:39] [INFO ] Time to serialize properties into /tmp/LTL8260345600543247200.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6239780763828395765.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13111188856116994734.hoa' '-atoms' '/tmp/LTL8260345600543247200.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8260345600543247200.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13111188856116994734.hoa
Detected timeout of ITS tools.
[2023-03-08 07:01:54] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:01:54] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:01:54] [INFO ] Time to serialize gal into /tmp/LTL13624806252106657720.gal : 2 ms
[2023-03-08 07:01:54] [INFO ] Time to serialize properties into /tmp/LTL15515154408921577192.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13624806252106657720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15515154408921577192.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p135==0)||(p258==0))"))))
Formula 0 simplified : FG!"((p135==0)||(p258==0))"
Detected timeout of ITS tools.
[2023-03-08 07:02:09] [INFO ] Flatten gal took : 6 ms
[2023-03-08 07:02:09] [INFO ] Applying decomposition
[2023-03-08 07:02:09] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4435029583467648930.txt' '-o' '/tmp/graph4435029583467648930.bin' '-w' '/tmp/graph4435029583467648930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4435029583467648930.bin' '-l' '-1' '-v' '-w' '/tmp/graph4435029583467648930.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:02:09] [INFO ] Decomposing Gal with order
[2023-03-08 07:02:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:02:10] [INFO ] Removed a total of 43 redundant transitions.
[2023-03-08 07:02:10] [INFO ] Flatten gal took : 31 ms
[2023-03-08 07:02:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 9 ms.
[2023-03-08 07:02:10] [INFO ] Time to serialize gal into /tmp/LTL4521361433137691713.gal : 3 ms
[2023-03-08 07:02:10] [INFO ] Time to serialize properties into /tmp/LTL16301231668098159185.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4521361433137691713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16301231668098159185.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i3.i1.u12.p135==0)||(i0.u4.p258==0))"))))
Formula 0 simplified : FG!"((i3.i1.u12.p135==0)||(i0.u4.p258==0))"
Reverse transition relation is NOT exact ! Due to transitions t146_t34, t145_t25, t154_t25, t157_t25, i1.u6.t0.t97.t90, i1.u6.t1.t92.t93, i2.u0.t138.t131.t...322
Computing Next relation with stutter on 85362 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
328 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.30285,122808,1,0,293287,1292,1285,363034,356,6996,498609
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-00b-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-00b-LTLFireability-00 finished in 67701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(p1 U G(p2))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 228 transition count 179
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 228 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 228 transition count 176
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 226 transition count 174
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 226 transition count 173
Applied a total of 22 rules in 9 ms. Remains 226 /235 variables (removed 9) and now considering 173/186 (removed 13) transitions.
// Phase 1: matrix 173 rows 226 cols
[2023-03-08 07:02:13] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-08 07:02:14] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-08 07:02:14] [INFO ] Invariant cache hit.
[2023-03-08 07:02:14] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-08 07:02:14] [INFO ] Invariant cache hit.
[2023-03-08 07:02:14] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/235 places, 173/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 502 ms. Remains : 226/235 places, 173/186 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-00b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s72 1) (EQ s74 1)), p1:(AND (EQ s72 1) (EQ s74 1) (EQ s14 1)), p0:(EQ s14 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 401 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 15 factoid took 316 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-00b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00b-LTLFireability-02 finished in 1318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (!p1&&F(G(!p1))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Graph (complete) has 421 edges and 235 vertex of which 233 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 232 transition count 166
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 215 transition count 166
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 215 transition count 155
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 57 place count 204 transition count 155
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 198 transition count 149
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 198 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 198 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 72 place count 198 transition count 145
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 197 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 196 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 196 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 196 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 196 transition count 142
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 79 place count 195 transition count 142
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 219 place count 125 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 123 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 121 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 227 place count 119 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 118 transition count 71
Applied a total of 229 rules in 41 ms. Remains 118 /235 variables (removed 117) and now considering 71/186 (removed 115) transitions.
// Phase 1: matrix 71 rows 118 cols
[2023-03-08 07:02:15] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-08 07:02:15] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 07:02:15] [INFO ] Invariant cache hit.
[2023-03-08 07:02:15] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-08 07:02:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:02:15] [INFO ] Invariant cache hit.
[2023-03-08 07:02:15] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/235 places, 71/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 118/235 places, 71/186 transitions.
Stuttering acceptance computed with spot in 114 ms :[p1, true, p1, p1]
Running random walk in product with property : DES-PT-00b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s63 1) (EQ s81 1)), p0:(EQ s111 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 45 steps with 2 reset in 1 ms.
FORMULA DES-PT-00b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-03 finished in 428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((G(p1) U p2))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 230 transition count 181
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 230 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 229 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 229 transition count 177
Applied a total of 15 rules in 12 ms. Remains 229 /235 variables (removed 6) and now considering 177/186 (removed 9) transitions.
// Phase 1: matrix 177 rows 229 cols
[2023-03-08 07:02:15] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-08 07:02:15] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 07:02:15] [INFO ] Invariant cache hit.
[2023-03-08 07:02:15] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-08 07:02:15] [INFO ] Invariant cache hit.
[2023-03-08 07:02:15] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/235 places, 177/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 229/235 places, 177/186 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : DES-PT-00b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s67 1), p2:(EQ s48 1), p1:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 0 ms.
FORMULA DES-PT-00b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-04 finished in 546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(!G(!F(p0)) U (p1 U (X(p2)||p3))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 228 transition count 179
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 228 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 228 transition count 176
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 226 transition count 174
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 226 transition count 173
Applied a total of 22 rules in 12 ms. Remains 226 /235 variables (removed 9) and now considering 173/186 (removed 13) transitions.
// Phase 1: matrix 173 rows 226 cols
[2023-03-08 07:02:16] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-08 07:02:16] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 07:02:16] [INFO ] Invariant cache hit.
[2023-03-08 07:02:16] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-08 07:02:16] [INFO ] Invariant cache hit.
[2023-03-08 07:02:16] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/235 places, 173/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 226/235 places, 173/186 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (OR p3 p2), (OR p2 p3), (OR p2 (AND p0 p3)), (OR (AND p0 p3) (AND p0 p2)), p0]
Running random walk in product with property : DES-PT-00b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p3, acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(OR p3 p2), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p3) (NOT p2)) (AND p1 (NOT p3) (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p0 p3) p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p3:(EQ s154 1), p0:(EQ s1 1), p1:(EQ s98 1), p2:(OR (EQ s1 1) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-00b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-08 finished in 620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Graph (complete) has 421 edges and 235 vertex of which 233 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 232 transition count 166
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 215 transition count 166
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 215 transition count 155
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 57 place count 204 transition count 155
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 198 transition count 149
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 198 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 198 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 72 place count 198 transition count 145
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 74 place count 197 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 196 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 196 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 196 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 196 transition count 142
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 195 transition count 142
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 225 place count 122 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 229 place count 120 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 118 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 233 place count 116 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 115 transition count 68
Applied a total of 235 rules in 37 ms. Remains 115 /235 variables (removed 120) and now considering 68/186 (removed 118) transitions.
// Phase 1: matrix 68 rows 115 cols
[2023-03-08 07:02:16] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-08 07:02:16] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 07:02:16] [INFO ] Invariant cache hit.
[2023-03-08 07:02:17] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-08 07:02:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:02:17] [INFO ] Invariant cache hit.
[2023-03-08 07:02:17] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/235 places, 68/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 115/235 places, 68/186 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s106 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7342 reset in 148 ms.
Product exploration explored 100000 steps with 7363 reset in 167 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 24 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 68/68 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 07:02:17] [INFO ] Invariant cache hit.
[2023-03-08 07:02:17] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 07:02:17] [INFO ] Invariant cache hit.
[2023-03-08 07:02:17] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-08 07:02:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:02:17] [INFO ] Invariant cache hit.
[2023-03-08 07:02:18] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 115/115 places, 68/68 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 245 steps, including 16 resets, run visited all 1 properties in 3 ms. (steps per millisecond=81 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7415 reset in 151 ms.
Product exploration explored 100000 steps with 7273 reset in 181 ms.
Built C files in :
/tmp/ltsmin3109669471991218626
[2023-03-08 07:02:18] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2023-03-08 07:02:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:02:18] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2023-03-08 07:02:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:02:18] [INFO ] Computing Do-Not-Accords matrix : 68 transitions.
[2023-03-08 07:02:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:02:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3109669471991218626
Running compilation step : cd /tmp/ltsmin3109669471991218626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin3109669471991218626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin3109669471991218626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4947800668346869666.hoa' '--buchi-type=spotba'
LTSmin run took 227 ms.
FORMULA DES-PT-00b-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00b-LTLFireability-09 finished in 2398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 180
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 229 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 227 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 227 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 227 transition count 175
Applied a total of 19 rules in 10 ms. Remains 227 /235 variables (removed 8) and now considering 175/186 (removed 11) transitions.
// Phase 1: matrix 175 rows 227 cols
[2023-03-08 07:02:19] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-08 07:02:19] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-08 07:02:19] [INFO ] Invariant cache hit.
[2023-03-08 07:02:19] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-08 07:02:19] [INFO ] Invariant cache hit.
[2023-03-08 07:02:19] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/235 places, 175/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 227/235 places, 175/186 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-00b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s29 1) (EQ s209 1)), p0:(EQ s149 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 131 steps with 0 reset in 1 ms.
FORMULA DES-PT-00b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-10 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X(X(X(F(p1)))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 230 transition count 181
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 230 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 229 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 229 transition count 178
Applied a total of 14 rules in 10 ms. Remains 229 /235 variables (removed 6) and now considering 178/186 (removed 8) transitions.
// Phase 1: matrix 178 rows 229 cols
[2023-03-08 07:02:19] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-08 07:02:19] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 07:02:19] [INFO ] Invariant cache hit.
[2023-03-08 07:02:20] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-08 07:02:20] [INFO ] Invariant cache hit.
[2023-03-08 07:02:20] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/235 places, 178/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 423 ms. Remains : 229/235 places, 178/186 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-00b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s67 1), p1:(OR (EQ s9 0) (EQ s41 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 1 ms.
FORMULA DES-PT-00b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-11 finished in 647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(G(p1)))) U p2)))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 180
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 229 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 227 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 227 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 227 transition count 175
Applied a total of 19 rules in 14 ms. Remains 227 /235 variables (removed 8) and now considering 175/186 (removed 11) transitions.
// Phase 1: matrix 175 rows 227 cols
[2023-03-08 07:02:20] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-08 07:02:20] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 07:02:20] [INFO ] Invariant cache hit.
[2023-03-08 07:02:20] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-08 07:02:20] [INFO ] Invariant cache hit.
[2023-03-08 07:02:20] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/235 places, 175/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 227/235 places, 175/186 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-00b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s39 1), p0:(AND (EQ s86 1) (EQ s211 1)), p1:(AND (EQ s29 1) (EQ s209 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 1 ms.
FORMULA DES-PT-00b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-13 finished in 587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U X(p1)))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Graph (complete) has 421 edges and 235 vertex of which 233 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 232 transition count 166
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 215 transition count 166
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 215 transition count 156
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 205 transition count 156
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 199 transition count 150
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 199 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 199 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 70 place count 199 transition count 146
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 72 place count 198 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 196 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 196 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 196 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 196 transition count 142
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 79 place count 195 transition count 142
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 225 place count 122 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 229 place count 120 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 118 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 233 place count 116 transition count 69
Applied a total of 233 rules in 26 ms. Remains 116 /235 variables (removed 119) and now considering 69/186 (removed 117) transitions.
// Phase 1: matrix 69 rows 116 cols
[2023-03-08 07:02:20] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-08 07:02:21] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 07:02:21] [INFO ] Invariant cache hit.
[2023-03-08 07:02:21] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-08 07:02:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:02:21] [INFO ] Invariant cache hit.
[2023-03-08 07:02:21] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/235 places, 69/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 116/235 places, 69/186 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : DES-PT-00b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={1} source=0 dest: 2}, { cond=p0, acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s47 1) (EQ s64 1)), p1:(EQ s15 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DES-PT-00b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-14 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Graph (complete) has 421 edges and 235 vertex of which 233 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 232 transition count 168
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 217 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 215 transition count 166
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 35 place count 215 transition count 155
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 57 place count 204 transition count 155
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 64 place count 197 transition count 148
Iterating global reduction 3 with 7 rules applied. Total rules applied 71 place count 197 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 197 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 197 transition count 144
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 76 place count 196 transition count 144
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 78 place count 194 transition count 142
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 194 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 194 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 81 place count 194 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 83 place count 193 transition count 140
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 229 place count 120 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 119 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 117 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 235 place count 115 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 237 place count 114 transition count 64
Applied a total of 237 rules in 32 ms. Remains 114 /235 variables (removed 121) and now considering 64/186 (removed 122) transitions.
// Phase 1: matrix 64 rows 114 cols
[2023-03-08 07:02:21] [INFO ] Computed 55 place invariants in 0 ms
[2023-03-08 07:02:21] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 07:02:21] [INFO ] Invariant cache hit.
[2023-03-08 07:02:21] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-08 07:02:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:02:21] [INFO ] Invariant cache hit.
[2023-03-08 07:02:21] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/235 places, 64/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 114/235 places, 64/186 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6473 reset in 140 ms.
Product exploration explored 100000 steps with 6398 reset in 162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 114 /114 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-08 07:02:22] [INFO ] Invariant cache hit.
[2023-03-08 07:02:22] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 07:02:22] [INFO ] Invariant cache hit.
[2023-03-08 07:02:22] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-08 07:02:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:02:22] [INFO ] Invariant cache hit.
[2023-03-08 07:02:22] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 114/114 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6406 reset in 139 ms.
Product exploration explored 100000 steps with 6408 reset in 153 ms.
Built C files in :
/tmp/ltsmin11535738232168269929
[2023-03-08 07:02:23] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2023-03-08 07:02:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:02:23] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2023-03-08 07:02:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:02:23] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2023-03-08 07:02:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:02:23] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11535738232168269929
Running compilation step : cd /tmp/ltsmin11535738232168269929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin11535738232168269929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin11535738232168269929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14826572902232136481.hoa' '--buchi-type=spotba'
LTSmin run took 458 ms.
FORMULA DES-PT-00b-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00b-LTLFireability-15 finished in 2595 ms.
All properties solved by simple procedures.
Total runtime 79745 ms.

BK_STOP 1678258944987

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-00b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-00b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475300356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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