fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472282000300
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DoubleLock-PT-p1s1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16217.575 3600000.00 4599040.00 85012.20 FTTFFF?TFFFFFFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.7K Jun 7 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 7 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Jun 7 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Jun 7 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 16:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Jun 7 16:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 7 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Jun 7 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 93K Jun 6 12:11 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 DoubleLock-PT-p1s1-LTLFireability-00
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-01
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-02
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-03
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-04
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-05
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-06
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-07
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-08
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-09
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-10
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-11
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-12
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-13
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-14
FORMULA_NAME DoubleLock-PT-p1s1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654791827222

Running Version 202205111006
[2022-06-09 16:23:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 16:23:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 16:23:48] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2022-06-09 16:23:48] [INFO ] Transformed 64 places.
[2022-06-09 16:23:48] [INFO ] Transformed 204 transitions.
[2022-06-09 16:23:48] [INFO ] Parsed PT model containing 64 places and 204 transitions in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 8 transitions.
FORMULA DoubleLock-PT-p1s1-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s1-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 196/196 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 52 transition count 196
Applied a total of 4 rules in 11 ms. Remains 52 /56 variables (removed 4) and now considering 196/196 (removed 0) transitions.
[2022-06-09 16:23:48] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:23:48] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-09 16:23:48] [INFO ] Implicit Places using invariants in 140 ms returned []
[2022-06-09 16:23:48] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:23:48] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 16:23:48] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:23:48] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2022-06-09 16:23:48] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:23:48] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 16:23:49] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 196/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/56 places, 196/196 transitions.
Support contains 36 out of 52 places after structural reductions.
[2022-06-09 16:23:49] [INFO ] Flatten gal took : 43 ms
[2022-06-09 16:23:49] [INFO ] Flatten gal took : 19 ms
[2022-06-09 16:23:49] [INFO ] Input system was already deterministic with 196 transitions.
Finished random walk after 3814 steps, including 24 resets, run visited all 32 properties in 168 ms. (steps per millisecond=22 )
FORMULA DoubleLock-PT-p1s1-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 4 stabilizing places and 24 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 49 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 48 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 45 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 45 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 44 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 44 transition count 156
Applied a total of 16 rules in 39 ms. Remains 44 /52 variables (removed 8) and now considering 156/196 (removed 40) transitions.
[2022-06-09 16:23:50] [INFO ] Flow matrix only has 112 transitions (discarded 44 similar events)
// Phase 1: matrix 112 rows 44 cols
[2022-06-09 16:23:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:23:50] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-06-09 16:23:50] [INFO ] Flow matrix only has 112 transitions (discarded 44 similar events)
// Phase 1: matrix 112 rows 44 cols
[2022-06-09 16:23:50] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 16:23:50] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-09 16:23:50] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2022-06-09 16:23:50] [INFO ] Redundant transitions in 6 ms returned []
[2022-06-09 16:23:50] [INFO ] Flow matrix only has 112 transitions (discarded 44 similar events)
// Phase 1: matrix 112 rows 44 cols
[2022-06-09 16:23:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:23:50] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/52 places, 156/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/52 places, 156/196 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 109 steps with 1 reset in 4 ms.
FORMULA DoubleLock-PT-p1s1-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s1-LTLFireability-00 finished in 605 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F((!p0&&F(p1))))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 188
Applied a total of 4 rules in 5 ms. Remains 50 /52 variables (removed 2) and now considering 188/196 (removed 8) transitions.
[2022-06-09 16:23:50] [INFO ] Flow matrix only has 143 transitions (discarded 45 similar events)
// Phase 1: matrix 143 rows 50 cols
[2022-06-09 16:23:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:23:50] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-06-09 16:23:50] [INFO ] Flow matrix only has 143 transitions (discarded 45 similar events)
// Phase 1: matrix 143 rows 50 cols
[2022-06-09 16:23:50] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 16:23:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 16:23:50] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-06-09 16:23:50] [INFO ] Flow matrix only has 143 transitions (discarded 45 similar events)
// Phase 1: matrix 143 rows 50 cols
[2022-06-09 16:23:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:23:51] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/52 places, 188/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/52 places, 188/196 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s45 1)), p1:(OR (LT s1 1) (LT s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Computed a total of 4 stabilizing places and 24 stable transitions
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleLock-PT-p1s1-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p1s1-LTLFireability-01 finished in 777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Applied a total of 0 rules in 14 ms. Remains 52 /52 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2022-06-09 16:23:51] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:23:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 16:23:51] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-06-09 16:23:51] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:23:51] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:23:51] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:23:51] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-06-09 16:23:51] [INFO ] Redundant transitions in 6 ms returned []
[2022-06-09 16:23:51] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:23:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:23:51] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 196/196 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s13 1) (OR (LT s8 1) (LT s50 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 471 steps with 28 reset in 3 ms.
FORMULA DoubleLock-PT-p1s1-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s1-LTLFireability-03 finished in 261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(p1)))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 49 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 48 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 45 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 45 transition count 160
Applied a total of 14 rules in 21 ms. Remains 45 /52 variables (removed 7) and now considering 160/196 (removed 36) transitions.
[2022-06-09 16:23:51] [INFO ] Flow matrix only has 120 transitions (discarded 40 similar events)
// Phase 1: matrix 120 rows 45 cols
[2022-06-09 16:23:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:23:51] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-06-09 16:23:51] [INFO ] Flow matrix only has 120 transitions (discarded 40 similar events)
// Phase 1: matrix 120 rows 45 cols
[2022-06-09 16:23:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:23:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 16:23:51] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-06-09 16:23:51] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 16:23:51] [INFO ] Flow matrix only has 120 transitions (discarded 40 similar events)
// Phase 1: matrix 120 rows 45 cols
[2022-06-09 16:23:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:23:52] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/52 places, 160/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/52 places, 160/196 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s12 1)), p0:(AND (GEQ s0 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 73 steps with 1 reset in 1 ms.
FORMULA DoubleLock-PT-p1s1-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s1-LTLFireability-05 finished in 360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(X(p1)))&&X(p2)&&p0)))'
Support contains 7 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 188
Applied a total of 4 rules in 4 ms. Remains 50 /52 variables (removed 2) and now considering 188/196 (removed 8) transitions.
[2022-06-09 16:23:52] [INFO ] Flow matrix only has 143 transitions (discarded 45 similar events)
// Phase 1: matrix 143 rows 50 cols
[2022-06-09 16:23:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:23:52] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-06-09 16:23:52] [INFO ] Flow matrix only has 143 transitions (discarded 45 similar events)
// Phase 1: matrix 143 rows 50 cols
[2022-06-09 16:23:52] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 16:23:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 16:23:52] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-06-09 16:23:52] [INFO ] Flow matrix only has 143 transitions (discarded 45 similar events)
// Phase 1: matrix 143 rows 50 cols
[2022-06-09 16:23:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:23:52] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/52 places, 188/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/52 places, 188/196 transitions.
Stuttering acceptance computed with spot in 531 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s17 1)) (OR (LT s1 1) (LT s48 1))), p2:(OR (LT s9 1) (LT s18 1)), p1:(OR (LT s1 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3432 reset in 238 ms.
Product exploration explored 100000 steps with 3515 reset in 284 ms.
Computed a total of 4 stabilizing places and 24 stable transitions
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p2))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p1), (NOT p1)]
Finished random walk after 160 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p2))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 188/188 transitions.
Applied a total of 0 rules in 13 ms. Remains 50 /50 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2022-06-09 16:23:54] [INFO ] Flow matrix only has 143 transitions (discarded 45 similar events)
// Phase 1: matrix 143 rows 50 cols
[2022-06-09 16:23:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 16:23:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-06-09 16:23:54] [INFO ] Flow matrix only has 143 transitions (discarded 45 similar events)
// Phase 1: matrix 143 rows 50 cols
[2022-06-09 16:23:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 16:23:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 16:23:54] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2022-06-09 16:23:54] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 16:23:54] [INFO ] Flow matrix only has 143 transitions (discarded 45 similar events)
// Phase 1: matrix 143 rows 50 cols
[2022-06-09 16:23:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:23:54] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 188/188 transitions.
Computed a total of 4 stabilizing places and 24 stable transitions
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (NOT p1)]
Finished random walk after 94 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=94 )
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3338 reset in 142 ms.
Product exploration explored 100000 steps with 3464 reset in 173 ms.
Built C files in :
/tmp/ltsmin2335040424218757598
[2022-06-09 16:23:56] [INFO ] Computing symmetric may disable matrix : 188 transitions.
[2022-06-09 16:23:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:23:56] [INFO ] Computing symmetric may enable matrix : 188 transitions.
[2022-06-09 16:23:56] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:23:56] [INFO ] Computing Do-Not-Accords matrix : 188 transitions.
[2022-06-09 16:23:56] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:23:56] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2335040424218757598
Running compilation step : cd /tmp/ltsmin2335040424218757598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 423 ms.
Running link step : cd /tmp/ltsmin2335040424218757598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2335040424218757598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12673843587652269989.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 188/188 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 48 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 47 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 46 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 46 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 45 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 45 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 44 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 44 transition count 156
Applied a total of 12 rules in 37 ms. Remains 44 /50 variables (removed 6) and now considering 156/188 (removed 32) transitions.
[2022-06-09 16:24:11] [INFO ] Flow matrix only has 112 transitions (discarded 44 similar events)
// Phase 1: matrix 112 rows 44 cols
[2022-06-09 16:24:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:24:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-06-09 16:24:11] [INFO ] Flow matrix only has 112 transitions (discarded 44 similar events)
// Phase 1: matrix 112 rows 44 cols
[2022-06-09 16:24:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:24:11] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-09 16:24:11] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2022-06-09 16:24:11] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 16:24:11] [INFO ] Flow matrix only has 112 transitions (discarded 44 similar events)
// Phase 1: matrix 112 rows 44 cols
[2022-06-09 16:24:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:24:11] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/50 places, 156/188 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/50 places, 156/188 transitions.
Built C files in :
/tmp/ltsmin6811202945878154555
[2022-06-09 16:24:11] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2022-06-09 16:24:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:24:11] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2022-06-09 16:24:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:24:11] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2022-06-09 16:24:11] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:24:11] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6811202945878154555
Running compilation step : cd /tmp/ltsmin6811202945878154555;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 313 ms.
Running link step : cd /tmp/ltsmin6811202945878154555;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6811202945878154555;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7412967193864204930.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-09 16:24:26] [INFO ] Flatten gal took : 12 ms
[2022-06-09 16:24:26] [INFO ] Flatten gal took : 12 ms
[2022-06-09 16:24:26] [INFO ] Time to serialize gal into /tmp/LTL16958547658430486576.gal : 3 ms
[2022-06-09 16:24:26] [INFO ] Time to serialize properties into /tmp/LTL16205003092769030089.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16958547658430486576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16205003092769030089.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1695854...268
Read 1 LTL properties
Checking formula 0 : !((X(((G(F(X("((s1<1)||(l0<1))"))))&&(X("((s9<1)||(l6<1))")))&&("(((s0<1)||(l5<1))&&((s1<1)||(l39<1)))"))))
Formula 0 simplified : !X("(((s0<1)||(l5<1))&&((s1<1)||(l39<1)))" & GFX"((s1<1)||(l0<1))" & X"((s9<1)||(l6<1))")
Detected timeout of ITS tools.
[2022-06-09 16:24:41] [INFO ] Flatten gal took : 11 ms
[2022-06-09 16:24:41] [INFO ] Applying decomposition
[2022-06-09 16:24:41] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14973489502717828163.txt' '-o' '/tmp/graph14973489502717828163.bin' '-w' '/tmp/graph14973489502717828163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14973489502717828163.bin' '-l' '-1' '-v' '-w' '/tmp/graph14973489502717828163.weights' '-q' '0' '-e' '0.001'
[2022-06-09 16:24:41] [INFO ] Decomposing Gal with order
[2022-06-09 16:24:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 16:24:41] [INFO ] Removed a total of 382 redundant transitions.
[2022-06-09 16:24:41] [INFO ] Flatten gal took : 48 ms
[2022-06-09 16:24:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 7 ms.
[2022-06-09 16:24:41] [INFO ] Time to serialize gal into /tmp/LTL16947758119849595546.gal : 3 ms
[2022-06-09 16:24:41] [INFO ] Time to serialize properties into /tmp/LTL3984547029050771643.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16947758119849595546.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3984547029050771643.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1694775...246
Read 1 LTL properties
Checking formula 0 : !((X(((G(F(X("((i4.u3.s1<1)||(i1.u4.l0<1))"))))&&(X("((i4.u3.s9<1)||(i3.u5.l6<1))")))&&("(((i2.u2.s0<1)||(u11.l5<1))&&((i4.u3.s1<1)||(...175
Formula 0 simplified : !X("(((i2.u2.s0<1)||(u11.l5<1))&&((i4.u3.s1<1)||(i0.u16.l39<1)))" & GFX"((i4.u3.s1<1)||(i1.u4.l0<1))" & X"((i4.u3.s9<1)||(i3.u5.l6<1...159
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9590224984206179658
[2022-06-09 16:24:56] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9590224984206179658
Running compilation step : cd /tmp/ltsmin9590224984206179658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 255 ms.
Running link step : cd /tmp/ltsmin9590224984206179658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin9590224984206179658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>(X((LTLAPp1==true))))&&X((LTLAPp2==true))&&(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleLock-PT-p1s1-LTLFireability-06 finished in 79868 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(F((F(p1)||p0))))&&(G(p2)||X(p3)))))'
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 49 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 48 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 45 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 45 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 44 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 44 transition count 156
Applied a total of 16 rules in 11 ms. Remains 44 /52 variables (removed 8) and now considering 156/196 (removed 40) transitions.
[2022-06-09 16:25:12] [INFO ] Flow matrix only has 112 transitions (discarded 44 similar events)
// Phase 1: matrix 112 rows 44 cols
[2022-06-09 16:25:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:12] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-06-09 16:25:12] [INFO ] Flow matrix only has 112 transitions (discarded 44 similar events)
// Phase 1: matrix 112 rows 44 cols
[2022-06-09 16:25:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:12] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-09 16:25:12] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-06-09 16:25:12] [INFO ] Flow matrix only has 112 transitions (discarded 44 similar events)
// Phase 1: matrix 112 rows 44 cols
[2022-06-09 16:25:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:12] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/52 places, 156/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/52 places, 156/196 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (LT s9 1) (LT s29 1)), p3:(OR (LT s10 1) (LT s30 1)), p0:(OR (LT s9 1) (LT s29 1)), p1:(OR (LT s0 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40000 reset in 112 ms.
Product exploration explored 100000 steps with 40003 reset in 112 ms.
Computed a total of 4 stabilizing places and 24 stable transitions
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p2 p3 p0 p1), (X (NOT (AND (NOT p3) (NOT p2)))), (X p3), (X (NOT (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), true, (X (X p3)), (X (X p2)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 10 factoid took 300 ms. Reduced automaton from 7 states, 16 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleLock-PT-p1s1-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p1s1-LTLFireability-07 finished in 1028 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X((G(p1) U X((X(p1) U p2))))&&X(p3))))'
Support contains 7 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Applied a total of 0 rules in 0 ms. Remains 52 /52 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2022-06-09 16:25:13] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:25:13] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:25:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-06-09 16:25:13] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:25:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:13] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:25:13] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2022-06-09 16:25:13] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:25:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:13] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 196/196 transitions.
Stuttering acceptance computed with spot in 1033 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), true, (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 6}, { cond=(AND p0 p3), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 8}]], initial=3, aps=[p0:(AND (GEQ s2 1) (GEQ s24 1)), p3:(AND (GEQ s10 1) (GEQ s36 1)), p2:(AND (GEQ s3 1) (GEQ s37 1)), p1:(AND (GEQ s10 1) (GEQ s50 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p1s1-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s1-LTLFireability-08 finished in 1243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G((G(p0)||p0))||p1)))&&X(F(p2))))'
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 49 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 48 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 164
Applied a total of 12 rules in 9 ms. Remains 46 /52 variables (removed 6) and now considering 164/196 (removed 32) transitions.
[2022-06-09 16:25:14] [INFO ] Flow matrix only has 121 transitions (discarded 43 similar events)
// Phase 1: matrix 121 rows 46 cols
[2022-06-09 16:25:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:14] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-06-09 16:25:14] [INFO ] Flow matrix only has 121 transitions (discarded 43 similar events)
// Phase 1: matrix 121 rows 46 cols
[2022-06-09 16:25:14] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 16:25:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 16:25:14] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-06-09 16:25:14] [INFO ] Flow matrix only has 121 transitions (discarded 43 similar events)
// Phase 1: matrix 121 rows 46 cols
[2022-06-09 16:25:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:14] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/52 places, 164/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/52 places, 164/196 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s25 1)), p1:(AND (GEQ s11 1) (GEQ s35 1)), p0:(AND (GEQ s6 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p1s1-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s1-LTLFireability-09 finished in 387 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G((G(p0) U !X(p1))) U G(!p2))))'
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 49 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 49 transition count 184
Applied a total of 6 rules in 8 ms. Remains 49 /52 variables (removed 3) and now considering 184/196 (removed 12) transitions.
[2022-06-09 16:25:14] [INFO ] Flow matrix only has 139 transitions (discarded 45 similar events)
// Phase 1: matrix 139 rows 49 cols
[2022-06-09 16:25:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:14] [INFO ] Implicit Places using invariants in 56 ms returned []
[2022-06-09 16:25:14] [INFO ] Flow matrix only has 139 transitions (discarded 45 similar events)
// Phase 1: matrix 139 rows 49 cols
[2022-06-09 16:25:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 16:25:14] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2022-06-09 16:25:14] [INFO ] Flow matrix only has 139 transitions (discarded 45 similar events)
// Phase 1: matrix 139 rows 49 cols
[2022-06-09 16:25:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:14] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/52 places, 184/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/52 places, 184/196 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s47 1)), p0:(AND (GEQ s3 1) (GEQ s37 1)), p1:(AND (GEQ s9 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 214 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s1-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s1-LTLFireability-10 finished in 559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((G(p0)&&X(p0))))&&G(F(p0)))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Applied a total of 0 rules in 9 ms. Remains 52 /52 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2022-06-09 16:25:15] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:25:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:15] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-06-09 16:25:15] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:25:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:25:15] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2022-06-09 16:25:15] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 16:25:15] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:25:15] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:25:15] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 196/196 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s41 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 903 reset in 183 ms.
Stack based approach found an accepted trace after 3436 steps with 25 reset with depth 181 and stack size 181 in 8 ms.
FORMULA DoubleLock-PT-p1s1-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DoubleLock-PT-p1s1-LTLFireability-11 finished in 459 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(X(G(p1))||F(p2))))'
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 49 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 48 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 164
Applied a total of 12 rules in 5 ms. Remains 46 /52 variables (removed 6) and now considering 164/196 (removed 32) transitions.
[2022-06-09 16:25:15] [INFO ] Flow matrix only has 121 transitions (discarded 43 similar events)
// Phase 1: matrix 121 rows 46 cols
[2022-06-09 16:25:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:15] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-06-09 16:25:15] [INFO ] Flow matrix only has 121 transitions (discarded 43 similar events)
// Phase 1: matrix 121 rows 46 cols
[2022-06-09 16:25:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 16:25:15] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2022-06-09 16:25:15] [INFO ] Flow matrix only has 121 transitions (discarded 43 similar events)
// Phase 1: matrix 121 rows 46 cols
[2022-06-09 16:25:15] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 16:25:15] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/52 places, 164/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/52 places, 164/196 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s8 1) (GEQ s35 1)), p2:(AND (GEQ s10 1) (GEQ s26 1)), p1:(AND (GEQ s5 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p1s1-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s1-LTLFireability-12 finished in 384 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U (p1 U (X(F(p2))||p0))))'
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 192
Applied a total of 2 rules in 3 ms. Remains 51 /52 variables (removed 1) and now considering 192/196 (removed 4) transitions.
[2022-06-09 16:25:16] [INFO ] Flow matrix only has 144 transitions (discarded 48 similar events)
// Phase 1: matrix 144 rows 51 cols
[2022-06-09 16:25:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:16] [INFO ] Implicit Places using invariants in 41 ms returned []
[2022-06-09 16:25:16] [INFO ] Flow matrix only has 144 transitions (discarded 48 similar events)
// Phase 1: matrix 144 rows 51 cols
[2022-06-09 16:25:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:16] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:25:16] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-06-09 16:25:16] [INFO ] Flow matrix only has 144 transitions (discarded 48 similar events)
// Phase 1: matrix 144 rows 51 cols
[2022-06-09 16:25:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:16] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/52 places, 192/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/52 places, 192/196 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR p0 p2), true, p2]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s13 1)), p0:(AND (GEQ s10 1) (GEQ s49 1)), p2:(AND (GEQ s2 1) (GEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 94 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s1-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s1-LTLFireability-13 finished in 300 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(X(((p1 U p2)&&p0))) U (X(F(p4))&&p3))))'
Support contains 7 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 196/196 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2022-06-09 16:25:16] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:25:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:16] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-06-09 16:25:16] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:25:16] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:25:16] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:25:16] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2022-06-09 16:25:16] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:25:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:25:16] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 196/196 transitions.
Stuttering acceptance computed with spot in 347 ms :[true, (AND p2 p4), (AND p0 p2 p4), (AND p3 p4), (AND p3 p4), (AND p0 p2 p3 p4), p4, p2, (AND p0 p2)]
Running random walk in product with property : DoubleLock-PT-p1s1-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 p4), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p4)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p4)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p4)), acceptance={} source=1 dest: 6}, { cond=(AND p1 (NOT p2) p4), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p1) (NOT p2) p4), acceptance={} source=1 dest: 8}], [{ cond=(AND p0 p2 p4), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2) (NOT p4)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p4)), acceptance={} source=2 dest: 6}, { cond=(AND p0 p1 (NOT p2) p4), acceptance={} source=2 dest: 7}, { cond=(OR (AND (NOT p0) p4) (AND (NOT p1) (NOT p2) p4)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}, { cond=p3, acceptance={} source=4 dest: 6}], [{ cond=(AND p3 p0 p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p1) (NOT p2))), acceptance={} source=5 dest: 2}, { cond=(NOT p3), acceptance={} source=5 dest: 5}, { cond=(AND p3 p0 p2), acceptance={} source=5 dest: 6}], [{ cond=p4, acceptance={} source=6 dest: 0}, { cond=(NOT p4), acceptance={} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 p2), acceptance={} source=8 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=8 dest: 8}]], initial=3, aps=[p2:(AND (GEQ s10 1) (GEQ s45 1)), p4:(AND (GEQ s3 1) (GEQ s51 1)), p1:(AND (GEQ s10 1) (GEQ s50 1)), p0:(AND (GEQ s1 1) (GEQ s32 1)), p3:(AND (GEQ s10 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 922 reset in 221 ms.
Product exploration explored 100000 steps with 867 reset in 232 ms.
Computed a total of 4 stabilizing places and 24 stable transitions
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p4) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (X (NOT (AND p3 p0 p1 (NOT p2))))), (X (X (NOT p4))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND p3 (NOT p1) (NOT p2)))))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 284 ms. Reduced automaton from 9 states, 28 edges and 5 AP to 9 states, 27 edges and 5 AP.
Stuttering acceptance computed with spot in 534 ms :[true, p4, p2, (AND p2 p4), (AND p0 p2), (AND p0 p2 p4), (AND p0 p2 p3 p4), (AND p0 p2 p3 p4), (AND p0 p2 p3 p4)]
Incomplete random walk after 10000 steps, including 78 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 23) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-06-09 16:25:19] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 52 cols
[2022-06-09 16:25:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 16:25:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 16:25:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:25:19] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2022-06-09 16:25:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 16:25:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:25:19] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 11 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p4) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (X (NOT (AND p3 p0 p1 (NOT p2))))), (X (X (NOT p4))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND p3 (NOT p1) (NOT p2)))))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT p3))), (G (NOT (AND p4 (NOT p2) p1 p0))), (G (NOT (AND p4 p2))), (G (NOT (AND (NOT p4) p2 p0))), (G (NOT (AND p4 p2 p0))), (G (NOT (AND p4 (NOT p2) p1))), (G (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (G (NOT (AND p2 p3 p0))), (G (NOT (AND (NOT p4) (NOT p2) p1 p0))), (G (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND p2 p0))), (G (NOT (AND (NOT p2) p3 p1 p0)))]
False Knowledge obtained : [(F (AND p4 (NOT p2) (NOT p1))), (F (AND (NOT p4) (NOT p2) p1)), (F (NOT (AND (NOT p4) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p4) p2)), (F p4), (F (NOT (OR (AND (NOT p4) (NOT p2) (NOT p1)) (AND (NOT p4) (NOT p0))))), (F (OR (AND p4 (NOT p2) (NOT p1)) (AND p4 (NOT p0)))), (F (AND (NOT p2) p1)), (F p2), (F p3), (F (OR (AND (NOT p2) p3 (NOT p1)) (AND p3 (NOT p0))))]
Property proved to be true thanks to knowledge :(G (OR (AND (NOT p2) (NOT p1)) (NOT p0)))
Knowledge based reduction with 18 factoid took 601 ms. Reduced automaton from 9 states, 27 edges and 5 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleLock-PT-p1s1-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p1s1-LTLFireability-14 finished in 3528 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(X(p1)))&&X(p2)&&p0)))'
[2022-06-09 16:25:20] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6509675493291581163
[2022-06-09 16:25:20] [INFO ] Computing symmetric may disable matrix : 196 transitions.
[2022-06-09 16:25:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:25:20] [INFO ] Computing symmetric may enable matrix : 196 transitions.
[2022-06-09 16:25:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:25:20] [INFO ] Computing Do-Not-Accords matrix : 196 transitions.
[2022-06-09 16:25:20] [INFO ] Applying decomposition
[2022-06-09 16:25:20] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:25:20] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6509675493291581163
Running compilation step : cd /tmp/ltsmin6509675493291581163;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-09 16:25:20] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11770460525587384407.txt' '-o' '/tmp/graph11770460525587384407.bin' '-w' '/tmp/graph11770460525587384407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11770460525587384407.bin' '-l' '-1' '-v' '-w' '/tmp/graph11770460525587384407.weights' '-q' '0' '-e' '0.001'
[2022-06-09 16:25:20] [INFO ] Decomposing Gal with order
[2022-06-09 16:25:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 16:25:20] [INFO ] Removed a total of 395 redundant transitions.
[2022-06-09 16:25:20] [INFO ] Flatten gal took : 32 ms
[2022-06-09 16:25:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2022-06-09 16:25:20] [INFO ] Time to serialize gal into /tmp/LTLFireability6599452736747698240.gal : 3 ms
[2022-06-09 16:25:20] [INFO ] Time to serialize properties into /tmp/LTLFireability14438356235714895998.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6599452736747698240.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14438356235714895998.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(((G(F(X("((i0.u2.s1<1)||(i1.u4.l0<1))"))))&&(X("((i0.u2.s9<1)||(i2.u6.l6<1))")))&&("(((i7.u1.s0<1)||(i2.u5.l5<1))&&((i0.u2.s1<1)|...177
Formula 0 simplified : !X("(((i7.u1.s0<1)||(i2.u5.l5<1))&&((i0.u2.s1<1)||(i7.u17.l39<1)))" & GFX"((i0.u2.s1<1)||(i1.u4.l0<1))" & X"((i0.u2.s9<1)||(i2.u6.l6...161
Compilation finished in 462 ms.
Running link step : cd /tmp/ltsmin6509675493291581163;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6509675493291581163;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>(X((LTLAPp1==true))))&&X((LTLAPp2==true))&&(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: LTL layer: formula: X(([](<>(X((LTLAPp1==true))))&&X((LTLAPp2==true))&&(LTLAPp0==true)))
pins2lts-mc-linux64( 7/ 8), 0.003: "X(([](<>(X((LTLAPp1==true))))&&X((LTLAPp2==true))&&(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.081: DFS-FIFO for weak LTL, using special progress label 200
pins2lts-mc-linux64( 0/ 8), 0.081: There are 201 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.081: State length is 53, there are 206 groups
pins2lts-mc-linux64( 0/ 8), 0.081: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.081: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.081: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.081: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.110: ~18 levels ~960 states ~1256 transitions
pins2lts-mc-linux64( 0/ 8), 0.145: ~18 levels ~1920 states ~2912 transitions
pins2lts-mc-linux64( 0/ 8), 0.171: ~18 levels ~3840 states ~6008 transitions
pins2lts-mc-linux64( 0/ 8), 0.217: ~18 levels ~7680 states ~14472 transitions
pins2lts-mc-linux64( 0/ 8), 0.291: ~19 levels ~15360 states ~27800 transitions
pins2lts-mc-linux64( 0/ 8), 0.434: ~19 levels ~30720 states ~53072 transitions
pins2lts-mc-linux64( 0/ 8), 0.682: ~19 levels ~61440 states ~99608 transitions
pins2lts-mc-linux64( 3/ 8), 1.105: ~20 levels ~122880 states ~190032 transitions
pins2lts-mc-linux64( 3/ 8), 1.756: ~20 levels ~245760 states ~378440 transitions
pins2lts-mc-linux64( 3/ 8), 2.653: ~21 levels ~491520 states ~754328 transitions
pins2lts-mc-linux64( 6/ 8), 4.039: ~21 levels ~983040 states ~1427696 transitions
pins2lts-mc-linux64( 3/ 8), 6.269: ~22 levels ~1966080 states ~3135952 transitions
pins2lts-mc-linux64( 2/ 8), 10.448: ~24 levels ~3932160 states ~5859952 transitions
pins2lts-mc-linux64( 6/ 8), 18.485: ~23 levels ~7864320 states ~11131816 transitions
pins2lts-mc-linux64( 6/ 8), 34.686: ~23 levels ~15728640 states ~22264912 transitions
pins2lts-mc-linux64( 6/ 8), 67.762: ~25 levels ~31457280 states ~44581336 transitions
pins2lts-mc-linux64( 6/ 8), 135.452: ~25 levels ~62914560 states ~91387416 transitions
pins2lts-mc-linux64( 6/ 8), 277.310: ~26 levels ~125829120 states ~194660864 transitions
pins2lts-mc-linux64( 6/ 8), 305.527: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 305.606:
pins2lts-mc-linux64( 0/ 8), 305.607: mean standard work distribution: 9.6% (states) 12.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 305.607:
pins2lts-mc-linux64( 0/ 8), 305.607: Explored 123138209 states 234758692 transitions, fanout: 1.906
pins2lts-mc-linux64( 0/ 8), 305.607: Total exploration time 305.520 sec (305.430 sec minimum, 305.465 sec on average)
pins2lts-mc-linux64( 0/ 8), 305.607: States per second: 403045, Transitions per second: 768391
pins2lts-mc-linux64( 0/ 8), 305.607:
pins2lts-mc-linux64( 0/ 8), 305.607: Progress states detected: 38055444
pins2lts-mc-linux64( 0/ 8), 305.607: Redundant explorations: -8.2545
pins2lts-mc-linux64( 0/ 8), 305.607:
pins2lts-mc-linux64( 0/ 8), 305.607: Queue width: 8B, total height: 20523175, memory: 156.58MB
pins2lts-mc-linux64( 0/ 8), 305.607: Tree memory: 1160.2MB, 9.1 B/state, compr.: 4.2%
pins2lts-mc-linux64( 0/ 8), 305.607: Tree fill ratio (roots/leafs): 99.0%/53.0%
pins2lts-mc-linux64( 0/ 8), 305.607: Stored 224 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 305.607: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 305.607: Est. total memory use: 1316.8MB (~1180.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6509675493291581163;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>(X((LTLAPp1==true))))&&X((LTLAPp2==true))&&(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6509675493291581163;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>(X((LTLAPp1==true))))&&X((LTLAPp2==true))&&(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-09 16:45:50] [INFO ] Flatten gal took : 13 ms
[2022-06-09 16:45:50] [INFO ] Time to serialize gal into /tmp/LTLFireability6476028752533479193.gal : 2 ms
[2022-06-09 16:45:50] [INFO ] Time to serialize properties into /tmp/LTLFireability12701556480851330777.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6476028752533479193.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12701556480851330777.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((X(((G(F(X("((s1<1)||(l0<1))"))))&&(X("((s9<1)||(l6<1))")))&&("(((s0<1)||(l5<1))&&((s1<1)||(l39<1)))"))))
Formula 0 simplified : !X("(((s0<1)||(l5<1))&&((s1<1)||(l39<1)))" & GFX"((s1<1)||(l0<1))" & X"((s9<1)||(l6<1))")
ITS-tools command line returned an error code 137
[2022-06-09 17:04:09] [INFO ] Flatten gal took : 63 ms
[2022-06-09 17:04:09] [INFO ] Input system was already deterministic with 196 transitions.
[2022-06-09 17:04:09] [INFO ] Transformed 52 places.
[2022-06-09 17:04:09] [INFO ] Transformed 196 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 17:04:09] [INFO ] Time to serialize gal into /tmp/LTLFireability11145882625354671455.gal : 2 ms
[2022-06-09 17:04:09] [INFO ] Time to serialize properties into /tmp/LTLFireability6885936261692995492.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11145882625354671455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6885936261692995492.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(((G(F(X("((s1<1)||(l0<1))"))))&&(X("((s9<1)||(l6<1))")))&&("(((s0<1)||(l5<1))&&((s1<1)||(l39<1)))"))))
Formula 0 simplified : !X("(((s0<1)||(l5<1))&&((s1<1)||(l39<1)))" & GFX"((s1<1)||(l0<1))" & X"((s9<1)||(l6<1))")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleLock-PT-p1s1"
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-4028"
echo " Executing tool itstools"
echo " Input is DoubleLock-PT-p1s1, 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 r312-tall-165472282000300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p1s1.tgz
mv DoubleLock-PT-p1s1 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 ;