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.r222-tall-165286025600676.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 ShieldPPPt-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600676
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.6K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 13:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 337K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653032052594

Running Version 202205111006
[2022-05-20 07:34:13] [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-20 07:34:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:34:13] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2022-05-20 07:34:13] [INFO ] Transformed 1253 places.
[2022-05-20 07:34:13] [INFO ] Transformed 903 transitions.
[2022-05-20 07:34:13] [INFO ] Found NUPN structural information;
[2022-05-20 07:34:13] [INFO ] Parsed PT model containing 1253 places and 903 transitions in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-050A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 118 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:14] [INFO ] Computed 551 place invariants in 31 ms
[2022-05-20 07:34:15] [INFO ] Implicit Places using invariants in 922 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:15] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 07:34:16] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 2227 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:16] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:34:17] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Support contains 68 out of 1253 places after structural reductions.
[2022-05-20 07:34:17] [INFO ] Flatten gal took : 231 ms
[2022-05-20 07:34:17] [INFO ] Flatten gal took : 111 ms
[2022-05-20 07:34:17] [INFO ] Input system was already deterministic with 902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 39) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:18] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:34:19] [INFO ] [Real]Absence check using 551 positive place invariants in 87 ms returned sat
[2022-05-20 07:34:22] [INFO ] After 2024ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:23
[2022-05-20 07:34:22] [INFO ] After 2154ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:24
[2022-05-20 07:34:22] [INFO ] After 3603ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:24
[2022-05-20 07:34:23] [INFO ] [Nat]Absence check using 551 positive place invariants in 87 ms returned sat
[2022-05-20 07:34:26] [INFO ] After 3203ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :24
[2022-05-20 07:34:29] [INFO ] After 6425ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :24
Attempting to minimize the solution found.
Minimization took 2996 ms.
[2022-05-20 07:34:32] [INFO ] After 10710ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :24
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 22 properties in 3047 ms.
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Partial Free-agglomeration rule applied 197 times.
Drop transitions removed 197 transitions
Iterating global reduction 0 with 197 rules applied. Total rules applied 201 place count 1251 transition count 900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 1250 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 203 place count 1249 transition count 899
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 203 place count 1249 transition count 897
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 207 place count 1247 transition count 897
Applied a total of 207 rules in 448 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 1247/1253 places, 897/902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 897 rows 1247 cols
[2022-05-20 07:34:36] [INFO ] Computed 550 place invariants in 7 ms
[2022-05-20 07:34:36] [INFO ] [Real]Absence check using 550 positive place invariants in 78 ms returned sat
[2022-05-20 07:34:37] [INFO ] After 389ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 07:34:37] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-05-20 07:34:37] [INFO ] After 54ms SMT Verify possible using 52 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:37] [INFO ] After 735ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:37] [INFO ] [Nat]Absence check using 550 positive place invariants in 77 ms returned sat
[2022-05-20 07:34:38] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:38] [INFO ] After 69ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:38] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2022-05-20 07:34:38] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2022-05-20 07:34:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 438 ms
[2022-05-20 07:34:38] [INFO ] After 546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2022-05-20 07:34:38] [INFO ] After 1283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1247/1247 places, 897/897 transitions.
Applied a total of 0 rules in 51 ms. Remains 1247 /1247 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1247/1247 places, 897/897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 224543 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224543 steps, saw 214583 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 897 rows 1247 cols
[2022-05-20 07:34:41] [INFO ] Computed 550 place invariants in 5 ms
[2022-05-20 07:34:42] [INFO ] [Real]Absence check using 550 positive place invariants in 80 ms returned sat
[2022-05-20 07:34:42] [INFO ] After 401ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 07:34:42] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-05-20 07:34:42] [INFO ] After 54ms SMT Verify possible using 52 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:42] [INFO ] After 748ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:42] [INFO ] [Nat]Absence check using 550 positive place invariants in 79 ms returned sat
[2022-05-20 07:34:43] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:43] [INFO ] After 69ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:43] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2022-05-20 07:34:43] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2022-05-20 07:34:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2022-05-20 07:34:43] [INFO ] After 569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-05-20 07:34:43] [INFO ] After 1291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1247/1247 places, 897/897 transitions.
Applied a total of 0 rules in 43 ms. Remains 1247 /1247 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1247/1247 places, 897/897 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1247/1247 places, 897/897 transitions.
Applied a total of 0 rules in 41 ms. Remains 1247 /1247 variables (removed 0) and now considering 897/897 (removed 0) transitions.
// Phase 1: matrix 897 rows 1247 cols
[2022-05-20 07:34:44] [INFO ] Computed 550 place invariants in 4 ms
[2022-05-20 07:34:44] [INFO ] Implicit Places using invariants in 706 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 708 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1245/1247 places, 897/897 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1243 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1243 transition count 895
Applied a total of 4 rules in 127 ms. Remains 1243 /1245 variables (removed 2) and now considering 895/897 (removed 2) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:44] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:34:45] [INFO ] Implicit Places using invariants in 592 ms returned []
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:45] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:34:45] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-20 07:34:47] [INFO ] Implicit Places using invariants and state equation in 2223 ms returned []
Implicit Place search using SMT with State Equation took 2817 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1243/1247 places, 895/897 transitions.
Finished structural reductions, in 2 iterations. Remains : 1243/1247 places, 895/897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 249606 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249606 steps, saw 240186 distinct states, run finished after 3004 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:50] [INFO ] Computed 548 place invariants in 10 ms
[2022-05-20 07:34:51] [INFO ] [Real]Absence check using 548 positive place invariants in 78 ms returned sat
[2022-05-20 07:34:51] [INFO ] After 388ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 07:34:51] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-20 07:34:51] [INFO ] After 54ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:51] [INFO ] After 674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:51] [INFO ] [Nat]Absence check using 548 positive place invariants in 78 ms returned sat
[2022-05-20 07:34:52] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:52] [INFO ] After 140ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:52] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2022-05-20 07:34:52] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2022-05-20 07:34:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2022-05-20 07:34:52] [INFO ] After 582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2022-05-20 07:34:52] [INFO ] After 1265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 31 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1243/1243 places, 895/895 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 31 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:52] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:34:53] [INFO ] Implicit Places using invariants in 556 ms returned []
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:53] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:34:53] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-20 07:34:55] [INFO ] Implicit Places using invariants and state equation in 2302 ms returned []
Implicit Place search using SMT with State Equation took 2863 ms to find 0 implicit places.
[2022-05-20 07:34:55] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:55] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:34:56] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 40 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:56] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:34:56] [INFO ] [Real]Absence check using 548 positive place invariants in 72 ms returned sat
[2022-05-20 07:34:56] [INFO ] After 388ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 07:34:56] [INFO ] After 464ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:56] [INFO ] After 685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:57] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 07:34:57] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:57] [INFO ] After 457ms 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-20 07:34:57] [INFO ] After 718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:57] [INFO ] Flatten gal took : 46 ms
[2022-05-20 07:34:57] [INFO ] Flatten gal took : 44 ms
[2022-05-20 07:34:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16349913103551626993.gal : 22 ms
[2022-05-20 07:34:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10429903541047811073.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6631347446256765183;'/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/ReachabilityCardinality16349913103551626993.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10429903541047811073.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/ReachabilityCardinality10429903541047811073.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :28 after 53
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :53 after 103
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :103 after 210
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :210 after 4207
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4207 after 222181
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :222181 after 4.27153e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.27153e+06 after 9.26921e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9.26921e+08 after 2.33981e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.33981e+10 after 5.09025e+13
Reachability property AtomicPropp32 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 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,4.16679e+19,1.88599,56576,2,11009,18,180204,6,0,5725,359076,0
Total reachable state count : 41667899171343901088

Verifying 1 reachability properties.
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,2.97019e+14,1.89014,56840,2,2802,18,180204,7,0,5731,359076,0
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ShieldPPPt-PT-050A-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))&&X((p1 U p2))&&G(F(p3))))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 24 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:35:00] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:35:00] [INFO ] Implicit Places using invariants in 670 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:35:00] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:35:02] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:35:02] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:35:02] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 496 ms :[(OR (NOT p2) (NOT p3) (NOT p0)), (OR (NOT p2) (NOT p3) (NOT p0)), true, (NOT p2), (OR (NOT p3) (NOT p0)), (NOT p3), (NOT p3), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(OR p2 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}, { cond=true, acceptance={} source=4 dest: 6}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s1045 1), p1:(AND (EQ s279 1) (EQ s298 1)), p3:(EQ s1045 0), p0:(OR (EQ s67 0) (EQ s69 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 9 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-00 finished in 3156 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(X((G(p0)||F(p1))))||X(X(G(p2)))))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 75 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:35:03] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:35:04] [INFO ] Implicit Places using invariants in 710 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 711 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 79 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2022-05-20 07:35:04] [INFO ] Computed 550 place invariants in 2 ms
[2022-05-20 07:35:04] [INFO ] Implicit Places using invariants in 744 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 746 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 82 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:05] [INFO ] Computed 548 place invariants in 10 ms
[2022-05-20 07:35:05] [INFO ] Implicit Places using invariants in 664 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:05] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:35:06] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions, in 3 iterations. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1197 1), p1:(EQ s51 1), p2:(OR (EQ s1191 0) (EQ s1202 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1014 ms.
Stack based approach found an accepted trace after 88 steps with 0 reset with depth 89 and stack size 86 in 2 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-02 finished in 4737 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((G(!G(p0))||p1)) U p2)))'
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 60 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:35:08] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:35:08] [INFO ] Implicit Places using invariants in 645 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 646 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 35 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2022-05-20 07:35:08] [INFO ] Computed 550 place invariants in 3 ms
[2022-05-20 07:35:09] [INFO ] Implicit Places using invariants in 624 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 625 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 52 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:09] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:35:10] [INFO ] Implicit Places using invariants in 632 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:10] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:35:11] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions, in 3 iterations. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), p0, p0, (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s617 1) (EQ s619 1)), p1:(AND (EQ s1206 1) (EQ s1221 1)), p0:(OR (AND (EQ s53 1) (EQ s76 1)) (AND (EQ s91 1) (EQ s102 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 749 ms.
Product exploration explored 100000 steps with 0 reset in 925 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 765 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), p0, p0, (AND p0 (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:14] [INFO ] Computed 548 place invariants in 8 ms
[2022-05-20 07:35:15] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 07:35:15] [INFO ] [Nat]Absence check using 548 positive place invariants in 81 ms returned sat
[2022-05-20 07:35:16] [INFO ] After 923ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 07:35:17] [INFO ] After 1545ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 451 ms.
[2022-05-20 07:35:17] [INFO ] After 2396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 552 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=92 )
Parikh walk visited 4 properties in 67 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F p1), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 16 factoid took 957 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), p0, p0, (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), p0, p0, (AND p0 (NOT p1)), (NOT p2)]
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:18] [INFO ] Computed 548 place invariants in 6 ms
[2022-05-20 07:35:19] [INFO ] [Real]Absence check using 548 positive place invariants in 129 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F p1), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 16 factoid took 379 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldPPPt-PT-050A-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050A-LTLFireability-03 finished in 11972 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 27 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:35:20] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:35:20] [INFO ] Implicit Places using invariants in 645 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:35:20] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:35:22] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 1969 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:35:22] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:35:22] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s845 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 3968 steps with 0 reset in 34 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-04 finished in 2658 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||p1)))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 26 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:35:22] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:35:23] [INFO ] Implicit Places using invariants in 631 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:35:23] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:35:24] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1940 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:35:24] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:35:25] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s187 1) (EQ s189 1)), p0:(AND (EQ s158 1) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 828 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-06 finished in 3451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 53 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:35:26] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:35:26] [INFO ] Implicit Places using invariants in 655 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 656 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 35 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2022-05-20 07:35:26] [INFO ] Computed 550 place invariants in 3 ms
[2022-05-20 07:35:27] [INFO ] Implicit Places using invariants in 646 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 649 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 54 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:27] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:35:28] [INFO ] Implicit Places using invariants in 629 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:28] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:35:29] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1923 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions, in 3 iterations. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s453 0) (EQ s476 0)), p1:(NEQ s1238 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 768 ms.
Product exploration explored 100000 steps with 0 reset in 959 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 331 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:31] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:35:32] [INFO ] [Real]Absence check using 548 positive place invariants in 82 ms returned sat
[2022-05-20 07:35:32] [INFO ] After 862ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 07:35:33] [INFO ] [Nat]Absence check using 548 positive place invariants in 93 ms returned sat
[2022-05-20 07:35:33] [INFO ] After 733ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 07:35:34] [INFO ] After 905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 185 ms.
[2022-05-20 07:35:34] [INFO ] After 1418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 160 ms.
Support contains 3 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Partial Free-agglomeration rule applied 196 times.
Drop transitions removed 196 transitions
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 1244 transition count 896
Applied a total of 196 rules in 54 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 896/896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 187810 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187810 steps, saw 178943 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:37] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:35:38] [INFO ] [Real]Absence check using 548 positive place invariants in 80 ms returned sat
[2022-05-20 07:35:38] [INFO ] After 813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 07:35:38] [INFO ] [Nat]Absence check using 548 positive place invariants in 78 ms returned sat
[2022-05-20 07:35:39] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 07:35:39] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-20 07:35:40] [INFO ] After 343ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 07:35:40] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2022-05-20 07:35:40] [INFO ] After 1695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 122 ms.
Support contains 3 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 27 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 896/896 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 26 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:40] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:35:41] [INFO ] Implicit Places using invariants in 669 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:41] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:35:41] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-20 07:35:43] [INFO ] Implicit Places using invariants and state equation in 2422 ms returned []
Implicit Place search using SMT with State Equation took 3093 ms to find 0 implicit places.
[2022-05-20 07:35:43] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:35:43] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:35:44] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 896/896 transitions.
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 1244 transition count 896
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 1244 transition count 848
Applied a total of 96 rules in 76 ms. Remains 1244 /1244 variables (removed 0) and now considering 848/896 (removed 48) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 848 rows 1244 cols
[2022-05-20 07:35:44] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:35:44] [INFO ] [Real]Absence check using 548 positive place invariants in 80 ms returned sat
[2022-05-20 07:35:45] [INFO ] After 808ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 07:35:45] [INFO ] [Nat]Absence check using 548 positive place invariants in 85 ms returned sat
[2022-05-20 07:35:46] [INFO ] After 891ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 07:35:46] [INFO ] After 1073ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2022-05-20 07:35:46] [INFO ] After 1507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 07:35:46] [INFO ] Flatten gal took : 51 ms
[2022-05-20 07:35:46] [INFO ] Flatten gal took : 50 ms
[2022-05-20 07:35:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5980280607583084355.gal : 6 ms
[2022-05-20 07:35:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16595119841232026683.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5236852711207999294;'/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/ReachabilityCardinality5980280607583084355.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16595119841232026683.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/ReachabilityCardinality16595119841232026683.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :102 after 459
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :459 after 59025
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :59025 after 652352
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :652352 after 1.26643e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.26643e+07 after 6.89459e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6.89459e+09 after 1.67462e+13
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.67462e+13 after 5.33793e+16
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.33793e+16 after 7.02597e+20
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7.02597e+20 after 6.78308e+27
Detected timeout of ITS tools.
[2022-05-20 07:36:01] [INFO ] Flatten gal took : 46 ms
[2022-05-20 07:36:01] [INFO ] Applying decomposition
[2022-05-20 07:36:01] [INFO ] Flatten gal took : 46 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/graph16965258785313944713.txt' '-o' '/tmp/graph16965258785313944713.bin' '-w' '/tmp/graph16965258785313944713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16965258785313944713.bin' '-l' '-1' '-v' '-w' '/tmp/graph16965258785313944713.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:36:02] [INFO ] Decomposing Gal with order
[2022-05-20 07:36:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:36:02] [INFO ] Removed a total of 294 redundant transitions.
[2022-05-20 07:36:02] [INFO ] Flatten gal took : 117 ms
[2022-05-20 07:36:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 166 ms.
[2022-05-20 07:36:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6797835303277004899.gal : 19 ms
[2022-05-20 07:36:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4992501334544780793.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5236852711207999294;'/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/ReachabilityCardinality6797835303277004899.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4992501334544780793.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...298
Loading property file /tmp/ReachabilityCardinality4992501334544780793.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :6913 after 6913
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6913 after 6913
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6913 after 6913
Reachability property apf3 is true.
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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,9.11064e+57,2.89055,88472,5812,71,172313,563,1309,339574,47,3621,0
Total reachable state count : 9.110637846089323284908645369353676060907e+57

Verifying 2 reachability properties.
Reachability property apf1 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
apf1,1.31466e+55,2.90005,88472,1786,68,172313,563,1323,339574,52,3621,0
Reachability property apf3 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
apf3,1.31466e+55,2.90227,88472,1786,68,172313,563,1327,339574,52,3621,0
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 284 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 34 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:36:05] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:36:06] [INFO ] Implicit Places using invariants in 639 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:36:06] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:36:07] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
[2022-05-20 07:36:07] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:36:07] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:36:08] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 896/896 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 268 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:36:09] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:36:09] [INFO ] [Real]Absence check using 548 positive place invariants in 80 ms returned sat
[2022-05-20 07:36:09] [INFO ] After 856ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 07:36:10] [INFO ] [Nat]Absence check using 548 positive place invariants in 82 ms returned sat
[2022-05-20 07:36:10] [INFO ] After 732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 07:36:11] [INFO ] After 897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2022-05-20 07:36:11] [INFO ] After 1394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 136 ms.
Support contains 3 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Partial Free-agglomeration rule applied 196 times.
Drop transitions removed 196 transitions
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 1244 transition count 896
Applied a total of 196 rules in 53 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 896/896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 198140 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198140 steps, saw 188821 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:36:14] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:36:15] [INFO ] [Real]Absence check using 548 positive place invariants in 83 ms returned sat
[2022-05-20 07:36:15] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 07:36:15] [INFO ] [Nat]Absence check using 548 positive place invariants in 84 ms returned sat
[2022-05-20 07:36:16] [INFO ] After 783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 07:36:16] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-20 07:36:17] [INFO ] After 346ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 07:36:17] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2022-05-20 07:36:17] [INFO ] After 1718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 121 ms.
Support contains 3 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 26 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 896/896 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 26 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:36:17] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:36:18] [INFO ] Implicit Places using invariants in 679 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:36:18] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:36:18] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-20 07:36:20] [INFO ] Implicit Places using invariants and state equation in 2456 ms returned []
Implicit Place search using SMT with State Equation took 3136 ms to find 0 implicit places.
[2022-05-20 07:36:20] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:36:20] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:36:21] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 896/896 transitions.
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 1244 transition count 896
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 1244 transition count 848
Applied a total of 96 rules in 73 ms. Remains 1244 /1244 variables (removed 0) and now considering 848/896 (removed 48) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 848 rows 1244 cols
[2022-05-20 07:36:21] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:36:21] [INFO ] [Real]Absence check using 548 positive place invariants in 80 ms returned sat
[2022-05-20 07:36:22] [INFO ] After 800ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 07:36:22] [INFO ] [Nat]Absence check using 548 positive place invariants in 82 ms returned sat
[2022-05-20 07:36:23] [INFO ] After 895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 07:36:23] [INFO ] After 1071ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2022-05-20 07:36:23] [INFO ] After 1487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 07:36:23] [INFO ] Flatten gal took : 47 ms
[2022-05-20 07:36:23] [INFO ] Flatten gal took : 46 ms
[2022-05-20 07:36:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15966096341890454380.gal : 21 ms
[2022-05-20 07:36:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5286530958872016151.prop : 79 ms
Invoking ITS tools like this :cd /tmp/redAtoms9897038242948711729;'/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/ReachabilityCardinality15966096341890454380.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5286530958872016151.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/ReachabilityCardinality5286530958872016151.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :102 after 459
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :459 after 59025
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :59025 after 652352
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :652352 after 1.26643e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.26643e+07 after 6.89459e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6.89459e+09 after 1.67462e+13
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.67462e+13 after 5.33793e+16
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.33793e+16 after 7.02597e+20
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7.02597e+20 after 6.78308e+27
Detected timeout of ITS tools.
[2022-05-20 07:36:38] [INFO ] Flatten gal took : 44 ms
[2022-05-20 07:36:38] [INFO ] Applying decomposition
[2022-05-20 07:36:38] [INFO ] Flatten gal took : 44 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/graph1036557165595067861.txt' '-o' '/tmp/graph1036557165595067861.bin' '-w' '/tmp/graph1036557165595067861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1036557165595067861.bin' '-l' '-1' '-v' '-w' '/tmp/graph1036557165595067861.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:36:39] [INFO ] Decomposing Gal with order
[2022-05-20 07:36:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:36:39] [INFO ] Removed a total of 295 redundant transitions.
[2022-05-20 07:36:39] [INFO ] Flatten gal took : 64 ms
[2022-05-20 07:36:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 60 ms.
[2022-05-20 07:36:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8127274413299903548.gal : 13 ms
[2022-05-20 07:36:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5180494537029554146.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9897038242948711729;'/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/ReachabilityCardinality8127274413299903548.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5180494537029554146.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...298
Loading property file /tmp/ReachabilityCardinality5180494537029554146.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :8.3166e+08 after 8.3166e+08
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8.3166e+08 after 8.3166e+08
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8.3166e+08 after 2.4947e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16883431941270902844
[2022-05-20 07:36:54] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16883431941270902844
Running compilation step : cd /tmp/ltsmin16883431941270902844;'/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 1593 ms.
Running link step : cd /tmp/ltsmin16883431941270902844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16883431941270902844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 342 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 791 ms.
Product exploration explored 100000 steps with 0 reset in 973 ms.
Built C files in :
/tmp/ltsmin6203237135442284233
[2022-05-20 07:37:11] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2022-05-20 07:37:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:37:11] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2022-05-20 07:37:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:37:11] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2022-05-20 07:37:11] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:37:11] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6203237135442284233
Running compilation step : cd /tmp/ltsmin6203237135442284233;'/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 2424 ms.
Running link step : cd /tmp/ltsmin6203237135442284233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6203237135442284233;'/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/stateBased587444579931409784.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 30 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:37:26] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:37:27] [INFO ] Implicit Places using invariants in 645 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:37:27] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:37:28] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
[2022-05-20 07:37:28] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:37:28] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:37:29] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 896/896 transitions.
Built C files in :
/tmp/ltsmin16873901264863609531
[2022-05-20 07:37:29] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2022-05-20 07:37:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:37:29] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2022-05-20 07:37:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:37:29] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2022-05-20 07:37:29] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:37:29] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16873901264863609531
Running compilation step : cd /tmp/ltsmin16873901264863609531;'/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 2538 ms.
Running link step : cd /tmp/ltsmin16873901264863609531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin16873901264863609531;'/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/stateBased8140957559756718642.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 07:37:44] [INFO ] Flatten gal took : 52 ms
[2022-05-20 07:37:44] [INFO ] Flatten gal took : 45 ms
[2022-05-20 07:37:44] [INFO ] Time to serialize gal into /tmp/LTL4807285237579219775.gal : 5 ms
[2022-05-20 07:37:44] [INFO ] Time to serialize properties into /tmp/LTL5037648073839443235.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/LTL4807285237579219775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5037648073839443235.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/LTL4807285...266
Read 1 LTL properties
Checking formula 0 : !((F((G("((p453==0)||(p476==0))"))||(G("(p1247==0)")))))
Formula 0 simplified : !F(G"((p453==0)||(p476==0))" | G"(p1247==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-20 07:37:59] [INFO ] Flatten gal took : 43 ms
[2022-05-20 07:37:59] [INFO ] Applying decomposition
[2022-05-20 07:37:59] [INFO ] Flatten gal took : 42 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/graph6975035120292452944.txt' '-o' '/tmp/graph6975035120292452944.bin' '-w' '/tmp/graph6975035120292452944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6975035120292452944.bin' '-l' '-1' '-v' '-w' '/tmp/graph6975035120292452944.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:37:59] [INFO ] Decomposing Gal with order
[2022-05-20 07:37:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:37:59] [INFO ] Removed a total of 149 redundant transitions.
[2022-05-20 07:37:59] [INFO ] Flatten gal took : 54 ms
[2022-05-20 07:37:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 50 ms.
[2022-05-20 07:37:59] [INFO ] Time to serialize gal into /tmp/LTL7882231185614376845.gal : 12 ms
[2022-05-20 07:37:59] [INFO ] Time to serialize properties into /tmp/LTL15773862366945707174.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/LTL7882231185614376845.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15773862366945707174.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/LTL7882231...246
Read 1 LTL properties
Checking formula 0 : !((F((G("((i8.u145.p453==0)||(i8.u152.p476==0))"))||(G("(i22.u398.p1247==0)")))))
Formula 0 simplified : !F(G"((i8.u145.p453==0)||(i8.u152.p476==0))" | G"(i22.u398.p1247==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3674214460647398125
[2022-05-20 07:38:14] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3674214460647398125
Running compilation step : cd /tmp/ltsmin3674214460647398125;'/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 1574 ms.
Running link step : cd /tmp/ltsmin3674214460647398125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3674214460647398125;'/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))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-050A-LTLFireability-07 finished in 183927 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)&&X((p0 U (p1 U p2)))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 25 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:30] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:38:30] [INFO ] Implicit Places using invariants in 667 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:30] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:38:32] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 2049 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:32] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:38:32] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) p1), true, p1, (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s417 1) (EQ s419 1)), p0:(AND (EQ s1231 1) (EQ s1246 1)), p2:(AND (EQ s1231 1) (EQ s1246 1) (EQ s1017 1) (EQ s1019 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-08 finished in 2810 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(!(p0 U p1)))&&p2)))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 27 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:32] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:38:33] [INFO ] Implicit Places using invariants in 669 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:33] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:38:34] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:34] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:38:35] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (OR (NOT p2) p1), p1, p1, (OR (NOT p2) p1)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(OR (EQ s1129 0) (EQ s1148 0)), p1:(AND (EQ s990 1) (EQ s1024 1)), p0:(EQ s145 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 2110 ms.
Product exploration explored 100000 steps with 25000 reset in 2254 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), true]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[true, p1, p1, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:40] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:38:40] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:38:41] [INFO ] [Nat]Absence check using 551 positive place invariants in 87 ms returned sat
[2022-05-20 07:38:41] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:38:41] [INFO ] After 489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2022-05-20 07:38:41] [INFO ] After 848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Partial Free-agglomeration rule applied 198 times.
Drop transitions removed 198 transitions
Iterating global reduction 0 with 198 rules applied. Total rules applied 202 place count 1251 transition count 900
Applied a total of 202 rules in 96 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1253 places, 900/902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 249970 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249970 steps, saw 241877 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:38:44] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:38:45] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:38:45] [INFO ] [Nat]Absence check using 551 positive place invariants in 82 ms returned sat
[2022-05-20 07:38:45] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:38:45] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-05-20 07:38:45] [INFO ] After 69ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:38:45] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2022-05-20 07:38:46] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2022-05-20 07:38:46] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2022-05-20 07:38:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 554 ms
[2022-05-20 07:38:46] [INFO ] After 663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2022-05-20 07:38:46] [INFO ] After 1396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 900/900 transitions.
Applied a total of 0 rules in 25 ms. Remains 1251 /1251 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 900/900 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 900/900 transitions.
Applied a total of 0 rules in 25 ms. Remains 1251 /1251 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:38:46] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:38:47] [INFO ] Implicit Places using invariants in 689 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 690 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1250/1251 places, 900/900 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 30 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2022-05-20 07:38:47] [INFO ] Computed 550 place invariants in 3 ms
[2022-05-20 07:38:47] [INFO ] Implicit Places using invariants in 673 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 674 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1246/1251 places, 898/900 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1244 transition count 896
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 119 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:38:47] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:38:48] [INFO ] Implicit Places using invariants in 567 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:38:48] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:38:49] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-20 07:38:50] [INFO ] Implicit Places using invariants and state equation in 1920 ms returned []
Implicit Place search using SMT with State Equation took 2488 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 1244/1251 places, 896/900 transitions.
Finished structural reductions, in 3 iterations. Remains : 1244/1251 places, 896/900 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 275135 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275135 steps, saw 266657 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:38:53] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:38:53] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:38:53] [INFO ] [Nat]Absence check using 548 positive place invariants in 81 ms returned sat
[2022-05-20 07:38:54] [INFO ] After 620ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:38:54] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-20 07:38:56] [INFO ] After 1403ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:38:56] [INFO ] After 1592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-05-20 07:38:56] [INFO ] After 2518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1185 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=59 )
Parikh walk visited 1 properties in 20 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 128 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 138 ms :[true, p1, p1, p1, p1]
Support contains 3 out of 1253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 30 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:56] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:38:57] [INFO ] Implicit Places using invariants in 660 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:57] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:38:58] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:58] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:38:59] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[true, p1, p1, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:59] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:38:59] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:39:00] [INFO ] [Nat]Absence check using 551 positive place invariants in 80 ms returned sat
[2022-05-20 07:39:00] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:39:00] [INFO ] After 452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-05-20 07:39:00] [INFO ] After 783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Partial Free-agglomeration rule applied 198 times.
Drop transitions removed 198 transitions
Iterating global reduction 0 with 198 rules applied. Total rules applied 202 place count 1251 transition count 900
Applied a total of 202 rules in 78 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1253 places, 900/902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 246184 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246184 steps, saw 238150 distinct states, run finished after 3004 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:39:03] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:39:03] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:39:04] [INFO ] [Nat]Absence check using 551 positive place invariants in 81 ms returned sat
[2022-05-20 07:39:04] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:39:04] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-05-20 07:39:04] [INFO ] After 71ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 556 ms
[2022-05-20 07:39:05] [INFO ] After 680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2022-05-20 07:39:05] [INFO ] After 1407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 900/900 transitions.
Applied a total of 0 rules in 26 ms. Remains 1251 /1251 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 900/900 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 900/900 transitions.
Applied a total of 0 rules in 25 ms. Remains 1251 /1251 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:39:05] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:39:06] [INFO ] Implicit Places using invariants in 721 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 724 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1250/1251 places, 900/900 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 31 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2022-05-20 07:39:06] [INFO ] Computed 550 place invariants in 4 ms
[2022-05-20 07:39:06] [INFO ] Implicit Places using invariants in 673 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 674 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1246/1251 places, 898/900 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1244 transition count 896
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 48 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:39:06] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:39:07] [INFO ] Implicit Places using invariants in 555 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:39:07] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:39:08] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-20 07:39:09] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 2480 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 1244/1251 places, 896/900 transitions.
Finished structural reductions, in 3 iterations. Remains : 1244/1251 places, 896/900 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 260712 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 260712 steps, saw 252449 distinct states, run finished after 3003 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:39:12] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:39:12] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:39:12] [INFO ] [Nat]Absence check using 548 positive place invariants in 87 ms returned sat
[2022-05-20 07:39:13] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:39:13] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-20 07:39:14] [INFO ] After 1378ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:39:15] [INFO ] After 1562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-20 07:39:15] [INFO ] After 2477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1104 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=64 )
Parikh walk visited 1 properties in 16 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 153 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 232 ms :[true, p1, p1, p1, p1]
Product exploration explored 100000 steps with 25000 reset in 2114 ms.
Product exploration explored 100000 steps with 25000 reset in 2218 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[true, p1, p1, p1, p1]
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1253 transition count 902
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 173 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2022-05-20 07:39:20] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:39:20] [INFO ] Computed 551 place invariants in 1 ms
[2022-05-20 07:39:21] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/1253 places, 902/902 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Product exploration explored 100000 steps with 25000 reset in 6190 ms.
Product exploration explored 100000 steps with 25000 reset in 6320 ms.
Built C files in :
/tmp/ltsmin9532083153424769854
[2022-05-20 07:39:33] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9532083153424769854
Running compilation step : cd /tmp/ltsmin9532083153424769854;'/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 1589 ms.
Running link step : cd /tmp/ltsmin9532083153424769854;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9532083153424769854;'/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/stateBased10069612576030664731.hoa' '--buchi-type=spotba'
LTSmin run took 490 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-050A-LTLFireability-09 finished in 63048 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!(X(G(F(G(p1)))) U p2)&&p0))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 56 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:39:35] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:39:36] [INFO ] Implicit Places using invariants in 645 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 646 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 33 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2022-05-20 07:39:36] [INFO ] Computed 550 place invariants in 4 ms
[2022-05-20 07:39:37] [INFO ] Implicit Places using invariants in 656 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 658 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 61 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:39:37] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:39:38] [INFO ] Implicit Places using invariants in 628 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:39:38] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:39:39] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions, in 3 iterations. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(OR (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s145 1) (EQ s160 1)), p2:(AND (EQ s268 1) (EQ s275 1)), p1:(AND (EQ s1 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 721 ms.
Stack based approach found an accepted trace after 589 steps with 0 reset with depth 590 and stack size 590 in 6 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-10 finished in 4364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((X(p2)&&p1))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 27 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:39:40] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:39:40] [INFO ] Implicit Places using invariants in 657 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:39:40] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:39:42] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1916 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:39:42] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:39:42] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=3, aps=[p2:(EQ s245 1), p1:(AND (EQ s168 1) (EQ s175 1) (EQ s320 1)), p0:(AND (EQ s1070 1) (EQ s1085 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-11 finished in 2716 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(X(X(F(X(X(p1))))))&&p0))))'
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 29 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:39:43] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:39:43] [INFO ] Implicit Places using invariants in 625 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:39:43] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:39:44] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:39:44] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:39:45] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(AND (EQ s429 1) (EQ s448 1)), p1:(EQ s1195 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 734 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-12 finished in 3421 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((X((p1 U G(p0)))&&(X(p2)||p3)))))'
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 30 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:39:46] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:39:47] [INFO ] Implicit Places using invariants in 630 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:39:47] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 07:39:48] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:39:48] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:39:48] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 480 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, (NOT p0), (NOT p0), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 8}, { cond=p0, acceptance={} source=2 dest: 9}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 10}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(OR (AND p0 (NOT p3) (NOT p2)) (AND (NOT p3) p1 (NOT p2))), acceptance={} source=8 dest: 4}], [{ cond=(NOT p0), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=11 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=11 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={} source=12 dest: 8}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(AND (EQ s1128 1) (EQ s1151 1)), p3:(AND (EQ s762 1) (EQ s764 1)), p1:(AND (EQ s112 1) (EQ s114 1)), p2:(AND (EQ s1170 1) (EQ s1185 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 2 reset in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-13 finished in 2985 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 51 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:39:49] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:39:50] [INFO ] Implicit Places using invariants in 629 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 630 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 32 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2022-05-20 07:39:50] [INFO ] Computed 550 place invariants in 2 ms
[2022-05-20 07:39:50] [INFO ] Implicit Places using invariants in 626 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 630 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 51 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:39:50] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:39:51] [INFO ] Implicit Places using invariants in 633 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:39:51] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:39:52] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions, in 3 iterations. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s218 1) (NEQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 726 ms.
Product exploration explored 100000 steps with 0 reset in 921 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Finished probabilistic random walk after 47109 steps, run visited all 1 properties in 483 ms. (steps per millisecond=97 )
Probabilistic random walk after 47109 steps, saw 46378 distinct states, run finished after 486 ms. (steps per millisecond=96 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 2 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 32 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:39:55] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:39:56] [INFO ] Implicit Places using invariants in 639 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:39:56] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:39:57] [INFO ] Implicit Places using invariants and state equation in 1289 ms returned []
Implicit Place search using SMT with State Equation took 1930 ms to find 0 implicit places.
[2022-05-20 07:39:57] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:39:57] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:39:57] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 896/896 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Finished probabilistic random walk after 47109 steps, run visited all 1 properties in 473 ms. (steps per millisecond=99 )
Probabilistic random walk after 47109 steps, saw 46378 distinct states, run finished after 475 ms. (steps per millisecond=99 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 726 ms.
Product exploration explored 100000 steps with 0 reset in 1008 ms.
Built C files in :
/tmp/ltsmin16772319608209690903
[2022-05-20 07:40:00] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2022-05-20 07:40:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:40:00] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2022-05-20 07:40:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:40:00] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2022-05-20 07:40:00] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:40:00] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16772319608209690903
Running compilation step : cd /tmp/ltsmin16772319608209690903;'/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 2429 ms.
Running link step : cd /tmp/ltsmin16772319608209690903;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin16772319608209690903;'/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/stateBased11811684159936419001.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 33 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:40:15] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:40:16] [INFO ] Implicit Places using invariants in 657 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:40:16] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:40:17] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 2058 ms to find 0 implicit places.
[2022-05-20 07:40:17] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:40:17] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:40:18] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 896/896 transitions.
Built C files in :
/tmp/ltsmin9740901650243409578
[2022-05-20 07:40:18] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2022-05-20 07:40:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:40:18] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2022-05-20 07:40:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:40:18] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2022-05-20 07:40:18] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:40:18] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9740901650243409578
Running compilation step : cd /tmp/ltsmin9740901650243409578;'/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 2615 ms.
Running link step : cd /tmp/ltsmin9740901650243409578;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9740901650243409578;'/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/stateBased11988960641396562185.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 07:40:33] [INFO ] Flatten gal took : 43 ms
[2022-05-20 07:40:33] [INFO ] Flatten gal took : 53 ms
[2022-05-20 07:40:33] [INFO ] Time to serialize gal into /tmp/LTL13017355786583305054.gal : 4 ms
[2022-05-20 07:40:33] [INFO ] Time to serialize properties into /tmp/LTL11267249193201821799.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/LTL13017355786583305054.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11267249193201821799.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/LTL1301735...268
Read 1 LTL properties
Checking formula 0 : !((F(G("((p218==0)||(p225==0))"))))
Formula 0 simplified : !FG"((p218==0)||(p225==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-20 07:40:48] [INFO ] Flatten gal took : 40 ms
[2022-05-20 07:40:48] [INFO ] Applying decomposition
[2022-05-20 07:40:48] [INFO ] Flatten gal took : 41 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/graph10385660636053242145.txt' '-o' '/tmp/graph10385660636053242145.bin' '-w' '/tmp/graph10385660636053242145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10385660636053242145.bin' '-l' '-1' '-v' '-w' '/tmp/graph10385660636053242145.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:40:48] [INFO ] Decomposing Gal with order
[2022-05-20 07:40:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:40:48] [INFO ] Removed a total of 149 redundant transitions.
[2022-05-20 07:40:48] [INFO ] Flatten gal took : 46 ms
[2022-05-20 07:40:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 33 ms.
[2022-05-20 07:40:48] [INFO ] Time to serialize gal into /tmp/LTL2465328683750256203.gal : 8 ms
[2022-05-20 07:40:48] [INFO ] Time to serialize properties into /tmp/LTL12316047847412247468.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/LTL2465328683750256203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12316047847412247468.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/LTL2465328...246
Read 1 LTL properties
Checking formula 0 : !((F(G("((i4.u68.p218==0)||(i3.u71.p225==0))"))))
Formula 0 simplified : !FG"((i4.u68.p218==0)||(i3.u71.p225==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9603532440134823050
[2022-05-20 07:41:04] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9603532440134823050
Running compilation step : cd /tmp/ltsmin9603532440134823050;'/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 1552 ms.
Running link step : cd /tmp/ltsmin9603532440134823050;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9603532440134823050;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-050A-LTLFireability-14 finished in 89690 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)||p1))||G(X(p2))))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 28 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:41:19] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:41:19] [INFO ] Implicit Places using invariants in 643 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:41:19] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:41:21] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:41:21] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 07:41:21] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s583 1) (EQ s600 1)), p0:(AND (EQ s290 1) (EQ s324 1)), p2:(EQ s772 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 767 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-15 finished in 3469 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2022-05-20 07:41:22] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13223067542148968565
[2022-05-20 07:41:22] [INFO ] Computing symmetric may disable matrix : 902 transitions.
[2022-05-20 07:41:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:41:22] [INFO ] Computing symmetric may enable matrix : 902 transitions.
[2022-05-20 07:41:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:41:22] [INFO ] Applying decomposition
[2022-05-20 07:41:22] [INFO ] Flatten gal took : 43 ms
[2022-05-20 07:41:22] [INFO ] Computing Do-Not-Accords matrix : 902 transitions.
[2022-05-20 07:41:22] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:41:22] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13223067542148968565
Running compilation step : cd /tmp/ltsmin13223067542148968565;'/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/graph13531271411018234533.txt' '-o' '/tmp/graph13531271411018234533.bin' '-w' '/tmp/graph13531271411018234533.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13531271411018234533.bin' '-l' '-1' '-v' '-w' '/tmp/graph13531271411018234533.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:41:22] [INFO ] Decomposing Gal with order
[2022-05-20 07:41:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:41:23] [INFO ] Removed a total of 150 redundant transitions.
[2022-05-20 07:41:23] [INFO ] Flatten gal took : 64 ms
[2022-05-20 07:41:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 56 ms.
[2022-05-20 07:41:23] [INFO ] Time to serialize gal into /tmp/LTLFireability15517477222113220581.gal : 17 ms
[2022-05-20 07:41:23] [INFO ] Time to serialize properties into /tmp/LTLFireability6077707272140448500.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/LTLFireability15517477222113220581.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6077707272140448500.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((F((G("((i9.i0.i0.u145.p453==0)||(i9.i0.i1.u152.p476==0))"))||(G("(i22.u398.p1247!=1)")))))
Formula 0 simplified : !F(G"((i9.i0.i0.u145.p453==0)||(i9.i0.i1.u152.p476==0))" | G"(i22.u398.p1247!=1)")
Compilation finished in 2481 ms.
Running link step : cd /tmp/ltsmin13223067542148968565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13223067542148968565;'/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' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 72383 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13223067542148968565;'/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' '--ltl' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 75389 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 579591 ms.

BK_STOP 1653032633349

--------------------
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="ShieldPPPt-PT-050A"
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 ShieldPPPt-PT-050A, 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 r222-tall-165286025600676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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