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-165286025300523.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 ShieldPPPs-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Apr 30 03:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 30 03:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 03:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 03:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 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 1.8M 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 ShieldPPPs-PT-100B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653013038401

Running Version 202205111006
[2022-05-20 02:17:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 02:17:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 02:17:19] [INFO ] Load time of PNML (sax parser for PT used): 285 ms
[2022-05-20 02:17:20] [INFO ] Transformed 6803 places.
[2022-05-20 02:17:20] [INFO ] Transformed 6303 transitions.
[2022-05-20 02:17:20] [INFO ] Found NUPN structural information;
[2022-05-20 02:17:20] [INFO ] Parsed PT model containing 6803 places and 6303 transitions in 691 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 6803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Discarding 694 places :
Symmetric choice reduction at 0 with 694 rule applications. Total rules 694 place count 6109 transition count 5609
Iterating global reduction 0 with 694 rules applied. Total rules applied 1388 place count 6109 transition count 5609
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1389 place count 6108 transition count 5608
Iterating global reduction 0 with 1 rules applied. Total rules applied 1390 place count 6108 transition count 5608
Applied a total of 1390 rules in 2849 ms. Remains 6108 /6803 variables (removed 695) and now considering 5608/6303 (removed 695) transitions.
// Phase 1: matrix 5608 rows 6108 cols
[2022-05-20 02:17:23] [INFO ] Computed 1101 place invariants in 65 ms
[2022-05-20 02:17:26] [INFO ] Implicit Places using invariants in 2772 ms returned []
// Phase 1: matrix 5608 rows 6108 cols
[2022-05-20 02:17:26] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 02:17:28] [INFO ] Implicit Places using invariants and state equation in 2150 ms returned []
Implicit Place search using SMT with State Equation took 4953 ms to find 0 implicit places.
// Phase 1: matrix 5608 rows 6108 cols
[2022-05-20 02:17:28] [INFO ] Computed 1101 place invariants in 32 ms
[2022-05-20 02:17:32] [INFO ] Dead Transitions using invariants and state equation in 3723 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6108/6803 places, 5608/6303 transitions.
Finished structural reductions, in 1 iterations. Remains : 6108/6803 places, 5608/6303 transitions.
Support contains 29 out of 6108 places after structural reductions.
[2022-05-20 02:17:33] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-20 02:17:33] [INFO ] Flatten gal took : 333 ms
FORMULA ShieldPPPs-PT-100B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 02:17:33] [INFO ] Flatten gal took : 213 ms
[2022-05-20 02:17:33] [INFO ] Input system was already deterministic with 5608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 691 ms. (steps per millisecond=14 ) properties (out of 19) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 5608 rows 6108 cols
[2022-05-20 02:17:34] [INFO ] Computed 1101 place invariants in 45 ms
[2022-05-20 02:17:36] [INFO ] After 1637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-20 02:17:38] [INFO ] [Nat]Absence check using 1101 positive place invariants in 676 ms returned sat
[2022-05-20 02:17:46] [INFO ] After 7050ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-20 02:17:49] [INFO ] Deduced a trap composed of 22 places in 2801 ms of which 20 ms to minimize.
[2022-05-20 02:17:52] [INFO ] Deduced a trap composed of 24 places in 2710 ms of which 6 ms to minimize.
[2022-05-20 02:17:55] [INFO ] Deduced a trap composed of 22 places in 2504 ms of which 11 ms to minimize.
[2022-05-20 02:17:58] [INFO ] Deduced a trap composed of 18 places in 2740 ms of which 6 ms to minimize.
[2022-05-20 02:18:01] [INFO ] Deduced a trap composed of 31 places in 2578 ms of which 4 ms to minimize.
[2022-05-20 02:18:04] [INFO ] Deduced a trap composed of 21 places in 2650 ms of which 4 ms to minimize.
[2022-05-20 02:18:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:18:04] [INFO ] After 27592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 3 properties in 2916 ms.
Support contains 17 out of 6108 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6108/6108 places, 5608/5608 transitions.
Drop transitions removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 6108 transition count 4911
Reduce places removed 697 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 699 rules applied. Total rules applied 1396 place count 5411 transition count 4909
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1398 place count 5409 transition count 4909
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 501 Pre rules applied. Total rules applied 1398 place count 5409 transition count 4408
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 2400 place count 4908 transition count 4408
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2402 place count 4906 transition count 4406
Iterating global reduction 3 with 2 rules applied. Total rules applied 2404 place count 4906 transition count 4406
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2404 place count 4906 transition count 4405
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2406 place count 4905 transition count 4405
Performed 1788 Post agglomeration using F-continuation condition.Transition count delta: 1788
Deduced a syphon composed of 1788 places in 8 ms
Reduce places removed 1788 places and 0 transitions.
Iterating global reduction 3 with 3576 rules applied. Total rules applied 5982 place count 3117 transition count 2617
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 891 times.
Drop transitions removed 891 transitions
Iterating global reduction 3 with 891 rules applied. Total rules applied 6873 place count 3117 transition count 2617
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6874 place count 3116 transition count 2616
Applied a total of 6874 rules in 2216 ms. Remains 3116 /6108 variables (removed 2992) and now considering 2616/5608 (removed 2992) transitions.
Finished structural reductions, in 1 iterations. Remains : 3116/6108 places, 2616/5608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2616 rows 3116 cols
[2022-05-20 02:18:11] [INFO ] Computed 1101 place invariants in 306 ms
[2022-05-20 02:18:11] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 02:18:12] [INFO ] [Nat]Absence check using 1046 positive place invariants in 202 ms returned sat
[2022-05-20 02:18:12] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 17 ms returned sat
[2022-05-20 02:18:15] [INFO ] After 2309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 02:18:15] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 1 ms to minimize.
[2022-05-20 02:18:15] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 1 ms to minimize.
[2022-05-20 02:18:16] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2022-05-20 02:18:16] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2022-05-20 02:18:16] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2022-05-20 02:18:17] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 0 ms to minimize.
[2022-05-20 02:18:17] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2022-05-20 02:18:17] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2022-05-20 02:18:18] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2022-05-20 02:18:18] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 0 ms to minimize.
[2022-05-20 02:18:18] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2022-05-20 02:18:19] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2022-05-20 02:18:19] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 1 ms to minimize.
[2022-05-20 02:18:19] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2022-05-20 02:18:20] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
[2022-05-20 02:18:20] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 1 ms to minimize.
[2022-05-20 02:18:20] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 2 ms to minimize.
[2022-05-20 02:18:20] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2022-05-20 02:18:21] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2022-05-20 02:18:21] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2022-05-20 02:18:21] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2022-05-20 02:18:22] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2022-05-20 02:18:22] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2022-05-20 02:18:22] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2022-05-20 02:18:22] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2022-05-20 02:18:23] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2022-05-20 02:18:23] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 0 ms to minimize.
[2022-05-20 02:18:23] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 4 ms to minimize.
[2022-05-20 02:18:24] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 1 ms to minimize.
[2022-05-20 02:18:24] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2022-05-20 02:18:24] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2022-05-20 02:18:24] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 0 ms to minimize.
[2022-05-20 02:18:25] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2022-05-20 02:18:25] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2022-05-20 02:18:25] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 0 ms to minimize.
[2022-05-20 02:18:25] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 1 ms to minimize.
[2022-05-20 02:18:26] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2022-05-20 02:18:26] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2022-05-20 02:18:26] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2022-05-20 02:18:26] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2022-05-20 02:18:27] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2022-05-20 02:18:27] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2022-05-20 02:18:27] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 12467 ms
[2022-05-20 02:18:27] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2022-05-20 02:18:28] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2022-05-20 02:18:28] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2022-05-20 02:18:28] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2022-05-20 02:18:28] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2022-05-20 02:18:28] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
[2022-05-20 02:18:29] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2022-05-20 02:18:29] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 5 ms to minimize.
[2022-05-20 02:18:29] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2022-05-20 02:18:29] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2022-05-20 02:18:29] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2022-05-20 02:18:30] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2440 ms
[2022-05-20 02:18:30] [INFO ] After 18228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 716 ms.
[2022-05-20 02:18:31] [INFO ] After 20027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1552 ms.
Support contains 13 out of 3116 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3116/3116 places, 2616/2616 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3116 transition count 2614
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3114 transition count 2614
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 3112 transition count 2612
Applied a total of 8 rules in 343 ms. Remains 3112 /3116 variables (removed 4) and now considering 2612/2616 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 3112/3116 places, 2612/2616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 751 ms. (steps per millisecond=13 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 53416 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53416 steps, saw 49021 distinct states, run finished after 3003 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2612 rows 3112 cols
[2022-05-20 02:18:38] [INFO ] Computed 1101 place invariants in 150 ms
[2022-05-20 02:18:39] [INFO ] After 629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 02:18:39] [INFO ] [Nat]Absence check using 1051 positive place invariants in 209 ms returned sat
[2022-05-20 02:18:39] [INFO ] [Nat]Absence check using 1051 positive and 50 generalized place invariants in 11 ms returned sat
[2022-05-20 02:18:42] [INFO ] After 2756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 02:18:43] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 1 ms to minimize.
[2022-05-20 02:18:43] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 1 ms to minimize.
[2022-05-20 02:18:44] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
[2022-05-20 02:18:44] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2022-05-20 02:18:44] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2022-05-20 02:18:44] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 1 ms to minimize.
[2022-05-20 02:18:45] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 2 ms to minimize.
[2022-05-20 02:18:45] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2022-05-20 02:18:45] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2022-05-20 02:18:46] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2022-05-20 02:18:46] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2022-05-20 02:18:46] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2022-05-20 02:18:46] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2022-05-20 02:18:47] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 1 ms to minimize.
[2022-05-20 02:18:47] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2022-05-20 02:18:47] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2022-05-20 02:18:47] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2022-05-20 02:18:48] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2022-05-20 02:18:48] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 0 ms to minimize.
[2022-05-20 02:18:48] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2022-05-20 02:18:48] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2022-05-20 02:18:49] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 0 ms to minimize.
[2022-05-20 02:18:49] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2022-05-20 02:18:49] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2022-05-20 02:18:49] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2022-05-20 02:18:50] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2022-05-20 02:18:50] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2022-05-20 02:18:50] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2022-05-20 02:18:50] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2022-05-20 02:18:51] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2022-05-20 02:18:51] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2022-05-20 02:18:51] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2022-05-20 02:18:51] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2022-05-20 02:18:52] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2022-05-20 02:18:52] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 1 ms to minimize.
[2022-05-20 02:18:52] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2022-05-20 02:18:53] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2022-05-20 02:18:53] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2022-05-20 02:18:53] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2022-05-20 02:18:53] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2022-05-20 02:18:54] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2022-05-20 02:18:54] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2022-05-20 02:18:54] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2022-05-20 02:18:54] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2022-05-20 02:18:55] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2022-05-20 02:18:55] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2022-05-20 02:18:55] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-05-20 02:18:55] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-05-20 02:18:56] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2022-05-20 02:18:56] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2022-05-20 02:18:56] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2022-05-20 02:18:56] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2022-05-20 02:18:56] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2022-05-20 02:18:57] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2022-05-20 02:18:57] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 14306 ms
[2022-05-20 02:18:57] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2022-05-20 02:18:57] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2022-05-20 02:18:57] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2022-05-20 02:18:58] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2022-05-20 02:18:58] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2022-05-20 02:18:58] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-20 02:18:58] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2022-05-20 02:18:58] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2022-05-20 02:18:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1689 ms
[2022-05-20 02:18:59] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2022-05-20 02:18:59] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2022-05-20 02:18:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 550 ms
[2022-05-20 02:18:59] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-20 02:19:00] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2022-05-20 02:19:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 549 ms
[2022-05-20 02:19:00] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2022-05-20 02:19:00] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2022-05-20 02:19:01] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2022-05-20 02:19:01] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2022-05-20 02:19:01] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2022-05-20 02:19:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1149 ms
[2022-05-20 02:19:01] [INFO ] After 21785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 649 ms.
[2022-05-20 02:19:02] [INFO ] After 23580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 591 ms.
Support contains 13 out of 3112 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3112/3112 places, 2612/2612 transitions.
Applied a total of 0 rules in 141 ms. Remains 3112 /3112 variables (removed 0) and now considering 2612/2612 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3112/3112 places, 2612/2612 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3112/3112 places, 2612/2612 transitions.
Applied a total of 0 rules in 136 ms. Remains 3112 /3112 variables (removed 0) and now considering 2612/2612 (removed 0) transitions.
// Phase 1: matrix 2612 rows 3112 cols
[2022-05-20 02:19:03] [INFO ] Computed 1101 place invariants in 32 ms
[2022-05-20 02:19:05] [INFO ] Implicit Places using invariants in 2274 ms returned []
// Phase 1: matrix 2612 rows 3112 cols
[2022-05-20 02:19:05] [INFO ] Computed 1101 place invariants in 28 ms
[2022-05-20 02:19:12] [INFO ] Implicit Places using invariants and state equation in 6647 ms returned []
Implicit Place search using SMT with State Equation took 8922 ms to find 0 implicit places.
[2022-05-20 02:19:12] [INFO ] Redundant transitions in 185 ms returned []
// Phase 1: matrix 2612 rows 3112 cols
[2022-05-20 02:19:12] [INFO ] Computed 1101 place invariants in 28 ms
[2022-05-20 02:19:14] [INFO ] Dead Transitions using invariants and state equation in 1800 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3112/3112 places, 2612/2612 transitions.
Computed a total of 1201 stabilizing places and 1201 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 6108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6108/6108 places, 5608/5608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6107 transition count 4905
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5405 transition count 4905
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5405 transition count 4405
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4905 transition count 4405
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2409 place count 4900 transition count 4400
Iterating global reduction 2 with 5 rules applied. Total rules applied 2414 place count 4900 transition count 4400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2414 place count 4900 transition count 4399
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2416 place count 4899 transition count 4399
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 6 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 6006 place count 3104 transition count 2604
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6008 place count 3102 transition count 2602
Applied a total of 6008 rules in 1637 ms. Remains 3102 /6108 variables (removed 3006) and now considering 2602/5608 (removed 3006) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:19:16] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:19:18] [INFO ] Implicit Places using invariants in 1912 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:19:18] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 02:19:22] [INFO ] Implicit Places using invariants and state equation in 4018 ms returned []
Implicit Place search using SMT with State Equation took 5932 ms to find 0 implicit places.
[2022-05-20 02:19:22] [INFO ] Redundant transitions in 146 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:19:22] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:19:24] [INFO ] Dead Transitions using invariants and state equation in 1782 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3102/6108 places, 2602/5608 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/6108 places, 2602/5608 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s233 0) (EQ s3005 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 5761 steps with 0 reset in 144 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-00 finished in 9863 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((!p0 U (p1 U p2))||F(p3)))))'
Support contains 3 out of 6108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 6108/6108 places, 5608/5608 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6103 transition count 5603
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6103 transition count 5603
Applied a total of 10 rules in 1155 ms. Remains 6103 /6108 variables (removed 5) and now considering 5603/5608 (removed 5) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:19:25] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:19:27] [INFO ] Implicit Places using invariants in 2273 ms returned []
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:19:28] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 02:19:30] [INFO ] Implicit Places using invariants and state equation in 2163 ms returned []
Implicit Place search using SMT with State Equation took 4438 ms to find 0 implicit places.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:19:30] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 02:19:33] [INFO ] Dead Transitions using invariants and state equation in 3655 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6108 places, 5603/5608 transitions.
Finished structural reductions, in 1 iterations. Remains : 6103/6108 places, 5603/5608 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(EQ s1095 1), p2:(OR (EQ s4503 0) (EQ s2249 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4651 ms.
Product exploration explored 100000 steps with 50000 reset in 4581 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Detected a total of 1199/6103 stabilizing places and 1199/5603 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p2), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) (NOT p2))))
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-01 finished in 18811 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(F(p0)))))'
Support contains 2 out of 6108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6108/6108 places, 5608/5608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6107 transition count 4906
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5406 transition count 4906
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1402 place count 5406 transition count 4406
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2402 place count 4906 transition count 4406
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2408 place count 4900 transition count 4400
Iterating global reduction 2 with 6 rules applied. Total rules applied 2414 place count 4900 transition count 4400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2414 place count 4900 transition count 4399
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2416 place count 4899 transition count 4399
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 6 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 6004 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6006 place count 3103 transition count 2603
Applied a total of 6006 rules in 1491 ms. Remains 3103 /6108 variables (removed 3005) and now considering 2603/5608 (removed 3005) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:19:44] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:19:46] [INFO ] Implicit Places using invariants in 1717 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:19:46] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:19:50] [INFO ] Implicit Places using invariants and state equation in 4173 ms returned []
Implicit Place search using SMT with State Equation took 5894 ms to find 0 implicit places.
[2022-05-20 02:19:50] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:19:50] [INFO ] Computed 1101 place invariants in 15 ms
[2022-05-20 02:19:52] [INFO ] Dead Transitions using invariants and state equation in 1740 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/6108 places, 2603/5608 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/6108 places, 2603/5608 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2949 0) (EQ s829 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 24 reset in 1806 ms.
Product exploration explored 100000 steps with 17 reset in 2253 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 144 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:19:57] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:19:59] [INFO ] Implicit Places using invariants in 1860 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:19:59] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 02:20:03] [INFO ] Implicit Places using invariants and state equation in 4142 ms returned []
Implicit Place search using SMT with State Equation took 6005 ms to find 0 implicit places.
[2022-05-20 02:20:03] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:20:03] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:20:05] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6669 steps, including 2 resets, run visited all 1 properties in 128 ms. (steps per millisecond=52 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23 reset in 1822 ms.
Product exploration explored 100000 steps with 29 reset in 2319 ms.
Built C files in :
/tmp/ltsmin17312640736204049287
[2022-05-20 02:20:10] [INFO ] Too many transitions (2603) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:20:10] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17312640736204049287
Running compilation step : cd /tmp/ltsmin17312640736204049287;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17312640736204049287;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17312640736204049287;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 145 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:20:13] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:20:15] [INFO ] Implicit Places using invariants in 1928 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:20:15] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:20:19] [INFO ] Implicit Places using invariants and state equation in 4336 ms returned []
Implicit Place search using SMT with State Equation took 6274 ms to find 0 implicit places.
[2022-05-20 02:20:19] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:20:19] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:20:21] [INFO ] Dead Transitions using invariants and state equation in 1760 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Built C files in :
/tmp/ltsmin6193546265499107705
[2022-05-20 02:20:21] [INFO ] Too many transitions (2603) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:20:21] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6193546265499107705
Running compilation step : cd /tmp/ltsmin6193546265499107705;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6193546265499107705;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6193546265499107705;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 02:20:24] [INFO ] Flatten gal took : 102 ms
[2022-05-20 02:20:25] [INFO ] Flatten gal took : 102 ms
[2022-05-20 02:20:25] [INFO ] Time to serialize gal into /tmp/LTL5925954467260681116.gal : 19 ms
[2022-05-20 02:20:25] [INFO ] Time to serialize properties into /tmp/LTL9781018774429214089.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/LTL5925954467260681116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9781018774429214089.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/LTL5925954...266
Read 1 LTL properties
Checking formula 0 : !((X(G(F(F("((p6473==0)||(p1884==1))"))))))
Formula 0 simplified : !XGF"((p6473==0)||(p1884==1))"
Detected timeout of ITS tools.
[2022-05-20 02:20:40] [INFO ] Flatten gal took : 95 ms
[2022-05-20 02:20:40] [INFO ] Applying decomposition
[2022-05-20 02:20:40] [INFO ] Flatten gal took : 98 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/graph9092674594378149105.txt' '-o' '/tmp/graph9092674594378149105.bin' '-w' '/tmp/graph9092674594378149105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9092674594378149105.bin' '-l' '-1' '-v' '-w' '/tmp/graph9092674594378149105.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:20:40] [INFO ] Decomposing Gal with order
[2022-05-20 02:20:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:20:41] [INFO ] Removed a total of 601 redundant transitions.
[2022-05-20 02:20:41] [INFO ] Flatten gal took : 234 ms
[2022-05-20 02:20:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1196 labels/synchronizations in 38 ms.
[2022-05-20 02:20:41] [INFO ] Time to serialize gal into /tmp/LTL7576588682424132650.gal : 28 ms
[2022-05-20 02:20:41] [INFO ] Time to serialize properties into /tmp/LTL10402325906615897878.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/LTL7576588682424132650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10402325906615897878.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/LTL7576588...246
Read 1 LTL properties
Checking formula 0 : !((X(G(F(F("((i55.u1047.p6473==0)||(i15.u295.p1884==1))"))))))
Formula 0 simplified : !XGF"((i55.u1047.p6473==0)||(i15.u295.p1884==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13088470110173770298
[2022-05-20 02:20:56] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13088470110173770298
Running compilation step : cd /tmp/ltsmin13088470110173770298;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13088470110173770298;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13088470110173770298;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-03 finished in 76226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(!(p0 U G(p1)))&&p2))))'
Support contains 5 out of 6108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6108/6108 places, 5608/5608 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6103 transition count 5603
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6103 transition count 5603
Applied a total of 10 rules in 1192 ms. Remains 6103 /6108 variables (removed 5) and now considering 5603/5608 (removed 5) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:21:00] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:21:03] [INFO ] Implicit Places using invariants in 2169 ms returned []
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:21:03] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:21:05] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 4215 ms to find 0 implicit places.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:21:05] [INFO ] Computed 1101 place invariants in 31 ms
[2022-05-20 02:21:09] [INFO ] Dead Transitions using invariants and state equation in 4072 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6108 places, 5603/5608 transitions.
Finished structural reductions, in 1 iterations. Remains : 6103/6108 places, 5603/5608 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, p1]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s5513 0), p0:(OR (EQ s290 0) (EQ s710 1)), p1:(OR (EQ s1171 0) (EQ s416 1) (EQ s290 0) (EQ s710 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15460 steps with 0 reset in 268 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-04 finished in 10060 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 6108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6108/6108 places, 5608/5608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6107 transition count 4906
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5406 transition count 4905
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5405 transition count 4905
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1404 place count 5405 transition count 4405
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2404 place count 4905 transition count 4405
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2410 place count 4899 transition count 4399
Iterating global reduction 3 with 6 rules applied. Total rules applied 2416 place count 4899 transition count 4399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2416 place count 4899 transition count 4398
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2418 place count 4898 transition count 4398
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 6 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 3 with 3592 rules applied. Total rules applied 6010 place count 3102 transition count 2602
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6012 place count 3100 transition count 2600
Applied a total of 6012 rules in 1541 ms. Remains 3100 /6108 variables (removed 3008) and now considering 2600/5608 (removed 3008) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 02:21:11] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:21:12] [INFO ] Implicit Places using invariants in 1799 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 02:21:12] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 02:21:16] [INFO ] Implicit Places using invariants and state equation in 3901 ms returned []
Implicit Place search using SMT with State Equation took 5702 ms to find 0 implicit places.
[2022-05-20 02:21:16] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 02:21:16] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:21:18] [INFO ] Dead Transitions using invariants and state equation in 1821 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3100/6108 places, 2600/5608 transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/6108 places, 2600/5608 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1320 0) (EQ s1448 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 28 reset in 1718 ms.
Product exploration explored 100000 steps with 28 reset in 2080 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9896 steps, including 2 resets, run visited all 1 properties in 186 ms. (steps per millisecond=53 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 122 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 02:21:23] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:21:25] [INFO ] Implicit Places using invariants in 1789 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 02:21:25] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:21:29] [INFO ] Implicit Places using invariants and state equation in 4104 ms returned []
Implicit Place search using SMT with State Equation took 5895 ms to find 0 implicit places.
[2022-05-20 02:21:29] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 02:21:29] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:21:31] [INFO ] Dead Transitions using invariants and state equation in 1751 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3100 places, 2600/2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 89194 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89194 steps, saw 80434 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 02:21:34] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:21:34] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:21:35] [INFO ] [Nat]Absence check using 1101 positive place invariants in 220 ms returned sat
[2022-05-20 02:21:37] [INFO ] After 1469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:21:37] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2022-05-20 02:21:37] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2022-05-20 02:21:37] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2022-05-20 02:21:37] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2022-05-20 02:21:37] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2022-05-20 02:21:38] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2022-05-20 02:21:38] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2022-05-20 02:21:38] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2022-05-20 02:21:38] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2022-05-20 02:21:38] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2022-05-20 02:21:38] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2022-05-20 02:21:39] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2022-05-20 02:21:39] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2022-05-20 02:21:39] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2215 ms
[2022-05-20 02:21:39] [INFO ] After 3774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-05-20 02:21:39] [INFO ] After 4453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 2 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 3100 transition count 2600
Applied a total of 597 rules in 239 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3100 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Finished probabilistic random walk after 75385 steps, run visited all 1 properties in 1728 ms. (steps per millisecond=43 )
Probabilistic random walk after 75385 steps, saw 74353 distinct states, run finished after 1729 ms. (steps per millisecond=43 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27 reset in 1832 ms.
Product exploration explored 100000 steps with 28 reset in 2061 ms.
Built C files in :
/tmp/ltsmin13911846875808450279
[2022-05-20 02:21:46] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:21:46] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13911846875808450279
Running compilation step : cd /tmp/ltsmin13911846875808450279;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13911846875808450279;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13911846875808450279;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 140 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 02:21:49] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:21:50] [INFO ] Implicit Places using invariants in 1701 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 02:21:50] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:21:54] [INFO ] Implicit Places using invariants and state equation in 3918 ms returned []
Implicit Place search using SMT with State Equation took 5637 ms to find 0 implicit places.
[2022-05-20 02:21:54] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 02:21:54] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:21:56] [INFO ] Dead Transitions using invariants and state equation in 1764 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3100 places, 2600/2600 transitions.
Built C files in :
/tmp/ltsmin16490129468707290303
[2022-05-20 02:21:56] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:21:56] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16490129468707290303
Running compilation step : cd /tmp/ltsmin16490129468707290303;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16490129468707290303;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16490129468707290303;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 02:21:59] [INFO ] Flatten gal took : 89 ms
[2022-05-20 02:22:00] [INFO ] Flatten gal took : 88 ms
[2022-05-20 02:22:00] [INFO ] Time to serialize gal into /tmp/LTL16318726171042403779.gal : 9 ms
[2022-05-20 02:22:00] [INFO ] Time to serialize properties into /tmp/LTL6487277890468689994.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/LTL16318726171042403779.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6487277890468689994.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/LTL1631872...267
Read 1 LTL properties
Checking formula 0 : !((G(F("((p2948==0)||(p3223==1))"))))
Formula 0 simplified : !GF"((p2948==0)||(p3223==1))"
Detected timeout of ITS tools.
[2022-05-20 02:22:15] [INFO ] Flatten gal took : 83 ms
[2022-05-20 02:22:15] [INFO ] Applying decomposition
[2022-05-20 02:22:15] [INFO ] Flatten gal took : 85 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/graph13192174702498999677.txt' '-o' '/tmp/graph13192174702498999677.bin' '-w' '/tmp/graph13192174702498999677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13192174702498999677.bin' '-l' '-1' '-v' '-w' '/tmp/graph13192174702498999677.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:22:15] [INFO ] Decomposing Gal with order
[2022-05-20 02:22:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:22:15] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 02:22:15] [INFO ] Flatten gal took : 144 ms
[2022-05-20 02:22:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 24 ms.
[2022-05-20 02:22:16] [INFO ] Time to serialize gal into /tmp/LTL3632785555423384137.gal : 20 ms
[2022-05-20 02:22:16] [INFO ] Time to serialize properties into /tmp/LTL1523237812311543968.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/LTL3632785555423384137.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1523237812311543968.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/LTL3632785...245
Read 1 LTL properties
Checking formula 0 : !((G(F("((i24.i0.i3.u469.p2948==0)||(i26.i0.i0.u514.p3223==1))"))))
Formula 0 simplified : !GF"((i24.i0.i3.u469.p2948==0)||(i26.i0.i0.u514.p3223==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6053457663561942683
[2022-05-20 02:22:31] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6053457663561942683
Running compilation step : cd /tmp/ltsmin6053457663561942683;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6053457663561942683;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6053457663561942683;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-05 finished in 84519 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 6108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6108/6108 places, 5608/5608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6107 transition count 4906
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5406 transition count 4906
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1402 place count 5406 transition count 4405
Deduced a syphon composed of 501 places in 21 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2404 place count 4905 transition count 4405
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2409 place count 4900 transition count 4400
Iterating global reduction 2 with 5 rules applied. Total rules applied 2414 place count 4900 transition count 4400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2414 place count 4900 transition count 4399
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2416 place count 4899 transition count 4399
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 6 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 6006 place count 3104 transition count 2604
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6008 place count 3102 transition count 2602
Applied a total of 6008 rules in 1577 ms. Remains 3102 /6108 variables (removed 3006) and now considering 2602/5608 (removed 3006) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:22:35] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:22:37] [INFO ] Implicit Places using invariants in 1806 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:22:37] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:22:41] [INFO ] Implicit Places using invariants and state equation in 4002 ms returned []
Implicit Place search using SMT with State Equation took 5810 ms to find 0 implicit places.
[2022-05-20 02:22:41] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:22:41] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:22:43] [INFO ] Dead Transitions using invariants and state equation in 1784 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3102/6108 places, 2602/5608 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/6108 places, 2602/5608 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-08 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 (EQ s1303 0) (EQ s687 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 15 reset in 1799 ms.
Product exploration explored 100000 steps with 15 reset in 2204 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 98 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 168 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 92908 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92908 steps, saw 83754 distinct states, run finished after 3004 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:22:50] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:22:51] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:22:51] [INFO ] [Nat]Absence check using 1101 positive place invariants in 207 ms returned sat
[2022-05-20 02:22:53] [INFO ] After 1408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:22:53] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2022-05-20 02:22:53] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2022-05-20 02:22:53] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2022-05-20 02:22:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 508 ms
[2022-05-20 02:22:53] [INFO ] After 2006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-20 02:22:53] [INFO ] After 2636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 3102 transition count 2602
Applied a total of 598 rules in 293 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 136673 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136673 steps, saw 135193 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:22:57] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 02:22:57] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:22:58] [INFO ] [Nat]Absence check using 1101 positive place invariants in 216 ms returned sat
[2022-05-20 02:22:59] [INFO ] After 1464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:23:00] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 0 ms to minimize.
[2022-05-20 02:23:00] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 0 ms to minimize.
[2022-05-20 02:23:00] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2022-05-20 02:23:00] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2022-05-20 02:23:01] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 0 ms to minimize.
[2022-05-20 02:23:01] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2022-05-20 02:23:01] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2022-05-20 02:23:01] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2022-05-20 02:23:01] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2022-05-20 02:23:01] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2022-05-20 02:23:01] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-05-20 02:23:02] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2022-05-20 02:23:02] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-20 02:23:02] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2022-05-20 02:23:02] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2540 ms
[2022-05-20 02:23:02] [INFO ] After 4072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-05-20 02:23:02] [INFO ] After 4734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 120 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 121 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:02] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 02:23:05] [INFO ] Implicit Places using invariants in 2250 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:05] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 02:23:09] [INFO ] Implicit Places using invariants and state equation in 4757 ms returned []
Implicit Place search using SMT with State Equation took 7010 ms to find 0 implicit places.
[2022-05-20 02:23:10] [INFO ] Redundant transitions in 78 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:10] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 02:23:11] [INFO ] Dead Transitions using invariants and state equation in 1708 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 145 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:11] [INFO ] Computed 1101 place invariants in 28 ms
[2022-05-20 02:23:12] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:23:12] [INFO ] [Nat]Absence check using 1101 positive place invariants in 202 ms returned sat
[2022-05-20 02:23:14] [INFO ] After 1376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:23:14] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 1 ms to minimize.
[2022-05-20 02:23:14] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 0 ms to minimize.
[2022-05-20 02:23:14] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2022-05-20 02:23:15] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2022-05-20 02:23:15] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 0 ms to minimize.
[2022-05-20 02:23:15] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2022-05-20 02:23:15] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2022-05-20 02:23:15] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2022-05-20 02:23:15] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2022-05-20 02:23:16] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2022-05-20 02:23:16] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2022-05-20 02:23:16] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-20 02:23:16] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2022-05-20 02:23:16] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2022-05-20 02:23:16] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2504 ms
[2022-05-20 02:23:16] [INFO ] After 3948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-05-20 02:23:16] [INFO ] After 4582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 122 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:17] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:23:18] [INFO ] Implicit Places using invariants in 1823 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:18] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 02:23:23] [INFO ] Implicit Places using invariants and state equation in 4118 ms returned []
Implicit Place search using SMT with State Equation took 5955 ms to find 0 implicit places.
[2022-05-20 02:23:23] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:23] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:23:24] [INFO ] Dead Transitions using invariants and state equation in 1779 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 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 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 43 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 91402 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91402 steps, saw 82419 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:28] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:23:28] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:23:29] [INFO ] [Nat]Absence check using 1101 positive place invariants in 213 ms returned sat
[2022-05-20 02:23:30] [INFO ] After 1429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:23:30] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2022-05-20 02:23:31] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2022-05-20 02:23:31] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2022-05-20 02:23:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 503 ms
[2022-05-20 02:23:31] [INFO ] After 1999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2022-05-20 02:23:31] [INFO ] After 2656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 3102 transition count 2602
Applied a total of 598 rules in 247 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 138919 steps, run timeout after 3002 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138919 steps, saw 137422 distinct states, run finished after 3003 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:35] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 02:23:35] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:23:36] [INFO ] [Nat]Absence check using 1101 positive place invariants in 220 ms returned sat
[2022-05-20 02:23:37] [INFO ] After 1468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:23:37] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 0 ms to minimize.
[2022-05-20 02:23:38] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 0 ms to minimize.
[2022-05-20 02:23:38] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 0 ms to minimize.
[2022-05-20 02:23:38] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2022-05-20 02:23:38] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2022-05-20 02:23:38] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-05-20 02:23:39] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2022-05-20 02:23:39] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2022-05-20 02:23:39] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2022-05-20 02:23:39] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2022-05-20 02:23:39] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2022-05-20 02:23:39] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2022-05-20 02:23:39] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2022-05-20 02:23:40] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2022-05-20 02:23:40] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2624 ms
[2022-05-20 02:23:40] [INFO ] After 4167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-05-20 02:23:40] [INFO ] After 4890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 2 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 125 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 112 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:40] [INFO ] Computed 1101 place invariants in 32 ms
[2022-05-20 02:23:42] [INFO ] Implicit Places using invariants in 2230 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:42] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 02:23:47] [INFO ] Implicit Places using invariants and state equation in 4630 ms returned []
Implicit Place search using SMT with State Equation took 6863 ms to find 0 implicit places.
[2022-05-20 02:23:47] [INFO ] Redundant transitions in 83 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:47] [INFO ] Computed 1101 place invariants in 32 ms
[2022-05-20 02:23:49] [INFO ] Dead Transitions using invariants and state equation in 1786 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 115 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:23:49] [INFO ] Computed 1101 place invariants in 32 ms
[2022-05-20 02:23:49] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:23:50] [INFO ] [Nat]Absence check using 1101 positive place invariants in 206 ms returned sat
[2022-05-20 02:23:51] [INFO ] After 1407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:23:52] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 0 ms to minimize.
[2022-05-20 02:23:52] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 0 ms to minimize.
[2022-05-20 02:23:52] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2022-05-20 02:23:52] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2022-05-20 02:23:52] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 0 ms to minimize.
[2022-05-20 02:23:53] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2022-05-20 02:23:53] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-05-20 02:23:53] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2022-05-20 02:23:53] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2022-05-20 02:23:53] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-05-20 02:23:53] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2022-05-20 02:23:53] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2022-05-20 02:23:54] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2022-05-20 02:23:54] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-20 02:23:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2523 ms
[2022-05-20 02:23:54] [INFO ] After 4005ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-20 02:23:54] [INFO ] After 4640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 193 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15 reset in 1832 ms.
Product exploration explored 100000 steps with 15 reset in 2236 ms.
Built C files in :
/tmp/ltsmin13804568680477760352
[2022-05-20 02:23:58] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:23:58] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13804568680477760352
Running compilation step : cd /tmp/ltsmin13804568680477760352;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13804568680477760352;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13804568680477760352;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 126 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:24:02] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:24:03] [INFO ] Implicit Places using invariants in 1827 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:24:03] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 02:24:07] [INFO ] Implicit Places using invariants and state equation in 4041 ms returned []
Implicit Place search using SMT with State Equation took 5884 ms to find 0 implicit places.
[2022-05-20 02:24:08] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:24:08] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 02:24:09] [INFO ] Dead Transitions using invariants and state equation in 1729 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Built C files in :
/tmp/ltsmin12487250072878835402
[2022-05-20 02:24:09] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:24:09] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12487250072878835402
Running compilation step : cd /tmp/ltsmin12487250072878835402;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12487250072878835402;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12487250072878835402;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 02:24:12] [INFO ] Flatten gal took : 81 ms
[2022-05-20 02:24:13] [INFO ] Flatten gal took : 80 ms
[2022-05-20 02:24:13] [INFO ] Time to serialize gal into /tmp/LTL10975681863908726471.gal : 14 ms
[2022-05-20 02:24:13] [INFO ] Time to serialize properties into /tmp/LTL10304965194525438148.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/LTL10975681863908726471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10304965194525438148.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/LTL1097568...268
Read 1 LTL properties
Checking formula 0 : !((F(G("((p2910==0)||(p1588==1))"))))
Formula 0 simplified : !FG"((p2910==0)||(p1588==1))"
Detected timeout of ITS tools.
[2022-05-20 02:24:28] [INFO ] Flatten gal took : 80 ms
[2022-05-20 02:24:28] [INFO ] Applying decomposition
[2022-05-20 02:24:28] [INFO ] Flatten gal took : 83 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/graph14444834091433469000.txt' '-o' '/tmp/graph14444834091433469000.bin' '-w' '/tmp/graph14444834091433469000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14444834091433469000.bin' '-l' '-1' '-v' '-w' '/tmp/graph14444834091433469000.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:24:28] [INFO ] Decomposing Gal with order
[2022-05-20 02:24:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:24:28] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 02:24:28] [INFO ] Flatten gal took : 161 ms
[2022-05-20 02:24:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 25 ms.
[2022-05-20 02:24:29] [INFO ] Time to serialize gal into /tmp/LTL17740107126038547090.gal : 63 ms
[2022-05-20 02:24:29] [INFO ] Time to serialize properties into /tmp/LTL2383727412296348225.ltl : 3 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/LTL17740107126038547090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2383727412296348225.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/LTL1774010...246
Read 1 LTL properties
Checking formula 0 : !((F(G("((i22.i1.i0.u462.p2910==0)||(i12.i0.i2.u245.p1588==1))"))))
Formula 0 simplified : !FG"((i22.i1.i0.u462.p2910==0)||(i12.i0.i2.u245.p1588==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8084116808083568326
[2022-05-20 02:24:44] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8084116808083568326
Running compilation step : cd /tmp/ltsmin8084116808083568326;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8084116808083568326;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8084116808083568326;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-08 finished in 133019 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 6108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6108/6108 places, 5608/5608 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6103 transition count 5603
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6103 transition count 5603
Applied a total of 10 rules in 1187 ms. Remains 6103 /6108 variables (removed 5) and now considering 5603/5608 (removed 5) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:24:48] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:24:50] [INFO ] Implicit Places using invariants in 2131 ms returned []
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:24:50] [INFO ] Computed 1101 place invariants in 19 ms
[2022-05-20 02:24:52] [INFO ] Implicit Places using invariants and state equation in 2131 ms returned []
Implicit Place search using SMT with State Equation took 4267 ms to find 0 implicit places.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:24:52] [INFO ] Computed 1101 place invariants in 16 ms
[2022-05-20 02:24:56] [INFO ] Dead Transitions using invariants and state equation in 3882 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6108 places, 5603/5608 transitions.
Finished structural reductions, in 1 iterations. Remains : 6103/6108 places, 5603/5608 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s625 0) (EQ s5735 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4317 steps with 0 reset in 58 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-09 finished in 9615 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G((X(p2)&&p1))))))'
Support contains 3 out of 6108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6108/6108 places, 5608/5608 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6102 transition count 5602
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6102 transition count 5602
Applied a total of 12 rules in 1108 ms. Remains 6102 /6108 variables (removed 6) and now considering 5602/5608 (removed 6) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:24:57] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:25:00] [INFO ] Implicit Places using invariants in 2173 ms returned []
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:25:00] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 02:25:02] [INFO ] Implicit Places using invariants and state equation in 2135 ms returned []
Implicit Place search using SMT with State Equation took 4318 ms to find 0 implicit places.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:25:02] [INFO ] Computed 1101 place invariants in 16 ms
[2022-05-20 02:25:06] [INFO ] Dead Transitions using invariants and state equation in 3913 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6108 places, 5602/5608 transitions.
Finished structural reductions, in 1 iterations. Remains : 6102/6108 places, 5602/5608 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s2464 1), p1:(AND (NEQ s972 0) (NEQ s5113 1)), p2:(AND (NEQ s972 0) (NEQ s5113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 1585 ms.
Product exploration explored 100000 steps with 10 reset in 1941 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 218907 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218907 steps, saw 213448 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:25:13] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:25:14] [INFO ] [Real]Absence check using 1101 positive place invariants in 702 ms returned sat
[2022-05-20 02:25:19] [INFO ] After 6137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:25:20] [INFO ] [Nat]Absence check using 1101 positive place invariants in 662 ms returned sat
[2022-05-20 02:25:25] [INFO ] After 4980ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:25:28] [INFO ] Deduced a trap composed of 24 places in 2462 ms of which 4 ms to minimize.
[2022-05-20 02:25:31] [INFO ] Deduced a trap composed of 17 places in 2500 ms of which 4 ms to minimize.
[2022-05-20 02:25:33] [INFO ] Deduced a trap composed of 19 places in 2506 ms of which 4 ms to minimize.
[2022-05-20 02:25:36] [INFO ] Deduced a trap composed of 21 places in 2327 ms of which 3 ms to minimize.
[2022-05-20 02:25:38] [INFO ] Deduced a trap composed of 19 places in 2289 ms of which 3 ms to minimize.
[2022-05-20 02:25:41] [INFO ] Deduced a trap composed of 22 places in 2325 ms of which 4 ms to minimize.
[2022-05-20 02:25:43] [INFO ] Deduced a trap composed of 22 places in 2334 ms of which 4 ms to minimize.
[2022-05-20 02:25:46] [INFO ] Deduced a trap composed of 34 places in 2168 ms of which 2 ms to minimize.
[2022-05-20 02:25:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:25:46] [INFO ] After 26768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 171 ms.
Support contains 1 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6102 transition count 4900
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5400 transition count 4900
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5400 transition count 4400
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4900 transition count 4400
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 7 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 6000 place count 3102 transition count 2602
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 2 with 897 rules applied. Total rules applied 6897 place count 3102 transition count 2602
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6898 place count 3101 transition count 2601
Applied a total of 6898 rules in 1155 ms. Remains 3101 /6102 variables (removed 3001) and now considering 2601/5602 (removed 3001) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/6102 places, 2601/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 111161 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111161 steps, saw 104588 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:25:50] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 02:25:51] [INFO ] [Real]Absence check using 1056 positive place invariants in 199 ms returned sat
[2022-05-20 02:25:51] [INFO ] [Real]Absence check using 1056 positive and 45 generalized place invariants in 13 ms returned sat
[2022-05-20 02:25:53] [INFO ] After 2519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:25:54] [INFO ] [Nat]Absence check using 1056 positive place invariants in 205 ms returned sat
[2022-05-20 02:25:54] [INFO ] [Nat]Absence check using 1056 positive and 45 generalized place invariants in 13 ms returned sat
[2022-05-20 02:25:56] [INFO ] After 2298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:25:56] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 0 ms to minimize.
[2022-05-20 02:25:57] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2022-05-20 02:25:57] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2022-05-20 02:25:57] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2022-05-20 02:25:58] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 0 ms to minimize.
[2022-05-20 02:25:58] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 1 ms to minimize.
[2022-05-20 02:25:58] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 0 ms to minimize.
[2022-05-20 02:25:59] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 1 ms to minimize.
[2022-05-20 02:25:59] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 1 ms to minimize.
[2022-05-20 02:25:59] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 0 ms to minimize.
[2022-05-20 02:26:00] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 1 ms to minimize.
[2022-05-20 02:26:00] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 0 ms to minimize.
[2022-05-20 02:26:00] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 0 ms to minimize.
[2022-05-20 02:26:01] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 1 ms to minimize.
[2022-05-20 02:26:01] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2022-05-20 02:26:01] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2022-05-20 02:26:02] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2022-05-20 02:26:02] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 1 ms to minimize.
[2022-05-20 02:26:02] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 1 ms to minimize.
[2022-05-20 02:26:03] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 0 ms to minimize.
[2022-05-20 02:26:03] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 0 ms to minimize.
[2022-05-20 02:26:03] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2022-05-20 02:26:03] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2022-05-20 02:26:04] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2022-05-20 02:26:04] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
[2022-05-20 02:26:04] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 2 ms to minimize.
[2022-05-20 02:26:04] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2022-05-20 02:26:05] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 1 ms to minimize.
[2022-05-20 02:26:05] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2022-05-20 02:26:05] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2022-05-20 02:26:05] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 1 ms to minimize.
[2022-05-20 02:26:06] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2022-05-20 02:26:06] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2022-05-20 02:26:06] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 2 ms to minimize.
[2022-05-20 02:26:06] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2022-05-20 02:26:07] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2022-05-20 02:26:07] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2022-05-20 02:26:07] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2022-05-20 02:26:07] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2022-05-20 02:26:08] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2022-05-20 02:26:08] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2022-05-20 02:26:08] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2022-05-20 02:26:08] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2022-05-20 02:26:09] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2022-05-20 02:26:09] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2022-05-20 02:26:09] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2022-05-20 02:26:09] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2022-05-20 02:26:09] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2022-05-20 02:26:10] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2022-05-20 02:26:10] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2022-05-20 02:26:10] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2022-05-20 02:26:10] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2022-05-20 02:26:11] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2022-05-20 02:26:11] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2022-05-20 02:26:11] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2022-05-20 02:26:11] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2022-05-20 02:26:11] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2022-05-20 02:26:12] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2022-05-20 02:26:12] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2022-05-20 02:26:12] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 1 ms to minimize.
[2022-05-20 02:26:12] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2022-05-20 02:26:13] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2022-05-20 02:26:13] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2022-05-20 02:26:13] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2022-05-20 02:26:13] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2022-05-20 02:26:14] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2022-05-20 02:26:14] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2022-05-20 02:26:14] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2022-05-20 02:26:14] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2022-05-20 02:26:15] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2022-05-20 02:26:15] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2022-05-20 02:26:15] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2022-05-20 02:26:15] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2022-05-20 02:26:16] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2022-05-20 02:26:16] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2022-05-20 02:26:16] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2022-05-20 02:26:16] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2022-05-20 02:26:16] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2022-05-20 02:26:17] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-20 02:26:17] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 20725 ms
[2022-05-20 02:26:17] [INFO ] After 23105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2022-05-20 02:26:17] [INFO ] After 23773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 129 ms.
Support contains 1 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 119 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 121 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:26:17] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 02:26:19] [INFO ] Implicit Places using invariants in 2201 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:26:19] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:26:24] [INFO ] Implicit Places using invariants and state equation in 4395 ms returned []
Implicit Place search using SMT with State Equation took 6596 ms to find 0 implicit places.
[2022-05-20 02:26:24] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:26:24] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 02:26:26] [INFO ] Dead Transitions using invariants and state equation in 1772 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 121 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:26:26] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 02:26:26] [INFO ] [Real]Absence check using 1056 positive place invariants in 191 ms returned sat
[2022-05-20 02:26:26] [INFO ] [Real]Absence check using 1056 positive and 45 generalized place invariants in 10 ms returned sat
[2022-05-20 02:26:28] [INFO ] After 2483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:26:29] [INFO ] [Nat]Absence check using 1056 positive place invariants in 196 ms returned sat
[2022-05-20 02:26:29] [INFO ] [Nat]Absence check using 1056 positive and 45 generalized place invariants in 9 ms returned sat
[2022-05-20 02:26:31] [INFO ] After 2246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:26:31] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2022-05-20 02:26:32] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2022-05-20 02:26:32] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2022-05-20 02:26:32] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 0 ms to minimize.
[2022-05-20 02:26:33] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 0 ms to minimize.
[2022-05-20 02:26:33] [INFO ] Deduced a trap composed of 36 places in 256 ms of which 1 ms to minimize.
[2022-05-20 02:26:33] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 0 ms to minimize.
[2022-05-20 02:26:34] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 1 ms to minimize.
[2022-05-20 02:26:34] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 0 ms to minimize.
[2022-05-20 02:26:34] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2022-05-20 02:26:35] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 0 ms to minimize.
[2022-05-20 02:26:35] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 1 ms to minimize.
[2022-05-20 02:26:35] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 1 ms to minimize.
[2022-05-20 02:26:36] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:26:36] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 0 ms to minimize.
[2022-05-20 02:26:36] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2022-05-20 02:26:37] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 0 ms to minimize.
[2022-05-20 02:26:37] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 1 ms to minimize.
[2022-05-20 02:26:37] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2022-05-20 02:26:38] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 0 ms to minimize.
[2022-05-20 02:26:38] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 1 ms to minimize.
[2022-05-20 02:26:38] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2022-05-20 02:26:39] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2022-05-20 02:26:39] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2022-05-20 02:26:39] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2022-05-20 02:26:39] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 1 ms to minimize.
[2022-05-20 02:26:40] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2022-05-20 02:26:40] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 0 ms to minimize.
[2022-05-20 02:26:40] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2022-05-20 02:26:40] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2022-05-20 02:26:41] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 0 ms to minimize.
[2022-05-20 02:26:41] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2022-05-20 02:26:41] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2022-05-20 02:26:41] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2022-05-20 02:26:42] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2022-05-20 02:26:42] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2022-05-20 02:26:42] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2022-05-20 02:26:42] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2022-05-20 02:26:43] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2022-05-20 02:26:43] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2022-05-20 02:26:43] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2022-05-20 02:26:43] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2022-05-20 02:26:44] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2022-05-20 02:26:44] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2022-05-20 02:26:44] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2022-05-20 02:26:44] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2022-05-20 02:26:44] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2022-05-20 02:26:45] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2022-05-20 02:26:45] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2022-05-20 02:26:45] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2022-05-20 02:26:45] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2022-05-20 02:26:46] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2022-05-20 02:26:46] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2022-05-20 02:26:46] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2022-05-20 02:26:46] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2022-05-20 02:26:46] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2022-05-20 02:26:47] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2022-05-20 02:26:47] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2022-05-20 02:26:47] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2022-05-20 02:26:47] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2022-05-20 02:26:48] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2022-05-20 02:26:48] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2022-05-20 02:26:48] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2022-05-20 02:26:48] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2022-05-20 02:26:49] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2022-05-20 02:26:49] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2022-05-20 02:26:49] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2022-05-20 02:26:49] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2022-05-20 02:26:50] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2022-05-20 02:26:50] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2022-05-20 02:26:50] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2022-05-20 02:26:50] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2022-05-20 02:26:51] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2022-05-20 02:26:51] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2022-05-20 02:26:51] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2022-05-20 02:26:51] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2022-05-20 02:26:51] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2022-05-20 02:26:52] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 0 ms to minimize.
[2022-05-20 02:26:52] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2022-05-20 02:26:52] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 20747 ms
[2022-05-20 02:26:52] [INFO ] After 23074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-05-20 02:26:52] [INFO ] After 23717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:26:52] [INFO ] Computed 1101 place invariants in 20 ms
[2022-05-20 02:27:05] [INFO ] [Real]Absence check using 1101 positive place invariants in 6637 ms returned sat
[2022-05-20 02:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:27:07] [INFO ] [Real]Absence check using state equation in 1981 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 6102 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6101 transition count 4900
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5400 transition count 4899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5399 transition count 4899
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1404 place count 5399 transition count 4399
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2404 place count 4899 transition count 4399
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 6 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 3 with 3590 rules applied. Total rules applied 5994 place count 3104 transition count 2604
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5996 place count 3102 transition count 2602
Applied a total of 5996 rules in 1031 ms. Remains 3102 /6102 variables (removed 3000) and now considering 2602/5602 (removed 3000) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:27:08] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 02:27:10] [INFO ] Implicit Places using invariants in 1832 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:27:10] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:27:14] [INFO ] Implicit Places using invariants and state equation in 3971 ms returned []
Implicit Place search using SMT with State Equation took 5804 ms to find 0 implicit places.
[2022-05-20 02:27:14] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:27:14] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:27:16] [INFO ] Dead Transitions using invariants and state equation in 1734 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3102/6102 places, 2602/5602 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/6102 places, 2602/5602 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95824 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95824 steps, saw 86402 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:27:19] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:27:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 203 ms returned sat
[2022-05-20 02:27:21] [INFO ] After 1934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:27:22] [INFO ] [Nat]Absence check using 1101 positive place invariants in 213 ms returned sat
[2022-05-20 02:27:23] [INFO ] After 1435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:27:23] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2022-05-20 02:27:24] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-20 02:27:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2022-05-20 02:27:24] [INFO ] After 1880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-05-20 02:27:24] [INFO ] After 2544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 600 place count 3101 transition count 2601
Applied a total of 600 rules in 362 ms. Remains 3101 /3102 variables (removed 1) and now considering 2601/2602 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3102 places, 2601/2602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Finished probabilistic random walk after 85550 steps, run visited all 1 properties in 1694 ms. (steps per millisecond=50 )
Probabilistic random walk after 85550 steps, saw 84462 distinct states, run finished after 1698 ms. (steps per millisecond=50 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:27:26] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 02:27:32] [INFO ] [Real]Absence check using 1101 positive place invariants in 1590 ms returned sat
[2022-05-20 02:27:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:27:41] [INFO ] [Real]Absence check using state equation in 9925 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25 reset in 1678 ms.
Product exploration explored 100000 steps with 25 reset in 2061 ms.
Built C files in :
/tmp/ltsmin1547654531317580665
[2022-05-20 02:27:45] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:27:45] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1547654531317580665
Running compilation step : cd /tmp/ltsmin1547654531317580665;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1547654531317580665;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1547654531317580665;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Applied a total of 2 rules in 234 ms. Remains 3101 /3102 variables (removed 1) and now considering 2601/2602 (removed 1) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:27:49] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:27:50] [INFO ] Implicit Places using invariants in 1828 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:27:50] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:27:55] [INFO ] Implicit Places using invariants and state equation in 4122 ms returned []
Implicit Place search using SMT with State Equation took 5964 ms to find 0 implicit places.
[2022-05-20 02:27:55] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:27:55] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:27:56] [INFO ] Dead Transitions using invariants and state equation in 1771 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3102 places, 2601/2602 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3102 places, 2601/2602 transitions.
Built C files in :
/tmp/ltsmin14505215893348448241
[2022-05-20 02:27:56] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:27:56] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14505215893348448241
Running compilation step : cd /tmp/ltsmin14505215893348448241;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14505215893348448241;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14505215893348448241;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 02:28:00] [INFO ] Flatten gal took : 80 ms
[2022-05-20 02:28:00] [INFO ] Flatten gal took : 81 ms
[2022-05-20 02:28:00] [INFO ] Time to serialize gal into /tmp/LTL4426977644580584290.gal : 8 ms
[2022-05-20 02:28:00] [INFO ] Time to serialize properties into /tmp/LTL14926179342823425377.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/LTL4426977644580584290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14926179342823425377.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/LTL4426977...267
Read 1 LTL properties
Checking formula 0 : !(((F("(p2737==1)"))||(X(X(G(("((p1070!=0)&&(p5694!=1))")&&(X("((p1070!=0)&&(p5694!=1))"))))))))
Formula 0 simplified : !(F"(p2737==1)" | XXG("((p1070!=0)&&(p5694!=1))" & X"((p1070!=0)&&(p5694!=1))"))
Detected timeout of ITS tools.
[2022-05-20 02:28:15] [INFO ] Flatten gal took : 77 ms
[2022-05-20 02:28:15] [INFO ] Applying decomposition
[2022-05-20 02:28:15] [INFO ] Flatten gal took : 77 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/graph6869776675937954204.txt' '-o' '/tmp/graph6869776675937954204.bin' '-w' '/tmp/graph6869776675937954204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6869776675937954204.bin' '-l' '-1' '-v' '-w' '/tmp/graph6869776675937954204.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:28:15] [INFO ] Decomposing Gal with order
[2022-05-20 02:28:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:28:15] [INFO ] Removed a total of 604 redundant transitions.
[2022-05-20 02:28:15] [INFO ] Flatten gal took : 149 ms
[2022-05-20 02:28:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1208 labels/synchronizations in 31 ms.
[2022-05-20 02:28:16] [INFO ] Time to serialize gal into /tmp/LTL14717015332068315879.gal : 26 ms
[2022-05-20 02:28:16] [INFO ] Time to serialize properties into /tmp/LTL6248547891625299453.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/LTL14717015332068315879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6248547891625299453.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/LTL1471701...246
Read 1 LTL properties
Checking formula 0 : !(((F("(i22.i0.i1.u434.p2737==1)"))||(X(X(G(("((i7.i1.i3.u160.p1070!=0)&&(i47.i1.i2.u920.p5694!=1))")&&(X("((i7.i1.i3.u160.p1070!=0)&&...190
Formula 0 simplified : !(F"(i22.i0.i1.u434.p2737==1)" | XXG("((i7.i1.i3.u160.p1070!=0)&&(i47.i1.i2.u920.p5694!=1))" & X"((i7.i1.i3.u160.p1070!=0)&&(i47.i1....176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4864010769094014419
[2022-05-20 02:28:31] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4864010769094014419
Running compilation step : cd /tmp/ltsmin4864010769094014419;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4864010769094014419;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4864010769094014419;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-10 finished in 217370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F(p0))))))'
Support contains 1 out of 6108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6108/6108 places, 5608/5608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6107 transition count 4906
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5406 transition count 4905
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5405 transition count 4905
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1404 place count 5405 transition count 4405
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2404 place count 4905 transition count 4405
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2410 place count 4899 transition count 4399
Iterating global reduction 3 with 6 rules applied. Total rules applied 2416 place count 4899 transition count 4399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2416 place count 4899 transition count 4398
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2418 place count 4898 transition count 4398
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 7 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 3 with 3588 rules applied. Total rules applied 6006 place count 3104 transition count 2604
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6008 place count 3102 transition count 2602
Applied a total of 6008 rules in 1543 ms. Remains 3102 /6108 variables (removed 3006) and now considering 2602/5608 (removed 3006) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:28:35] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 02:28:37] [INFO ] Implicit Places using invariants in 1893 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:28:37] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 02:28:41] [INFO ] Implicit Places using invariants and state equation in 4124 ms returned []
Implicit Place search using SMT with State Equation took 6018 ms to find 0 implicit places.
[2022-05-20 02:28:41] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:28:41] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:28:43] [INFO ] Dead Transitions using invariants and state equation in 1926 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3102/6108 places, 2602/5608 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/6108 places, 2602/5608 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2204 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22290 reset in 3429 ms.
Product exploration explored 100000 steps with 22316 reset in 3594 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/3102 stabilizing places and 2/2602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:28:51] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 02:28:56] [INFO ] [Real]Absence check using 1101 positive place invariants in 1316 ms returned sat
[2022-05-20 02:28:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:29:06] [INFO ] [Real]Absence check using state equation in 10282 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 142 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:29:06] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 02:29:08] [INFO ] Implicit Places using invariants in 1852 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:29:08] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 02:29:12] [INFO ] Implicit Places using invariants and state equation in 4321 ms returned []
Implicit Place search using SMT with State Equation took 6174 ms to find 0 implicit places.
[2022-05-20 02:29:12] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:29:12] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:29:14] [INFO ] Dead Transitions using invariants and state equation in 1790 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/3102 stabilizing places and 2/2602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:29:15] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:29:19] [INFO ] [Real]Absence check using 1101 positive place invariants in 1349 ms returned sat
[2022-05-20 02:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:29:30] [INFO ] [Real]Absence check using state equation in 10327 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22232 reset in 3420 ms.
Product exploration explored 100000 steps with 22241 reset in 3542 ms.
Built C files in :
/tmp/ltsmin10831732347954230595
[2022-05-20 02:29:37] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:29:37] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10831732347954230595
Running compilation step : cd /tmp/ltsmin10831732347954230595;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10831732347954230595;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10831732347954230595;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 125 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:29:40] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:29:41] [INFO ] Implicit Places using invariants in 1667 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:29:41] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:29:45] [INFO ] Implicit Places using invariants and state equation in 3922 ms returned []
Implicit Place search using SMT with State Equation took 5600 ms to find 0 implicit places.
[2022-05-20 02:29:45] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:29:45] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:29:47] [INFO ] Dead Transitions using invariants and state equation in 1844 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Built C files in :
/tmp/ltsmin3626547078599298948
[2022-05-20 02:29:47] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:29:47] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3626547078599298948
Running compilation step : cd /tmp/ltsmin3626547078599298948;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3626547078599298948;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3626547078599298948;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 02:29:51] [INFO ] Flatten gal took : 124 ms
[2022-05-20 02:29:51] [INFO ] Flatten gal took : 110 ms
[2022-05-20 02:29:51] [INFO ] Time to serialize gal into /tmp/LTL17903193190300175773.gal : 8 ms
[2022-05-20 02:29:51] [INFO ] Time to serialize properties into /tmp/LTL38681960572083566.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/LTL17903193190300175773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL38681960572083566.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/LTL1790319...265
Read 1 LTL properties
Checking formula 0 : !((F(("(p4860==1)")||(X(X(F("(p4860==1)")))))))
Formula 0 simplified : !F("(p4860==1)" | XXF"(p4860==1)")
Detected timeout of ITS tools.
[2022-05-20 02:30:06] [INFO ] Flatten gal took : 116 ms
[2022-05-20 02:30:06] [INFO ] Applying decomposition
[2022-05-20 02:30:06] [INFO ] Flatten gal took : 147 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/graph18103015715076133332.txt' '-o' '/tmp/graph18103015715076133332.bin' '-w' '/tmp/graph18103015715076133332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18103015715076133332.bin' '-l' '-1' '-v' '-w' '/tmp/graph18103015715076133332.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:30:06] [INFO ] Decomposing Gal with order
[2022-05-20 02:30:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:30:07] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 02:30:07] [INFO ] Flatten gal took : 131 ms
[2022-05-20 02:30:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 70 ms.
[2022-05-20 02:30:07] [INFO ] Time to serialize gal into /tmp/LTL8149054106701158299.gal : 33 ms
[2022-05-20 02:30:07] [INFO ] Time to serialize properties into /tmp/LTL1226527340724322276.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/LTL8149054106701158299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1226527340724322276.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/LTL8149054...245
Read 1 LTL properties
Checking formula 0 : !((F(("(i39.u790.p4860==1)")||(X(X(F("(i39.u790.p4860==1)")))))))
Formula 0 simplified : !F("(i39.u790.p4860==1)" | XXF"(i39.u790.p4860==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin995550131794949472
[2022-05-20 02:30:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin995550131794949472
Running compilation step : cd /tmp/ltsmin995550131794949472;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin995550131794949472;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin995550131794949472;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-14 finished in 111153 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U ((p0 U X(p1))&&X(F((G(X(p2))&&p2))))))'
Support contains 5 out of 6108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6108/6108 places, 5608/5608 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6103 transition count 5603
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6103 transition count 5603
Applied a total of 10 rules in 1073 ms. Remains 6103 /6108 variables (removed 5) and now considering 5603/5608 (removed 5) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:30:26] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:30:28] [INFO ] Implicit Places using invariants in 2175 ms returned []
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:30:28] [INFO ] Computed 1101 place invariants in 16 ms
[2022-05-20 02:30:30] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 4344 ms to find 0 implicit places.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:30:30] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:30:34] [INFO ] Dead Transitions using invariants and state equation in 3882 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6108 places, 5603/5608 transitions.
Finished structural reductions, in 1 iterations. Remains : 6103/6108 places, 5603/5608 transitions.
Stuttering acceptance computed with spot in 924 ms :[(AND p1 p2), (AND p2 p1), p2, p2]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s4263 0) (EQ s1319 1)), p2:(EQ s2723 1), p1:(OR (EQ s1071 0) (EQ s1971 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 39 reset in 1078 ms.
Product exploration explored 100000 steps with 33 reset in 1404 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Detected a total of 1200/6103 stabilizing places and 1200/5603 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p2 p1))), (X p0), (X p1), (X (X (NOT p2))), true, (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 395 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[p2, p2]
Finished random walk after 1807 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=106 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p2 p1))), (X p0), (X p1), (X (X (NOT p2))), true, (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 10 factoid took 358 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[p2, p2]
Stuttering acceptance computed with spot in 57 ms :[p2, p2]
Support contains 1 out of 6103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 4901
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 21 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 7 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5984 place count 3110 transition count 2610
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5986 place count 3108 transition count 2608
Applied a total of 5986 rules in 1018 ms. Remains 3108 /6103 variables (removed 2995) and now considering 2608/5603 (removed 2995) transitions.
// Phase 1: matrix 2608 rows 3108 cols
[2022-05-20 02:30:40] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 02:30:41] [INFO ] Implicit Places using invariants in 1780 ms returned []
// Phase 1: matrix 2608 rows 3108 cols
[2022-05-20 02:30:42] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:30:46] [INFO ] Implicit Places using invariants and state equation in 4011 ms returned []
Implicit Place search using SMT with State Equation took 5793 ms to find 0 implicit places.
[2022-05-20 02:30:46] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 2608 rows 3108 cols
[2022-05-20 02:30:46] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:30:47] [INFO ] Dead Transitions using invariants and state equation in 1730 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3108/6103 places, 2608/5603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3108/6103 places, 2608/5603 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/3108 stabilizing places and 4/2608 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[p2, p2]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F p2)]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[p2, p2]
Stuttering acceptance computed with spot in 54 ms :[p2, p2]
Stuttering acceptance computed with spot in 72 ms :[p2, p2]
Product exploration explored 100000 steps with 58 reset in 1823 ms.
Product exploration explored 100000 steps with 62 reset in 2218 ms.
Built C files in :
/tmp/ltsmin1516290704530083886
[2022-05-20 02:30:52] [INFO ] Too many transitions (2608) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:30:52] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1516290704530083886
Running compilation step : cd /tmp/ltsmin1516290704530083886;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1516290704530083886;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1516290704530083886;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 3108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3108/3108 places, 2608/2608 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3106 transition count 2605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 3105 transition count 2605
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 3102 transition count 2602
Applied a total of 8 rules in 252 ms. Remains 3102 /3108 variables (removed 6) and now considering 2602/2608 (removed 6) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:30:55] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:30:57] [INFO ] Implicit Places using invariants in 1717 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:30:57] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 02:31:01] [INFO ] Implicit Places using invariants and state equation in 3950 ms returned []
Implicit Place search using SMT with State Equation took 5676 ms to find 0 implicit places.
[2022-05-20 02:31:01] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:31:01] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:31:03] [INFO ] Dead Transitions using invariants and state equation in 1812 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3102/3108 places, 2602/2608 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3108 places, 2602/2608 transitions.
Built C files in :
/tmp/ltsmin15437495346059370647
[2022-05-20 02:31:03] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:31:03] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15437495346059370647
Running compilation step : cd /tmp/ltsmin15437495346059370647;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15437495346059370647;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15437495346059370647;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 02:31:06] [INFO ] Flatten gal took : 77 ms
[2022-05-20 02:31:06] [INFO ] Flatten gal took : 78 ms
[2022-05-20 02:31:06] [INFO ] Time to serialize gal into /tmp/LTL2528260130380843670.gal : 7 ms
[2022-05-20 02:31:06] [INFO ] Time to serialize properties into /tmp/LTL11665879375052064886.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/LTL2528260130380843670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11665879375052064886.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/LTL2528260...267
Read 1 LTL properties
Checking formula 0 : !((!(("((p4745==0)||(p1459==1))")U((("((p4745==0)||(p1459==1))")U(X("((p1183==0)||(p2188==1))")))&&(X(F((G(X("(p3026==1)")))&&("(p3026...168
Formula 0 simplified : "((p4745==0)||(p1459==1))" U (("((p4745==0)||(p1459==1))" U X"((p1183==0)||(p2188==1))") & XF("(p3026==1)" & GX"(p3026==1)"))
Detected timeout of ITS tools.
[2022-05-20 02:31:21] [INFO ] Flatten gal took : 78 ms
[2022-05-20 02:31:21] [INFO ] Applying decomposition
[2022-05-20 02:31:21] [INFO ] Flatten gal took : 82 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/graph3779315835545600663.txt' '-o' '/tmp/graph3779315835545600663.bin' '-w' '/tmp/graph3779315835545600663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3779315835545600663.bin' '-l' '-1' '-v' '-w' '/tmp/graph3779315835545600663.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:31:22] [INFO ] Decomposing Gal with order
[2022-05-20 02:31:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:31:22] [INFO ] Removed a total of 601 redundant transitions.
[2022-05-20 02:31:22] [INFO ] Flatten gal took : 161 ms
[2022-05-20 02:31:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 1204 labels/synchronizations in 23 ms.
[2022-05-20 02:31:22] [INFO ] Time to serialize gal into /tmp/LTL8475381510238991622.gal : 15 ms
[2022-05-20 02:31:22] [INFO ] Time to serialize properties into /tmp/LTL14836476570580203758.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/LTL8475381510238991622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14836476570580203758.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/LTL8475381...246
Read 1 LTL properties
Checking formula 0 : !((!(("((i39.i1.i0.u764.p4745==0)||(i11.i1.i1.u224.p1459==1))")U((("((i39.i1.i0.u764.p4745==0)||(i11.i1.i1.u224.p1459==1))")U(X("((i9....281
Formula 0 simplified : "((i39.i1.i0.u764.p4745==0)||(i11.i1.i1.u224.p1459==1))" U (("((i39.i1.i0.u764.p4745==0)||(i11.i1.i1.u224.p1459==1))" U X"((i9.i1.i0...261
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9030353882759164997
[2022-05-20 02:31:37] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9030353882759164997
Running compilation step : cd /tmp/ltsmin9030353882759164997;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9030353882759164997;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9030353882759164997;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-15 finished in 75301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(F(p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G((X(p2)&&p1))))))'
Found a SL insensitive property : ShieldPPPs-PT-100B-LTLCardinality-10
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 3 out of 6108 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 6108/6108 places, 5608/5608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6107 transition count 4906
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5406 transition count 4905
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5405 transition count 4905
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1404 place count 5405 transition count 4405
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2404 place count 4905 transition count 4405
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2410 place count 4899 transition count 4399
Iterating global reduction 3 with 6 rules applied. Total rules applied 2416 place count 4899 transition count 4399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2416 place count 4899 transition count 4398
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2418 place count 4898 transition count 4398
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 7 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 3 with 3588 rules applied. Total rules applied 6006 place count 3104 transition count 2604
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6008 place count 3102 transition count 2602
Applied a total of 6008 rules in 1578 ms. Remains 3102 /6108 variables (removed 3006) and now considering 2602/5608 (removed 3006) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:31:42] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:31:44] [INFO ] Implicit Places using invariants in 1778 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:31:44] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 02:31:48] [INFO ] Implicit Places using invariants and state equation in 4406 ms returned []
Implicit Place search using SMT with State Equation took 6193 ms to find 0 implicit places.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:31:48] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 02:31:50] [INFO ] Dead Transitions using invariants and state equation in 1839 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3102/6108 places, 2602/5608 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/6108 places, 2602/5608 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s1220 1), p1:(AND (NEQ s450 0) (NEQ s2592 1)), p2:(AND (NEQ s450 0) (NEQ s2592 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24 reset in 1720 ms.
Product exploration explored 100000 steps with 25 reset in 2058 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95249 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95249 steps, saw 85907 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:31:58] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 02:31:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 215 ms returned sat
[2022-05-20 02:32:00] [INFO ] After 1336ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:32:00] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2022-05-20 02:32:00] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2022-05-20 02:32:00] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2022-05-20 02:32:00] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2022-05-20 02:32:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 897 ms
[2022-05-20 02:32:01] [INFO ] After 2302ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:32:01] [INFO ] After 2880ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:32:01] [INFO ] [Nat]Absence check using 1101 positive place invariants in 214 ms returned sat
[2022-05-20 02:32:03] [INFO ] After 1424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:32:03] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2022-05-20 02:32:03] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2022-05-20 02:32:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 366 ms
[2022-05-20 02:32:03] [INFO ] After 1858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-20 02:32:03] [INFO ] After 2543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 600 place count 3101 transition count 2601
Applied a total of 600 rules in 340 ms. Remains 3101 /3102 variables (removed 1) and now considering 2601/2602 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3102 places, 2601/2602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Finished probabilistic random walk after 85608 steps, run visited all 1 properties in 1701 ms. (steps per millisecond=50 )
Probabilistic random walk after 85608 steps, saw 84520 distinct states, run finished after 1705 ms. (steps per millisecond=50 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:32:06] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 02:32:11] [INFO ] [Real]Absence check using 1101 positive place invariants in 1540 ms returned sat
[2022-05-20 02:32:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:32:21] [INFO ] [Real]Absence check using state equation in 9939 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 3102 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 132 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:32:21] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:32:23] [INFO ] Implicit Places using invariants in 1899 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:32:23] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:32:27] [INFO ] Implicit Places using invariants and state equation in 4135 ms returned []
Implicit Place search using SMT with State Equation took 6035 ms to find 0 implicit places.
[2022-05-20 02:32:27] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:32:27] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 02:32:29] [INFO ] Dead Transitions using invariants and state equation in 1810 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 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 168 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 91984 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91984 steps, saw 82945 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:32:32] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:32:33] [INFO ] [Real]Absence check using 1101 positive place invariants in 205 ms returned sat
[2022-05-20 02:32:34] [INFO ] After 1347ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:32:34] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 0 ms to minimize.
[2022-05-20 02:32:35] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2022-05-20 02:32:35] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 0 ms to minimize.
[2022-05-20 02:32:35] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2022-05-20 02:32:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 898 ms
[2022-05-20 02:32:35] [INFO ] After 2313ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:32:35] [INFO ] After 2859ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:32:36] [INFO ] [Nat]Absence check using 1101 positive place invariants in 208 ms returned sat
[2022-05-20 02:32:37] [INFO ] After 1480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:32:37] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2022-05-20 02:32:37] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2022-05-20 02:32:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms
[2022-05-20 02:32:38] [INFO ] After 1947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-05-20 02:32:38] [INFO ] After 2604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 600 place count 3101 transition count 2601
Applied a total of 600 rules in 349 ms. Remains 3101 /3102 variables (removed 1) and now considering 2601/2602 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3102 places, 2601/2602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Finished probabilistic random walk after 85608 steps, run visited all 1 properties in 1703 ms. (steps per millisecond=50 )
Probabilistic random walk after 85608 steps, saw 84520 distinct states, run finished after 1707 ms. (steps per millisecond=50 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:32:40] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 02:32:45] [INFO ] [Real]Absence check using 1101 positive place invariants in 1524 ms returned sat
[2022-05-20 02:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:32:55] [INFO ] [Real]Absence check using state equation in 10060 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25 reset in 1648 ms.
Product exploration explored 100000 steps with 25 reset in 2006 ms.
Built C files in :
/tmp/ltsmin2669228956466282709
[2022-05-20 02:32:59] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:32:59] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2669228956466282709
Running compilation step : cd /tmp/ltsmin2669228956466282709;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2669228956466282709;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2669228956466282709;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Applied a total of 2 rules in 249 ms. Remains 3101 /3102 variables (removed 1) and now considering 2601/2602 (removed 1) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:33:02] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:33:04] [INFO ] Implicit Places using invariants in 1926 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:33:04] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:33:08] [INFO ] Implicit Places using invariants and state equation in 3954 ms returned []
Implicit Place search using SMT with State Equation took 5885 ms to find 0 implicit places.
[2022-05-20 02:33:08] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:33:08] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 02:33:10] [INFO ] Dead Transitions using invariants and state equation in 1882 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3102 places, 2601/2602 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3102 places, 2601/2602 transitions.
Built C files in :
/tmp/ltsmin16374939759008779069
[2022-05-20 02:33:10] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:33:10] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16374939759008779069
Running compilation step : cd /tmp/ltsmin16374939759008779069;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16374939759008779069;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16374939759008779069;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 02:33:14] [INFO ] Flatten gal took : 78 ms
[2022-05-20 02:33:14] [INFO ] Flatten gal took : 79 ms
[2022-05-20 02:33:14] [INFO ] Time to serialize gal into /tmp/LTL10418801254555093734.gal : 7 ms
[2022-05-20 02:33:14] [INFO ] Time to serialize properties into /tmp/LTL1292978101991289175.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/LTL10418801254555093734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1292978101991289175.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/LTL1041880...267
Read 1 LTL properties
Checking formula 0 : !(((F("(p2737==1)"))||(X(X(G(("((p1070!=0)&&(p5694!=1))")&&(X("((p1070!=0)&&(p5694!=1))"))))))))
Formula 0 simplified : !(F"(p2737==1)" | XXG("((p1070!=0)&&(p5694!=1))" & X"((p1070!=0)&&(p5694!=1))"))
Detected timeout of ITS tools.
[2022-05-20 02:33:29] [INFO ] Flatten gal took : 79 ms
[2022-05-20 02:33:29] [INFO ] Applying decomposition
[2022-05-20 02:33:29] [INFO ] Flatten gal took : 79 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/graph1773131772091049432.txt' '-o' '/tmp/graph1773131772091049432.bin' '-w' '/tmp/graph1773131772091049432.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1773131772091049432.bin' '-l' '-1' '-v' '-w' '/tmp/graph1773131772091049432.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:33:29] [INFO ] Decomposing Gal with order
[2022-05-20 02:33:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:33:29] [INFO ] Removed a total of 602 redundant transitions.
[2022-05-20 02:33:29] [INFO ] Flatten gal took : 119 ms
[2022-05-20 02:33:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1206 labels/synchronizations in 26 ms.
[2022-05-20 02:33:29] [INFO ] Time to serialize gal into /tmp/LTL13095280500632192756.gal : 16 ms
[2022-05-20 02:33:29] [INFO ] Time to serialize properties into /tmp/LTL4915681760913179407.ltl : 43 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/LTL13095280500632192756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4915681760913179407.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/LTL1309528...246
Read 1 LTL properties
Checking formula 0 : !(((F("(i20.i1.i0.u434.p2737==1)"))||(X(X(G(("((i7.i1.i0.u160.p1070!=0)&&(i46.u921.p5694!=1))")&&(X("((i7.i1.i0.u160.p1070!=0)&&(i46.u...178
Formula 0 simplified : !(F"(i20.i1.i0.u434.p2737==1)" | XXG("((i7.i1.i0.u160.p1070!=0)&&(i46.u921.p5694!=1))" & X"((i7.i1.i0.u160.p1070!=0)&&(i46.u921.p569...164
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3608587093395523222
[2022-05-20 02:33:45] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3608587093395523222
Running compilation step : cd /tmp/ltsmin3608587093395523222;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3608587093395523222;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3608587093395523222;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-10 finished in 127121 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F(p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U ((p0 U X(p1))&&X(F((G(X(p2))&&p2))))))'
[2022-05-20 02:33:48] [INFO ] Flatten gal took : 145 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3411862333577463349
[2022-05-20 02:33:48] [INFO ] Too many transitions (5608) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:33:48] [INFO ] Applying decomposition
[2022-05-20 02:33:48] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3411862333577463349
Running compilation step : cd /tmp/ltsmin3411862333577463349;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 02:33:48] [INFO ] Flatten gal took : 186 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/graph13424782298352503852.txt' '-o' '/tmp/graph13424782298352503852.bin' '-w' '/tmp/graph13424782298352503852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13424782298352503852.bin' '-l' '-1' '-v' '-w' '/tmp/graph13424782298352503852.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:33:49] [INFO ] Decomposing Gal with order
[2022-05-20 02:33:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:33:50] [INFO ] Removed a total of 900 redundant transitions.
[2022-05-20 02:33:51] [INFO ] Flatten gal took : 243 ms
[2022-05-20 02:33:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-05-20 02:33:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality15947703771113831005.gal : 32 ms
[2022-05-20 02:33:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality4874120679939291685.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/LTLCardinality15947703771113831005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4874120679939291685.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/LTLCardina...268
Read 6 LTL properties
Checking formula 0 : !((X(G(F(F("((i63.i1.i0.i0.u2284.p6473==0)||(i18.u670.p1884==1))"))))))
Formula 0 simplified : !XGF"((i63.i1.i0.i0.u2284.p6473==0)||(i18.u670.p1884==1))"
Compilation finished in 21172 ms.
Running link step : cd /tmp/ltsmin3411862333577463349;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin3411862333577463349;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>(<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin3411862333577463349;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>(<>((LTLAPp0==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3411862333577463349;'/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' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin3411862333577463349;'/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' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3411862333577463349;'/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'
Detected timeout of ITS tools.
[2022-05-20 02:59:21] [INFO ] Applying decomposition
[2022-05-20 02:59:22] [INFO ] Flatten gal took : 311 ms
[2022-05-20 02:59:22] [INFO ] Decomposing Gal with order
[2022-05-20 02:59:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:59:30] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 02:59:30] [INFO ] Flatten gal took : 597 ms
[2022-05-20 02:59:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 257 ms.
[2022-05-20 02:59:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality440617761800183235.gal : 87 ms
[2022-05-20 02:59:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality9857092979548908389.ltl : 7 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/LTLCardinality440617761800183235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9857092979548908389.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/LTLCardina...266
Read 6 LTL properties
Checking formula 0 : !((X(G(F(F("((i0.i0.i0.i0.i1.i0.i0.i0.i0.u2293.p6473==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....333
Formula 0 simplified : !XGF"((i0.i0.i0.i0.i1.i0.i0.i0.i0.u2293.p6473==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...322
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin3411862333577463349;'/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'
Running LTSmin : cd /tmp/ltsmin3411862333577463349;'/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' '(<>((LTLAPp3==true))||X(X([]((X((LTLAPp5==true))&&(LTLAPp4==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin3411862333577463349;'/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' '(<>((LTLAPp3==true))||X(X([]((X((LTLAPp5==true))&&(LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3411862333577463349;'/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' '<>(((LTLAPp6==true)||X(X(<>((LTLAPp6==true))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="ShieldPPPs-PT-100B"
export BK_EXAMINATION="LTLCardinality"
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 ShieldPPPs-PT-100B, examination is LTLCardinality"
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-165286025300523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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