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.r042-smll-165252095700452.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 DES-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095700452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 4.7K Apr 29 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 29 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 15:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 43K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652729384513

Running Version 202205111006
[2022-05-16 19:29:46] [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-05-16 19:29:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 19:29:47] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2022-05-16 19:29:47] [INFO ] Transformed 155 places.
[2022-05-16 19:29:47] [INFO ] Transformed 112 transitions.
[2022-05-16 19:29:47] [INFO ] Found NUPN structural information;
[2022-05-16 19:29:47] [INFO ] Parsed PT model containing 155 places and 112 transitions in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 53 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 50 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 154 cols
[2022-05-16 19:29:47] [INFO ] Computed 59 place invariants in 43 ms
[2022-05-16 19:29:48] [INFO ] Implicit Places using invariants in 425 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 575 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/155 places, 97/98 transitions.
Applied a total of 0 rules in 14 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/155 places, 97/98 transitions.
Support contains 53 out of 153 places after structural reductions.
[2022-05-16 19:29:48] [INFO ] Flatten gal took : 144 ms
[2022-05-16 19:29:48] [INFO ] Flatten gal took : 84 ms
[2022-05-16 19:29:49] [INFO ] Input system was already deterministic with 97 transitions.
Incomplete random walk after 10000 steps, including 223 resets, run finished after 976 ms. (steps per millisecond=10 ) properties (out of 33) seen :25
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:29:50] [INFO ] Computed 58 place invariants in 6 ms
[2022-05-16 19:29:51] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-05-16 19:29:51] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2022-05-16 19:29:51] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-16 19:29:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-05-16 19:29:51] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 110 ms returned sat
[2022-05-16 19:29:51] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-16 19:29:52] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 7 ms to minimize.
[2022-05-16 19:29:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-16 19:29:52] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
[2022-05-16 19:29:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2022-05-16 19:29:52] [INFO ] After 680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 184 ms.
[2022-05-16 19:29:52] [INFO ] After 1358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 367 ms.
Support contains 14 out of 153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 153 transition count 95
Applied a total of 6 rules in 49 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 95 rows 153 cols
[2022-05-16 19:29:53] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-16 19:29:53] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-16 19:29:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2022-05-16 19:29:53] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 19:29:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2022-05-16 19:29:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 43 ms returned sat
[2022-05-16 19:29:54] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 19:29:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 19:29:54] [INFO ] After 127ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-16 19:29:54] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 125 ms.
[2022-05-16 19:29:54] [INFO ] After 757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 106 ms.
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 15 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 95/95 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 539208 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 539208 steps, saw 77403 distinct states, run finished after 3005 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 95 rows 153 cols
[2022-05-16 19:29:58] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-16 19:29:58] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-16 19:29:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2022-05-16 19:29:58] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 19:29:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-16 19:29:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 41 ms returned sat
[2022-05-16 19:29:58] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 19:29:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 19:29:59] [INFO ] After 183ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-16 19:29:59] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 107 ms.
[2022-05-16 19:29:59] [INFO ] After 805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 64 ms.
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
// Phase 1: matrix 95 rows 153 cols
[2022-05-16 19:29:59] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-16 19:29:59] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 95 rows 153 cols
[2022-05-16 19:29:59] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-16 19:29:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 19:30:00] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2022-05-16 19:30:00] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 95 rows 153 cols
[2022-05-16 19:30:00] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-16 19:30:00] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 95 rows 153 cols
[2022-05-16 19:30:00] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-16 19:30:00] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-16 19:30:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2022-05-16 19:30:00] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 19:30:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-05-16 19:30:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 64 ms returned sat
[2022-05-16 19:30:00] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 19:30:01] [INFO ] After 422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 123 ms.
[2022-05-16 19:30:01] [INFO ] After 792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-16 19:30:01] [INFO ] Flatten gal took : 18 ms
[2022-05-16 19:30:01] [INFO ] Flatten gal took : 15 ms
[2022-05-16 19:30:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9307406775988977053.gal : 8 ms
[2022-05-16 19:30:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2600141489772538526.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1684983044600209857;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9307406775988977053.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2600141489772538526.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2600141489772538526.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 17
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :17 after 38
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :38 after 129
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :129 after 1365
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1365 after 1897
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :13397 after 20081
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :20081 after 396225
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :396225 after 4.30089e+06
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :4.30089e+06 after 8.42717e+06
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :8.42717e+06 after 1.70206e+07
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :3.97819e+07 after 1.13108e+08
Detected timeout of ITS tools.
[2022-05-16 19:30:16] [INFO ] Flatten gal took : 18 ms
[2022-05-16 19:30:16] [INFO ] Applying decomposition
[2022-05-16 19:30:16] [INFO ] Flatten gal took : 13 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/graph11268191596684937442.txt' '-o' '/tmp/graph11268191596684937442.bin' '-w' '/tmp/graph11268191596684937442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11268191596684937442.bin' '-l' '-1' '-v' '-w' '/tmp/graph11268191596684937442.weights' '-q' '0' '-e' '0.001'
[2022-05-16 19:30:16] [INFO ] Decomposing Gal with order
[2022-05-16 19:30:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 19:30:16] [INFO ] Removed a total of 21 redundant transitions.
[2022-05-16 19:30:16] [INFO ] Flatten gal took : 80 ms
[2022-05-16 19:30:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 17 ms.
[2022-05-16 19:30:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15812226668532827995.gal : 7 ms
[2022-05-16 19:30:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16366209144718044455.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1684983044600209857;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15812226668532827995.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16366209144718044455.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality16366209144718044455.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 785
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :785 after 10749
Reachability property AtomicPropp23 is true.
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :10749 after 8.08337e+08
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :8.08337e+08 after 3.75433e+09
Reachability property AtomicPropp4 is true.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3.41085e+10 after 1.02863e+11
Reachability property AtomicPropp13 is true.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.03462e+11 after 2.44525e+11
Reachability property AtomicPropp28 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.35905e+11,1.37276,38904,4093,479,83558,1895,282,119257,141,5233,0
Total reachable state count : 435905434457

Verifying 4 reachability properties.
Reachability property AtomicPropp4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp4,1.73644e+10,1.37774,39168,1522,227,83558,1895,290,119257,148,5233,0
Reachability property AtomicPropp13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp13,1.90057e+10,1.37984,39168,1542,253,83558,1895,296,119257,152,5233,0
Reachability property AtomicPropp23 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp23,49314,1.38046,39168,314,113,83558,1895,303,119257,156,5233,0
Reachability property AtomicPropp28 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp28,348,1.38163,39168,92,70,83558,1895,314,119257,160,5233,0
FORMULA DES-PT-10a-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DES-PT-10a-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 56 stabilizing places and 51 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&(!(G(p2)&&X(p3)) U p4))))'
Support contains 9 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:18] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:18] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:18] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:19] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:19] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:19] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 679 ms :[(OR (NOT p1) (NOT p4)), (OR (NOT p1) (NOT p4)), true, (NOT p0), (NOT p1), (NOT p4), (AND p2 p3), p2]
Running random walk in product with property : DES-PT-10a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR (AND p1 (NOT p4)) (AND p0 (NOT p4))), acceptance={} source=1 dest: 5}, { cond=(OR (AND p1 (NOT p4) p2) (AND p0 (NOT p4) p2)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p4), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p4) p2), acceptance={0} source=5 dest: 6}], [{ cond=(AND p2 p3), acceptance={} source=6 dest: 7}], [{ cond=p2, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s71 1) (EQ s134 1)), p0:(AND (EQ s11 1) (EQ s148 1)), p4:(AND (EQ s17 1) (EQ s148 1)), p2:(AND (EQ s147 1) (EQ s151 1)), p3:(AND (EQ s55 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 46 steps with 1 reset in 6 ms.
FORMULA DES-PT-10a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-00 finished in 1585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:20] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-16 19:30:20] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:20] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-16 19:30:20] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:20] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-16 19:30:20] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s46 1) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-10a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-01 finished in 936 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(((p0 U p1)||F(p2))))))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:21] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:21] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:21] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:21] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:21] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:21] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-10a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s138 1) (EQ s147 1) (EQ s105 1) (EQ s121 1)), p0:(AND (EQ s129 1) (EQ s132 1)), p2:(AND (EQ s105 1) (EQ s121 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA DES-PT-10a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-03 finished in 887 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:21] [INFO ] Computed 58 place invariants in 18 ms
[2022-05-16 19:30:22] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:22] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:22] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:22] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:22] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s56 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-04 finished in 968 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(X(p0)))||X((F(p1) U !X(p2))))))'
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:22] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:23] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:23] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:23] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:23] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-16 19:30:23] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 404 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-10a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s16 1) (EQ s148 1)), p2:(AND (EQ s97 1) (EQ s113 1)), p0:(AND (EQ s52 1) (EQ s62 1) (EQ s64 1))], nbAcceptance=0, 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 25000 reset in 726 ms.
Product exploration explored 100000 steps with 25000 reset in 482 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 287 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 50 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 448 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:26] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:27] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:27] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:27] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:27] [INFO ] Computed 58 place invariants in 8 ms
[2022-05-16 19:30:27] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 455 steps, including 11 resets, run visited all 3 properties in 14 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 283 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 534 ms.
Product exploration explored 100000 steps with 25000 reset in 495 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 28 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2022-05-16 19:30:31] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:31] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:31] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Product exploration explored 100000 steps with 25000 reset in 689 ms.
Product exploration explored 100000 steps with 25000 reset in 1033 ms.
Built C files in :
/tmp/ltsmin8868984529033701260
[2022-05-16 19:30:33] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8868984529033701260
Running compilation step : cd /tmp/ltsmin8868984529033701260;'/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 643 ms.
Running link step : cd /tmp/ltsmin8868984529033701260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin8868984529033701260;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14127096097863661928.hoa' '--buchi-type=spotba'
LTSmin run took 616 ms.
FORMULA DES-PT-10a-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10a-LTLFireability-05 finished in 11637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 10 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:34] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:34] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:34] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:34] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2022-05-16 19:30:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:35] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-16 19:30:35] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-10a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s89 1) (EQ s106 1)) (AND (EQ s142 1) (EQ s147 1))), p1:(AND (EQ s52 1) (EQ s59 1) (EQ s131 1) (EQ s140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA DES-PT-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-06 finished in 723 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 9 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:35] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:35] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:35] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:35] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2022-05-16 19:30:35] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:35] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:35] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s148 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 65 steps with 0 reset in 0 ms.
FORMULA DES-PT-10a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-08 finished in 698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 9 ms. Remains 152 /153 variables (removed 1) and now considering 96/97 (removed 1) transitions.
// Phase 1: matrix 96 rows 152 cols
[2022-05-16 19:30:35] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:36] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 96 rows 152 cols
[2022-05-16 19:30:36] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:36] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2022-05-16 19:30:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 152 cols
[2022-05-16 19:30:36] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:36] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 152/153 places, 96/97 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s61 1) (EQ s63 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 33 steps with 0 reset in 0 ms.
FORMULA DES-PT-10a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-09 finished in 805 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:36] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:36] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:36] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:37] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:37] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:37] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-10a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s142 0) (EQ s147 0)), p1:(EQ s46 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 426 ms.
Product exploration explored 100000 steps with 50000 reset in 434 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) 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 6 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-10a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLFireability-10 finished in 1814 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(((p1 U G(p1)) U p2))&&p0)))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:38] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-16 19:30:38] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:38] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:39] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2022-05-16 19:30:39] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:39] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:39] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-10a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s58 1) (EQ s60 1) (OR (EQ s22 0) (EQ s69 0))), p2:(AND (EQ s83 1) (EQ s100 1)), p1:(AND (EQ s22 1) (EQ s69 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 0 ms.
FORMULA DES-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-11 finished in 1082 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:39] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:39] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:39] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:40] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2022-05-16 19:30:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:40] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:40] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s51 1) (EQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA DES-PT-10a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-12 finished in 743 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(F(p1))||G(G(F(G(p2)))))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:40] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:40] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:40] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-16 19:30:40] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:40] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:41] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-10a-LTLFireability-13 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=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s44 1), p1:(AND (EQ s44 1) (EQ s63 1)), p2:(AND (EQ s33 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-13 finished in 1056 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))||(G(p1) U G(!p2)))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:41] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:41] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:41] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:42] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:42] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:42] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Running random walk in product with property : DES-PT-10a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s138 1) (EQ s147 1)), p0:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 18189 reset in 500 ms.
Product exploration explored 100000 steps with 18216 reset in 314 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 899 steps, including 20 resets, run visited all 2 properties in 6 ms. (steps per millisecond=149 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 3 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:43] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:44] [INFO ] Implicit Places using invariants in 231 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:44] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:44] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:44] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:44] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 1520 steps, including 35 resets, run visited all 2 properties in 8 ms. (steps per millisecond=190 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 18181 reset in 292 ms.
Product exploration explored 100000 steps with 18194 reset in 331 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 10 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2022-05-16 19:30:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:46] [INFO ] Computed 58 place invariants in 0 ms
[2022-05-16 19:30:46] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Product exploration explored 100000 steps with 18194 reset in 888 ms.
Product exploration explored 100000 steps with 18180 reset in 641 ms.
Built C files in :
/tmp/ltsmin11497282916278047389
[2022-05-16 19:30:48] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11497282916278047389
Running compilation step : cd /tmp/ltsmin11497282916278047389;'/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 468 ms.
Running link step : cd /tmp/ltsmin11497282916278047389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11497282916278047389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5217212862009751234.hoa' '--buchi-type=spotba'
LTSmin run took 137 ms.
FORMULA DES-PT-10a-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10a-LTLFireability-14 finished in 7316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((F(p0)&&!p1) U p2)||G(X(p3)))))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:48] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:49] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:49] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:49] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:49] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:30:49] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : DES-PT-10a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p1 p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s24 1) (EQ s69 1)), p1:(AND (EQ s62 1) (EQ s64 1)), p0:(AND (EQ s105 1) (EQ s121 1)), p3:(OR (EQ s24 0) (EQ s69 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2581 reset in 287 ms.
Product exploration explored 100000 steps with 2608 reset in 308 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (X p3)), (X (X (AND (NOT p2) (NOT p1) p3))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1238 ms. Reduced automaton from 8 states, 19 edges and 4 AP to 8 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 367 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 230 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:30:52] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:30:53] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 19:30:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2022-05-16 19:30:53] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 183 ms returned sat
[2022-05-16 19:30:53] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2022-05-16 19:30:53] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-16 19:30:53] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 153 transition count 95
Applied a total of 7 rules in 11 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 883069 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :{}
Probabilistic random walk after 883069 steps, saw 125848 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 95 rows 153 cols
[2022-05-16 19:30:56] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-16 19:30:56] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 19:30:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2022-05-16 19:30:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 63 ms returned sat
[2022-05-16 19:30:57] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 19:30:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 19:30:57] [INFO ] After 34ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 19:30:57] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-16 19:30:57] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
// Phase 1: matrix 95 rows 153 cols
[2022-05-16 19:30:57] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-16 19:30:57] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 95 rows 153 cols
[2022-05-16 19:30:57] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-16 19:30:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 19:30:57] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2022-05-16 19:30:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 95 rows 153 cols
[2022-05-16 19:30:57] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-16 19:30:57] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 12 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 95 rows 153 cols
[2022-05-16 19:30:57] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-16 19:30:58] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 19:30:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-16 19:30:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 104 ms returned sat
[2022-05-16 19:30:58] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 19:30:58] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-16 19:30:58] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-16 19:30:58] [INFO ] Flatten gal took : 21 ms
[2022-05-16 19:30:58] [INFO ] Flatten gal took : 18 ms
[2022-05-16 19:30:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16345819479258833275.gal : 4 ms
[2022-05-16 19:30:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12749873886455970587.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9717290174923212605;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16345819479258833275.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12749873886455970587.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality12749873886455970587.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 47
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :47 after 521
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :521 after 2410
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2410 after 2749
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :13397 after 57425
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :57425 after 433185
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :433185 after 4.36777e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.36777e+06 after 8.43024e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.43024e+06 after 1.70455e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.97819e+07 after 1.13115e+08
Detected timeout of ITS tools.
[2022-05-16 19:31:13] [INFO ] Flatten gal took : 11 ms
[2022-05-16 19:31:13] [INFO ] Applying decomposition
[2022-05-16 19:31:13] [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/graph13152959914197323817.txt' '-o' '/tmp/graph13152959914197323817.bin' '-w' '/tmp/graph13152959914197323817.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13152959914197323817.bin' '-l' '-1' '-v' '-w' '/tmp/graph13152959914197323817.weights' '-q' '0' '-e' '0.001'
[2022-05-16 19:31:13] [INFO ] Decomposing Gal with order
[2022-05-16 19:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 19:31:13] [INFO ] Removed a total of 32 redundant transitions.
[2022-05-16 19:31:13] [INFO ] Flatten gal took : 38 ms
[2022-05-16 19:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2022-05-16 19:31:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13462214938993776256.gal : 3 ms
[2022-05-16 19:31:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17415512221537154507.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9717290174923212605;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13462214938993776256.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17415512221537154507.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality17415512221537154507.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 153
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :153 after 10749
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10749 after 9.7189e+08
Reachability property apf8 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.75433e+09,0.481511,21512,1940,229,35840,975,315,87866,142,2447,0
Total reachable state count : 3754328995

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,9084,0.483433,21776,146,90,35840,975,323,87866,149,2447,0
Reachability property apf8 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf8,9084,0.484102,21776,146,90,35840,975,332,87866,151,2447,0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (X p3)), (X (X (AND (NOT p2) (NOT p1) p3))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3) p1))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) p3 (NOT p1)))), (F (AND (NOT p2) p3 p1)), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (AND (NOT p2) p1)), (F (NOT (AND p3 (NOT p0)))), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 1397 ms. Reduced automaton from 8 states, 18 edges and 4 AP to 6 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p3) p2), false, (AND (NOT p3) (NOT p0) p2), (OR p2 p3), (OR (AND (NOT p0) p3) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p3) p2), false, (AND (NOT p3) (NOT p0) p2), (OR p2 p3), (OR (AND (NOT p0) p3) (AND (NOT p0) p2))]
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:31:16] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:31:16] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:31:16] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:31:16] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:31:16] [INFO ] Computed 58 place invariants in 7 ms
[2022-05-16 19:31:17] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p0) p3)), (X (X (NOT (AND p2 (NOT p3))))), (X (X p3)), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (AND (NOT p0) p3))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1156 ms. Reduced automaton from 6 states, 11 edges and 4 AP to 6 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p3) p2), false, (AND (NOT p3) (NOT p0) p2), (OR p2 p3), (OR (AND (NOT p0) p3) (AND (NOT p0) p2))]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:31:19] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:31:19] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2022-05-16 19:31:19] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2022-05-16 19:31:19] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 19:31:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2022-05-16 19:31:19] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2022-05-16 19:31:19] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-16 19:31:19] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-05-16 19:31:19] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 307 steps, including 2 resets, run visited all 3 properties in 8 ms. (steps per millisecond=38 )
Parikh walk visited 3 properties in 7 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p0) p3)), (X (X (NOT (AND p2 (NOT p3))))), (X (X p3)), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (AND (NOT p0) p3))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p3 p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p3) p2 (NOT p0))), (F (NOT (AND p3 (NOT p0)))), (F (NOT p3)), (F (AND (NOT p2) p1)), (F (AND (NOT p3) p2)), (F (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0)))))]
Knowledge based reduction with 17 factoid took 1234 ms. Reduced automaton from 6 states, 11 edges and 4 AP to 6 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 232 ms :[(OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), true, (NOT p0)]
Stuttering acceptance computed with spot in 258 ms :[(OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), true, (NOT p0)]
Stuttering acceptance computed with spot in 253 ms :[(OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), true, (NOT p0)]
Product exploration explored 100000 steps with 2599 reset in 408 ms.
Product exploration explored 100000 steps with 2591 reset in 474 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 197 ms :[(OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), true, (NOT p0)]
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2022-05-16 19:31:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:31:23] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 19:31:23] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Product exploration explored 100000 steps with 2614 reset in 437 ms.
Product exploration explored 100000 steps with 2608 reset in 368 ms.
Built C files in :
/tmp/ltsmin12437030553593114042
[2022-05-16 19:31:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12437030553593114042
Running compilation step : cd /tmp/ltsmin12437030553593114042;'/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 338 ms.
Running link step : cd /tmp/ltsmin12437030553593114042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12437030553593114042;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12901391314809399743.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:31:39] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:31:39] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:31:39] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:31:39] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 153 cols
[2022-05-16 19:31:39] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 19:31:39] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 97/97 transitions.
Built C files in :
/tmp/ltsmin9259336714675427469
[2022-05-16 19:31:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9259336714675427469
Running compilation step : cd /tmp/ltsmin9259336714675427469;'/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 321 ms.
Running link step : cd /tmp/ltsmin9259336714675427469;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9259336714675427469;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2448853428505441406.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 19:31:54] [INFO ] Flatten gal took : 39 ms
[2022-05-16 19:31:54] [INFO ] Flatten gal took : 19 ms
[2022-05-16 19:31:54] [INFO ] Time to serialize gal into /tmp/LTL4906975347628174828.gal : 3 ms
[2022-05-16 19:31:54] [INFO ] Time to serialize properties into /tmp/LTL11663949810686062815.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4906975347628174828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11663949810686062815.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/LTL4906975...267
Read 1 LTL properties
Checking formula 0 : !((X((((F("((p106==1)&&(p122==1))"))&&(!("((p63==1)&&(p65==1))")))U("((p24==1)&&(p70==1))"))||(G(X("((p24==0)||(p70==0))"))))))
Formula 0 simplified : !X(((!"((p63==1)&&(p65==1))" & F"((p106==1)&&(p122==1))") U "((p24==1)&&(p70==1))") | GX"((p24==0)||(p70==0))")
Detected timeout of ITS tools.
[2022-05-16 19:32:10] [INFO ] Flatten gal took : 9 ms
[2022-05-16 19:32:10] [INFO ] Applying decomposition
[2022-05-16 19:32:10] [INFO ] Flatten gal took : 8 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/graph6383287628032766652.txt' '-o' '/tmp/graph6383287628032766652.bin' '-w' '/tmp/graph6383287628032766652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6383287628032766652.bin' '-l' '-1' '-v' '-w' '/tmp/graph6383287628032766652.weights' '-q' '0' '-e' '0.001'
[2022-05-16 19:32:10] [INFO ] Decomposing Gal with order
[2022-05-16 19:32:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 19:32:10] [INFO ] Removed a total of 16 redundant transitions.
[2022-05-16 19:32:10] [INFO ] Flatten gal took : 18 ms
[2022-05-16 19:32:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 19:32:10] [INFO ] Time to serialize gal into /tmp/LTL15481755621277133707.gal : 4 ms
[2022-05-16 19:32:10] [INFO ] Time to serialize properties into /tmp/LTL3600023422918419663.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/LTL15481755621277133707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3600023422918419663.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/LTL1548175...246
Read 1 LTL properties
Checking formula 0 : !((X((((F("((i9.u30.p106==1)&&(i9.u38.p122==1))"))&&(!("((i2.u7.p63==1)&&(i2.u10.p65==1))")))U("((i1.u13.p24==1)&&(i1.u13.p70==1))"))|...203
Formula 0 simplified : !X(((!"((i2.u7.p63==1)&&(i2.u10.p65==1))" & F"((i9.u30.p106==1)&&(i9.u38.p122==1))") U "((i1.u13.p24==1)&&(i1.u13.p70==1))") | GX"((...189
Reverse transition relation is NOT exact ! Due to transitions t1, t57, t58, u14.t11, u48.t5, u48.t21, i0.u2.t8, i0.u2.t31, i0.u2.t35, i0.u2.t36, i0.u2.t37,...390
Computing Next relation with stutter on 184834 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10031001226322793871
[2022-05-16 19:32:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10031001226322793871
Running compilation step : cd /tmp/ltsmin10031001226322793871;'/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 337 ms.
Running link step : cd /tmp/ltsmin10031001226322793871;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10031001226322793871;'/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((((<>((LTLAPp0==true))&&!(LTLAPp1==true)) U (LTLAPp2==true))||[](X((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-10a-LTLFireability-15 finished in 111524 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((F(p0)&&!p1) U p2)||G(X(p3)))))'
[2022-05-16 19:32:40] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8564088914050739053
[2022-05-16 19:32:40] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2022-05-16 19:32:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 19:32:40] [INFO ] Applying decomposition
[2022-05-16 19:32:40] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2022-05-16 19:32:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 19:32:40] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2022-05-16 19:32:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 19:32:40] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8564088914050739053
Running compilation step : cd /tmp/ltsmin8564088914050739053;'/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-05-16 19:32:40] [INFO ] Flatten gal took : 22 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/graph9536387580454452672.txt' '-o' '/tmp/graph9536387580454452672.bin' '-w' '/tmp/graph9536387580454452672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9536387580454452672.bin' '-l' '-1' '-v' '-w' '/tmp/graph9536387580454452672.weights' '-q' '0' '-e' '0.001'
[2022-05-16 19:32:40] [INFO ] Decomposing Gal with order
[2022-05-16 19:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 19:32:40] [INFO ] Removed a total of 23 redundant transitions.
[2022-05-16 19:32:40] [INFO ] Flatten gal took : 56 ms
[2022-05-16 19:32:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 18 ms.
[2022-05-16 19:32:40] [INFO ] Time to serialize gal into /tmp/LTLFireability6512802098141252803.gal : 5 ms
[2022-05-16 19:32:40] [INFO ] Time to serialize properties into /tmp/LTLFireability574159303166129265.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/LTLFireability6512802098141252803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability574159303166129265.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...266
Read 1 LTL properties
Checking formula 0 : !((X((((F("((i11.u31.p106==1)&&(i11.u39.p122==1))"))&&(!("((i2.u9.p63==1)&&(i2.u10.p65==1))")))U("((u13.p24==1)&&(u13.p70==1))"))||(G(...193
Formula 0 simplified : !X(((!"((i2.u9.p63==1)&&(i2.u10.p65==1))" & F"((i11.u31.p106==1)&&(i11.u39.p122==1))") U "((u13.p24==1)&&(u13.p70==1))") | GX"((u13....179
Compilation finished in 532 ms.
Running link step : cd /tmp/ltsmin8564088914050739053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8564088914050739053;'/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((((<>((LTLAPp0==true))&&!(LTLAPp1==true)) U (LTLAPp2==true))||[](X((LTLAPp3==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t57, t58, t90, u13.t50, u49.t5, u49.t21, i0.u2.t8, i0.u2.t31, i0.u2.t35, i0.u2.t36, i0.u2...383
Computing Next relation with stutter on 184834 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: LTL layer: formula: X((((<>((LTLAPp0==true))&&!(LTLAPp1==true)) U (LTLAPp2==true))||[](X((LTLAPp3==true)))))
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: "X((((<>((LTLAPp0==true))&&!(LTLAPp1==true)) U (LTLAPp2==true))||[](X((LTLAPp3==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: buchi has 10 states
pins2lts-mc-linux64( 0/ 8), 0.020: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.072: DFS-FIFO for weak LTL, using special progress label 102
pins2lts-mc-linux64( 0/ 8), 0.072: There are 103 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.072: State length is 154, there are 128 groups
pins2lts-mc-linux64( 0/ 8), 0.072: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.072: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.072: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.072: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.103: ~1 levels ~960 states ~6232 transitions
pins2lts-mc-linux64( 1/ 8), 0.141: ~1 levels ~1920 states ~11704 transitions
pins2lts-mc-linux64( 1/ 8), 0.189: ~1 levels ~3840 states ~21120 transitions
pins2lts-mc-linux64( 1/ 8), 0.266: ~1 levels ~7680 states ~38664 transitions
pins2lts-mc-linux64( 0/ 8), 0.457: ~1 levels ~15360 states ~85456 transitions
pins2lts-mc-linux64( 5/ 8), 0.710: ~1 levels ~30720 states ~172616 transitions
pins2lts-mc-linux64( 5/ 8), 1.197: ~1 levels ~61440 states ~353936 transitions
pins2lts-mc-linux64( 5/ 8), 2.116: ~1 levels ~122880 states ~734400 transitions
pins2lts-mc-linux64( 6/ 8), 3.556: ~1 levels ~245760 states ~1407472 transitions
pins2lts-mc-linux64( 6/ 8), 6.299: ~1 levels ~491520 states ~3337368 transitions
pins2lts-mc-linux64( 6/ 8), 10.197: ~1 levels ~983040 states ~8111864 transitions
pins2lts-mc-linux64( 6/ 8), 17.409: ~1 levels ~1966080 states ~18220560 transitions
pins2lts-mc-linux64( 6/ 8), 31.946: ~1 levels ~3932160 states ~38954304 transitions
pins2lts-mc-linux64( 6/ 8), 60.760: ~1 levels ~7864320 states ~79499944 transitions
pins2lts-mc-linux64( 6/ 8), 118.387: ~1 levels ~15728640 states ~161523896 transitions
pins2lts-mc-linux64( 6/ 8), 233.120: ~1 levels ~31457280 states ~324698584 transitions
pins2lts-mc-linux64( 3/ 8), 465.592: ~1 levels ~62914560 states ~666405032 transitions
pins2lts-mc-linux64( 0/ 8), 852.754: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 852.802:
pins2lts-mc-linux64( 0/ 8), 852.803: mean standard work distribution: 4.9% (states) 1.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 852.803:
pins2lts-mc-linux64( 0/ 8), 852.803: Explored 104301552 states 1130802032 transitions, fanout: 10.842
pins2lts-mc-linux64( 0/ 8), 852.803: Total exploration time 852.710 sec (852.660 sec minimum, 852.681 sec on average)
pins2lts-mc-linux64( 0/ 8), 852.803: States per second: 122318, Transitions per second: 1326127
pins2lts-mc-linux64( 0/ 8), 852.803:
pins2lts-mc-linux64( 0/ 8), 852.803: Progress states detected: 134217298
pins2lts-mc-linux64( 0/ 8), 852.803: Redundant explorations: -22.2891
pins2lts-mc-linux64( 0/ 8), 852.803:
pins2lts-mc-linux64( 0/ 8), 852.803: Queue width: 8B, total height: 63114623, memory: 481.53MB
pins2lts-mc-linux64( 0/ 8), 852.803: Tree memory: 1054.2MB, 8.2 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 852.803: Tree fill ratio (roots/leafs): 99.0%/11.0%
pins2lts-mc-linux64( 0/ 8), 852.803: Stored 97 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 852.803: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 852.803: Est. total memory use: 1535.7MB (~1505.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8564088914050739053;'/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((((<>((LTLAPp0==true))&&!(LTLAPp1==true)) U (LTLAPp2==true))||[](X((LTLAPp3==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8564088914050739053;'/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((((<>((LTLAPp0==true))&&!(LTLAPp1==true)) U (LTLAPp2==true))||[](X((LTLAPp3==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)
107 unique states visited
104 strongly connected components in search stack
110 transitions explored
104 items max in DFS search stack
54160 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,541.637,3621096,1,0,9.34016e+06,7381,921,1.00841e+07,431,36459,1840119
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-10a-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1203697 ms.

BK_STOP 1652730590807

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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="DES-PT-10a"
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 DES-PT-10a, 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 r042-smll-165252095700452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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