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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 6.4K Apr 29 15:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 29 15:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 29 15:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 29 15:57 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.6K May 9 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:23 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 70K 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-30a-LTLFireability-00
FORMULA_NAME DES-PT-30a-LTLFireability-01
FORMULA_NAME DES-PT-30a-LTLFireability-02
FORMULA_NAME DES-PT-30a-LTLFireability-03
FORMULA_NAME DES-PT-30a-LTLFireability-04
FORMULA_NAME DES-PT-30a-LTLFireability-05
FORMULA_NAME DES-PT-30a-LTLFireability-06
FORMULA_NAME DES-PT-30a-LTLFireability-07
FORMULA_NAME DES-PT-30a-LTLFireability-08
FORMULA_NAME DES-PT-30a-LTLFireability-09
FORMULA_NAME DES-PT-30a-LTLFireability-10
FORMULA_NAME DES-PT-30a-LTLFireability-11
FORMULA_NAME DES-PT-30a-LTLFireability-12
FORMULA_NAME DES-PT-30a-LTLFireability-13
FORMULA_NAME DES-PT-30a-LTLFireability-14
FORMULA_NAME DES-PT-30a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652750493266

Running Version 202205111006
[2022-05-17 01:21:35] [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-17 01:21:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 01:21:35] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2022-05-17 01:21:35] [INFO ] Transformed 234 places.
[2022-05-17 01:21:35] [INFO ] Transformed 191 transitions.
[2022-05-17 01:21:35] [INFO ] Found NUPN structural information;
[2022-05-17 01:21:35] [INFO ] Parsed PT model containing 234 places and 191 transitions in 442 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 233 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 176
Applied a total of 2 rules in 94 ms. Remains 233 /234 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 233 cols
[2022-05-17 01:21:36] [INFO ] Computed 59 place invariants in 37 ms
[2022-05-17 01:21:36] [INFO ] Implicit Places using invariants in 569 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 644 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/234 places, 176/177 transitions.
Applied a total of 0 rules in 14 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 232/234 places, 176/177 transitions.
Support contains 57 out of 232 places after structural reductions.
[2022-05-17 01:21:37] [INFO ] Flatten gal took : 112 ms
[2022-05-17 01:21:37] [INFO ] Flatten gal took : 54 ms
[2022-05-17 01:21:37] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 216 resets, run finished after 997 ms. (steps per millisecond=10 ) properties (out of 38) seen :25
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:21:40] [INFO ] Computed 58 place invariants in 9 ms
[2022-05-17 01:21:40] [INFO ] [Real]Absence check using 32 positive place invariants in 12 ms returned sat
[2022-05-17 01:21:40] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 25 ms returned sat
[2022-05-17 01:21:40] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2022-05-17 01:21:40] [INFO ] [Nat]Absence check using 32 positive place invariants in 14 ms returned sat
[2022-05-17 01:21:41] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 154 ms returned sat
[2022-05-17 01:21:42] [INFO ] After 1139ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :11
[2022-05-17 01:21:42] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 6 ms to minimize.
[2022-05-17 01:21:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-05-17 01:21:43] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 2 ms to minimize.
[2022-05-17 01:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2022-05-17 01:21:43] [INFO ] After 2618ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :11
Attempting to minimize the solution found.
Minimization took 831 ms.
[2022-05-17 01:21:44] [INFO ] After 3984ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :11
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1023 ms.
Support contains 17 out of 232 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 176/176 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 232 transition count 174
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 232 transition count 174
Applied a total of 6 rules in 40 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 342795 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 342795 steps, saw 51358 distinct states, run finished after 3004 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:21:50] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 01:21:50] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-17 01:21:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2022-05-17 01:21:50] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-17 01:21:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-05-17 01:21:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 212 ms returned sat
[2022-05-17 01:21:51] [INFO ] After 754ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-17 01:21:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 01:21:52] [INFO ] After 529ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-17 01:21:52] [INFO ] After 1273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 546 ms.
[2022-05-17 01:21:53] [INFO ] After 3100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 963 ms.
Support contains 17 out of 232 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 16 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 11 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:21:54] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 01:21:54] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:21:54] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 01:21:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 01:21:55] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2022-05-17 01:21:55] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:21:55] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 01:21:55] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 17 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:21:55] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 01:21:55] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-17 01:21:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2022-05-17 01:21:55] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-17 01:21:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-17 01:21:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 131 ms returned sat
[2022-05-17 01:21:56] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-17 01:21:57] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2022-05-17 01:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-17 01:21:57] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2022-05-17 01:21:57] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2022-05-17 01:21:57] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2022-05-17 01:21:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 379 ms
[2022-05-17 01:21:57] [INFO ] After 1647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 405 ms.
[2022-05-17 01:21:58] [INFO ] After 2420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2022-05-17 01:21:58] [INFO ] Flatten gal took : 43 ms
[2022-05-17 01:21:58] [INFO ] Flatten gal took : 41 ms
[2022-05-17 01:21:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15738677629463731420.gal : 15 ms
[2022-05-17 01:21:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18108639856894209712.prop : 2 ms
Invoking ITS tools like this :cd /tmp/redAtoms9645615056260238814;'/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/ReachabilityCardinality15738677629463731420.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18108639856894209712.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/ReachabilityCardinality18108639856894209712.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :13 after 20
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :20 after 71
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :71 after 85
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :85 after 521
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :521 after 1495
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :1495 after 3553
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :13397 after 128885
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :128885 after 1.7012e+06
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1.7012e+06 after 4.36343e+06
Detected timeout of ITS tools.
[2022-05-17 01:22:13] [INFO ] Flatten gal took : 31 ms
[2022-05-17 01:22:13] [INFO ] Applying decomposition
[2022-05-17 01:22:13] [INFO ] Flatten gal took : 24 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/graph2564216088734838420.txt' '-o' '/tmp/graph2564216088734838420.bin' '-w' '/tmp/graph2564216088734838420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2564216088734838420.bin' '-l' '-1' '-v' '-w' '/tmp/graph2564216088734838420.weights' '-q' '0' '-e' '0.001'
[2022-05-17 01:22:13] [INFO ] Decomposing Gal with order
[2022-05-17 01:22:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 01:22:13] [INFO ] Removed a total of 22 redundant transitions.
[2022-05-17 01:22:13] [INFO ] Flatten gal took : 132 ms
[2022-05-17 01:22:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 14 ms.
[2022-05-17 01:22:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17961321178162286333.gal : 11 ms
[2022-05-17 01:22:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3713027262738386126.prop : 2 ms
Invoking ITS tools like this :cd /tmp/redAtoms9645615056260238814;'/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/ReachabilityCardinality17961321178162286333.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3713027262738386126.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...299
Loading property file /tmp/ReachabilityCardinality3713027262738386126.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :5 after 371
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :371 after 1145
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :1145 after 10749
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :10749 after 2.81848e+08
Reachability property AtomicPropp4 is true.
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :2.81848e+08 after 5.03647e+08
Reachability property AtomicPropp15 is true.
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :5.03647e+08 after 7.23086e+08
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :7.23086e+08 after 1.17216e+10
Reachability property AtomicPropp9 is true.
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1.40262e+12 after 1.78423e+12
Reachability property AtomicPropp10 is true.
Reachability property AtomicPropp6 is true.
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :2.92905e+12 after 3.31066e+12
Reachability property AtomicPropp29 is true.
Reachability property AtomicPropp11 is true.
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3.69227e+12 after 4.07387e+12
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :4.83709e+12 after 4.96916e+12
Reachability property AtomicPropp25 is true.
Reachability property AtomicPropp8 is true.
Reachability property AtomicPropp7 is true.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.36352e+12 after 6.74513e+12
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.27156e+12 after 8.40363e+12
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,1.04687e+13,7.18118,157676,11616,3872,401359,13389,300,295711,305,88704,0
Total reachable state count : 10468710182155

Verifying 11 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,8.08495e+06,7.21658,157940,513,215,401359,13389,308,295711,312,88704,0
Reachability property AtomicPropp6 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
AtomicPropp6,6.21826e+10,7.2221,157940,1447,583,401359,13389,316,295711,317,88704,0
Reachability property AtomicPropp7 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
AtomicPropp7,889344,7.22445,157940,190,324,401359,13389,338,295711,325,88704,96
Reachability property AtomicPropp8 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
AtomicPropp8,6.21826e+10,7.22687,157940,1447,765,401359,13389,338,295711,325,88704,96
Reachability property AtomicPropp9 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
AtomicPropp9,6.21798e+10,7.22895,157940,1459,424,401359,13389,344,295711,329,88704,96
Reachability property AtomicPropp10 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
AtomicPropp10,5.43881e+10,7.23067,157940,1074,416,401359,13389,358,295711,339,88704,96
Reachability property AtomicPropp11 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
AtomicPropp11,1908,7.23312,157940,97,148,401359,13389,368,295711,341,88704,96
Reachability property AtomicPropp15 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
AtomicPropp15,8.08495e+06,7.23408,157940,513,227,401359,13389,376,295711,345,88704,96
Reachability property AtomicPropp25 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
AtomicPropp25,5.43881e+10,7.23637,157940,1074,687,401359,13389,386,295711,351,88704,96
Reachability property AtomicPropp29 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
AtomicPropp29,6.58742e+06,7.23776,157940,481,448,401359,13389,396,295711,357,88704,96
Reachability property AtomicPropp32 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
AtomicPropp32,486,7.24515,157940,99,135,401359,13389,402,295711,359,88704,96
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA DES-PT-30a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 135 stabilizing places and 130 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F((!p0 U G(p1))) U G(F(p1)))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:22:21] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:22:21] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:22:21] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:22:22] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:22:22] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:22:22] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 384 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s229 1) (EQ s231 1)), p1:(AND (EQ s220 1) (EQ s222 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 247 steps with 10 reset in 8 ms.
FORMULA DES-PT-30a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-00 finished in 1470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U !F((X(!F(!p0))&&X(p1)))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:22:22] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:22:23] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:22:23] [INFO ] Computed 58 place invariants in 9 ms
[2022-05-17 01:22:23] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:22:23] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:22:23] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND p1 p0), (AND p1 p0), p0]
Running random walk in product with property : DES-PT-30a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s74 1) (EQ s148 1)), p0:(AND (EQ s116 1) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2212 reset in 645 ms.
Product exploration explored 100000 steps with 2225 reset in 388 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 241 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 107 ms :[(AND p0 p1), (AND p0 p1), p0]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:22:25] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:22:25] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2022-05-17 01:22:25] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 21 ms returned sat
[2022-05-17 01:22:25] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 01:22:25] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2022-05-17 01:22:25] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 117 ms returned sat
[2022-05-17 01:22:25] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 01:22:25] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-17 01:22:26] [INFO ] After 464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 176/176 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 232 transition count 174
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 232 transition count 174
Applied a total of 6 rules in 27 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1198143 steps, run timeout after 3001 ms. (steps per millisecond=399 ) properties seen :{}
Probabilistic random walk after 1198143 steps, saw 167740 distinct states, run finished after 3001 ms. (steps per millisecond=399 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:22:29] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 01:22:29] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-17 01:22:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2022-05-17 01:22:29] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 01:22:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-17 01:22:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 123 ms returned sat
[2022-05-17 01:22:29] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 01:22:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 01:22:29] [INFO ] After 28ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 01:22:29] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-17 01:22:29] [INFO ] After 518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 18 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 18 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:22:29] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 01:22:30] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:22:30] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 01:22:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 01:22:30] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2022-05-17 01:22:30] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:22:30] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 01:22:30] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 16 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:22:30] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 01:22:30] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-17 01:22:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2022-05-17 01:22:30] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 01:22:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-17 01:22:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 124 ms returned sat
[2022-05-17 01:22:31] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 01:22:31] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-17 01:22:31] [INFO ] After 477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 01:22:31] [INFO ] Flatten gal took : 23 ms
[2022-05-17 01:22:31] [INFO ] Flatten gal took : 18 ms
[2022-05-17 01:22:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10767185751705249045.gal : 3 ms
[2022-05-17 01:22:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10648802123974161773.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4976355828768322904;'/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/ReachabilityCardinality10767185751705249045.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10648802123974161773.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/ReachabilityCardinality10648802123974161773.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 71
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :71 after 85
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :85 after 521
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :521 after 1495
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1495 after 3553
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :13397 after 128885
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :128885 after 1.7012e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.7012e+06 after 4.36343e+06
Detected timeout of ITS tools.
[2022-05-17 01:22:46] [INFO ] Flatten gal took : 18 ms
[2022-05-17 01:22:46] [INFO ] Applying decomposition
[2022-05-17 01:22:46] [INFO ] Flatten gal took : 17 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/graph13135802570296695994.txt' '-o' '/tmp/graph13135802570296695994.bin' '-w' '/tmp/graph13135802570296695994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13135802570296695994.bin' '-l' '-1' '-v' '-w' '/tmp/graph13135802570296695994.weights' '-q' '0' '-e' '0.001'
[2022-05-17 01:22:46] [INFO ] Decomposing Gal with order
[2022-05-17 01:22:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 01:22:46] [INFO ] Removed a total of 22 redundant transitions.
[2022-05-17 01:22:46] [INFO ] Flatten gal took : 44 ms
[2022-05-17 01:22:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2022-05-17 01:22:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12808582295295228895.gal : 7 ms
[2022-05-17 01:22:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5078019254848461824.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4976355828768322904;'/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/ReachabilityCardinality12808582295295228895.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5078019254848461824.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...299
Loading property file /tmp/ReachabilityCardinality5078019254848461824.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 1737
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1737 after 10749
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10749 after 1.6808e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.6808e+08 after 2.91301e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.91301e+08 after 4.63812e+08
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 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,1.08021e+11,0.943986,30200,2464,620,53450,5707,306,97852,302,19104,0
Total reachable state count : 108020930059

Verifying 1 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,1032,0.948405,30464,80,132,53450,5707,328,97852,315,19104,0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 342 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 130 ms :[(AND p0 p1), (AND p0 p1), p0]
Stuttering acceptance computed with spot in 129 ms :[(AND p0 p1), (AND p0 p1), p0]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:22:48] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-17 01:22:48] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:22:48] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:22:49] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:22:49] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:22:49] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 316 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 132 ms :[(AND p0 p1), (AND p0 p1), p0]
Incomplete random walk after 10000 steps, including 213 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:22:49] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:22:50] [INFO ] [Real]Absence check using 32 positive place invariants in 12 ms returned sat
[2022-05-17 01:22:50] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 32 ms returned sat
[2022-05-17 01:22:50] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 01:22:50] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2022-05-17 01:22:50] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 120 ms returned sat
[2022-05-17 01:22:50] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 01:22:50] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-17 01:22:50] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 176/176 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 232 transition count 174
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 232 transition count 174
Applied a total of 6 rules in 20 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 985908 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 985908 steps, saw 139567 distinct states, run finished after 3002 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:22:53] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 01:22:53] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-17 01:22:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2022-05-17 01:22:53] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 01:22:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-17 01:22:53] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 125 ms returned sat
[2022-05-17 01:22:54] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 01:22:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 01:22:54] [INFO ] After 44ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 01:22:54] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-17 01:22:54] [INFO ] After 652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 15 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:22:54] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 01:22:54] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:22:54] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 01:22:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 01:22:55] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
[2022-05-17 01:22:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:22:55] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 01:22:55] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:22:55] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 01:22:55] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-17 01:22:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2022-05-17 01:22:55] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 01:22:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-17 01:22:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 123 ms returned sat
[2022-05-17 01:22:56] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 01:22:56] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-17 01:22:56] [INFO ] After 452ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 01:22:56] [INFO ] Flatten gal took : 18 ms
[2022-05-17 01:22:56] [INFO ] Flatten gal took : 17 ms
[2022-05-17 01:22:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9309244578251859482.gal : 2 ms
[2022-05-17 01:22:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5919392209428449091.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15970793569246722999;'/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/ReachabilityCardinality9309244578251859482.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5919392209428449091.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/ReachabilityCardinality5919392209428449091.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 71
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :71 after 85
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :85 after 521
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :521 after 1495
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1495 after 3553
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :13397 after 128885
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :128885 after 1.7012e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.7012e+06 after 4.36343e+06
SDD proceeding with computation,1 properties remain. new max is 8192
Detected timeout of ITS tools.
[2022-05-17 01:23:11] [INFO ] Flatten gal took : 14 ms
[2022-05-17 01:23:11] [INFO ] Applying decomposition
[2022-05-17 01:23:11] [INFO ] Flatten gal took : 26 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/graph4083554012347842598.txt' '-o' '/tmp/graph4083554012347842598.bin' '-w' '/tmp/graph4083554012347842598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4083554012347842598.bin' '-l' '-1' '-v' '-w' '/tmp/graph4083554012347842598.weights' '-q' '0' '-e' '0.001'
[2022-05-17 01:23:11] [INFO ] Decomposing Gal with order
[2022-05-17 01:23:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 01:23:11] [INFO ] Removed a total of 42 redundant transitions.
[2022-05-17 01:23:11] [INFO ] Flatten gal took : 25 ms
[2022-05-17 01:23:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 4 ms.
[2022-05-17 01:23:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17240136226218949368.gal : 4 ms
[2022-05-17 01:23:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3237345683437062350.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15970793569246722999;'/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/ReachabilityCardinality17240136226218949368.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3237345683437062350.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...299
Loading property file /tmp/ReachabilityCardinality3237345683437062350.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 1705
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1705 after 10749
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10749 after 2.76911e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.76911e+08 after 4.81017e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.81017e+08 after 7.66765e+08
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 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,1.08021e+11,2.51707,63396,2869,549,107475,5492,335,325659,305,18829,0
Total reachable state count : 108020930059

Verifying 1 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,516,2.52493,63396,88,134,107475,5492,357,325659,318,18829,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 249 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 103 ms :[(AND p0 p1), (AND p0 p1), p0]
Stuttering acceptance computed with spot in 120 ms :[(AND p0 p1), (AND p0 p1), p0]
Stuttering acceptance computed with spot in 122 ms :[(AND p0 p1), (AND p0 p1), p0]
Product exploration explored 100000 steps with 2201 reset in 296 ms.
Product exploration explored 100000 steps with 2217 reset in 530 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 153 ms :[(AND p0 p1), (AND p0 p1), p0]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 59 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2022-05-17 01:23:15] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:23:15] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:23:16] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Product exploration explored 100000 steps with 2243 reset in 588 ms.
Product exploration explored 100000 steps with 2210 reset in 379 ms.
Built C files in :
/tmp/ltsmin5941973914625619123
[2022-05-17 01:23:17] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5941973914625619123
Running compilation step : cd /tmp/ltsmin5941973914625619123;'/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 937 ms.
Running link step : cd /tmp/ltsmin5941973914625619123;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin5941973914625619123;'/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/stateBased8377526355689331259.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:23:32] [INFO ] Computed 58 place invariants in 7 ms
[2022-05-17 01:23:32] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:23:32] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:23:33] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:23:33] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:23:33] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin10440350546235070959
[2022-05-17 01:23:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10440350546235070959
Running compilation step : cd /tmp/ltsmin10440350546235070959;'/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 674 ms.
Running link step : cd /tmp/ltsmin10440350546235070959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10440350546235070959;'/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/stateBased14207022223163178227.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 01:23:48] [INFO ] Flatten gal took : 18 ms
[2022-05-17 01:23:48] [INFO ] Flatten gal took : 16 ms
[2022-05-17 01:23:48] [INFO ] Time to serialize gal into /tmp/LTL16051226868430499946.gal : 3 ms
[2022-05-17 01:23:48] [INFO ] Time to serialize properties into /tmp/LTL11822850252598384743.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/LTL16051226868430499946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11822850252598384743.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/LTL1605122...268
Read 1 LTL properties
Checking formula 0 : !((!(F((X(!(F(!("((p116==1)&&(p124==1))")))))&&(X("((p74==1)&&(p149==1))"))))))
Formula 0 simplified : F(X!F!"((p116==1)&&(p124==1))" & X"((p74==1)&&(p149==1))")
Detected timeout of ITS tools.
[2022-05-17 01:24:03] [INFO ] Flatten gal took : 21 ms
[2022-05-17 01:24:03] [INFO ] Applying decomposition
[2022-05-17 01:24:03] [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/graph3072922074509834851.txt' '-o' '/tmp/graph3072922074509834851.bin' '-w' '/tmp/graph3072922074509834851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3072922074509834851.bin' '-l' '-1' '-v' '-w' '/tmp/graph3072922074509834851.weights' '-q' '0' '-e' '0.001'
[2022-05-17 01:24:03] [INFO ] Decomposing Gal with order
[2022-05-17 01:24:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 01:24:03] [INFO ] Removed a total of 14 redundant transitions.
[2022-05-17 01:24:03] [INFO ] Flatten gal took : 36 ms
[2022-05-17 01:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-17 01:24:03] [INFO ] Time to serialize gal into /tmp/LTL816241001725905057.gal : 11 ms
[2022-05-17 01:24:03] [INFO ] Time to serialize properties into /tmp/LTL5317832798023996338.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/LTL816241001725905057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5317832798023996338.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/LTL8162410...244
Read 1 LTL properties
Checking formula 0 : !((!(F((X(!(F(!("((i0.u2.p116==1)&&(i0.u2.p124==1))")))))&&(X("((u12.p74==1)&&(u12.p149==1))"))))))
Formula 0 simplified : F(X!F!"((i0.u2.p116==1)&&(i0.u2.p124==1))" & X"((u12.p74==1)&&(u12.p149==1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t136, t137, t169, u12.t129, u13.t11, u47.t5, u47.t40, i0.u2.t8, i0.u2.t70, i0.u2.t74, i0....629
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11709055569233073114
[2022-05-17 01:24:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11709055569233073114
Running compilation step : cd /tmp/ltsmin11709055569233073114;'/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 654 ms.
Running link step : cd /tmp/ltsmin11709055569233073114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11709055569233073114;'/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' '(false U !<>((X(!<>(!(LTLAPp0==true)))&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30a-LTLFireability-01 finished in 130963 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p0)||X(F(p1))))&&X(p2))))'
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:33] [INFO ] Computed 58 place invariants in 7 ms
[2022-05-17 01:24:34] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:34] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:24:34] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:34] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-17 01:24:34] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s42 1) (EQ s227 1)), p0:(AND (EQ s48 1) (EQ s227 1)), p1:(AND (EQ s42 1) (EQ s227 1) (EQ s164 1) (EQ s181 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-03 finished in 1318 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U !p1)&&(X(p2)||p3))))'
Support contains 9 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:35] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:24:35] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:35] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:24:35] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:35] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:24:36] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (NOT p0), p1, (NOT p2)]
Running random walk in product with property : DES-PT-30a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=1 dest: 5}], [{ 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 p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}]], initial=0, aps=[p1:(AND (EQ s23 1) (EQ s151 1) (EQ s153 1)), p0:(AND (EQ s54 1) (EQ s227 1)), p3:(AND (EQ s137 1) (EQ s139 1)), p2:(AND (EQ s106 1) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-04 finished in 1131 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)&&p0))&&X(p2)))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:36] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:24:36] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:36] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:24:37] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:37] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:24:37] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (EQ s62 1) (EQ s148 1)) (AND (EQ s30 1) (EQ s227 1))), p0:(AND (EQ s30 1) (EQ s227 1)), p2:(OR (EQ s62 0) (EQ s148 0))], 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 4 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-05 finished in 1360 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 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:37] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:24:38] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:38] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:24:38] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:38] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:24:38] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLFireability-06 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 s121 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-30a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-06 finished in 1133 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!(p0 U X(p1))&&(X(p3)||p2)))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:38] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:24:39] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:39] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:24:39] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:39] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:24:39] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR p1 (AND (NOT p2) (NOT p3))), p1, (AND (NOT p1) (NOT p2) (NOT p3)), false]
Running random walk in product with property : DES-PT-30a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s184 0) (EQ s200 0)), p1:(AND (EQ s184 1) (EQ s200 1)), p0:(AND (EQ s30 1) (EQ s227 1)), p3:(OR (EQ s30 0) (EQ s227 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33176 reset in 552 ms.
Product exploration explored 100000 steps with 33291 reset in 604 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0) p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
Knowledge based reduction with 13 factoid took 948 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 233 ms :[(OR p1 (AND (NOT p2) (NOT p3))), p1, (AND (NOT p1) (NOT p2) (NOT p3)), false]
Incomplete random walk after 10000 steps, including 215 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:42] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:24:42] [INFO ] [Real]Absence check using 32 positive place invariants in 12 ms returned sat
[2022-05-17 01:24:42] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 34 ms returned sat
[2022-05-17 01:24:42] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 01:24:43] [INFO ] [Nat]Absence check using 32 positive place invariants in 12 ms returned sat
[2022-05-17 01:24:43] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 148 ms returned sat
[2022-05-17 01:24:43] [INFO ] After 555ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0) p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p1 p0))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (F (AND (NOT p3) (NOT p1))), (F (AND (NOT p3) (NOT p1) p0)), (F (NOT p2)), (F (AND (NOT p2) p1)), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 15 factoid took 1232 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 214 ms :[p1, p1, false, false]
Stuttering acceptance computed with spot in 310 ms :[p1, p1, false, false]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:45] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:24:45] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:45] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:24:46] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:24:46] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:24:46] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p3 (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND p2 (NOT p3) p0)), (X (AND (NOT p1) (NOT p3))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR (AND p2 p0) (AND p3 p0)))), (X (X (NOT (OR (AND p2 p0) (AND p3 p0)))))]
Knowledge based reduction with 9 factoid took 670 ms. Reduced automaton from 4 states, 9 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 201 ms :[p1, p1, false, false]
Finished random walk after 41 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p2 (NOT p1) p3 (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND p2 (NOT p3) p0)), (X (AND (NOT p1) (NOT p3))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR (AND p2 p0) (AND p3 p0)))), (X (X (NOT (OR (AND p2 p0) (AND p3 p0))))), (F (AND p2 p0 (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (OR (AND p2 p0) (AND p0 p3))), (F (NOT p2)), (F (AND (NOT p2) p1)), (F p1)]
Knowledge based reduction with 9 factoid took 774 ms. Reduced automaton from 4 states, 9 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 181 ms :[p1, p1, false, false]
Stuttering acceptance computed with spot in 206 ms :[p1, p1, false, false]
Stuttering acceptance computed with spot in 174 ms :[p1, p1, false, false]
Product exploration explored 100000 steps with 33242 reset in 779 ms.
Product exploration explored 100000 steps with 33218 reset in 691 ms.
Built C files in :
/tmp/ltsmin9262668402596067357
[2022-05-17 01:24:50] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9262668402596067357
Running compilation step : cd /tmp/ltsmin9262668402596067357;'/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 687 ms.
Running link step : cd /tmp/ltsmin9262668402596067357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9262668402596067357;'/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/stateBased7344918219889826290.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:25:05] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:25:05] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:25:05] [INFO ] Computed 58 place invariants in 6 ms
[2022-05-17 01:25:06] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:25:06] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:25:06] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin7771691085533484671
[2022-05-17 01:25:06] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7771691085533484671
Running compilation step : cd /tmp/ltsmin7771691085533484671;'/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 680 ms.
Running link step : cd /tmp/ltsmin7771691085533484671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7771691085533484671;'/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/stateBased9930625683056750311.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 01:25:21] [INFO ] Flatten gal took : 29 ms
[2022-05-17 01:25:21] [INFO ] Flatten gal took : 15 ms
[2022-05-17 01:25:21] [INFO ] Time to serialize gal into /tmp/LTL5879418153723468804.gal : 2 ms
[2022-05-17 01:25:21] [INFO ] Time to serialize properties into /tmp/LTL3493476243655048639.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5879418153723468804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3493476243655048639.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/LTL5879418...266
Read 1 LTL properties
Checking formula 0 : !((G(F((!(("((p30==1)&&(p229==1))")U(X("((p185==1)&&(p201==1))"))))&&(((X("((p30==0)||(p229==0))"))||("(p185==0)"))||("(p201==0)")))))...156
Formula 0 simplified : !GF(!("((p30==1)&&(p229==1))" U X"((p185==1)&&(p201==1))") & ("(p185==0)" | "(p201==0)" | X"((p30==0)||(p229==0))"))
Detected timeout of ITS tools.
[2022-05-17 01:25:36] [INFO ] Flatten gal took : 13 ms
[2022-05-17 01:25:36] [INFO ] Applying decomposition
[2022-05-17 01:25:36] [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/graph107820791837822139.txt' '-o' '/tmp/graph107820791837822139.bin' '-w' '/tmp/graph107820791837822139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph107820791837822139.bin' '-l' '-1' '-v' '-w' '/tmp/graph107820791837822139.weights' '-q' '0' '-e' '0.001'
[2022-05-17 01:25:36] [INFO ] Decomposing Gal with order
[2022-05-17 01:25:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 01:25:36] [INFO ] Removed a total of 16 redundant transitions.
[2022-05-17 01:25:36] [INFO ] Flatten gal took : 48 ms
[2022-05-17 01:25:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 15 ms.
[2022-05-17 01:25:36] [INFO ] Time to serialize gal into /tmp/LTL13305623437840208963.gal : 4 ms
[2022-05-17 01:25:36] [INFO ] Time to serialize properties into /tmp/LTL14837398422563801395.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13305623437840208963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14837398422563801395.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/LTL1330562...247
Read 1 LTL properties
Checking formula 0 : !((G(F((!(("((u48.p30==1)&&(u48.p229==1))")U(X("((i7.u30.p185==1)&&(i7.u38.p201==1))"))))&&(((X("((u48.p30==0)||(u48.p229==0))"))||("(...200
Formula 0 simplified : !GF(!("((u48.p30==1)&&(u48.p229==1))" U X"((i7.u30.p185==1)&&(i7.u38.p201==1))") & ("(i7.u30.p185==0)" | "(i7.u38.p201==0)" | X"((u4...183
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1554188092724413516
[2022-05-17 01:25:51] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1554188092724413516
Running compilation step : cd /tmp/ltsmin1554188092724413516;'/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 481 ms.
Running link step : cd /tmp/ltsmin1554188092724413516;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1554188092724413516;'/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' '[](<>((!((LTLAPp0==true) U X((LTLAPp1==true)))&&(X((LTLAPp3==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30a-LTLFireability-07 finished in 88141 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(X(p1)||F(p1)))))'
Support contains 10 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 17 ms. Remains 231 /232 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 231 cols
[2022-05-17 01:26:07] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:26:07] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 175 rows 231 cols
[2022-05-17 01:26:07] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:07] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2022-05-17 01:26:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 175 rows 231 cols
[2022-05-17 01:26:07] [INFO ] Computed 58 place invariants in 11 ms
[2022-05-17 01:26:07] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/232 places, 175/176 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s190 0) (EQ s192 0) (EQ s194 0) (EQ s196 0) (EQ s198 0) (EQ s200 0) (EQ s202 0) (EQ s204 0)), p1:(AND (EQ s140 1) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 88 steps with 1 reset in 1 ms.
FORMULA DES-PT-30a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-08 finished in 880 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:07] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:08] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:08] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:26:08] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2022-05-17 01:26:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:08] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:08] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s140 1) (EQ s145 1) (EQ s147 1)), p0:(AND (EQ s140 1) (EQ s145 1) (EQ s147 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, null][true, true]]
Stuttering criterion allowed to conclude after 53 steps with 1 reset in 1 ms.
FORMULA DES-PT-30a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-10 finished in 1136 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:09] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:09] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:09] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:26:10] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:10] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:10] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s11 1) (EQ s151 1) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-12 finished in 1602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p1)&&(p1 U p1)&&G(p2)&&p0) U X(!p3)))'
Support contains 7 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:10] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:10] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:10] [INFO ] Computed 58 place invariants in 6 ms
[2022-05-17 01:26:11] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:11] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:11] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 185 ms :[p3, p3, p3, true, (NOT p2)]
Running random walk in product with property : DES-PT-30a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=0 dest: 2}], [{ cond=p3, acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1 (NOT p0) p3), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p1 p0 p3), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p2) p3) (AND (NOT p1) p3)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 p1 p3), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s172 1) (EQ s189 1)), p1:(AND (EQ s121 1) (EQ s133 1)), p0:(AND (EQ s121 1) (EQ s133 1)), p3:(AND (EQ s19 1) (EQ s151 1) (EQ s153 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]]
Product exploration explored 100000 steps with 50000 reset in 587 ms.
Product exploration explored 100000 steps with 50000 reset in 614 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p1) p3)))), (X (NOT (AND p2 p1 (NOT p0) p3))), (X (NOT (AND p2 p1 p0 p3))), (X (NOT (AND p2 p1 p3))), true, (X (X (NOT p3))), (X (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p1) p3))))), (X (X (NOT (AND p2 p1 (NOT p0) p3)))), (X (X (NOT (AND p2 p1 p0 p3)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1 p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p3))
Knowledge based reduction with 14 factoid took 301 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-30a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-13 finished in 3002 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F((!(p1 U p2)&&(X(p4)||p3)))))'
Support contains 7 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:13] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:26:13] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:13] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:14] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:14] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:14] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) p2 (AND (NOT p3) (NOT p4))), (OR p2 (AND (NOT p3) (NOT p4))), (NOT p0), (OR (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), p2, true]
Running random walk in product with property : DES-PT-30a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 (NOT p4)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p4)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s91 1) (EQ s124 1)), p3:(OR (EQ s131 0) (EQ s141 0) (EQ s143 0)), p1:(AND (EQ s217 1) (EQ s226 1)), p0:(AND (EQ s131 1) (EQ s141 1) (EQ s143 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-14 finished in 1275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(F(p0)) U (G(F(p1))||p2))))'
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 19 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:14] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:15] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:15] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:26:15] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2022-05-17 01:26:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:15] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 01:26:15] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR p2 p1), (OR (AND p0 p2) (AND p0 p1)), p1, (AND p0 p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s158 1) (EQ s175 1)), p0:(AND (EQ s130 1) (EQ s223 1)), p1:(AND (EQ s170 1) (EQ s187 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2242 reset in 333 ms.
Product exploration explored 100000 steps with 2255 reset in 413 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1132 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 182 ms :[(OR p1 (AND p0 p2)), (OR (AND p0 p2) (AND p0 p1)), p1, (AND p0 p1)]
Finished random walk after 7940 steps, including 182 resets, run visited all 10 properties in 77 ms. (steps per millisecond=103 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 19 factoid took 1452 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 217 ms :[(OR p1 (AND p0 p2)), (OR (AND p0 p2) (AND p0 p1)), p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 227 ms :[(OR p1 (AND p0 p2)), (OR (AND p0 p2) (AND p0 p1)), p1, (AND p0 p1)]
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 19 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:20] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:26:20] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:20] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:26:21] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
[2022-05-17 01:26:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:21] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-17 01:26:21] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (NOT (AND p0 p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1141 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 209 ms :[(OR p1 (AND p0 p2)), (OR (AND p0 p2) (AND p0 p1)), p1, (AND p0 p1)]
Finished random walk after 1111 steps, including 27 resets, run visited all 10 properties in 7 ms. (steps per millisecond=158 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (NOT (AND p0 p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 17 factoid took 1162 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[(OR p1 (AND p0 p2)), (OR (AND p0 p2) (AND p0 p1)), p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 189 ms :[(OR p1 (AND p0 p2)), (OR (AND p0 p2) (AND p0 p1)), p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 200 ms :[(OR p1 (AND p0 p2)), (OR (AND p0 p2) (AND p0 p1)), p1, (AND p0 p1)]
Product exploration explored 100000 steps with 2208 reset in 388 ms.
Product exploration explored 100000 steps with 2226 reset in 581 ms.
Built C files in :
/tmp/ltsmin12844725473883920157
[2022-05-17 01:26:25] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2022-05-17 01:26:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 01:26:25] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2022-05-17 01:26:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 01:26:25] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2022-05-17 01:26:25] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 01:26:25] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12844725473883920157
Running compilation step : cd /tmp/ltsmin12844725473883920157;'/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 618 ms.
Running link step : cd /tmp/ltsmin12844725473883920157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12844725473883920157;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10160586273519543611.hoa' '--buchi-type=spotba'
LTSmin run took 238 ms.
FORMULA DES-PT-30a-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30a-LTLFireability-15 finished in 11627 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U !F((X(!F(!p0))&&X(p1)))))'
Found a SL insensitive property : DES-PT-30a-LTLFireability-01
Stuttering acceptance computed with spot in 144 ms :[(AND p1 p0), (AND p1 p0), p0]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:26] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:27] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:27] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:26:27] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:27] [INFO ] Computed 58 place invariants in 11 ms
[2022-05-17 01:26:27] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Running random walk in product with property : DES-PT-30a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s74 1) (EQ s148 1)), p0:(AND (EQ s116 1) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2222 reset in 413 ms.
Product exploration explored 100000 steps with 2228 reset in 463 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 256 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 118 ms :[(AND p0 p1), (AND p0 p1), p0]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:29] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:29] [INFO ] [Real]Absence check using 32 positive place invariants in 13 ms returned sat
[2022-05-17 01:26:29] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 35 ms returned sat
[2022-05-17 01:26:29] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 01:26:29] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2022-05-17 01:26:29] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 205 ms returned sat
[2022-05-17 01:26:30] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 01:26:30] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-17 01:26:30] [INFO ] After 797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 176/176 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 232 transition count 174
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 232 transition count 174
Applied a total of 6 rules in 41 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 123 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1153402 steps, run timeout after 3001 ms. (steps per millisecond=384 ) properties seen :{}
Probabilistic random walk after 1153402 steps, saw 161691 distinct states, run finished after 3002 ms. (steps per millisecond=384 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:26:33] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 01:26:33] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-17 01:26:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2022-05-17 01:26:33] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 01:26:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-17 01:26:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 123 ms returned sat
[2022-05-17 01:26:33] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 01:26:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 01:26:33] [INFO ] After 31ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 01:26:34] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-17 01:26:34] [INFO ] After 564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:26:34] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 01:26:34] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:26:34] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 01:26:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 01:26:35] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2022-05-17 01:26:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:26:35] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 01:26:35] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 15 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:26:35] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 01:26:35] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-17 01:26:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 26 ms returned sat
[2022-05-17 01:26:35] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 01:26:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-17 01:26:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 179 ms returned sat
[2022-05-17 01:26:36] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 01:26:36] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-17 01:26:36] [INFO ] After 611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 01:26:36] [INFO ] Flatten gal took : 11 ms
[2022-05-17 01:26:36] [INFO ] Flatten gal took : 9 ms
[2022-05-17 01:26:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15281712088187387576.gal : 2 ms
[2022-05-17 01:26:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7698402374851303372.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16229414494329717349;'/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/ReachabilityCardinality15281712088187387576.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7698402374851303372.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...320
Loading property file /tmp/ReachabilityCardinality7698402374851303372.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 71
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :71 after 85
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :85 after 521
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :521 after 1495
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1495 after 3553
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :13397 after 128885
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :128885 after 1.7012e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.7012e+06 after 4.36343e+06
Detected timeout of ITS tools.
[2022-05-17 01:26:51] [INFO ] Flatten gal took : 17 ms
[2022-05-17 01:26:51] [INFO ] Applying decomposition
[2022-05-17 01:26:51] [INFO ] Flatten gal took : 17 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/graph6892833734513717638.txt' '-o' '/tmp/graph6892833734513717638.bin' '-w' '/tmp/graph6892833734513717638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6892833734513717638.bin' '-l' '-1' '-v' '-w' '/tmp/graph6892833734513717638.weights' '-q' '0' '-e' '0.001'
[2022-05-17 01:26:51] [INFO ] Decomposing Gal with order
[2022-05-17 01:26:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 01:26:51] [INFO ] Removed a total of 22 redundant transitions.
[2022-05-17 01:26:51] [INFO ] Flatten gal took : 31 ms
[2022-05-17 01:26:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2022-05-17 01:26:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6001583063357579205.gal : 4 ms
[2022-05-17 01:26:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13966545770307461893.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16229414494329717349;'/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/ReachabilityCardinality6001583063357579205.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13966545770307461893.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...299
Loading property file /tmp/ReachabilityCardinality13966545770307461893.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 371
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :371 after 1145
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1145 after 10749
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10749 after 2.81848e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.81848e+08 after 5.03647e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.03647e+08 after 1.17216e+10
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 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.31066e+12,2.90233,61064,5576,1225,144225,5690,296,150874,302,16782,0
Total reachable state count : 3310659477287

Verifying 1 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,1848,2.91281,61328,93,135,144225,5690,318,150874,315,16782,0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 305 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 126 ms :[(AND p0 p1), (AND p0 p1), p0]
Stuttering acceptance computed with spot in 119 ms :[(AND p0 p1), (AND p0 p1), p0]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:54] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:55] [INFO ] Implicit Places using invariants in 393 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:55] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:26:55] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:55] [INFO ] Computed 58 place invariants in 7 ms
[2022-05-17 01:26:56] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 296 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 133 ms :[(AND p0 p1), (AND p0 p1), p0]
Incomplete random walk after 10000 steps, including 214 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:26:56] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:26:56] [INFO ] [Real]Absence check using 32 positive place invariants in 12 ms returned sat
[2022-05-17 01:26:56] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 22 ms returned sat
[2022-05-17 01:26:56] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 01:26:56] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2022-05-17 01:26:56] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 121 ms returned sat
[2022-05-17 01:26:57] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 01:26:57] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-17 01:26:57] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 176/176 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 232 transition count 174
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 232 transition count 174
Applied a total of 6 rules in 25 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1205928 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :{}
Probabilistic random walk after 1205928 steps, saw 168875 distinct states, run finished after 3001 ms. (steps per millisecond=401 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:27:00] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 01:27:00] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-05-17 01:27:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2022-05-17 01:27:00] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 01:27:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-05-17 01:27:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 211 ms returned sat
[2022-05-17 01:27:01] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 01:27:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 01:27:01] [INFO ] After 40ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 01:27:01] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-17 01:27:01] [INFO ] After 741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:27:01] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 01:27:01] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:27:01] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 01:27:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 01:27:02] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2022-05-17 01:27:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:27:02] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 01:27:02] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2022-05-17 01:27:02] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 01:27:02] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-17 01:27:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2022-05-17 01:27:02] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 01:27:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-17 01:27:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 125 ms returned sat
[2022-05-17 01:27:02] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 01:27:02] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-17 01:27:02] [INFO ] After 506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 01:27:02] [INFO ] Flatten gal took : 17 ms
[2022-05-17 01:27:02] [INFO ] Flatten gal took : 16 ms
[2022-05-17 01:27:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2176806958158717940.gal : 4 ms
[2022-05-17 01:27:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18155991760372722692.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17384654082807660282;'/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/ReachabilityCardinality2176806958158717940.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18155991760372722692.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...320
Loading property file /tmp/ReachabilityCardinality18155991760372722692.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 71
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :71 after 85
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :85 after 521
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :521 after 1495
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1495 after 3553
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :13397 after 128885
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :128885 after 1.7012e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.7012e+06 after 4.36343e+06
Detected timeout of ITS tools.
[2022-05-17 01:27:17] [INFO ] Flatten gal took : 15 ms
[2022-05-17 01:27:18] [INFO ] Applying decomposition
[2022-05-17 01:27:18] [INFO ] Flatten gal took : 18 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/graph11071548423165231340.txt' '-o' '/tmp/graph11071548423165231340.bin' '-w' '/tmp/graph11071548423165231340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11071548423165231340.bin' '-l' '-1' '-v' '-w' '/tmp/graph11071548423165231340.weights' '-q' '0' '-e' '0.001'
[2022-05-17 01:27:18] [INFO ] Decomposing Gal with order
[2022-05-17 01:27:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 01:27:18] [INFO ] Removed a total of 21 redundant transitions.
[2022-05-17 01:27:18] [INFO ] Flatten gal took : 20 ms
[2022-05-17 01:27:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2022-05-17 01:27:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9759018972420789405.gal : 3 ms
[2022-05-17 01:27:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality417544212917478427.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17384654082807660282;'/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/ReachabilityCardinality9759018972420789405.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality417544212917478427.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...297
Loading property file /tmp/ReachabilityCardinality417544212917478427.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 361
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :361 after 1145
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1145 after 10749
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10749 after 1.09983e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.09983e+09 after 1.9743e+09
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 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,1.06785e+11,0.664293,21988,2554,599,33054,3637,295,89047,303,6967,0
Total reachable state count : 106785109971

Verifying 1 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,516,0.667891,22252,82,136,33054,3637,317,89047,316,6967,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 250 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 100 ms :[(AND p0 p1), (AND p0 p1), p0]
Stuttering acceptance computed with spot in 109 ms :[(AND p0 p1), (AND p0 p1), p0]
Stuttering acceptance computed with spot in 186 ms :[(AND p0 p1), (AND p0 p1), p0]
Product exploration explored 100000 steps with 2242 reset in 233 ms.
Product exploration explored 100000 steps with 2242 reset in 462 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 123 ms :[(AND p0 p1), (AND p0 p1), p0]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2022-05-17 01:27:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:27:20] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:27:20] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Product exploration explored 100000 steps with 2200 reset in 470 ms.
Product exploration explored 100000 steps with 2243 reset in 317 ms.
Built C files in :
/tmp/ltsmin5606658873340061172
[2022-05-17 01:27:21] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5606658873340061172
Running compilation step : cd /tmp/ltsmin5606658873340061172;'/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 681 ms.
Running link step : cd /tmp/ltsmin5606658873340061172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5606658873340061172;'/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/stateBased14612802724436294538.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:27:36] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:27:36] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:27:36] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:27:37] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:27:37] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:27:37] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin7743509954425792157
[2022-05-17 01:27:37] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7743509954425792157
Running compilation step : cd /tmp/ltsmin7743509954425792157;'/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 479 ms.
Running link step : cd /tmp/ltsmin7743509954425792157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7743509954425792157;'/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/stateBased7986366376073326756.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 01:27:52] [INFO ] Flatten gal took : 11 ms
[2022-05-17 01:27:52] [INFO ] Flatten gal took : 10 ms
[2022-05-17 01:27:52] [INFO ] Time to serialize gal into /tmp/LTL14752009221386344234.gal : 1 ms
[2022-05-17 01:27:52] [INFO ] Time to serialize properties into /tmp/LTL18315134224590186218.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/LTL14752009221386344234.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18315134224590186218.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/LTL1475200...268
Read 1 LTL properties
Checking formula 0 : !((!(F((X(!(F(!("((p116==1)&&(p124==1))")))))&&(X("((p74==1)&&(p149==1))"))))))
Formula 0 simplified : F(X!F!"((p116==1)&&(p124==1))" & X"((p74==1)&&(p149==1))")
Detected timeout of ITS tools.
[2022-05-17 01:28:07] [INFO ] Flatten gal took : 9 ms
[2022-05-17 01:28:07] [INFO ] Applying decomposition
[2022-05-17 01:28:07] [INFO ] Flatten gal took : 9 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/graph12185806562110698218.txt' '-o' '/tmp/graph12185806562110698218.bin' '-w' '/tmp/graph12185806562110698218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12185806562110698218.bin' '-l' '-1' '-v' '-w' '/tmp/graph12185806562110698218.weights' '-q' '0' '-e' '0.001'
[2022-05-17 01:28:07] [INFO ] Decomposing Gal with order
[2022-05-17 01:28:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 01:28:07] [INFO ] Removed a total of 39 redundant transitions.
[2022-05-17 01:28:07] [INFO ] Flatten gal took : 18 ms
[2022-05-17 01:28:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 2 ms.
[2022-05-17 01:28:07] [INFO ] Time to serialize gal into /tmp/LTL14035863502330899432.gal : 2 ms
[2022-05-17 01:28:07] [INFO ] Time to serialize properties into /tmp/LTL6757633367264237765.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14035863502330899432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6757633367264237765.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/LTL1403586...246
Read 1 LTL properties
Checking formula 0 : !((!(F((X(!(F(!("((i1.u2.p116==1)&&(i1.u2.p124==1))")))))&&(X("((u13.p74==1)&&(u13.p149==1))"))))))
Formula 0 simplified : F(X!F!"((i1.u2.p116==1)&&(i1.u2.p124==1))" & X"((u13.p74==1)&&(u13.p149==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5870954369187741388
[2022-05-17 01:28:23] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5870954369187741388
Running compilation step : cd /tmp/ltsmin5870954369187741388;'/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 521 ms.
Running link step : cd /tmp/ltsmin5870954369187741388;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5870954369187741388;'/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' '(false U !<>((X(!<>(!(LTLAPp0==true)))&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30a-LTLFireability-01 finished in 131598 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!(p0 U X(p1))&&(X(p3)||p2)))))'
Found a CL insensitive property : DES-PT-30a-LTLFireability-07
Stuttering acceptance computed with spot in 196 ms :[(OR p1 (AND (NOT p2) (NOT p3))), p1, (AND (NOT p1) (NOT p2) (NOT p3)), false]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:28:38] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:28:38] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:28:38] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-17 01:28:39] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:28:39] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:28:39] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Running random walk in product with property : DES-PT-30a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s184 0) (EQ s200 0)), p1:(AND (EQ s184 1) (EQ s200 1)), p0:(AND (EQ s30 1) (EQ s227 1)), p3:(OR (EQ s30 0) (EQ s227 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33209 reset in 486 ms.
Product exploration explored 100000 steps with 33346 reset in 508 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0) p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
Knowledge based reduction with 13 factoid took 1035 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 224 ms :[(OR p1 (AND (NOT p2) (NOT p3))), p1, (AND (NOT p1) (NOT p2) (NOT p3)), false]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:28:41] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:28:41] [INFO ] [Real]Absence check using 32 positive place invariants in 14 ms returned sat
[2022-05-17 01:28:41] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 33 ms returned sat
[2022-05-17 01:28:41] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 01:28:42] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2022-05-17 01:28:42] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 89 ms returned sat
[2022-05-17 01:28:42] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0) p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p1 p0))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (F (AND (NOT p3) (NOT p1))), (F (AND (NOT p3) (NOT p1) p0)), (F (NOT p2)), (F (AND (NOT p2) p1)), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 15 factoid took 1425 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 251 ms :[p1, p1, false, false]
Stuttering acceptance computed with spot in 226 ms :[p1, p1, false, false]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:28:44] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 01:28:44] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:28:44] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:28:45] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:28:45] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 01:28:45] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p3 (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND p2 (NOT p3) p0)), (X (AND (NOT p1) (NOT p3))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR (AND p2 p0) (AND p3 p0)))), (X (X (NOT (OR (AND p2 p0) (AND p3 p0)))))]
Knowledge based reduction with 9 factoid took 745 ms. Reduced automaton from 4 states, 9 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 234 ms :[p1, p1, false, false]
Finished random walk after 151 steps, including 3 resets, run visited all 6 properties in 5 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p2 (NOT p1) p3 (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND p2 (NOT p3) p0)), (X (AND (NOT p1) (NOT p3))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR (AND p2 p0) (AND p3 p0)))), (X (X (NOT (OR (AND p2 p0) (AND p3 p0))))), (F (AND p2 p0 (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (OR (AND p2 p0) (AND p0 p3))), (F (NOT p2)), (F (AND (NOT p2) p1)), (F p1)]
Knowledge based reduction with 9 factoid took 690 ms. Reduced automaton from 4 states, 9 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 161 ms :[p1, p1, false, false]
Stuttering acceptance computed with spot in 237 ms :[p1, p1, false, false]
Stuttering acceptance computed with spot in 200 ms :[p1, p1, false, false]
Product exploration explored 100000 steps with 33235 reset in 475 ms.
Product exploration explored 100000 steps with 33385 reset in 499 ms.
Built C files in :
/tmp/ltsmin2206111734633909550
[2022-05-17 01:28:48] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2206111734633909550
Running compilation step : cd /tmp/ltsmin2206111734633909550;'/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 777 ms.
Running link step : cd /tmp/ltsmin2206111734633909550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2206111734633909550;'/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/stateBased10326409002279188119.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:29:04] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:29:04] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:29:04] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:29:04] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 232 cols
[2022-05-17 01:29:04] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 01:29:04] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin2559676464242804824
[2022-05-17 01:29:05] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2559676464242804824
Running compilation step : cd /tmp/ltsmin2559676464242804824;'/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 749 ms.
Running link step : cd /tmp/ltsmin2559676464242804824;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2559676464242804824;'/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/stateBased923529681297991650.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 01:29:20] [INFO ] Flatten gal took : 9 ms
[2022-05-17 01:29:20] [INFO ] Flatten gal took : 9 ms
[2022-05-17 01:29:20] [INFO ] Time to serialize gal into /tmp/LTL7116531726455898366.gal : 1 ms
[2022-05-17 01:29:20] [INFO ] Time to serialize properties into /tmp/LTL4750501560848300658.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/LTL7116531726455898366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4750501560848300658.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/LTL7116531...266
Read 1 LTL properties
Checking formula 0 : !((G(F((!(("((p30==1)&&(p229==1))")U(X("((p185==1)&&(p201==1))"))))&&(((X("((p30==0)||(p229==0))"))||("(p185==0)"))||("(p201==0)")))))...156
Formula 0 simplified : !GF(!("((p30==1)&&(p229==1))" U X"((p185==1)&&(p201==1))") & ("(p185==0)" | "(p201==0)" | X"((p30==0)||(p229==0))"))
Detected timeout of ITS tools.
[2022-05-17 01:29:35] [INFO ] Flatten gal took : 9 ms
[2022-05-17 01:29:35] [INFO ] Applying decomposition
[2022-05-17 01:29:35] [INFO ] Flatten gal took : 9 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/graph769239399539486910.txt' '-o' '/tmp/graph769239399539486910.bin' '-w' '/tmp/graph769239399539486910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph769239399539486910.bin' '-l' '-1' '-v' '-w' '/tmp/graph769239399539486910.weights' '-q' '0' '-e' '0.001'
[2022-05-17 01:29:35] [INFO ] Decomposing Gal with order
[2022-05-17 01:29:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 01:29:35] [INFO ] Removed a total of 37 redundant transitions.
[2022-05-17 01:29:35] [INFO ] Flatten gal took : 18 ms
[2022-05-17 01:29:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 2 ms.
[2022-05-17 01:29:35] [INFO ] Time to serialize gal into /tmp/LTL2315732166176430721.gal : 3 ms
[2022-05-17 01:29:35] [INFO ] Time to serialize properties into /tmp/LTL15713067927763228703.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2315732166176430721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15713067927763228703.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/LTL2315732...246
Read 1 LTL properties
Checking formula 0 : !((G(F((!(("((u48.p30==1)&&(u48.p229==1))")U(X("((i10.u30.p185==1)&&(i10.u38.p201==1))"))))&&(((X("((u48.p30==0)||(u48.p229==0))"))||(...204
Formula 0 simplified : !GF(!("((u48.p30==1)&&(u48.p229==1))" U X"((i10.u30.p185==1)&&(i10.u38.p201==1))") & ("(i10.u30.p185==0)" | "(i10.u38.p201==0)" | X"...187
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin611062498895395331
[2022-05-17 01:29:50] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin611062498895395331
Running compilation step : cd /tmp/ltsmin611062498895395331;'/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 533 ms.
Running link step : cd /tmp/ltsmin611062498895395331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin611062498895395331;'/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' '[](<>((!((LTLAPp0==true) U X((LTLAPp1==true)))&&(X((LTLAPp3==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30a-LTLFireability-07 finished in 87276 ms.
[2022-05-17 01:30:05] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
[2022-05-17 01:30:05] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin3535078465278572630
[2022-05-17 01:30:05] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2022-05-17 01:30:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 01:30:05] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2022-05-17 01:30:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 01:30:05] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2022-05-17 01:30:05] [INFO ] Flatten gal took : 29 ms
[2022-05-17 01:30:05] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 01:30:05] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3535078465278572630
Running compilation step : cd /tmp/ltsmin3535078465278572630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
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/graph1888146563503192743.txt' '-o' '/tmp/graph1888146563503192743.bin' '-w' '/tmp/graph1888146563503192743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1888146563503192743.bin' '-l' '-1' '-v' '-w' '/tmp/graph1888146563503192743.weights' '-q' '0' '-e' '0.001'
[2022-05-17 01:30:05] [INFO ] Decomposing Gal with order
[2022-05-17 01:30:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 01:30:05] [INFO ] Removed a total of 14 redundant transitions.
[2022-05-17 01:30:05] [INFO ] Flatten gal took : 19 ms
[2022-05-17 01:30:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-17 01:30:05] [INFO ] Time to serialize gal into /tmp/LTLFireability11061434217660637767.gal : 3 ms
[2022-05-17 01:30:05] [INFO ] Time to serialize properties into /tmp/LTLFireability10556041361090005212.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/LTLFireability11061434217660637767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10556041361090005212.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...269
Read 2 LTL properties
Checking formula 0 : !((!(F((X(!(F(!("((i1.u2.p116==1)&&(i1.u2.p124==1))")))))&&(X("((u12.p74==1)&&(u12.p149==1))"))))))
Formula 0 simplified : F(X!F!"((i1.u2.p116==1)&&(i1.u2.p124==1))" & X"((u12.p74==1)&&(u12.p149==1))")
Compilation finished in 567 ms.
Running link step : cd /tmp/ltsmin3535078465278572630;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3535078465278572630;'/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' '(false U !<>((X(!<>(!(LTLAPp0==true)))&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t136, t137, t169, u12.t129, u13.t11, u47.t5, u47.t40, i0.i0.u0.t10, i0.i0.u6.t174, i0.i1....629
Computing Next relation with stutter on 1.99965e+06 deadlock states
118 unique states visited
0 strongly connected components in search stack
176 transitions explored
61 items max in DFS search stack
6333 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,63.3835,1083776,1,0,2.74922e+06,84692,2284,3.01249e+06,3319,480894,2582776
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-30a-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F((!(("((u47.p30==1)&&(u47.p229==1))")U(X("((i10.u29.p185==1)&&(i10.u37.p201==1))"))))&&(((X("((u47.p30==0)||(u47.p229==0))"))||(...204
Formula 1 simplified : !GF(!("((u47.p30==1)&&(u47.p229==1))" U X"((i10.u29.p185==1)&&(i10.u37.p201==1))") & ("(i10.u29.p185==0)" | "(i10.u37.p201==0)" | X"...187
Computing Next relation with stutter on 1.99965e+06 deadlock states
1545 unique states visited
0 strongly connected components in search stack
1719 transitions explored
145 items max in DFS search stack
10950 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,172.895,2731664,1,0,7.42584e+06,88858,2387,6.60088e+06,3338,525103,6446913
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DES-PT-30a-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 959978 ms.

BK_STOP 1652751455548

--------------------
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-30a"
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-30a, 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-165252095800484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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