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-165286025300524.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300524
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653013111001

Running Version 202205111006
[2022-05-20 02:18:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 02:18:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 02:18:32] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2022-05-20 02:18:32] [INFO ] Transformed 6803 places.
[2022-05-20 02:18:32] [INFO ] Transformed 6303 transitions.
[2022-05-20 02:18:32] [INFO ] Found NUPN structural information;
[2022-05-20 02:18:32] [INFO ] Parsed PT model containing 6803 places and 6303 transitions in 644 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-100B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 6803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Discarding 690 places :
Symmetric choice reduction at 0 with 690 rule applications. Total rules 690 place count 6113 transition count 5613
Iterating global reduction 0 with 690 rules applied. Total rules applied 1380 place count 6113 transition count 5613
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1381 place count 6112 transition count 5612
Iterating global reduction 0 with 1 rules applied. Total rules applied 1382 place count 6112 transition count 5612
Applied a total of 1382 rules in 2699 ms. Remains 6112 /6803 variables (removed 691) and now considering 5612/6303 (removed 691) transitions.
// Phase 1: matrix 5612 rows 6112 cols
[2022-05-20 02:18:35] [INFO ] Computed 1101 place invariants in 68 ms
[2022-05-20 02:18:38] [INFO ] Implicit Places using invariants in 2426 ms returned []
// Phase 1: matrix 5612 rows 6112 cols
[2022-05-20 02:18:38] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 02:18:40] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 4523 ms to find 0 implicit places.
// Phase 1: matrix 5612 rows 6112 cols
[2022-05-20 02:18:40] [INFO ] Computed 1101 place invariants in 31 ms
[2022-05-20 02:18:43] [INFO ] Dead Transitions using invariants and state equation in 3682 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6112/6803 places, 5612/6303 transitions.
Finished structural reductions, in 1 iterations. Remains : 6112/6803 places, 5612/6303 transitions.
Support contains 44 out of 6112 places after structural reductions.
[2022-05-20 02:18:44] [INFO ] Flatten gal took : 332 ms
[2022-05-20 02:18:44] [INFO ] Flatten gal took : 204 ms
[2022-05-20 02:18:45] [INFO ] Input system was already deterministic with 5612 transitions.
Support contains 40 out of 6112 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=16 ) properties (out of 31) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 5612 rows 6112 cols
[2022-05-20 02:18:45] [INFO ] Computed 1101 place invariants in 33 ms
[2022-05-20 02:18:48] [INFO ] [Real]Absence check using 1101 positive place invariants in 659 ms returned sat
[2022-05-20 02:18:55] [INFO ] After 9101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-20 02:18:57] [INFO ] [Nat]Absence check using 1101 positive place invariants in 672 ms returned sat
[2022-05-20 02:19:06] [INFO ] After 7222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-20 02:19:08] [INFO ] Deduced a trap composed of 27 places in 2536 ms of which 15 ms to minimize.
[2022-05-20 02:19:11] [INFO ] Deduced a trap composed of 31 places in 2396 ms of which 5 ms to minimize.
[2022-05-20 02:19:13] [INFO ] Deduced a trap composed of 17 places in 2187 ms of which 12 ms to minimize.
[2022-05-20 02:19:16] [INFO ] Deduced a trap composed of 20 places in 2346 ms of which 5 ms to minimize.
[2022-05-20 02:19:18] [INFO ] Deduced a trap composed of 36 places in 2293 ms of which 4 ms to minimize.
[2022-05-20 02:19:21] [INFO ] Deduced a trap composed of 34 places in 2216 ms of which 3 ms to minimize.
[2022-05-20 02:19:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:19:21] [INFO ] After 26010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 3369 ms.
Support contains 21 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 6112 transition count 4914
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 5414 transition count 4914
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1396 place count 5414 transition count 4415
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 2394 place count 4915 transition count 4415
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2396 place count 4913 transition count 4413
Iterating global reduction 2 with 2 rules applied. Total rules applied 2398 place count 4913 transition count 4413
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2398 place count 4913 transition count 4412
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 2400 place count 4912 transition count 4412
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 8 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5984 place count 3120 transition count 2620
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 891 times.
Drop transitions removed 891 transitions
Iterating global reduction 2 with 891 rules applied. Total rules applied 6875 place count 3120 transition count 2620
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6876 place count 3119 transition count 2619
Applied a total of 6876 rules in 2307 ms. Remains 3119 /6112 variables (removed 2993) and now considering 2619/5612 (removed 2993) transitions.
Finished structural reductions, in 1 iterations. Remains : 3119/6112 places, 2619/5612 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2619 rows 3119 cols
[2022-05-20 02:19:28] [INFO ] Computed 1101 place invariants in 110 ms
[2022-05-20 02:19:29] [INFO ] [Real]Absence check using 1037 positive place invariants in 190 ms returned sat
[2022-05-20 02:19:29] [INFO ] [Real]Absence check using 1037 positive and 64 generalized place invariants in 12 ms returned sat
[2022-05-20 02:19:32] [INFO ] After 3285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-20 02:19:33] [INFO ] [Nat]Absence check using 1037 positive place invariants in 186 ms returned sat
[2022-05-20 02:19:33] [INFO ] [Nat]Absence check using 1037 positive and 64 generalized place invariants in 20 ms returned sat
[2022-05-20 02:19:36] [INFO ] After 3110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-20 02:19:37] [INFO ] Deduced a trap composed of 8 places in 566 ms of which 1 ms to minimize.
[2022-05-20 02:19:38] [INFO ] Deduced a trap composed of 6 places in 546 ms of which 1 ms to minimize.
[2022-05-20 02:19:38] [INFO ] Deduced a trap composed of 8 places in 545 ms of which 1 ms to minimize.
[2022-05-20 02:19:39] [INFO ] Deduced a trap composed of 6 places in 518 ms of which 2 ms to minimize.
[2022-05-20 02:19:39] [INFO ] Deduced a trap composed of 4 places in 517 ms of which 1 ms to minimize.
[2022-05-20 02:19:40] [INFO ] Deduced a trap composed of 5 places in 481 ms of which 1 ms to minimize.
[2022-05-20 02:19:41] [INFO ] Deduced a trap composed of 6 places in 450 ms of which 1 ms to minimize.
[2022-05-20 02:19:41] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 1 ms to minimize.
[2022-05-20 02:19:42] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 1 ms to minimize.
[2022-05-20 02:19:42] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 1 ms to minimize.
[2022-05-20 02:19:43] [INFO ] Deduced a trap composed of 6 places in 388 ms of which 1 ms to minimize.
[2022-05-20 02:19:43] [INFO ] Deduced a trap composed of 11 places in 390 ms of which 1 ms to minimize.
[2022-05-20 02:19:44] [INFO ] Deduced a trap composed of 6 places in 374 ms of which 1 ms to minimize.
[2022-05-20 02:19:44] [INFO ] Deduced a trap composed of 6 places in 363 ms of which 1 ms to minimize.
[2022-05-20 02:19:44] [INFO ] Deduced a trap composed of 6 places in 377 ms of which 1 ms to minimize.
[2022-05-20 02:19:45] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 0 ms to minimize.
[2022-05-20 02:19:45] [INFO ] Deduced a trap composed of 5 places in 335 ms of which 1 ms to minimize.
[2022-05-20 02:19:46] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 1 ms to minimize.
[2022-05-20 02:19:46] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 1 ms to minimize.
[2022-05-20 02:19:46] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 0 ms to minimize.
[2022-05-20 02:19:47] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 0 ms to minimize.
[2022-05-20 02:19:47] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
[2022-05-20 02:19:48] [INFO ] Deduced a trap composed of 9 places in 337 ms of which 1 ms to minimize.
[2022-05-20 02:19:48] [INFO ] Deduced a trap composed of 6 places in 338 ms of which 1 ms to minimize.
[2022-05-20 02:19:49] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 1 ms to minimize.
[2022-05-20 02:19:49] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2022-05-20 02:19:49] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:19:50] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 5 ms to minimize.
[2022-05-20 02:19:50] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2022-05-20 02:19:50] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2022-05-20 02:19:51] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2022-05-20 02:19:51] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2022-05-20 02:19:51] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 0 ms to minimize.
[2022-05-20 02:19:51] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2022-05-20 02:19:52] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2022-05-20 02:19:52] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2022-05-20 02:19:52] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2022-05-20 02:19:52] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2022-05-20 02:19:52] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 16204 ms
[2022-05-20 02:19:53] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2022-05-20 02:19:53] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2022-05-20 02:19:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 430 ms
[2022-05-20 02:19:54] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2022-05-20 02:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2022-05-20 02:19:55] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2022-05-20 02:19:55] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2022-05-20 02:19:55] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2022-05-20 02:19:55] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2022-05-20 02:19:55] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2022-05-20 02:19:56] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2022-05-20 02:19:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1439 ms
[2022-05-20 02:19:56] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2022-05-20 02:19:56] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2022-05-20 02:19:57] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 3 ms to minimize.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-20 02:19:59] [INFO ] Deduced a trap composed of 3 places in 2686 ms of which 3 ms to minimize.
[2022-05-20 02:19:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:19:59] [INFO ] After 27703ms 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 0 properties in 2168 ms.
Support contains 19 out of 3119 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3119/3119 places, 2619/2619 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 3117 transition count 2617
Applied a total of 4 rules in 301 ms. Remains 3117 /3119 variables (removed 2) and now considering 2617/2619 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 3117/3119 places, 2617/2619 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 127410 steps, run timeout after 6002 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 127410 steps, saw 119126 distinct states, run finished after 6003 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2617 rows 3117 cols
[2022-05-20 02:20:10] [INFO ] Computed 1101 place invariants in 62 ms
[2022-05-20 02:20:11] [INFO ] [Real]Absence check using 1039 positive place invariants in 193 ms returned sat
[2022-05-20 02:20:11] [INFO ] [Real]Absence check using 1039 positive and 62 generalized place invariants in 20 ms returned sat
[2022-05-20 02:20:13] [INFO ] After 3481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-20 02:20:14] [INFO ] [Nat]Absence check using 1039 positive place invariants in 195 ms returned sat
[2022-05-20 02:20:14] [INFO ] [Nat]Absence check using 1039 positive and 62 generalized place invariants in 13 ms returned sat
[2022-05-20 02:20:18] [INFO ] After 2673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-20 02:20:18] [INFO ] Deduced a trap composed of 5 places in 428 ms of which 1 ms to minimize.
[2022-05-20 02:20:19] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 1 ms to minimize.
[2022-05-20 02:20:19] [INFO ] Deduced a trap composed of 6 places in 408 ms of which 1 ms to minimize.
[2022-05-20 02:20:20] [INFO ] Deduced a trap composed of 5 places in 419 ms of which 1 ms to minimize.
[2022-05-20 02:20:20] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 2 ms to minimize.
[2022-05-20 02:20:21] [INFO ] Deduced a trap composed of 5 places in 419 ms of which 1 ms to minimize.
[2022-05-20 02:20:21] [INFO ] Deduced a trap composed of 6 places in 393 ms of which 1 ms to minimize.
[2022-05-20 02:20:22] [INFO ] Deduced a trap composed of 6 places in 410 ms of which 2 ms to minimize.
[2022-05-20 02:20:22] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 4 ms to minimize.
[2022-05-20 02:20:23] [INFO ] Deduced a trap composed of 6 places in 353 ms of which 1 ms to minimize.
[2022-05-20 02:20:23] [INFO ] Deduced a trap composed of 6 places in 360 ms of which 2 ms to minimize.
[2022-05-20 02:20:24] [INFO ] Deduced a trap composed of 8 places in 352 ms of which 2 ms to minimize.
[2022-05-20 02:20:24] [INFO ] Deduced a trap composed of 5 places in 358 ms of which 1 ms to minimize.
[2022-05-20 02:20:24] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 1 ms to minimize.
[2022-05-20 02:20:25] [INFO ] Deduced a trap composed of 5 places in 332 ms of which 1 ms to minimize.
[2022-05-20 02:20:25] [INFO ] Deduced a trap composed of 8 places in 320 ms of which 1 ms to minimize.
[2022-05-20 02:20:26] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2022-05-20 02:20:26] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 1 ms to minimize.
[2022-05-20 02:20:26] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2022-05-20 02:20:27] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2022-05-20 02:20:27] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2022-05-20 02:20:28] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 1 ms to minimize.
[2022-05-20 02:20:28] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 0 ms to minimize.
[2022-05-20 02:20:28] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 0 ms to minimize.
[2022-05-20 02:20:29] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2022-05-20 02:20:29] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 0 ms to minimize.
[2022-05-20 02:20:29] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 0 ms to minimize.
[2022-05-20 02:20:29] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2022-05-20 02:20:30] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2022-05-20 02:20:30] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2022-05-20 02:20:30] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 0 ms to minimize.
[2022-05-20 02:20:31] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2022-05-20 02:20:31] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 0 ms to minimize.
[2022-05-20 02:20:31] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2022-05-20 02:20:31] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2022-05-20 02:20:32] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2022-05-20 02:20:32] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 0 ms to minimize.
[2022-05-20 02:20:32] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2022-05-20 02:20:33] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2022-05-20 02:20:33] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 0 ms to minimize.
[2022-05-20 02:20:33] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2022-05-20 02:20:33] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2022-05-20 02:20:34] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2022-05-20 02:20:34] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2022-05-20 02:20:34] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2022-05-20 02:20:34] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2022-05-20 02:20:35] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 0 ms to minimize.
[2022-05-20 02:20:35] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 1 ms to minimize.
[2022-05-20 02:20:35] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 1 ms to minimize.
[2022-05-20 02:20:35] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2022-05-20 02:20:36] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 17879 ms
[2022-05-20 02:20:36] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2022-05-20 02:20:36] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2022-05-20 02:20:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 627 ms
[2022-05-20 02:20:37] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 0 ms to minimize.
[2022-05-20 02:20:37] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 0 ms to minimize.
[2022-05-20 02:20:37] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 1 ms to minimize.
[2022-05-20 02:20:38] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 1 ms to minimize.
[2022-05-20 02:20:38] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2022-05-20 02:20:38] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 1 ms to minimize.
[2022-05-20 02:20:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:20:38] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Parikh walk visited 0 properties in 1354 ms.
Support contains 19 out of 3117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3117/3117 places, 2617/2617 transitions.
Applied a total of 0 rules in 140 ms. Remains 3117 /3117 variables (removed 0) and now considering 2617/2617 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3117/3117 places, 2617/2617 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3117/3117 places, 2617/2617 transitions.
Applied a total of 0 rules in 144 ms. Remains 3117 /3117 variables (removed 0) and now considering 2617/2617 (removed 0) transitions.
// Phase 1: matrix 2617 rows 3117 cols
[2022-05-20 02:20:40] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:20:42] [INFO ] Implicit Places using invariants in 2220 ms returned []
// Phase 1: matrix 2617 rows 3117 cols
[2022-05-20 02:20:42] [INFO ] Computed 1101 place invariants in 53 ms
[2022-05-20 02:20:47] [INFO ] Implicit Places using invariants and state equation in 5197 ms returned []
Implicit Place search using SMT with State Equation took 7419 ms to find 0 implicit places.
[2022-05-20 02:20:48] [INFO ] Redundant transitions in 180 ms returned []
// Phase 1: matrix 2617 rows 3117 cols
[2022-05-20 02:20:48] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:20:49] [INFO ] Dead Transitions using invariants and state equation in 1778 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3117/3117 places, 2617/2617 transitions.
Computed a total of 1204 stabilizing places and 1204 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G((p1 U (p1 U (X(p0)||p2))))))'
Support contains 4 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6102 transition count 5602
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6102 transition count 5602
Applied a total of 20 rules in 1152 ms. Remains 6102 /6112 variables (removed 10) and now considering 5602/5612 (removed 10) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:20:51] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:20:53] [INFO ] Implicit Places using invariants in 2112 ms returned []
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:20:53] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:20:55] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 4271 ms to find 0 implicit places.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:20:55] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 02:20:59] [INFO ] Dead Transitions using invariants and state equation in 3809 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6112 places, 5602/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 6102/6112 places, 5602/5612 transitions.
Stuttering acceptance computed with spot in 406 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s1517 1) (EQ s1561 1)), p2:(EQ s2134 1), p1:(EQ s4130 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 1723 ms.
Product exploration explored 100000 steps with 8 reset in 1995 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/6102 stabilizing places and 1199/5602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1237 ms. Reduced automaton from 7 states, 18 edges and 3 AP to 7 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:21:05] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 02:21:07] [INFO ] [Real]Absence check using 1101 positive place invariants in 687 ms returned sat
[2022-05-20 02:21:12] [INFO ] After 6518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 02:21:13] [INFO ] [Nat]Absence check using 1101 positive place invariants in 648 ms returned sat
[2022-05-20 02:21:18] [INFO ] After 4975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 02:21:21] [INFO ] Deduced a trap composed of 27 places in 2530 ms of which 3 ms to minimize.
[2022-05-20 02:21:24] [INFO ] Deduced a trap composed of 21 places in 2500 ms of which 3 ms to minimize.
[2022-05-20 02:21:27] [INFO ] Deduced a trap composed of 24 places in 2467 ms of which 3 ms to minimize.
[2022-05-20 02:21:29] [INFO ] Deduced a trap composed of 36 places in 2497 ms of which 3 ms to minimize.
[2022-05-20 02:21:32] [INFO ] Deduced a trap composed of 21 places in 2509 ms of which 3 ms to minimize.
[2022-05-20 02:21:35] [INFO ] Deduced a trap composed of 22 places in 2476 ms of which 3 ms to minimize.
[2022-05-20 02:21:37] [INFO ] Deduced a trap composed of 21 places in 2449 ms of which 4 ms to minimize.
[2022-05-20 02:21:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:21:37] [INFO ] After 25356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 589 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6102 transition count 4902
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5402 transition count 4902
Performed 502 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 502 Pre rules applied. Total rules applied 1400 place count 5402 transition count 4400
Deduced a syphon composed of 502 places in 20 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 2 with 1004 rules applied. Total rules applied 2404 place count 4900 transition count 4400
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 6 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5990 place count 3107 transition count 2607
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 2 with 894 rules applied. Total rules applied 6884 place count 3107 transition count 2607
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6885 place count 3106 transition count 2606
Applied a total of 6885 rules in 1194 ms. Remains 3106 /6102 variables (removed 2996) and now considering 2606/5602 (removed 2996) transitions.
Finished structural reductions, in 1 iterations. Remains : 3106/6102 places, 2606/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 83202 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83202 steps, saw 77229 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:21:43] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 02:21:43] [INFO ] [Real]Absence check using 1044 positive place invariants in 192 ms returned sat
[2022-05-20 02:21:43] [INFO ] [Real]Absence check using 1044 positive and 57 generalized place invariants in 12 ms returned sat
[2022-05-20 02:21:45] [INFO ] After 2541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 02:21:46] [INFO ] [Nat]Absence check using 1044 positive place invariants in 190 ms returned sat
[2022-05-20 02:21:46] [INFO ] [Nat]Absence check using 1044 positive and 57 generalized place invariants in 11 ms returned sat
[2022-05-20 02:21:48] [INFO ] After 1713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 02:21:48] [INFO ] Deduced a trap composed of 9 places in 359 ms of which 1 ms to minimize.
[2022-05-20 02:21:49] [INFO ] Deduced a trap composed of 6 places in 354 ms of which 1 ms to minimize.
[2022-05-20 02:21:49] [INFO ] Deduced a trap composed of 5 places in 359 ms of which 1 ms to minimize.
[2022-05-20 02:21:49] [INFO ] Deduced a trap composed of 5 places in 350 ms of which 1 ms to minimize.
[2022-05-20 02:21:50] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 1 ms to minimize.
[2022-05-20 02:21:50] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2022-05-20 02:21:51] [INFO ] Deduced a trap composed of 6 places in 305 ms of which 1 ms to minimize.
[2022-05-20 02:21:51] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 1 ms to minimize.
[2022-05-20 02:21:52] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 1 ms to minimize.
[2022-05-20 02:21:52] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2022-05-20 02:21:52] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2022-05-20 02:21:53] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2022-05-20 02:21:53] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 1 ms to minimize.
[2022-05-20 02:21:53] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 1 ms to minimize.
[2022-05-20 02:21:54] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 0 ms to minimize.
[2022-05-20 02:21:54] [INFO ] Deduced a trap composed of 8 places in 275 ms of which 0 ms to minimize.
[2022-05-20 02:21:55] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 1 ms to minimize.
[2022-05-20 02:21:55] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 1 ms to minimize.
[2022-05-20 02:21:55] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2022-05-20 02:21:56] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2022-05-20 02:21:56] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 0 ms to minimize.
[2022-05-20 02:21:56] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2022-05-20 02:21:57] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2022-05-20 02:21:57] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 0 ms to minimize.
[2022-05-20 02:21:57] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2022-05-20 02:21:58] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2022-05-20 02:21:58] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 0 ms to minimize.
[2022-05-20 02:21:58] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2022-05-20 02:21:59] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 1 ms to minimize.
[2022-05-20 02:21:59] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 1 ms to minimize.
[2022-05-20 02:22:00] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 0 ms to minimize.
[2022-05-20 02:22:00] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2022-05-20 02:22:00] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 0 ms to minimize.
[2022-05-20 02:22:01] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2022-05-20 02:22:01] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 0 ms to minimize.
[2022-05-20 02:22:01] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2022-05-20 02:22:01] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2022-05-20 02:22:02] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 1 ms to minimize.
[2022-05-20 02:22:02] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 0 ms to minimize.
[2022-05-20 02:22:03] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2022-05-20 02:22:03] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2022-05-20 02:22:03] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
[2022-05-20 02:22:04] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 0 ms to minimize.
[2022-05-20 02:22:04] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 0 ms to minimize.
[2022-05-20 02:22:04] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 0 ms to minimize.
[2022-05-20 02:22:04] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 1 ms to minimize.
[2022-05-20 02:22:05] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2022-05-20 02:22:05] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
[2022-05-20 02:22:05] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2022-05-20 02:22:06] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 1 ms to minimize.
[2022-05-20 02:22:06] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2022-05-20 02:22:06] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2022-05-20 02:22:07] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2022-05-20 02:22:07] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 0 ms to minimize.
[2022-05-20 02:22:07] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2022-05-20 02:22:08] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 0 ms to minimize.
[2022-05-20 02:22:08] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2022-05-20 02:22:08] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2022-05-20 02:22:08] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 0 ms to minimize.
[2022-05-20 02:22:09] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2022-05-20 02:22:09] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 1 ms to minimize.
[2022-05-20 02:22:09] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2022-05-20 02:22:10] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2022-05-20 02:22:10] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2022-05-20 02:22:10] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-20 02:22:13] [INFO ] Deduced a trap composed of 3 places in 2440 ms of which 3 ms to minimize.
[2022-05-20 02:22:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:22:13] [INFO ] After 27483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 407 ms.
Support contains 4 out of 3106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3106/3106 places, 2606/2606 transitions.
Applied a total of 0 rules in 133 ms. Remains 3106 /3106 variables (removed 0) and now considering 2606/2606 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3106/3106 places, 2606/2606 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3106/3106 places, 2606/2606 transitions.
Applied a total of 0 rules in 142 ms. Remains 3106 /3106 variables (removed 0) and now considering 2606/2606 (removed 0) transitions.
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:22:13] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:22:16] [INFO ] Implicit Places using invariants in 2163 ms returned []
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:22:16] [INFO ] Computed 1101 place invariants in 45 ms
[2022-05-20 02:22:21] [INFO ] Implicit Places using invariants and state equation in 5858 ms returned []
Implicit Place search using SMT with State Equation took 8021 ms to find 0 implicit places.
[2022-05-20 02:22:22] [INFO ] Redundant transitions in 134 ms returned []
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:22:22] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:22:23] [INFO ] Dead Transitions using invariants and state equation in 1753 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3106/3106 places, 2606/2606 transitions.
Applied a total of 0 rules in 139 ms. Remains 3106 /3106 variables (removed 0) and now considering 2606/2606 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:22:23] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 02:22:24] [INFO ] [Real]Absence check using 1044 positive place invariants in 189 ms returned sat
[2022-05-20 02:22:24] [INFO ] [Real]Absence check using 1044 positive and 57 generalized place invariants in 11 ms returned sat
[2022-05-20 02:22:26] [INFO ] After 2555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 02:22:27] [INFO ] [Nat]Absence check using 1044 positive place invariants in 192 ms returned sat
[2022-05-20 02:22:27] [INFO ] [Nat]Absence check using 1044 positive and 57 generalized place invariants in 11 ms returned sat
[2022-05-20 02:22:28] [INFO ] After 1676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 02:22:29] [INFO ] Deduced a trap composed of 9 places in 357 ms of which 1 ms to minimize.
[2022-05-20 02:22:29] [INFO ] Deduced a trap composed of 6 places in 348 ms of which 1 ms to minimize.
[2022-05-20 02:22:30] [INFO ] Deduced a trap composed of 5 places in 361 ms of which 1 ms to minimize.
[2022-05-20 02:22:30] [INFO ] Deduced a trap composed of 5 places in 346 ms of which 1 ms to minimize.
[2022-05-20 02:22:31] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 1 ms to minimize.
[2022-05-20 02:22:31] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2022-05-20 02:22:32] [INFO ] Deduced a trap composed of 6 places in 321 ms of which 1 ms to minimize.
[2022-05-20 02:22:32] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 1 ms to minimize.
[2022-05-20 02:22:32] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 1 ms to minimize.
[2022-05-20 02:22:33] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2022-05-20 02:22:33] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 0 ms to minimize.
[2022-05-20 02:22:33] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2022-05-20 02:22:34] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 1 ms to minimize.
[2022-05-20 02:22:34] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
[2022-05-20 02:22:35] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2022-05-20 02:22:35] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 1 ms to minimize.
[2022-05-20 02:22:35] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 1 ms to minimize.
[2022-05-20 02:22:36] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 1 ms to minimize.
[2022-05-20 02:22:36] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2022-05-20 02:22:36] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2022-05-20 02:22:37] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2022-05-20 02:22:37] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2022-05-20 02:22:37] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2022-05-20 02:22:38] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 1 ms to minimize.
[2022-05-20 02:22:38] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2022-05-20 02:22:38] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2022-05-20 02:22:39] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2022-05-20 02:22:39] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 0 ms to minimize.
[2022-05-20 02:22:39] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 0 ms to minimize.
[2022-05-20 02:22:40] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 0 ms to minimize.
[2022-05-20 02:22:40] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 1 ms to minimize.
[2022-05-20 02:22:41] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 0 ms to minimize.
[2022-05-20 02:22:41] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 1 ms to minimize.
[2022-05-20 02:22:41] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 0 ms to minimize.
[2022-05-20 02:22:42] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2022-05-20 02:22:42] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2022-05-20 02:22:42] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 1 ms to minimize.
[2022-05-20 02:22:42] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 0 ms to minimize.
[2022-05-20 02:22:43] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 1 ms to minimize.
[2022-05-20 02:22:43] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2022-05-20 02:22:44] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 0 ms to minimize.
[2022-05-20 02:22:44] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2022-05-20 02:22:44] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 1 ms to minimize.
[2022-05-20 02:22:44] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 2 ms to minimize.
[2022-05-20 02:22:45] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 0 ms to minimize.
[2022-05-20 02:22:45] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 1 ms to minimize.
[2022-05-20 02:22:45] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 0 ms to minimize.
[2022-05-20 02:22:46] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 0 ms to minimize.
[2022-05-20 02:22:46] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2022-05-20 02:22:46] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2022-05-20 02:22:47] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2022-05-20 02:22:47] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2022-05-20 02:22:47] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 1 ms to minimize.
[2022-05-20 02:22:48] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 0 ms to minimize.
[2022-05-20 02:22:48] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
[2022-05-20 02:22:48] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 0 ms to minimize.
[2022-05-20 02:22:48] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2022-05-20 02:22:49] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2022-05-20 02:22:49] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2022-05-20 02:22:49] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 2 ms to minimize.
[2022-05-20 02:22:50] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2022-05-20 02:22:50] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 0 ms to minimize.
[2022-05-20 02:22:50] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2022-05-20 02:22:51] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2022-05-20 02:22:51] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 0 ms to minimize.
[2022-05-20 02:22:51] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 0 ms to minimize.
[2022-05-20 02:22:51] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2022-05-20 02:22:52] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 2 ms to minimize.
[2022-05-20 02:22:52] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2022-05-20 02:22:52] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2022-05-20 02:22:52] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2022-05-20 02:22:52] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2022-05-20 02:22:53] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2022-05-20 02:22:53] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
[2022-05-20 02:22:53] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2022-05-20 02:22:53] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2022-05-20 02:22:54] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2022-05-20 02:22:54] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2022-05-20 02:22:54] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2022-05-20 02:22:54] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2022-05-20 02:22:55] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2022-05-20 02:22:55] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2022-05-20 02:22:55] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2022-05-20 02:22:55] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2022-05-20 02:22:55] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2022-05-20 02:22:56] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2022-05-20 02:22:56] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2022-05-20 02:22:56] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2022-05-20 02:22:56] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2022-05-20 02:22:57] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2022-05-20 02:22:57] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2022-05-20 02:22:57] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 0 ms to minimize.
[2022-05-20 02:22:57] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2022-05-20 02:22:57] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2022-05-20 02:22:58] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2022-05-20 02:22:58] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2022-05-20 02:22:58] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2022-05-20 02:22:58] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2022-05-20 02:22:59] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2022-05-20 02:22:59] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2022-05-20 02:22:59] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2022-05-20 02:22:59] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 0 ms to minimize.
[2022-05-20 02:22:59] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2022-05-20 02:23:00] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2022-05-20 02:23:00] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2022-05-20 02:23:00] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2022-05-20 02:23:00] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2022-05-20 02:23:01] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2022-05-20 02:23:01] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2022-05-20 02:23:01] [INFO ] Trap strengthening (SAT) tested/added 110/109 trap constraints in 32365 ms
[2022-05-20 02:23:01] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2022-05-20 02:23:01] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2022-05-20 02:23:02] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2022-05-20 02:23:02] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2022-05-20 02:23:02] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2022-05-20 02:23:02] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2022-05-20 02:23:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1379 ms
[2022-05-20 02:23:03] [INFO ] After 35759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 276 ms.
[2022-05-20 02:23:03] [INFO ] After 36753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 18 factoid took 1033 ms. Reduced automaton from 7 states, 18 edges and 3 AP to 7 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:23:04] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:23:18] [INFO ] [Real]Absence check using 1101 positive place invariants in 7097 ms returned sat
[2022-05-20 02:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:23:19] [INFO ] [Real]Absence check using state equation in 1492 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 567 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:23:20] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:23:22] [INFO ] Implicit Places using invariants in 2100 ms returned []
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:23:22] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:23:24] [INFO ] Implicit Places using invariants and state equation in 2083 ms returned []
Implicit Place search using SMT with State Equation took 4184 ms to find 0 implicit places.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:23:24] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:23:28] [INFO ] Dead Transitions using invariants and state equation in 3791 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6102/6102 places, 5602/5602 transitions.
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/6102 stabilizing places and 1199/5602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 903 ms. Reduced automaton from 7 states, 18 edges and 3 AP to 7 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:23:30] [INFO ] Computed 1101 place invariants in 19 ms
[2022-05-20 02:23:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 639 ms returned sat
[2022-05-20 02:23:36] [INFO ] After 6360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 02:23:37] [INFO ] [Nat]Absence check using 1101 positive place invariants in 698 ms returned sat
[2022-05-20 02:23:43] [INFO ] After 4900ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 02:23:45] [INFO ] Deduced a trap composed of 26 places in 2551 ms of which 3 ms to minimize.
[2022-05-20 02:23:48] [INFO ] Deduced a trap composed of 25 places in 2465 ms of which 3 ms to minimize.
[2022-05-20 02:23:51] [INFO ] Deduced a trap composed of 19 places in 2507 ms of which 4 ms to minimize.
[2022-05-20 02:23:53] [INFO ] Deduced a trap composed of 28 places in 2532 ms of which 4 ms to minimize.
[2022-05-20 02:23:56] [INFO ] Deduced a trap composed of 29 places in 2534 ms of which 3 ms to minimize.
[2022-05-20 02:23:59] [INFO ] Deduced a trap composed of 22 places in 2541 ms of which 3 ms to minimize.
[2022-05-20 02:24:02] [INFO ] Deduced a trap composed of 20 places in 2499 ms of which 4 ms to minimize.
[2022-05-20 02:24:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:24:02] [INFO ] After 25479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 488 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6102 transition count 4902
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5402 transition count 4902
Performed 502 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 502 Pre rules applied. Total rules applied 1400 place count 5402 transition count 4400
Deduced a syphon composed of 502 places in 21 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 2 with 1004 rules applied. Total rules applied 2404 place count 4900 transition count 4400
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 6 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5990 place count 3107 transition count 2607
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 2 with 894 rules applied. Total rules applied 6884 place count 3107 transition count 2607
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6885 place count 3106 transition count 2606
Applied a total of 6885 rules in 1144 ms. Remains 3106 /6102 variables (removed 2996) and now considering 2606/5602 (removed 2996) transitions.
Finished structural reductions, in 1 iterations. Remains : 3106/6102 places, 2606/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 69999 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69999 steps, saw 64647 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:24:07] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 02:24:07] [INFO ] [Real]Absence check using 1044 positive place invariants in 191 ms returned sat
[2022-05-20 02:24:07] [INFO ] [Real]Absence check using 1044 positive and 57 generalized place invariants in 11 ms returned sat
[2022-05-20 02:24:09] [INFO ] After 2518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 02:24:10] [INFO ] [Nat]Absence check using 1044 positive place invariants in 189 ms returned sat
[2022-05-20 02:24:10] [INFO ] [Nat]Absence check using 1044 positive and 57 generalized place invariants in 11 ms returned sat
[2022-05-20 02:24:12] [INFO ] After 1717ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 02:24:12] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2022-05-20 02:24:13] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 1 ms to minimize.
[2022-05-20 02:24:13] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 1 ms to minimize.
[2022-05-20 02:24:14] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 1 ms to minimize.
[2022-05-20 02:24:14] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 1 ms to minimize.
[2022-05-20 02:24:14] [INFO ] Deduced a trap composed of 6 places in 329 ms of which 1 ms to minimize.
[2022-05-20 02:24:15] [INFO ] Deduced a trap composed of 6 places in 326 ms of which 1 ms to minimize.
[2022-05-20 02:24:15] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 1 ms to minimize.
[2022-05-20 02:24:16] [INFO ] Deduced a trap composed of 6 places in 320 ms of which 1 ms to minimize.
[2022-05-20 02:24:16] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 1 ms to minimize.
[2022-05-20 02:24:16] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 1 ms to minimize.
[2022-05-20 02:24:17] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 1 ms to minimize.
[2022-05-20 02:24:17] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 1 ms to minimize.
[2022-05-20 02:24:18] [INFO ] Deduced a trap composed of 6 places in 343 ms of which 1 ms to minimize.
[2022-05-20 02:24:18] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 1 ms to minimize.
[2022-05-20 02:24:19] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 1 ms to minimize.
[2022-05-20 02:24:19] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2022-05-20 02:24:19] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2022-05-20 02:24:20] [INFO ] Deduced a trap composed of 8 places in 335 ms of which 1 ms to minimize.
[2022-05-20 02:24:20] [INFO ] Deduced a trap composed of 6 places in 325 ms of which 1 ms to minimize.
[2022-05-20 02:24:21] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2022-05-20 02:24:21] [INFO ] Deduced a trap composed of 6 places in 343 ms of which 1 ms to minimize.
[2022-05-20 02:24:22] [INFO ] Deduced a trap composed of 5 places in 354 ms of which 1 ms to minimize.
[2022-05-20 02:24:22] [INFO ] Deduced a trap composed of 6 places in 360 ms of which 1 ms to minimize.
[2022-05-20 02:24:23] [INFO ] Deduced a trap composed of 6 places in 360 ms of which 1 ms to minimize.
[2022-05-20 02:24:23] [INFO ] Deduced a trap composed of 5 places in 347 ms of which 1 ms to minimize.
[2022-05-20 02:24:23] [INFO ] Deduced a trap composed of 9 places in 344 ms of which 1 ms to minimize.
[2022-05-20 02:24:24] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 0 ms to minimize.
[2022-05-20 02:24:24] [INFO ] Deduced a trap composed of 8 places in 337 ms of which 1 ms to minimize.
[2022-05-20 02:24:25] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 1 ms to minimize.
[2022-05-20 02:24:25] [INFO ] Deduced a trap composed of 6 places in 352 ms of which 1 ms to minimize.
[2022-05-20 02:24:26] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 1 ms to minimize.
[2022-05-20 02:24:26] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2022-05-20 02:24:26] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 0 ms to minimize.
[2022-05-20 02:24:27] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 1 ms to minimize.
[2022-05-20 02:24:27] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2022-05-20 02:24:27] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2022-05-20 02:24:28] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 1 ms to minimize.
[2022-05-20 02:24:28] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 0 ms to minimize.
[2022-05-20 02:24:29] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 0 ms to minimize.
[2022-05-20 02:24:29] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 1 ms to minimize.
[2022-05-20 02:24:29] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 1 ms to minimize.
[2022-05-20 02:24:30] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 1 ms to minimize.
[2022-05-20 02:24:30] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2022-05-20 02:24:30] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 0 ms to minimize.
[2022-05-20 02:24:31] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2022-05-20 02:24:31] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2022-05-20 02:24:32] [INFO ] Deduced a trap composed of 9 places in 283 ms of which 1 ms to minimize.
[2022-05-20 02:24:32] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 1 ms to minimize.
[2022-05-20 02:24:32] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2022-05-20 02:24:33] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2022-05-20 02:24:33] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2022-05-20 02:24:33] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2022-05-20 02:24:34] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 0 ms to minimize.
[2022-05-20 02:24:34] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 1 ms to minimize.
[2022-05-20 02:24:35] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 3 ms to minimize.
[2022-05-20 02:24:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:24:35] [INFO ] After 25095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 355 ms.
Support contains 4 out of 3106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3106/3106 places, 2606/2606 transitions.
Applied a total of 0 rules in 125 ms. Remains 3106 /3106 variables (removed 0) and now considering 2606/2606 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3106/3106 places, 2606/2606 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3106/3106 places, 2606/2606 transitions.
Applied a total of 0 rules in 122 ms. Remains 3106 /3106 variables (removed 0) and now considering 2606/2606 (removed 0) transitions.
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:24:35] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 02:24:37] [INFO ] Implicit Places using invariants in 2140 ms returned []
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:24:37] [INFO ] Computed 1101 place invariants in 40 ms
[2022-05-20 02:24:43] [INFO ] Implicit Places using invariants and state equation in 5855 ms returned []
Implicit Place search using SMT with State Equation took 7995 ms to find 0 implicit places.
[2022-05-20 02:24:43] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:24:43] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 02:24:45] [INFO ] Dead Transitions using invariants and state equation in 1752 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3106/3106 places, 2606/2606 transitions.
Applied a total of 0 rules in 124 ms. Remains 3106 /3106 variables (removed 0) and now considering 2606/2606 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:24:45] [INFO ] Computed 1101 place invariants in 40 ms
[2022-05-20 02:24:46] [INFO ] [Real]Absence check using 1044 positive place invariants in 176 ms returned sat
[2022-05-20 02:24:46] [INFO ] [Real]Absence check using 1044 positive and 57 generalized place invariants in 11 ms returned sat
[2022-05-20 02:24:48] [INFO ] After 2469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 02:24:48] [INFO ] [Nat]Absence check using 1044 positive place invariants in 190 ms returned sat
[2022-05-20 02:24:48] [INFO ] [Nat]Absence check using 1044 positive and 57 generalized place invariants in 11 ms returned sat
[2022-05-20 02:24:50] [INFO ] After 1720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 02:24:50] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2022-05-20 02:24:51] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2022-05-20 02:24:51] [INFO ] Deduced a trap composed of 9 places in 321 ms of which 1 ms to minimize.
[2022-05-20 02:24:52] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 0 ms to minimize.
[2022-05-20 02:24:52] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 1 ms to minimize.
[2022-05-20 02:24:53] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 1 ms to minimize.
[2022-05-20 02:24:53] [INFO ] Deduced a trap composed of 6 places in 327 ms of which 1 ms to minimize.
[2022-05-20 02:24:53] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2022-05-20 02:24:54] [INFO ] Deduced a trap composed of 6 places in 325 ms of which 1 ms to minimize.
[2022-05-20 02:24:54] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 1 ms to minimize.
[2022-05-20 02:24:55] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 1 ms to minimize.
[2022-05-20 02:24:55] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 1 ms to minimize.
[2022-05-20 02:24:55] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2022-05-20 02:24:56] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 1 ms to minimize.
[2022-05-20 02:24:56] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 1 ms to minimize.
[2022-05-20 02:24:57] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 0 ms to minimize.
[2022-05-20 02:24:57] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 1 ms to minimize.
[2022-05-20 02:24:58] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 1 ms to minimize.
[2022-05-20 02:24:58] [INFO ] Deduced a trap composed of 8 places in 334 ms of which 1 ms to minimize.
[2022-05-20 02:24:58] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 1 ms to minimize.
[2022-05-20 02:24:59] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 1 ms to minimize.
[2022-05-20 02:24:59] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 1 ms to minimize.
[2022-05-20 02:25:00] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 1 ms to minimize.
[2022-05-20 02:25:00] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 1 ms to minimize.
[2022-05-20 02:25:01] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 1 ms to minimize.
[2022-05-20 02:25:01] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
[2022-05-20 02:25:01] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 1 ms to minimize.
[2022-05-20 02:25:02] [INFO ] Deduced a trap composed of 6 places in 327 ms of which 1 ms to minimize.
[2022-05-20 02:25:02] [INFO ] Deduced a trap composed of 8 places in 329 ms of which 1 ms to minimize.
[2022-05-20 02:25:03] [INFO ] Deduced a trap composed of 6 places in 324 ms of which 0 ms to minimize.
[2022-05-20 02:25:03] [INFO ] Deduced a trap composed of 6 places in 354 ms of which 1 ms to minimize.
[2022-05-20 02:25:04] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 1 ms to minimize.
[2022-05-20 02:25:04] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2022-05-20 02:25:04] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 1 ms to minimize.
[2022-05-20 02:25:05] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 0 ms to minimize.
[2022-05-20 02:25:05] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2022-05-20 02:25:05] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2022-05-20 02:25:06] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 0 ms to minimize.
[2022-05-20 02:25:06] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2022-05-20 02:25:07] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2022-05-20 02:25:07] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 0 ms to minimize.
[2022-05-20 02:25:07] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 1 ms to minimize.
[2022-05-20 02:25:08] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 1 ms to minimize.
[2022-05-20 02:25:08] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 0 ms to minimize.
[2022-05-20 02:25:08] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 0 ms to minimize.
[2022-05-20 02:25:09] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2022-05-20 02:25:09] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 1 ms to minimize.
[2022-05-20 02:25:10] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 1 ms to minimize.
[2022-05-20 02:25:10] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 1 ms to minimize.
[2022-05-20 02:25:10] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 1 ms to minimize.
[2022-05-20 02:25:11] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 0 ms to minimize.
[2022-05-20 02:25:11] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 0 ms to minimize.
[2022-05-20 02:25:11] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 0 ms to minimize.
[2022-05-20 02:25:12] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2022-05-20 02:25:12] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
[2022-05-20 02:25:13] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 1 ms to minimize.
[2022-05-20 02:25:13] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2022-05-20 02:25:13] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 0 ms to minimize.
[2022-05-20 02:25:14] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2022-05-20 02:25:14] [INFO ] Deduced a trap composed of 14 places in 266 ms of which 1 ms to minimize.
[2022-05-20 02:25:14] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 1 ms to minimize.
[2022-05-20 02:25:15] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 0 ms to minimize.
[2022-05-20 02:25:15] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 0 ms to minimize.
[2022-05-20 02:25:15] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2022-05-20 02:25:16] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 1 ms to minimize.
[2022-05-20 02:25:16] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2022-05-20 02:25:16] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
[2022-05-20 02:25:17] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 0 ms to minimize.
[2022-05-20 02:25:17] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2022-05-20 02:25:17] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 0 ms to minimize.
[2022-05-20 02:25:18] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 0 ms to minimize.
[2022-05-20 02:25:18] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2022-05-20 02:25:18] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 1 ms to minimize.
[2022-05-20 02:25:19] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2022-05-20 02:25:19] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
[2022-05-20 02:25:19] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 0 ms to minimize.
[2022-05-20 02:25:19] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2022-05-20 02:25:20] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 1 ms to minimize.
[2022-05-20 02:25:20] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2022-05-20 02:25:20] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 1 ms to minimize.
[2022-05-20 02:25:21] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2022-05-20 02:25:21] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 1 ms to minimize.
[2022-05-20 02:25:22] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 0 ms to minimize.
[2022-05-20 02:25:22] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 1 ms to minimize.
[2022-05-20 02:25:22] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2022-05-20 02:25:22] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2022-05-20 02:25:23] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 0 ms to minimize.
[2022-05-20 02:25:23] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2022-05-20 02:25:23] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 0 ms to minimize.
[2022-05-20 02:25:24] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2022-05-20 02:25:24] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2022-05-20 02:25:24] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2022-05-20 02:25:25] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2022-05-20 02:25:25] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2022-05-20 02:25:25] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 0 ms to minimize.
[2022-05-20 02:25:25] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 0 ms to minimize.
[2022-05-20 02:25:26] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2022-05-20 02:25:26] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2022-05-20 02:25:26] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 1 ms to minimize.
[2022-05-20 02:25:27] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2022-05-20 02:25:27] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2022-05-20 02:25:27] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2022-05-20 02:25:27] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2022-05-20 02:25:27] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2022-05-20 02:25:28] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2022-05-20 02:25:28] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2022-05-20 02:25:28] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 0 ms to minimize.
[2022-05-20 02:25:28] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2022-05-20 02:25:29] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2022-05-20 02:25:29] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2022-05-20 02:25:29] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2022-05-20 02:25:29] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2022-05-20 02:25:29] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2022-05-20 02:25:30] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2022-05-20 02:25:30] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2022-05-20 02:25:30] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2022-05-20 02:25:30] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2022-05-20 02:25:30] [INFO ] Trap strengthening (SAT) tested/added 118/117 trap constraints in 40402 ms
[2022-05-20 02:25:31] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2022-05-20 02:25:31] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
[2022-05-20 02:25:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 567 ms
[2022-05-20 02:25:31] [INFO ] After 43003ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 306 ms.
[2022-05-20 02:25:32] [INFO ] After 44008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 18 factoid took 869 ms. Reduced automaton from 7 states, 18 edges and 3 AP to 7 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:25:33] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 02:25:47] [INFO ] [Real]Absence check using 1101 positive place invariants in 7111 ms returned sat
[2022-05-20 02:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:25:48] [INFO ] [Real]Absence check using state equation in 1163 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Product exploration explored 100000 steps with 8 reset in 1589 ms.
Product exploration explored 100000 steps with 8 reset in 1901 ms.
Applying partial POR strategy [false, true, false, false, false, false, true]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Performed 699 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 6102 transition count 5602
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 203 Pre rules applied. Total rules applied 699 place count 6102 transition count 5603
Deduced a syphon composed of 902 places in 24 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 902 place count 6102 transition count 5603
Performed 2093 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2995 places in 16 ms
Iterating global reduction 1 with 2093 rules applied. Total rules applied 2995 place count 6102 transition count 5603
Renaming transitions due to excessive name length > 1024 char.
Discarding 700 places :
Symmetric choice reduction at 1 with 700 rule applications. Total rules 3695 place count 5402 transition count 4903
Deduced a syphon composed of 2295 places in 9 ms
Iterating global reduction 1 with 700 rules applied. Total rules applied 4395 place count 5402 transition count 4903
Deduced a syphon composed of 2295 places in 10 ms
Applied a total of 4395 rules in 4430 ms. Remains 5402 /6102 variables (removed 700) and now considering 4903/5602 (removed 699) transitions.
[2022-05-20 02:25:57] [INFO ] Redundant transitions in 229 ms returned []
// Phase 1: matrix 4903 rows 5402 cols
[2022-05-20 02:25:57] [INFO ] Computed 1101 place invariants in 123 ms
[2022-05-20 02:26:00] [INFO ] Dead Transitions using invariants and state equation in 3253 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5402/6102 places, 4903/5602 transitions.
Finished structural reductions, in 1 iterations. Remains : 5402/6102 places, 4903/5602 transitions.
Entered a terminal (fully accepting) state of product in 81475 steps with 6 reset in 1362 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-00 finished in 311767 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((X(G(p0))||X(G(p1)))))&&F(p2)))'
Support contains 4 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 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 6111 transition count 4909
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5409 transition count 4909
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 5409 transition count 4409
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 4909 transition count 4409
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 2413 place count 4900 transition count 4400
Iterating global reduction 2 with 9 rules applied. Total rules applied 2422 place count 4900 transition count 4400
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2422 place count 4900 transition count 4398
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2426 place count 4898 transition count 4398
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 6 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 6010 place count 3106 transition count 2606
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 6012 place count 3104 transition count 2604
Applied a total of 6012 rules in 1491 ms. Remains 3104 /6112 variables (removed 3008) and now considering 2604/5612 (removed 3008) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:26:03] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:26:05] [INFO ] Implicit Places using invariants in 1646 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:26:05] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:26:09] [INFO ] Implicit Places using invariants and state equation in 3936 ms returned []
Implicit Place search using SMT with State Equation took 5588 ms to find 0 implicit places.
[2022-05-20 02:26:09] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:26:09] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:26:10] [INFO ] Dead Transitions using invariants and state equation in 1690 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3104/6112 places, 2604/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/6112 places, 2604/5612 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s1269 1), p0:(AND (EQ s1269 1) (EQ s1290 1) (EQ s1300 1)), p1:(EQ s1361 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 19 reset in 1704 ms.
Product exploration explored 100000 steps with 19 reset in 2068 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/3104 stabilizing places and 2/2604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 8 factoid took 452 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:26:16] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:26:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 199 ms returned sat
[2022-05-20 02:26:18] [INFO ] After 2013ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 02:26:18] [INFO ] [Nat]Absence check using 1101 positive place invariants in 200 ms returned sat
[2022-05-20 02:26:20] [INFO ] After 1560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 02:26:20] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2022-05-20 02:26:20] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2022-05-20 02:26:20] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2022-05-20 02:26:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 530 ms
[2022-05-20 02:26:21] [INFO ] After 2474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 267 ms.
[2022-05-20 02:26:21] [INFO ] After 3450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 147 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 600 place count 3104 transition count 2604
Applied a total of 600 rules in 236 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 2604/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 87381 steps, run timeout after 3005 ms. (steps per millisecond=29 ) properties seen :{0=1}
Probabilistic random walk after 87381 steps, saw 86267 distinct states, run finished after 3005 ms. (steps per millisecond=29 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:26:25] [INFO ] Computed 1101 place invariants in 40 ms
[2022-05-20 02:26:26] [INFO ] [Real]Absence check using 1100 positive place invariants in 199 ms returned sat
[2022-05-20 02:26:26] [INFO ] [Real]Absence check using 1100 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-20 02:26:27] [INFO ] After 1980ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 02:26:28] [INFO ] [Nat]Absence check using 1100 positive place invariants in 204 ms returned sat
[2022-05-20 02:26:28] [INFO ] [Nat]Absence check using 1100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 02:26:29] [INFO ] After 1510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 02:26:30] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2022-05-20 02:26:30] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2022-05-20 02:26:30] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2022-05-20 02:26:30] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 1 ms to minimize.
[2022-05-20 02:26:30] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2022-05-20 02:26:31] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-05-20 02:26:31] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2022-05-20 02:26:31] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2022-05-20 02:26:31] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-20 02:26:31] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2022-05-20 02:26:31] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2022-05-20 02:26:32] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2022-05-20 02:26:32] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2022-05-20 02:26:32] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2022-05-20 02:26:32] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2022-05-20 02:26:32] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2585 ms
[2022-05-20 02:26:32] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2022-05-20 02:26:32] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-05-20 02:26:32] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2022-05-20 02:26:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 498 ms
[2022-05-20 02:26:33] [INFO ] After 4744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 189 ms.
[2022-05-20 02:26:33] [INFO ] After 5576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 78 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 117 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 2604/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 107457 steps, run timeout after 3002 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107457 steps, saw 106240 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:26:37] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 02:26:37] [INFO ] [Real]Absence check using 1100 positive place invariants in 198 ms returned sat
[2022-05-20 02:26:37] [INFO ] [Real]Absence check using 1100 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-20 02:26:39] [INFO ] After 1949ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 02:26:39] [INFO ] [Nat]Absence check using 1100 positive place invariants in 200 ms returned sat
[2022-05-20 02:26:39] [INFO ] [Nat]Absence check using 1100 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-20 02:26:41] [INFO ] After 1505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 02:26:41] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2022-05-20 02:26:41] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2022-05-20 02:26:41] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2022-05-20 02:26:41] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 1 ms to minimize.
[2022-05-20 02:26:42] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2022-05-20 02:26:42] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-05-20 02:26:42] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-05-20 02:26:42] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2022-05-20 02:26:42] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2022-05-20 02:26:42] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2022-05-20 02:26:43] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2022-05-20 02:26:43] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2022-05-20 02:26:43] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2022-05-20 02:26:43] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2022-05-20 02:26:43] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2022-05-20 02:26:43] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2609 ms
[2022-05-20 02:26:43] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2022-05-20 02:26:44] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-05-20 02:26:44] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2022-05-20 02:26:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 506 ms
[2022-05-20 02:26:44] [INFO ] After 4769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 186 ms.
[2022-05-20 02:26:44] [INFO ] After 5568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 76 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 112 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 114 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:26:44] [INFO ] Computed 1101 place invariants in 40 ms
[2022-05-20 02:26:47] [INFO ] Implicit Places using invariants in 2125 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:26:47] [INFO ] Computed 1101 place invariants in 31 ms
[2022-05-20 02:26:51] [INFO ] Implicit Places using invariants and state equation in 4717 ms returned []
Implicit Place search using SMT with State Equation took 6844 ms to find 0 implicit places.
[2022-05-20 02:26:51] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:26:51] [INFO ] Computed 1101 place invariants in 40 ms
[2022-05-20 02:26:53] [INFO ] Dead Transitions using invariants and state equation in 1802 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 114 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:26:53] [INFO ] Computed 1101 place invariants in 43 ms
[2022-05-20 02:26:54] [INFO ] [Real]Absence check using 1100 positive place invariants in 207 ms returned sat
[2022-05-20 02:26:54] [INFO ] [Real]Absence check using 1100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 02:26:55] [INFO ] After 1990ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 02:26:56] [INFO ] [Nat]Absence check using 1100 positive place invariants in 210 ms returned sat
[2022-05-20 02:26:56] [INFO ] [Nat]Absence check using 1100 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-20 02:26:57] [INFO ] After 1503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 02:26:58] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2022-05-20 02:26:58] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2022-05-20 02:26:58] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2022-05-20 02:26:58] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 1 ms to minimize.
[2022-05-20 02:26:58] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2022-05-20 02:26:59] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2022-05-20 02:26:59] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2022-05-20 02:26:59] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2022-05-20 02:26:59] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2022-05-20 02:26:59] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2022-05-20 02:26:59] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2022-05-20 02:27:00] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2022-05-20 02:27:00] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2022-05-20 02:27:00] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2022-05-20 02:27:00] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2022-05-20 02:27:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2576 ms
[2022-05-20 02:27:00] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2022-05-20 02:27:00] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2022-05-20 02:27:00] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2022-05-20 02:27:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 476 ms
[2022-05-20 02:27:01] [INFO ] After 4716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 186 ms.
[2022-05-20 02:27:01] [INFO ] After 5541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 8 factoid took 510 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:27:02] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:27:07] [INFO ] [Real]Absence check using 1101 positive place invariants in 1575 ms returned sat
[2022-05-20 02:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:27:17] [INFO ] [Real]Absence check using state equation in 9938 ms returned unknown
Could not prove EG (NOT p2)
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 120 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:27:17] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:27:18] [INFO ] Implicit Places using invariants in 1712 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:27:18] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:27:22] [INFO ] Implicit Places using invariants and state equation in 3894 ms returned []
Implicit Place search using SMT with State Equation took 5607 ms to find 0 implicit places.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:27:22] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:27:24] [INFO ] Dead Transitions using invariants and state equation in 1710 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 2604/2604 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/3104 stabilizing places and 2/2604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 424 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:27:25] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:27:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 199 ms returned sat
[2022-05-20 02:27:27] [INFO ] After 1985ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 02:27:28] [INFO ] [Nat]Absence check using 1101 positive place invariants in 205 ms returned sat
[2022-05-20 02:27:29] [INFO ] After 1563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 02:27:30] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2022-05-20 02:27:30] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2022-05-20 02:27:30] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 0 ms to minimize.
[2022-05-20 02:27:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 526 ms
[2022-05-20 02:27:30] [INFO ] After 2468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 271 ms.
[2022-05-20 02:27:31] [INFO ] After 3457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 102 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 600 place count 3104 transition count 2604
Applied a total of 600 rules in 241 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 2604/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 109130 steps, run timeout after 3005 ms. (steps per millisecond=36 ) properties seen :{0=1}
Probabilistic random walk after 109130 steps, saw 107905 distinct states, run finished after 3007 ms. (steps per millisecond=36 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:27:35] [INFO ] Computed 1101 place invariants in 32 ms
[2022-05-20 02:27:35] [INFO ] [Real]Absence check using 1100 positive place invariants in 200 ms returned sat
[2022-05-20 02:27:35] [INFO ] [Real]Absence check using 1100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 02:27:37] [INFO ] After 1959ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 02:27:37] [INFO ] [Nat]Absence check using 1100 positive place invariants in 204 ms returned sat
[2022-05-20 02:27:37] [INFO ] [Nat]Absence check using 1100 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-20 02:27:39] [INFO ] After 1478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 02:27:39] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2022-05-20 02:27:39] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2022-05-20 02:27:39] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2022-05-20 02:27:40] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 0 ms to minimize.
[2022-05-20 02:27:40] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2022-05-20 02:27:40] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-20 02:27:40] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2022-05-20 02:27:40] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 0 ms to minimize.
[2022-05-20 02:27:40] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2022-05-20 02:27:41] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-20 02:27:41] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2022-05-20 02:27:41] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2022-05-20 02:27:41] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2022-05-20 02:27:41] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2022-05-20 02:27:41] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2022-05-20 02:27:41] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2567 ms
[2022-05-20 02:27:42] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2022-05-20 02:27:42] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2022-05-20 02:27:42] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2022-05-20 02:27:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 491 ms
[2022-05-20 02:27:42] [INFO ] After 4680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 183 ms.
[2022-05-20 02:27:42] [INFO ] After 5488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 66 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 116 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 2604/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 124009 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124009 steps, saw 122619 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:27:46] [INFO ] Computed 1101 place invariants in 38 ms
[2022-05-20 02:27:46] [INFO ] [Real]Absence check using 1100 positive place invariants in 201 ms returned sat
[2022-05-20 02:27:46] [INFO ] [Real]Absence check using 1100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 02:27:48] [INFO ] After 1956ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 02:27:48] [INFO ] [Nat]Absence check using 1100 positive place invariants in 200 ms returned sat
[2022-05-20 02:27:48] [INFO ] [Nat]Absence check using 1100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 02:27:50] [INFO ] After 1474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 02:27:50] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2022-05-20 02:27:50] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2022-05-20 02:27:51] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2022-05-20 02:27:51] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 0 ms to minimize.
[2022-05-20 02:27:51] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2022-05-20 02:27:51] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2022-05-20 02:27:51] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2022-05-20 02:27:51] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2022-05-20 02:27:52] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2022-05-20 02:27:52] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-05-20 02:27:52] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2022-05-20 02:27:52] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2022-05-20 02:27:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2022-05-20 02:27:52] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2022-05-20 02:27:52] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2022-05-20 02:27:53] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2609 ms
[2022-05-20 02:27:53] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2022-05-20 02:27:53] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2022-05-20 02:27:53] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2022-05-20 02:27:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 489 ms
[2022-05-20 02:27:53] [INFO ] After 4717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 190 ms.
[2022-05-20 02:27:53] [INFO ] After 5534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 68 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 113 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 115 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:27:54] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:27:56] [INFO ] Implicit Places using invariants in 2147 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:27:56] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:28:00] [INFO ] Implicit Places using invariants and state equation in 4673 ms returned []
Implicit Place search using SMT with State Equation took 6820 ms to find 0 implicit places.
[2022-05-20 02:28:01] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:28:01] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:28:02] [INFO ] Dead Transitions using invariants and state equation in 1734 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 113 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:28:02] [INFO ] Computed 1101 place invariants in 38 ms
[2022-05-20 02:28:03] [INFO ] [Real]Absence check using 1100 positive place invariants in 202 ms returned sat
[2022-05-20 02:28:03] [INFO ] [Real]Absence check using 1100 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-20 02:28:04] [INFO ] After 1918ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 02:28:05] [INFO ] [Nat]Absence check using 1100 positive place invariants in 200 ms returned sat
[2022-05-20 02:28:05] [INFO ] [Nat]Absence check using 1100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 02:28:06] [INFO ] After 1485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 02:28:07] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2022-05-20 02:28:07] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2022-05-20 02:28:07] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2022-05-20 02:28:07] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 0 ms to minimize.
[2022-05-20 02:28:07] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2022-05-20 02:28:08] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2022-05-20 02:28:08] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2022-05-20 02:28:08] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 0 ms to minimize.
[2022-05-20 02:28:08] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2022-05-20 02:28:08] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2022-05-20 02:28:08] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-20 02:28:09] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2022-05-20 02:28:09] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2022-05-20 02:28:09] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2022-05-20 02:28:09] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2022-05-20 02:28:09] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2587 ms
[2022-05-20 02:28:09] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2022-05-20 02:28:09] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2022-05-20 02:28:10] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2022-05-20 02:28:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 485 ms
[2022-05-20 02:28:10] [INFO ] After 4719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 178 ms.
[2022-05-20 02:28:10] [INFO ] After 5533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 8 factoid took 453 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:28:11] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 02:28:15] [INFO ] [Real]Absence check using 1101 positive place invariants in 1497 ms returned sat
[2022-05-20 02:28:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:28:26] [INFO ] [Real]Absence check using state equation in 10238 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 18 reset in 1713 ms.
Product exploration explored 100000 steps with 19 reset in 2122 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 126 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2022-05-20 02:28:30] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:28:30] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 02:28:32] [INFO ] Dead Transitions using invariants and state equation in 1705 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 2604/2604 transitions.
Product exploration explored 100000 steps with 17 reset in 1701 ms.
Product exploration explored 100000 steps with 18 reset in 2100 ms.
Built C files in :
/tmp/ltsmin4920938522984374935
[2022-05-20 02:28:36] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4920938522984374935
Running compilation step : cd /tmp/ltsmin4920938522984374935;'/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/ltsmin4920938522984374935;'/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/ltsmin4920938522984374935;'/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 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 117 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:28:39] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:28:40] [INFO ] Implicit Places using invariants in 1717 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:28:40] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:28:44] [INFO ] Implicit Places using invariants and state equation in 3983 ms returned []
Implicit Place search using SMT with State Equation took 5701 ms to find 0 implicit places.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:28:44] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:28:46] [INFO ] Dead Transitions using invariants and state equation in 1709 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 2604/2604 transitions.
Built C files in :
/tmp/ltsmin5607067506470801400
[2022-05-20 02:28:46] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5607067506470801400
Running compilation step : cd /tmp/ltsmin5607067506470801400;'/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/ltsmin5607067506470801400;'/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/ltsmin5607067506470801400;'/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:49] [INFO ] Flatten gal took : 96 ms
[2022-05-20 02:28:50] [INFO ] Flatten gal took : 98 ms
[2022-05-20 02:28:50] [INFO ] Time to serialize gal into /tmp/LTL16151985447985446582.gal : 20 ms
[2022-05-20 02:28:50] [INFO ] Time to serialize properties into /tmp/LTL9943138937068129409.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/LTL16151985447985446582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9943138937068129409.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/LTL1615198...267
Read 1 LTL properties
Checking formula 0 : !(((F(G((X(G("(((p2840==1)&&(p2880==1))&&(p2900==1))")))||(X(G("(p3030==0)"))))))&&(F("(p2840==1)"))))
Formula 0 simplified : !(FG(XG"(((p2840==1)&&(p2880==1))&&(p2900==1))" | XG"(p3030==0)") & F"(p2840==1)")
Detected timeout of ITS tools.
[2022-05-20 02:29:05] [INFO ] Flatten gal took : 90 ms
[2022-05-20 02:29:05] [INFO ] Applying decomposition
[2022-05-20 02:29:05] [INFO ] Flatten gal took : 93 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/graph2965504053461843913.txt' '-o' '/tmp/graph2965504053461843913.bin' '-w' '/tmp/graph2965504053461843913.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2965504053461843913.bin' '-l' '-1' '-v' '-w' '/tmp/graph2965504053461843913.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:29:05] [INFO ] Decomposing Gal with order
[2022-05-20 02:29:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:29:06] [INFO ] Removed a total of 604 redundant transitions.
[2022-05-20 02:29:06] [INFO ] Flatten gal took : 244 ms
[2022-05-20 02:29:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1196 labels/synchronizations in 43 ms.
[2022-05-20 02:29:06] [INFO ] Time to serialize gal into /tmp/LTL6176299255037738102.gal : 27 ms
[2022-05-20 02:29:06] [INFO ] Time to serialize properties into /tmp/LTL15234010147978401265.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/LTL6176299255037738102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15234010147978401265.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/LTL6176299...246
Read 1 LTL properties
Checking formula 0 : !(((F(G((X(G("(((i22.i1.i3.u451.p2840==1)&&(i23.i0.i2.u459.p2880==1))&&(i23.i0.i4.u462.p2900==1))")))||(X(G("(i24.u484.p3030==0)")))))...192
Formula 0 simplified : !(FG(XG"(((i22.i1.i3.u451.p2840==1)&&(i23.i0.i2.u459.p2880==1))&&(i23.i0.i4.u462.p2900==1))" | XG"(i24.u484.p3030==0)") & F"(i22.i1....174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18206511201775748879
[2022-05-20 02:29:21] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18206511201775748879
Running compilation step : cd /tmp/ltsmin18206511201775748879;'/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/ltsmin18206511201775748879;'/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/ltsmin18206511201775748879;'/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-LTLFireability-02 finished in 202409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0)) U G(p1)) U p2))'
Support contains 3 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6102 transition count 5602
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6102 transition count 5602
Applied a total of 20 rules in 1214 ms. Remains 6102 /6112 variables (removed 10) and now considering 5602/5612 (removed 10) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:29:25] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 02:29:27] [INFO ] Implicit Places using invariants in 2099 ms returned []
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:29:27] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 02:29:29] [INFO ] Implicit Places using invariants and state equation in 2082 ms returned []
Implicit Place search using SMT with State Equation took 4182 ms to find 0 implicit places.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:29:29] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:29:33] [INFO ] Dead Transitions using invariants and state equation in 3764 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6112 places, 5602/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 6102/6112 places, 5602/5612 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s35 1), p1:(EQ s6063 1), p0:(EQ s5208 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-03 finished in 9471 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(G(F((X(p0) U p0))))&&p1))))'
Support contains 2 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6104 transition count 5604
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6104 transition count 5604
Applied a total of 16 rules in 1158 ms. Remains 6104 /6112 variables (removed 8) and now considering 5604/5612 (removed 8) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:29:35] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 02:29:37] [INFO ] Implicit Places using invariants in 2116 ms returned []
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:29:37] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:29:39] [INFO ] Implicit Places using invariants and state equation in 2110 ms returned []
Implicit Place search using SMT with State Equation took 4227 ms to find 0 implicit places.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:29:39] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 02:29:43] [INFO ] Dead Transitions using invariants and state equation in 3762 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6104/6112 places, 5604/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 6104/6112 places, 5604/5612 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1336 1), p1:(EQ s5616 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 12 reset in 1557 ms.
Product exploration explored 100000 steps with 9 reset in 1928 ms.
Computed a total of 1201 stabilizing places and 1201 stable transitions
Computed a total of 1201 stabilizing places and 1201 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:29:47] [INFO ] Computed 1101 place invariants in 26 ms
[2022-05-20 02:29:48] [INFO ] [Real]Absence check using 1101 positive place invariants in 657 ms returned sat
[2022-05-20 02:29:53] [INFO ] After 5994ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:29:54] [INFO ] [Nat]Absence check using 1101 positive place invariants in 628 ms returned sat
[2022-05-20 02:29:59] [INFO ] After 4644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:30:02] [INFO ] Deduced a trap composed of 29 places in 2529 ms of which 3 ms to minimize.
[2022-05-20 02:30:05] [INFO ] Deduced a trap composed of 21 places in 2669 ms of which 4 ms to minimize.
[2022-05-20 02:30:07] [INFO ] Deduced a trap composed of 18 places in 2528 ms of which 3 ms to minimize.
[2022-05-20 02:30:10] [INFO ] Deduced a trap composed of 24 places in 2619 ms of which 3 ms to minimize.
[2022-05-20 02:30:13] [INFO ] Deduced a trap composed of 31 places in 2611 ms of which 4 ms to minimize.
[2022-05-20 02:30:16] [INFO ] Deduced a trap composed of 13 places in 2567 ms of which 3 ms to minimize.
[2022-05-20 02:30:18] [INFO ] Deduced a trap composed of 20 places in 2471 ms of which 3 ms to minimize.
[2022-05-20 02:30:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:30:18] [INFO ] After 25221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 76 ms.
Support contains 1 out of 6104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6104/6104 places, 5604/5604 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 6104 transition count 4902
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5402 transition count 4902
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 5402 transition count 4402
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 4902 transition count 4402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2405 place count 4901 transition count 4401
Iterating global reduction 2 with 1 rules applied. Total rules applied 2406 place count 4901 transition count 4401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2406 place count 4901 transition count 4400
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 2408 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 6 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 6004 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 6901 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 6902 place count 3101 transition count 2601
Applied a total of 6902 rules in 1496 ms. Remains 3101 /6104 variables (removed 3003) and now considering 2601/5604 (removed 3003) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/6104 places, 2601/5604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 109518 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109518 steps, saw 102585 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:30:23] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 02:30:24] [INFO ] [Real]Absence check using 1053 positive place invariants in 192 ms returned sat
[2022-05-20 02:30:24] [INFO ] [Real]Absence check using 1053 positive and 48 generalized place invariants in 17 ms returned sat
[2022-05-20 02:30:25] [INFO ] After 2083ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:30:26] [INFO ] [Nat]Absence check using 1053 positive place invariants in 195 ms returned sat
[2022-05-20 02:30:26] [INFO ] [Nat]Absence check using 1053 positive and 48 generalized place invariants in 10 ms returned sat
[2022-05-20 02:30:28] [INFO ] After 2335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:30:29] [INFO ] Deduced a trap composed of 5 places in 341 ms of which 1 ms to minimize.
[2022-05-20 02:30:29] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 1 ms to minimize.
[2022-05-20 02:30:29] [INFO ] Deduced a trap composed of 6 places in 334 ms of which 1 ms to minimize.
[2022-05-20 02:30:30] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 1 ms to minimize.
[2022-05-20 02:30:30] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 1 ms to minimize.
[2022-05-20 02:30:31] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 1 ms to minimize.
[2022-05-20 02:30:31] [INFO ] Deduced a trap composed of 6 places in 338 ms of which 1 ms to minimize.
[2022-05-20 02:30:32] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 0 ms to minimize.
[2022-05-20 02:30:32] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2022-05-20 02:30:32] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2022-05-20 02:30:33] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2022-05-20 02:30:33] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 1 ms to minimize.
[2022-05-20 02:30:34] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 1 ms to minimize.
[2022-05-20 02:30:34] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 1 ms to minimize.
[2022-05-20 02:30:35] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 0 ms to minimize.
[2022-05-20 02:30:35] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 1 ms to minimize.
[2022-05-20 02:30:35] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 1 ms to minimize.
[2022-05-20 02:30:36] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 1 ms to minimize.
[2022-05-20 02:30:36] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 1 ms to minimize.
[2022-05-20 02:30:37] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 1 ms to minimize.
[2022-05-20 02:30:37] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2022-05-20 02:30:37] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2022-05-20 02:30:38] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 1 ms to minimize.
[2022-05-20 02:30:38] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 1 ms to minimize.
[2022-05-20 02:30:39] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 1 ms to minimize.
[2022-05-20 02:30:39] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2022-05-20 02:30:39] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 0 ms to minimize.
[2022-05-20 02:30:40] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2022-05-20 02:30:40] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2022-05-20 02:30:41] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2022-05-20 02:30:41] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2022-05-20 02:30:41] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 1 ms to minimize.
[2022-05-20 02:30:42] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 1 ms to minimize.
[2022-05-20 02:30:42] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2022-05-20 02:30:43] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 1 ms to minimize.
[2022-05-20 02:30:43] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 0 ms to minimize.
[2022-05-20 02:30:43] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2022-05-20 02:30:44] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 1 ms to minimize.
[2022-05-20 02:30:44] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2022-05-20 02:30:45] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 1 ms to minimize.
[2022-05-20 02:30:45] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2022-05-20 02:30:45] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 1 ms to minimize.
[2022-05-20 02:30:46] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 1 ms to minimize.
[2022-05-20 02:30:46] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 0 ms to minimize.
[2022-05-20 02:30:47] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 1 ms to minimize.
[2022-05-20 02:30:47] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 0 ms to minimize.
[2022-05-20 02:30:47] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2022-05-20 02:30:48] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2022-05-20 02:30:48] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2022-05-20 02:30:48] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 1 ms to minimize.
[2022-05-20 02:30:49] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2022-05-20 02:30:49] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2022-05-20 02:30:50] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2022-05-20 02:30:50] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 1 ms to minimize.
[2022-05-20 02:30:50] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2022-05-20 02:30:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:30:50] [INFO ] After 25133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 140 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 121 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 137 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:30:51] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 02:30:53] [INFO ] Implicit Places using invariants in 2167 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:30:53] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 02:30:58] [INFO ] Implicit Places using invariants and state equation in 5326 ms returned []
Implicit Place search using SMT with State Equation took 7494 ms to find 0 implicit places.
[2022-05-20 02:30:58] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:30:58] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:31:00] [INFO ] Dead Transitions using invariants and state equation in 1740 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 124 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:31:00] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 02:31:01] [INFO ] [Real]Absence check using 1053 positive place invariants in 199 ms returned sat
[2022-05-20 02:31:01] [INFO ] [Real]Absence check using 1053 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-20 02:31:02] [INFO ] After 2103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:31:03] [INFO ] [Nat]Absence check using 1053 positive place invariants in 194 ms returned sat
[2022-05-20 02:31:03] [INFO ] [Nat]Absence check using 1053 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-20 02:31:05] [INFO ] After 2272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:31:06] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 1 ms to minimize.
[2022-05-20 02:31:06] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 1 ms to minimize.
[2022-05-20 02:31:06] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 1 ms to minimize.
[2022-05-20 02:31:07] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 1 ms to minimize.
[2022-05-20 02:31:07] [INFO ] Deduced a trap composed of 6 places in 341 ms of which 1 ms to minimize.
[2022-05-20 02:31:08] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 1 ms to minimize.
[2022-05-20 02:31:08] [INFO ] Deduced a trap composed of 6 places in 327 ms of which 1 ms to minimize.
[2022-05-20 02:31:09] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 1 ms to minimize.
[2022-05-20 02:31:09] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2022-05-20 02:31:10] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 1 ms to minimize.
[2022-05-20 02:31:10] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2022-05-20 02:31:10] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 1 ms to minimize.
[2022-05-20 02:31:11] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 1 ms to minimize.
[2022-05-20 02:31:11] [INFO ] Deduced a trap composed of 6 places in 318 ms of which 1 ms to minimize.
[2022-05-20 02:31:12] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 1 ms to minimize.
[2022-05-20 02:31:12] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 1 ms to minimize.
[2022-05-20 02:31:12] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 0 ms to minimize.
[2022-05-20 02:31:13] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 0 ms to minimize.
[2022-05-20 02:31:13] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 0 ms to minimize.
[2022-05-20 02:31:14] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 1 ms to minimize.
[2022-05-20 02:31:14] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 1 ms to minimize.
[2022-05-20 02:31:14] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2022-05-20 02:31:15] [INFO ] Deduced a trap composed of 12 places in 306 ms of which 1 ms to minimize.
[2022-05-20 02:31:15] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 1 ms to minimize.
[2022-05-20 02:31:16] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2022-05-20 02:31:16] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:31:16] [INFO ] Deduced a trap composed of 6 places in 305 ms of which 1 ms to minimize.
[2022-05-20 02:31:17] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 1 ms to minimize.
[2022-05-20 02:31:17] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2022-05-20 02:31:18] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 0 ms to minimize.
[2022-05-20 02:31:18] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 0 ms to minimize.
[2022-05-20 02:31:18] [INFO ] Deduced a trap composed of 8 places in 297 ms of which 1 ms to minimize.
[2022-05-20 02:31:19] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 1 ms to minimize.
[2022-05-20 02:31:19] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:31:20] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 1 ms to minimize.
[2022-05-20 02:31:20] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 1 ms to minimize.
[2022-05-20 02:31:20] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 1 ms to minimize.
[2022-05-20 02:31:21] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:31:21] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 1 ms to minimize.
[2022-05-20 02:31:22] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 1 ms to minimize.
[2022-05-20 02:31:22] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2022-05-20 02:31:22] [INFO ] Deduced a trap composed of 6 places in 305 ms of which 1 ms to minimize.
[2022-05-20 02:31:23] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 0 ms to minimize.
[2022-05-20 02:31:23] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 0 ms to minimize.
[2022-05-20 02:31:24] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 1 ms to minimize.
[2022-05-20 02:31:24] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 1 ms to minimize.
[2022-05-20 02:31:24] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2022-05-20 02:31:25] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 1 ms to minimize.
[2022-05-20 02:31:25] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 0 ms to minimize.
[2022-05-20 02:31:25] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:31:26] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:31:26] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 1 ms to minimize.
[2022-05-20 02:31:27] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2022-05-20 02:31:27] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 0 ms to minimize.
[2022-05-20 02:31:27] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2022-05-20 02:31:28] [INFO ] Deduced a trap composed of 9 places in 283 ms of which 1 ms to minimize.
[2022-05-20 02:31:28] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 0 ms to minimize.
[2022-05-20 02:31:29] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2022-05-20 02:31:29] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2022-05-20 02:31:29] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 1 ms to minimize.
[2022-05-20 02:31:30] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 0 ms to minimize.
[2022-05-20 02:31:30] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2022-05-20 02:31:30] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2022-05-20 02:31:31] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 1 ms to minimize.
[2022-05-20 02:31:31] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 0 ms to minimize.
[2022-05-20 02:31:32] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 1 ms to minimize.
[2022-05-20 02:31:32] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2022-05-20 02:31:32] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 1 ms to minimize.
[2022-05-20 02:31:33] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:31:33] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2022-05-20 02:31:34] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 0 ms to minimize.
[2022-05-20 02:31:34] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2022-05-20 02:31:34] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 0 ms to minimize.
[2022-05-20 02:31:35] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 1 ms to minimize.
[2022-05-20 02:31:35] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
[2022-05-20 02:31:36] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2022-05-20 02:31:36] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 0 ms to minimize.
[2022-05-20 02:31:36] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 1 ms to minimize.
[2022-05-20 02:31:37] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 0 ms to minimize.
[2022-05-20 02:31:37] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 1 ms to minimize.
[2022-05-20 02:31:37] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 1 ms to minimize.
[2022-05-20 02:31:38] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 0 ms to minimize.
[2022-05-20 02:31:38] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 1 ms to minimize.
[2022-05-20 02:31:38] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2022-05-20 02:31:39] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2022-05-20 02:31:39] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2022-05-20 02:31:39] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2022-05-20 02:31:40] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 1 ms to minimize.
[2022-05-20 02:31:40] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2022-05-20 02:31:40] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2022-05-20 02:31:41] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2022-05-20 02:31:41] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 1 ms to minimize.
[2022-05-20 02:31:42] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2022-05-20 02:31:42] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
[2022-05-20 02:31:42] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 1 ms to minimize.
[2022-05-20 02:31:43] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 0 ms to minimize.
[2022-05-20 02:31:43] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2022-05-20 02:31:43] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2022-05-20 02:31:44] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2022-05-20 02:31:44] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 0 ms to minimize.
[2022-05-20 02:31:44] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2022-05-20 02:31:44] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 1 ms to minimize.
[2022-05-20 02:31:45] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2022-05-20 02:31:45] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 1 ms to minimize.
[2022-05-20 02:31:45] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2022-05-20 02:31:46] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 1 ms to minimize.
[2022-05-20 02:31:46] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2022-05-20 02:31:46] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2022-05-20 02:31:47] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2022-05-20 02:31:47] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2022-05-20 02:31:47] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 1 ms to minimize.
[2022-05-20 02:31:48] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 0 ms to minimize.
[2022-05-20 02:31:48] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:31:48] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2022-05-20 02:31:49] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 0 ms to minimize.
[2022-05-20 02:31:49] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2022-05-20 02:31:49] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2022-05-20 02:31:50] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2022-05-20 02:31:50] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2022-05-20 02:31:50] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2022-05-20 02:31:51] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 0 ms to minimize.
[2022-05-20 02:31:51] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2022-05-20 02:31:51] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
[2022-05-20 02:31:52] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 0 ms to minimize.
[2022-05-20 02:31:52] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 0 ms to minimize.
[2022-05-20 02:31:52] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:31:53] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2022-05-20 02:31:53] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 0 ms to minimize.
[2022-05-20 02:31:53] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2022-05-20 02:31:54] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2022-05-20 02:31:54] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2022-05-20 02:31:54] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 1 ms to minimize.
[2022-05-20 02:31:55] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2022-05-20 02:31:55] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 0 ms to minimize.
[2022-05-20 02:31:55] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 0 ms to minimize.
[2022-05-20 02:31:55] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2022-05-20 02:31:56] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 1 ms to minimize.
[2022-05-20 02:31:56] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 1 ms to minimize.
[2022-05-20 02:31:56] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2022-05-20 02:31:57] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 0 ms to minimize.
[2022-05-20 02:31:57] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2022-05-20 02:31:57] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2022-05-20 02:31:57] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2022-05-20 02:31:58] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2022-05-20 02:31:58] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2022-05-20 02:31:58] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2022-05-20 02:31:58] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2022-05-20 02:31:59] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2022-05-20 02:31:59] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2022-05-20 02:31:59] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2022-05-20 02:31:59] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2022-05-20 02:32:00] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2022-05-20 02:32:00] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2022-05-20 02:32:00] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2022-05-20 02:32:00] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2022-05-20 02:32:01] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2022-05-20 02:32:01] [INFO ] Trap strengthening (SAT) tested/added 157/156 trap constraints in 55463 ms
[2022-05-20 02:32:01] [INFO ] After 57829ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2022-05-20 02:32:01] [INFO ] After 58481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:32:01] [INFO ] Computed 1101 place invariants in 28 ms
[2022-05-20 02:32:15] [INFO ] [Real]Absence check using 1101 positive place invariants in 7028 ms returned sat
[2022-05-20 02:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:32:16] [INFO ] [Real]Absence check using state equation in 1546 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:32:17] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 02:32:30] [INFO ] [Real]Absence check using 1101 positive place invariants in 6816 ms returned sat
[2022-05-20 02:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:32:32] [INFO ] [Real]Absence check using state equation in 2001 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Applied a total of 0 rules in 578 ms. Remains 6104 /6104 variables (removed 0) and now considering 5604/5604 (removed 0) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:32:32] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 02:32:34] [INFO ] Implicit Places using invariants in 2105 ms returned []
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:32:34] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 02:32:36] [INFO ] Implicit Places using invariants and state equation in 2108 ms returned []
Implicit Place search using SMT with State Equation took 4213 ms to find 0 implicit places.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:32:36] [INFO ] Computed 1101 place invariants in 20 ms
[2022-05-20 02:32:40] [INFO ] Dead Transitions using invariants and state equation in 3771 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6104/6104 places, 5604/5604 transitions.
Computed a total of 1201 stabilizing places and 1201 stable transitions
Computed a total of 1201 stabilizing places and 1201 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 242 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:32:41] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 02:32:42] [INFO ] [Real]Absence check using 1101 positive place invariants in 671 ms returned sat
[2022-05-20 02:32:47] [INFO ] After 6005ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:32:48] [INFO ] [Nat]Absence check using 1101 positive place invariants in 663 ms returned sat
[2022-05-20 02:32:53] [INFO ] After 4734ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:32:56] [INFO ] Deduced a trap composed of 29 places in 2459 ms of which 4 ms to minimize.
[2022-05-20 02:32:58] [INFO ] Deduced a trap composed of 21 places in 2591 ms of which 3 ms to minimize.
[2022-05-20 02:33:01] [INFO ] Deduced a trap composed of 18 places in 2615 ms of which 3 ms to minimize.
[2022-05-20 02:33:04] [INFO ] Deduced a trap composed of 24 places in 2627 ms of which 3 ms to minimize.
[2022-05-20 02:33:07] [INFO ] Deduced a trap composed of 31 places in 2640 ms of which 4 ms to minimize.
[2022-05-20 02:33:10] [INFO ] Deduced a trap composed of 13 places in 2581 ms of which 4 ms to minimize.
[2022-05-20 02:33:13] [INFO ] Deduced a trap composed of 20 places in 2628 ms of which 3 ms to minimize.
[2022-05-20 02:33:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:33:13] [INFO ] After 25553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 76 ms.
Support contains 1 out of 6104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6104/6104 places, 5604/5604 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 6104 transition count 4902
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5402 transition count 4902
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 5402 transition count 4402
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 4902 transition count 4402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2405 place count 4901 transition count 4401
Iterating global reduction 2 with 1 rules applied. Total rules applied 2406 place count 4901 transition count 4401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2406 place count 4901 transition count 4400
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 2408 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 6 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 6004 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 6901 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 6902 place count 3101 transition count 2601
Applied a total of 6902 rules in 1456 ms. Remains 3101 /6104 variables (removed 3003) and now considering 2601/5604 (removed 3003) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/6104 places, 2601/5604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 112614 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112614 steps, saw 105455 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:33:17] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 02:33:18] [INFO ] [Real]Absence check using 1053 positive place invariants in 193 ms returned sat
[2022-05-20 02:33:18] [INFO ] [Real]Absence check using 1053 positive and 48 generalized place invariants in 10 ms returned sat
[2022-05-20 02:33:19] [INFO ] After 2069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:33:20] [INFO ] [Nat]Absence check using 1053 positive place invariants in 194 ms returned sat
[2022-05-20 02:33:20] [INFO ] [Nat]Absence check using 1053 positive and 48 generalized place invariants in 10 ms returned sat
[2022-05-20 02:33:22] [INFO ] After 2305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:33:23] [INFO ] Deduced a trap composed of 5 places in 347 ms of which 1 ms to minimize.
[2022-05-20 02:33:23] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 0 ms to minimize.
[2022-05-20 02:33:24] [INFO ] Deduced a trap composed of 6 places in 344 ms of which 1 ms to minimize.
[2022-05-20 02:33:24] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 0 ms to minimize.
[2022-05-20 02:33:24] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 1 ms to minimize.
[2022-05-20 02:33:25] [INFO ] Deduced a trap composed of 5 places in 335 ms of which 1 ms to minimize.
[2022-05-20 02:33:25] [INFO ] Deduced a trap composed of 6 places in 330 ms of which 1 ms to minimize.
[2022-05-20 02:33:26] [INFO ] Deduced a trap composed of 6 places in 329 ms of which 1 ms to minimize.
[2022-05-20 02:33:26] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2022-05-20 02:33:27] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2022-05-20 02:33:27] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2022-05-20 02:33:27] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 1 ms to minimize.
[2022-05-20 02:33:28] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 1 ms to minimize.
[2022-05-20 02:33:28] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 1 ms to minimize.
[2022-05-20 02:33:29] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 1 ms to minimize.
[2022-05-20 02:33:29] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 1 ms to minimize.
[2022-05-20 02:33:29] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2022-05-20 02:33:30] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 0 ms to minimize.
[2022-05-20 02:33:30] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 0 ms to minimize.
[2022-05-20 02:33:31] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 1 ms to minimize.
[2022-05-20 02:33:31] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 0 ms to minimize.
[2022-05-20 02:33:31] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2022-05-20 02:33:32] [INFO ] Deduced a trap composed of 12 places in 300 ms of which 1 ms to minimize.
[2022-05-20 02:33:32] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2022-05-20 02:33:33] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2022-05-20 02:33:33] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 1 ms to minimize.
[2022-05-20 02:33:34] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 1 ms to minimize.
[2022-05-20 02:33:34] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 0 ms to minimize.
[2022-05-20 02:33:34] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 1 ms to minimize.
[2022-05-20 02:33:35] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 0 ms to minimize.
[2022-05-20 02:33:35] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2022-05-20 02:33:35] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:33:36] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:33:36] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 0 ms to minimize.
[2022-05-20 02:33:37] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:33:37] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 0 ms to minimize.
[2022-05-20 02:33:37] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 0 ms to minimize.
[2022-05-20 02:33:38] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2022-05-20 02:33:38] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2022-05-20 02:33:39] [INFO ] Deduced a trap composed of 8 places in 304 ms of which 1 ms to minimize.
[2022-05-20 02:33:39] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2022-05-20 02:33:39] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 1 ms to minimize.
[2022-05-20 02:33:40] [INFO ] Deduced a trap composed of 9 places in 305 ms of which 1 ms to minimize.
[2022-05-20 02:33:40] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2022-05-20 02:33:41] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2022-05-20 02:33:41] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 0 ms to minimize.
[2022-05-20 02:33:41] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2022-05-20 02:33:42] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 1 ms to minimize.
[2022-05-20 02:33:42] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 1 ms to minimize.
[2022-05-20 02:33:43] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 0 ms to minimize.
[2022-05-20 02:33:43] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2022-05-20 02:33:43] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 4 ms to minimize.
[2022-05-20 02:33:44] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2022-05-20 02:33:44] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 1 ms to minimize.
[2022-05-20 02:33:44] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 1 ms to minimize.
[2022-05-20 02:33:44] [INFO ] Trap strengthening (SAT) tested/added 55/55 trap constraints in 22150 ms
[2022-05-20 02:33:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:33:44] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 144 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 121 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:33:45] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 02:33:47] [INFO ] Implicit Places using invariants in 2169 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:33:47] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:33:52] [INFO ] Implicit Places using invariants and state equation in 5185 ms returned []
Implicit Place search using SMT with State Equation took 7354 ms to find 0 implicit places.
[2022-05-20 02:33:52] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:33:52] [INFO ] Computed 1101 place invariants in 38 ms
[2022-05-20 02:33:54] [INFO ] Dead Transitions using invariants and state equation in 1771 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:33:54] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 02:33:55] [INFO ] [Real]Absence check using 1053 positive place invariants in 194 ms returned sat
[2022-05-20 02:33:55] [INFO ] [Real]Absence check using 1053 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-20 02:33:56] [INFO ] After 2088ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:33:57] [INFO ] [Nat]Absence check using 1053 positive place invariants in 193 ms returned sat
[2022-05-20 02:33:57] [INFO ] [Nat]Absence check using 1053 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-20 02:33:59] [INFO ] After 2320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:34:00] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
[2022-05-20 02:34:00] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2022-05-20 02:34:00] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 1 ms to minimize.
[2022-05-20 02:34:01] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2022-05-20 02:34:01] [INFO ] Deduced a trap composed of 6 places in 338 ms of which 0 ms to minimize.
[2022-05-20 02:34:02] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 1 ms to minimize.
[2022-05-20 02:34:02] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 1 ms to minimize.
[2022-05-20 02:34:03] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 1 ms to minimize.
[2022-05-20 02:34:03] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2022-05-20 02:34:04] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 0 ms to minimize.
[2022-05-20 02:34:04] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2022-05-20 02:34:04] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 1 ms to minimize.
[2022-05-20 02:34:05] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 1 ms to minimize.
[2022-05-20 02:34:05] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2022-05-20 02:34:06] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 0 ms to minimize.
[2022-05-20 02:34:06] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 1 ms to minimize.
[2022-05-20 02:34:06] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2022-05-20 02:34:07] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 1 ms to minimize.
[2022-05-20 02:34:07] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2022-05-20 02:34:08] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 0 ms to minimize.
[2022-05-20 02:34:08] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 1 ms to minimize.
[2022-05-20 02:34:08] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2022-05-20 02:34:09] [INFO ] Deduced a trap composed of 12 places in 307 ms of which 1 ms to minimize.
[2022-05-20 02:34:09] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 1 ms to minimize.
[2022-05-20 02:34:10] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 0 ms to minimize.
[2022-05-20 02:34:10] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 1 ms to minimize.
[2022-05-20 02:34:10] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2022-05-20 02:34:11] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2022-05-20 02:34:11] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2022-05-20 02:34:12] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2022-05-20 02:34:12] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 1 ms to minimize.
[2022-05-20 02:34:12] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:34:13] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 1 ms to minimize.
[2022-05-20 02:34:13] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 0 ms to minimize.
[2022-05-20 02:34:14] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2022-05-20 02:34:14] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:34:14] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2022-05-20 02:34:15] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 1 ms to minimize.
[2022-05-20 02:34:15] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2022-05-20 02:34:15] [INFO ] Deduced a trap composed of 8 places in 303 ms of which 1 ms to minimize.
[2022-05-20 02:34:16] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2022-05-20 02:34:16] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2022-05-20 02:34:17] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 1 ms to minimize.
[2022-05-20 02:34:17] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 0 ms to minimize.
[2022-05-20 02:34:17] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 1 ms to minimize.
[2022-05-20 02:34:18] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 0 ms to minimize.
[2022-05-20 02:34:18] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2022-05-20 02:34:19] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2022-05-20 02:34:19] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2022-05-20 02:34:19] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2022-05-20 02:34:20] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 1 ms to minimize.
[2022-05-20 02:34:20] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 1 ms to minimize.
[2022-05-20 02:34:21] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2022-05-20 02:34:21] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 0 ms to minimize.
[2022-05-20 02:34:21] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 0 ms to minimize.
[2022-05-20 02:34:22] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 1 ms to minimize.
[2022-05-20 02:34:22] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 0 ms to minimize.
[2022-05-20 02:34:22] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 1 ms to minimize.
[2022-05-20 02:34:23] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2022-05-20 02:34:23] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2022-05-20 02:34:24] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 1 ms to minimize.
[2022-05-20 02:34:24] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 1 ms to minimize.
[2022-05-20 02:34:24] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 1 ms to minimize.
[2022-05-20 02:34:25] [INFO ] Deduced a trap composed of 8 places in 310 ms of which 0 ms to minimize.
[2022-05-20 02:34:25] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 1 ms to minimize.
[2022-05-20 02:34:26] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 0 ms to minimize.
[2022-05-20 02:34:26] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 0 ms to minimize.
[2022-05-20 02:34:26] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 1 ms to minimize.
[2022-05-20 02:34:27] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 0 ms to minimize.
[2022-05-20 02:34:27] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 1 ms to minimize.
[2022-05-20 02:34:28] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 1 ms to minimize.
[2022-05-20 02:34:28] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 0 ms to minimize.
[2022-05-20 02:34:28] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 1 ms to minimize.
[2022-05-20 02:34:29] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2022-05-20 02:34:29] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
[2022-05-20 02:34:29] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 1 ms to minimize.
[2022-05-20 02:34:30] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2022-05-20 02:34:30] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2022-05-20 02:34:31] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 1 ms to minimize.
[2022-05-20 02:34:31] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2022-05-20 02:34:31] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2022-05-20 02:34:32] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2022-05-20 02:34:32] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2022-05-20 02:34:32] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2022-05-20 02:34:33] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 0 ms to minimize.
[2022-05-20 02:34:33] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 1 ms to minimize.
[2022-05-20 02:34:33] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 1 ms to minimize.
[2022-05-20 02:34:34] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 1 ms to minimize.
[2022-05-20 02:34:34] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2022-05-20 02:34:34] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2022-05-20 02:34:35] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2022-05-20 02:34:35] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 0 ms to minimize.
[2022-05-20 02:34:35] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2022-05-20 02:34:36] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2022-05-20 02:34:36] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2022-05-20 02:34:36] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 1 ms to minimize.
[2022-05-20 02:34:37] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2022-05-20 02:34:37] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2022-05-20 02:34:37] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2022-05-20 02:34:38] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 0 ms to minimize.
[2022-05-20 02:34:38] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2022-05-20 02:34:38] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 1 ms to minimize.
[2022-05-20 02:34:39] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 0 ms to minimize.
[2022-05-20 02:34:39] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 0 ms to minimize.
[2022-05-20 02:34:39] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2022-05-20 02:34:40] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 0 ms to minimize.
[2022-05-20 02:34:40] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2022-05-20 02:34:40] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 0 ms to minimize.
[2022-05-20 02:34:41] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2022-05-20 02:34:41] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 0 ms to minimize.
[2022-05-20 02:34:41] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 0 ms to minimize.
[2022-05-20 02:34:42] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 0 ms to minimize.
[2022-05-20 02:34:42] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:34:42] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 1 ms to minimize.
[2022-05-20 02:34:43] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 0 ms to minimize.
[2022-05-20 02:34:43] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2022-05-20 02:34:43] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 0 ms to minimize.
[2022-05-20 02:34:44] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2022-05-20 02:34:44] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 0 ms to minimize.
[2022-05-20 02:34:44] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 0 ms to minimize.
[2022-05-20 02:34:45] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2022-05-20 02:34:45] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 0 ms to minimize.
[2022-05-20 02:34:45] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
[2022-05-20 02:34:45] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2022-05-20 02:34:46] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:34:46] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 1 ms to minimize.
[2022-05-20 02:34:46] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 0 ms to minimize.
[2022-05-20 02:34:47] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 1 ms to minimize.
[2022-05-20 02:34:47] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2022-05-20 02:34:47] [INFO ] Deduced a trap composed of 8 places in 228 ms of which 1 ms to minimize.
[2022-05-20 02:34:48] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 0 ms to minimize.
[2022-05-20 02:34:48] [INFO ] Deduced a trap composed of 54 places in 246 ms of which 0 ms to minimize.
[2022-05-20 02:34:48] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2022-05-20 02:34:49] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2022-05-20 02:34:49] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2022-05-20 02:34:49] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2022-05-20 02:34:50] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2022-05-20 02:34:50] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 1 ms to minimize.
[2022-05-20 02:34:50] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2022-05-20 02:34:51] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 1 ms to minimize.
[2022-05-20 02:34:51] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2022-05-20 02:34:51] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2022-05-20 02:34:51] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2022-05-20 02:34:51] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2022-05-20 02:34:52] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2022-05-20 02:34:52] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2022-05-20 02:34:52] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2022-05-20 02:34:52] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2022-05-20 02:34:53] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2022-05-20 02:34:53] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2022-05-20 02:34:53] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2022-05-20 02:34:53] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2022-05-20 02:34:54] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2022-05-20 02:34:54] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2022-05-20 02:34:54] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2022-05-20 02:34:54] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2022-05-20 02:34:54] [INFO ] Trap strengthening (SAT) tested/added 157/156 trap constraints in 55275 ms
[2022-05-20 02:34:55] [INFO ] After 57680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2022-05-20 02:34:55] [INFO ] After 58335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 237 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:34:55] [INFO ] Computed 1101 place invariants in 26 ms
[2022-05-20 02:35:09] [INFO ] [Real]Absence check using 1101 positive place invariants in 7273 ms returned sat
[2022-05-20 02:35:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:35:10] [INFO ] [Real]Absence check using state equation in 1362 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:35:10] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:35:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 6854 ms returned sat
[2022-05-20 02:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:35:25] [INFO ] [Real]Absence check using state equation in 2202 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 13 reset in 1518 ms.
Product exploration explored 100000 steps with 9 reset in 1921 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 2 out of 6104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Performed 701 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6104 transition count 5604
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 203 Pre rules applied. Total rules applied 701 place count 6104 transition count 5607
Deduced a syphon composed of 904 places in 28 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 904 place count 6104 transition count 5607
Performed 2097 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3001 places in 11 ms
Iterating global reduction 1 with 2097 rules applied. Total rules applied 3001 place count 6104 transition count 5607
Renaming transitions due to excessive name length > 1024 char.
Discarding 700 places :
Symmetric choice reduction at 1 with 700 rule applications. Total rules 3701 place count 5404 transition count 4907
Deduced a syphon composed of 2301 places in 10 ms
Iterating global reduction 1 with 700 rules applied. Total rules applied 4401 place count 5404 transition count 4907
Deduced a syphon composed of 2301 places in 9 ms
Applied a total of 4401 rules in 3897 ms. Remains 5404 /6104 variables (removed 700) and now considering 4907/5604 (removed 697) transitions.
[2022-05-20 02:35:33] [INFO ] Redundant transitions in 243 ms returned []
// Phase 1: matrix 4907 rows 5404 cols
[2022-05-20 02:35:34] [INFO ] Computed 1101 place invariants in 142 ms
[2022-05-20 02:35:37] [INFO ] Dead Transitions using invariants and state equation in 3351 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5404/6104 places, 4907/5604 transitions.
Finished structural reductions, in 1 iterations. Remains : 5404/6104 places, 4907/5604 transitions.
Product exploration explored 100000 steps with 22 reset in 1759 ms.
Product exploration explored 100000 steps with 29 reset in 2170 ms.
Built C files in :
/tmp/ltsmin13863328027310465015
[2022-05-20 02:35:41] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13863328027310465015
Running compilation step : cd /tmp/ltsmin13863328027310465015;'/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/ltsmin13863328027310465015;'/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/ltsmin13863328027310465015;'/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 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Applied a total of 0 rules in 614 ms. Remains 6104 /6104 variables (removed 0) and now considering 5604/5604 (removed 0) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:35:44] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:35:47] [INFO ] Implicit Places using invariants in 2075 ms returned []
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:35:47] [INFO ] Computed 1101 place invariants in 28 ms
[2022-05-20 02:35:49] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned []
Implicit Place search using SMT with State Equation took 4179 ms to find 0 implicit places.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:35:49] [INFO ] Computed 1101 place invariants in 19 ms
[2022-05-20 02:35:53] [INFO ] Dead Transitions using invariants and state equation in 3873 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6104/6104 places, 5604/5604 transitions.
Built C files in :
/tmp/ltsmin15331348318619674756
[2022-05-20 02:35:53] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15331348318619674756
Running compilation step : cd /tmp/ltsmin15331348318619674756;'/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/ltsmin15331348318619674756;'/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/ltsmin15331348318619674756;'/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:35:56] [INFO ] Flatten gal took : 265 ms
[2022-05-20 02:35:56] [INFO ] Flatten gal took : 163 ms
[2022-05-20 02:35:56] [INFO ] Time to serialize gal into /tmp/LTL5024788192858567801.gal : 40 ms
[2022-05-20 02:35:56] [INFO ] Time to serialize properties into /tmp/LTL7538623595345512436.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/LTL5024788192858567801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7538623595345512436.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/LTL5024788...266
Read 1 LTL properties
Checking formula 0 : !((F(X((X(G(F((X("(p1476==1)"))U("(p1476==1)")))))&&("(p6257==1)")))))
Formula 0 simplified : !FX("(p6257==1)" & XGF(X"(p1476==1)" U "(p1476==1)"))
Detected timeout of ITS tools.
[2022-05-20 02:36:12] [INFO ] Flatten gal took : 167 ms
[2022-05-20 02:36:12] [INFO ] Applying decomposition
[2022-05-20 02:36:12] [INFO ] Flatten gal took : 156 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/graph13430880073586103843.txt' '-o' '/tmp/graph13430880073586103843.bin' '-w' '/tmp/graph13430880073586103843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13430880073586103843.bin' '-l' '-1' '-v' '-w' '/tmp/graph13430880073586103843.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:36:12] [INFO ] Decomposing Gal with order
[2022-05-20 02:36:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:36:14] [INFO ] Removed a total of 900 redundant transitions.
[2022-05-20 02:36:14] [INFO ] Flatten gal took : 271 ms
[2022-05-20 02:36:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2022-05-20 02:36:14] [INFO ] Time to serialize gal into /tmp/LTL6638523730350440226.gal : 35 ms
[2022-05-20 02:36:14] [INFO ] Time to serialize properties into /tmp/LTL2243220936258843165.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/LTL6638523730350440226.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2243220936258843165.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/LTL6638523...245
Read 1 LTL properties
Checking formula 0 : !((F(X((X(G(F((X("(i15.u531.p1476==1)"))U("(i15.u531.p1476==1)")))))&&("(i63.u2209.p6257==1)")))))
Formula 0 simplified : !FX("(i63.u2209.p6257==1)" & XGF(X"(i15.u531.p1476==1)" U "(i15.u531.p1476==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8363973172692317967
[2022-05-20 02:36:29] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8363973172692317967
Running compilation step : cd /tmp/ltsmin8363973172692317967;'/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/ltsmin8363973172692317967;'/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/ltsmin8363973172692317967;'/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-LTLFireability-04 finished in 418761 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&p1)))'
Support contains 2 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6102 transition count 5602
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6102 transition count 5602
Applied a total of 20 rules in 1163 ms. Remains 6102 /6112 variables (removed 10) and now considering 5602/5612 (removed 10) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:36:33] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:36:36] [INFO ] Implicit Places using invariants in 2107 ms returned []
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:36:36] [INFO ] Computed 1101 place invariants in 16 ms
[2022-05-20 02:36:38] [INFO ] Implicit Places using invariants and state equation in 2078 ms returned []
Implicit Place search using SMT with State Equation took 4187 ms to find 0 implicit places.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:36:38] [INFO ] Computed 1101 place invariants in 19 ms
[2022-05-20 02:36:41] [INFO ] Dead Transitions using invariants and state equation in 3830 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6112 places, 5602/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 6102/6112 places, 5602/5612 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s2389 0), p1:(EQ s5673 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4807 ms.
Product exploration explored 100000 steps with 50000 reset in 4684 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/6102 stabilizing places and 1199/5602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X p1), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-100B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100B-LTLFireability-05 finished in 19104 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0)||G(p1)||p2) U G(p1)))'
Support contains 4 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6102 transition count 5602
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6102 transition count 5602
Applied a total of 20 rules in 1154 ms. Remains 6102 /6112 variables (removed 10) and now considering 5602/5612 (removed 10) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:36:53] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:36:55] [INFO ] Implicit Places using invariants in 2127 ms returned []
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:36:55] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:36:57] [INFO ] Implicit Places using invariants and state equation in 2116 ms returned []
Implicit Place search using SMT with State Equation took 4244 ms to find 0 implicit places.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:36:57] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 02:37:01] [INFO ] Dead Transitions using invariants and state equation in 3813 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6112 places, 5602/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 6102/6112 places, 5602/5612 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s73 1), p2:(EQ s1650 1), p0:(AND (EQ s5593 1) (EQ s5610 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33451 reset in 3229 ms.
Product exploration explored 100000 steps with 33424 reset in 3193 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/6102 stabilizing places and 1199/5602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 925 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Finished random walk after 2798 steps, including 0 resets, run visited all 6 properties in 84 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p0), (F (AND p1 p0)), (F p1), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 15 factoid took 881 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Stuttering acceptance computed with spot in 686 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:37:10] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:37:22] [INFO ] [Real]Absence check using 1101 positive place invariants in 4977 ms returned sat
[2022-05-20 02:37:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:37:25] [INFO ] [Real]Absence check using state equation in 3469 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 578 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:37:26] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 02:37:28] [INFO ] Implicit Places using invariants in 1997 ms returned []
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:37:28] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 02:37:30] [INFO ] Implicit Places using invariants and state equation in 2149 ms returned []
Implicit Place search using SMT with State Equation took 4147 ms to find 0 implicit places.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:37:30] [INFO ] Computed 1101 place invariants in 20 ms
[2022-05-20 02:37:34] [INFO ] Dead Transitions using invariants and state equation in 3887 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6102/6102 places, 5602/5602 transitions.
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/6102 stabilizing places and 1199/5602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 666 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:37:35] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 02:37:36] [INFO ] [Real]Absence check using 1101 positive place invariants in 684 ms returned sat
[2022-05-20 02:37:41] [INFO ] After 4910ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:37:45] [INFO ] Deduced a trap composed of 23 places in 3688 ms of which 5 ms to minimize.
[2022-05-20 02:37:49] [INFO ] Deduced a trap composed of 33 places in 3736 ms of which 4 ms to minimize.
[2022-05-20 02:37:53] [INFO ] Deduced a trap composed of 28 places in 3719 ms of which 5 ms to minimize.
[2022-05-20 02:37:57] [INFO ] Deduced a trap composed of 25 places in 3688 ms of which 5 ms to minimize.
[2022-05-20 02:38:01] [INFO ] Deduced a trap composed of 20 places in 3728 ms of which 5 ms to minimize.
[2022-05-20 02:38:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:38:01] [INFO ] After 25827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 42 ms.
Support contains 3 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 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 2 with 3592 rules applied. Total rules applied 5996 place count 3104 transition count 2604
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6892 place count 3104 transition count 2604
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6893 place count 3103 transition count 2603
Applied a total of 6893 rules in 1126 ms. Remains 3103 /6102 variables (removed 2999) and now considering 2603/5602 (removed 2999) transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/6102 places, 2603/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Finished Best-First random walk after 1785 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=111 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p0), (F (AND p1 p0)), (F p1), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 15 factoid took 755 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:38:03] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 02:38:15] [INFO ] [Real]Absence check using 1101 positive place invariants in 5052 ms returned sat
[2022-05-20 02:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:38:19] [INFO ] [Real]Absence check using state equation in 3507 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 3198 ms.
Product exploration explored 100000 steps with 33283 reset in 3195 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Performed 701 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 5602
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 701 place count 6102 transition count 5603
Deduced a syphon composed of 902 places in 24 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 902 place count 6102 transition count 5603
Performed 2096 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2998 places in 10 ms
Iterating global reduction 1 with 2096 rules applied. Total rules applied 2998 place count 6102 transition count 5603
Renaming transitions due to excessive name length > 1024 char.
Discarding 702 places :
Symmetric choice reduction at 1 with 702 rule applications. Total rules 3700 place count 5400 transition count 4901
Deduced a syphon composed of 2296 places in 9 ms
Iterating global reduction 1 with 702 rules applied. Total rules applied 4402 place count 5400 transition count 4901
Deduced a syphon composed of 2296 places in 9 ms
Applied a total of 4402 rules in 2684 ms. Remains 5400 /6102 variables (removed 702) and now considering 4901/5602 (removed 701) transitions.
[2022-05-20 02:38:28] [INFO ] Redundant transitions in 225 ms returned []
// Phase 1: matrix 4901 rows 5400 cols
[2022-05-20 02:38:28] [INFO ] Computed 1101 place invariants in 76 ms
[2022-05-20 02:38:31] [INFO ] Dead Transitions using invariants and state equation in 3223 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5400/6102 places, 4901/5602 transitions.
Finished structural reductions, in 1 iterations. Remains : 5400/6102 places, 4901/5602 transitions.
Product exploration timeout after 71440 steps with 23824 reset in 10001 ms.
Product exploration timeout after 71070 steps with 23617 reset in 10003 ms.
Built C files in :
/tmp/ltsmin2444513608405807035
[2022-05-20 02:38:52] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2444513608405807035
Running compilation step : cd /tmp/ltsmin2444513608405807035;'/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/ltsmin2444513608405807035;'/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/ltsmin2444513608405807035;'/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 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 564 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:38:55] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:38:57] [INFO ] Implicit Places using invariants in 2109 ms returned []
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:38:57] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 02:38:59] [INFO ] Implicit Places using invariants and state equation in 2076 ms returned []
Implicit Place search using SMT with State Equation took 4187 ms to find 0 implicit places.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:38:59] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 02:39:03] [INFO ] Dead Transitions using invariants and state equation in 3769 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6102/6102 places, 5602/5602 transitions.
Built C files in :
/tmp/ltsmin8517616515197722074
[2022-05-20 02:39:03] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8517616515197722074
Running compilation step : cd /tmp/ltsmin8517616515197722074;'/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/ltsmin8517616515197722074;'/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/ltsmin8517616515197722074;'/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:39:06] [INFO ] Flatten gal took : 141 ms
[2022-05-20 02:39:07] [INFO ] Flatten gal took : 145 ms
[2022-05-20 02:39:07] [INFO ] Time to serialize gal into /tmp/LTL1409797281114128760.gal : 27 ms
[2022-05-20 02:39:07] [INFO ] Time to serialize properties into /tmp/LTL18104454193358645446.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/LTL1409797281114128760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18104454193358645446.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/LTL1409797...267
Read 1 LTL properties
Checking formula 0 : !(((((X(!("((p6230==1)&&(p6250==1))")))||(G("(p73==1)")))||("(p1828==1)"))U(G("(p73==1)"))))
Formula 0 simplified : !(("(p1828==1)" | X!"((p6230==1)&&(p6250==1))" | G"(p73==1)") U G"(p73==1)")
Detected timeout of ITS tools.
[2022-05-20 02:39:22] [INFO ] Flatten gal took : 136 ms
[2022-05-20 02:39:22] [INFO ] Applying decomposition
[2022-05-20 02:39:22] [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/graph16161291095390117319.txt' '-o' '/tmp/graph16161291095390117319.bin' '-w' '/tmp/graph16161291095390117319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16161291095390117319.bin' '-l' '-1' '-v' '-w' '/tmp/graph16161291095390117319.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:39:22] [INFO ] Decomposing Gal with order
[2022-05-20 02:39:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:39:24] [INFO ] Removed a total of 900 redundant transitions.
[2022-05-20 02:39:24] [INFO ] Flatten gal took : 251 ms
[2022-05-20 02:39:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2022-05-20 02:39:24] [INFO ] Time to serialize gal into /tmp/LTL7302224346607673429.gal : 37 ms
[2022-05-20 02:39:24] [INFO ] Time to serialize properties into /tmp/LTL6069592890721564307.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/LTL7302224346607673429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6069592890721564307.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/LTL7302224...245
Read 1 LTL properties
Checking formula 0 : !(((((X(!("((i59.u2207.p6230==1)&&(i59.u2214.p6250==1))")))||(G("(i18.u33.p73==1)")))||("(i17.u653.p1828==1)"))U(G("(i18.u33.p73==1)")...158
Formula 0 simplified : !(("(i17.u653.p1828==1)" | X!"((i59.u2207.p6230==1)&&(i59.u2214.p6250==1))" | G"(i18.u33.p73==1)") U G"(i18.u33.p73==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin328523485767010238
[2022-05-20 02:39:40] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin328523485767010238
Running compilation step : cd /tmp/ltsmin328523485767010238;'/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/ltsmin328523485767010238;'/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/ltsmin328523485767010238;'/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-LTLFireability-06 finished in 171196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 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 6111 transition count 4909
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5409 transition count 4909
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 5409 transition count 4409
Deduced a syphon composed of 500 places in 23 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4909 transition count 4409
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2412 place count 4901 transition count 4401
Iterating global reduction 2 with 8 rules applied. Total rules applied 2420 place count 4901 transition count 4401
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2420 place count 4901 transition count 4398
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2426 place count 4898 transition count 4398
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 6 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 6010 place count 3106 transition count 2606
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 6012 place count 3104 transition count 2604
Applied a total of 6012 rules in 1453 ms. Remains 3104 /6112 variables (removed 3008) and now considering 2604/5612 (removed 3008) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:39:44] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 02:39:46] [INFO ] Implicit Places using invariants in 1751 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:39:46] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 02:39:50] [INFO ] Implicit Places using invariants and state equation in 3979 ms returned []
Implicit Place search using SMT with State Equation took 5730 ms to find 0 implicit places.
[2022-05-20 02:39:50] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:39:50] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:39:51] [INFO ] Dead Transitions using invariants and state equation in 1679 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3104/6112 places, 2604/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/6112 places, 2604/5612 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s716 1), p0:(OR (EQ s1357 1) (EQ s1368 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22265 reset in 2519 ms.
Product exploration explored 100000 steps with 22255 reset in 2814 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/3104 stabilizing places and 2/2604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 1644 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 4 factoid took 406 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 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:39:59] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:40:04] [INFO ] [Real]Absence check using 1101 positive place invariants in 1486 ms returned sat
[2022-05-20 02:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:40:14] [INFO ] [Real]Absence check using state equation in 10261 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 3104 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 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 122 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:40:14] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:40:16] [INFO ] Implicit Places using invariants in 1743 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:40:16] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:40:20] [INFO ] Implicit Places using invariants and state equation in 3993 ms returned []
Implicit Place search using SMT with State Equation took 5741 ms to find 0 implicit places.
[2022-05-20 02:40:20] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:40:20] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:40:22] [INFO ] Dead Transitions using invariants and state equation in 1716 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 2604/2604 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/3104 stabilizing places and 2/2604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 162 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 43 ms :[(NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 151 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 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:40:22] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:40:27] [INFO ] [Real]Absence check using 1101 positive place invariants in 1515 ms returned sat
[2022-05-20 02:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:40:37] [INFO ] [Real]Absence check using state equation in 10070 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Product exploration explored 100000 steps with 22017 reset in 2471 ms.
Product exploration explored 100000 steps with 22150 reset in 2779 ms.
Built C files in :
/tmp/ltsmin14134023516583738295
[2022-05-20 02:40:43] [INFO ] Too many transitions (2604) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:40:43] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14134023516583738295
Running compilation step : cd /tmp/ltsmin14134023516583738295;'/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/ltsmin14134023516583738295;'/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/ltsmin14134023516583738295;'/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 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3102 transition count 2602
Applied a total of 4 rules in 260 ms. Remains 3102 /3104 variables (removed 2) and now considering 2602/2604 (removed 2) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:40:46] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:40:48] [INFO ] Implicit Places using invariants in 1742 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:40:48] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:40:51] [INFO ] Implicit Places using invariants and state equation in 3826 ms returned []
Implicit Place search using SMT with State Equation took 5569 ms to find 0 implicit places.
[2022-05-20 02:40:52] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:40:52] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 02:40:53] [INFO ] Dead Transitions using invariants and state equation in 1696 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3102/3104 places, 2602/2604 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3104 places, 2602/2604 transitions.
Built C files in :
/tmp/ltsmin3141897439386852762
[2022-05-20 02:40:53] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:40:53] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3141897439386852762
Running compilation step : cd /tmp/ltsmin3141897439386852762;'/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/ltsmin3141897439386852762;'/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/ltsmin3141897439386852762;'/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:40:56] [INFO ] Flatten gal took : 74 ms
[2022-05-20 02:40:57] [INFO ] Flatten gal took : 75 ms
[2022-05-20 02:40:57] [INFO ] Time to serialize gal into /tmp/LTL685290144139903576.gal : 7 ms
[2022-05-20 02:40:57] [INFO ] Time to serialize properties into /tmp/LTL4944062414514517682.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/LTL685290144139903576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4944062414514517682.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/LTL6852901...265
Read 1 LTL properties
Checking formula 0 : !(((G("((p3021==1)||(p3046==1))"))||(F("(p1649==1)"))))
Formula 0 simplified : !(G"((p3021==1)||(p3046==1))" | F"(p1649==1)")
Detected timeout of ITS tools.
[2022-05-20 02:41:12] [INFO ] Flatten gal took : 75 ms
[2022-05-20 02:41:12] [INFO ] Applying decomposition
[2022-05-20 02:41:12] [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/graph14396078273578863759.txt' '-o' '/tmp/graph14396078273578863759.bin' '-w' '/tmp/graph14396078273578863759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14396078273578863759.bin' '-l' '-1' '-v' '-w' '/tmp/graph14396078273578863759.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:41:12] [INFO ] Decomposing Gal with order
[2022-05-20 02:41:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:41:12] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 02:41:12] [INFO ] Flatten gal took : 120 ms
[2022-05-20 02:41:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 22 ms.
[2022-05-20 02:41:12] [INFO ] Time to serialize gal into /tmp/LTL17038085029628339794.gal : 18 ms
[2022-05-20 02:41:12] [INFO ] Time to serialize properties into /tmp/LTL2354485972582689161.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/LTL17038085029628339794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2354485972582689161.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/LTL1703808...246
Read 1 LTL properties
Checking formula 0 : !(((G("((i24.i0.i2.u482.p3021==1)||(i24.i0.i1.u485.p3046==1))"))||(F("(i13.u254.p1649==1)"))))
Formula 0 simplified : !(G"((i24.i0.i2.u482.p3021==1)||(i24.i0.i1.u485.p3046==1))" | F"(i13.u254.p1649==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14289538520681930450
[2022-05-20 02:41:27] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14289538520681930450
Running compilation step : cd /tmp/ltsmin14289538520681930450;'/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/ltsmin14289538520681930450;'/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/ltsmin14289538520681930450;'/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-LTLFireability-08 finished in 107920 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||p1)))'
Support contains 3 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 6103 transition count 5603
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 6103 transition count 5603
Applied a total of 18 rules in 1191 ms. Remains 6103 /6112 variables (removed 9) and now considering 5603/5612 (removed 9) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:41:32] [INFO ] Computed 1101 place invariants in 20 ms
[2022-05-20 02:41:34] [INFO ] Implicit Places using invariants in 2085 ms returned []
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:41:34] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 02:41:36] [INFO ] Implicit Places using invariants and state equation in 2086 ms returned []
Implicit Place search using SMT with State Equation took 4172 ms to find 0 implicit places.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:41:36] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:41:40] [INFO ] Dead Transitions using invariants and state equation in 3783 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6112 places, 5603/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 6103/6112 places, 5603/5612 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s2106 1) (EQ s2141 1)), p0:(NEQ s3340 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 6 reset in 1652 ms.
Product exploration explored 100000 steps with 7 reset in 1936 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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 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 218303 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218303 steps, saw 212927 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:41:47] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:41:48] [INFO ] [Real]Absence check using 1101 positive place invariants in 659 ms returned sat
[2022-05-20 02:41:53] [INFO ] After 4743ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:41:56] [INFO ] Deduced a trap composed of 24 places in 2405 ms of which 3 ms to minimize.
[2022-05-20 02:41:58] [INFO ] Deduced a trap composed of 34 places in 2410 ms of which 3 ms to minimize.
[2022-05-20 02:42:01] [INFO ] Deduced a trap composed of 17 places in 2421 ms of which 4 ms to minimize.
[2022-05-20 02:42:03] [INFO ] Deduced a trap composed of 29 places in 2413 ms of which 4 ms to minimize.
[2022-05-20 02:42:06] [INFO ] Deduced a trap composed of 23 places in 2387 ms of which 3 ms to minimize.
[2022-05-20 02:42:09] [INFO ] Deduced a trap composed of 18 places in 2363 ms of which 4 ms to minimize.
[2022-05-20 02:42:11] [INFO ] Deduced a trap composed of 18 places in 2317 ms of which 3 ms to minimize.
[2022-05-20 02:42:14] [INFO ] Deduced a trap composed of 22 places in 2328 ms of which 3 ms to minimize.
[2022-05-20 02:42:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:42:14] [INFO ] After 26702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 6103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6103/6103 places, 5603/5603 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 6103 transition count 4901
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5401 transition count 4901
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 5401 transition count 4401
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 4901 transition count 4401
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: 1799
Deduced a syphon composed of 1799 places in 6 ms
Reduce places removed 1799 places and 0 transitions.
Iterating global reduction 2 with 3598 rules applied. Total rules applied 6002 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 6899 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 6900 place count 3101 transition count 2601
Applied a total of 6900 rules in 1131 ms. Remains 3101 /6103 variables (removed 3002) and now considering 2601/5603 (removed 3002) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/6103 places, 2601/5603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 106413 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106413 steps, saw 99694 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:42:18] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 02:42:19] [INFO ] [Real]Absence check using 1052 positive place invariants in 203 ms returned sat
[2022-05-20 02:42:19] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 10 ms returned sat
[2022-05-20 02:42:20] [INFO ] After 2162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:42:21] [INFO ] [Nat]Absence check using 1052 positive place invariants in 192 ms returned sat
[2022-05-20 02:42:21] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 10 ms returned sat
[2022-05-20 02:42:23] [INFO ] After 1641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:42:23] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 0 ms to minimize.
[2022-05-20 02:42:23] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
[2022-05-20 02:42:24] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2022-05-20 02:42:24] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2022-05-20 02:42:24] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2022-05-20 02:42:25] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2022-05-20 02:42:25] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 0 ms to minimize.
[2022-05-20 02:42:25] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 0 ms to minimize.
[2022-05-20 02:42:26] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 0 ms to minimize.
[2022-05-20 02:42:26] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:42:26] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 0 ms to minimize.
[2022-05-20 02:42:26] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2022-05-20 02:42:27] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2022-05-20 02:42:27] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2022-05-20 02:42:27] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2022-05-20 02:42:28] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 1 ms to minimize.
[2022-05-20 02:42:28] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
[2022-05-20 02:42:28] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2022-05-20 02:42:28] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2022-05-20 02:42:29] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2022-05-20 02:42:29] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2022-05-20 02:42:29] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2022-05-20 02:42:30] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2022-05-20 02:42:30] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2022-05-20 02:42:30] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2022-05-20 02:42:30] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2022-05-20 02:42:30] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2022-05-20 02:42:31] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2022-05-20 02:42:31] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2022-05-20 02:42:31] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2022-05-20 02:42:31] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2022-05-20 02:42:32] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2022-05-20 02:42:32] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 0 ms to minimize.
[2022-05-20 02:42:32] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2022-05-20 02:42:32] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-05-20 02:42:32] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2022-05-20 02:42:32] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-20 02:42:33] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2022-05-20 02:42:33] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2022-05-20 02:42:33] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2022-05-20 02:42:33] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2022-05-20 02:42:33] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2022-05-20 02:42:33] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2022-05-20 02:42:34] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2022-05-20 02:42:34] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2022-05-20 02:42:34] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2022-05-20 02:42:34] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2022-05-20 02:42:34] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2022-05-20 02:42:34] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-20 02:42:35] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 11952 ms
[2022-05-20 02:42:35] [INFO ] After 13675ms 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:42:35] [INFO ] After 14319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 102 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 121 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 122 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:42:35] [INFO ] Computed 1101 place invariants in 33 ms
[2022-05-20 02:42:37] [INFO ] Implicit Places using invariants in 2166 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:42:37] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 02:42:42] [INFO ] Implicit Places using invariants and state equation in 4971 ms returned []
Implicit Place search using SMT with State Equation took 7139 ms to find 0 implicit places.
[2022-05-20 02:42:42] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:42:42] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 02:42:44] [INFO ] Dead Transitions using invariants and state equation in 1787 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 126 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:42:44] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 02:42:45] [INFO ] [Real]Absence check using 1052 positive place invariants in 200 ms returned sat
[2022-05-20 02:42:45] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 10 ms returned sat
[2022-05-20 02:42:46] [INFO ] After 2185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:42:47] [INFO ] [Nat]Absence check using 1052 positive place invariants in 192 ms returned sat
[2022-05-20 02:42:47] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 11 ms returned sat
[2022-05-20 02:42:49] [INFO ] After 1632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:42:49] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 0 ms to minimize.
[2022-05-20 02:42:49] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2022-05-20 02:42:50] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 1 ms to minimize.
[2022-05-20 02:42:50] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2022-05-20 02:42:50] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2022-05-20 02:42:51] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2022-05-20 02:42:51] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2022-05-20 02:42:51] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2022-05-20 02:42:52] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 0 ms to minimize.
[2022-05-20 02:42:52] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2022-05-20 02:42:52] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2022-05-20 02:42:52] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2022-05-20 02:42:53] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2022-05-20 02:42:53] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 1 ms to minimize.
[2022-05-20 02:42:53] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
[2022-05-20 02:42:54] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2022-05-20 02:42:54] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2022-05-20 02:42:54] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2022-05-20 02:42:54] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2022-05-20 02:42:55] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 1 ms to minimize.
[2022-05-20 02:42:55] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2022-05-20 02:42:55] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2022-05-20 02:42:56] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2022-05-20 02:42:56] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2022-05-20 02:42:56] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2022-05-20 02:42:56] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2022-05-20 02:42:56] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2022-05-20 02:42:57] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2022-05-20 02:42:57] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2022-05-20 02:42:57] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2022-05-20 02:42:57] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-20 02:42:58] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2022-05-20 02:42:58] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 0 ms to minimize.
[2022-05-20 02:42:58] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 0 ms to minimize.
[2022-05-20 02:42:58] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-05-20 02:42:58] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 0 ms to minimize.
[2022-05-20 02:42:58] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2022-05-20 02:42:59] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-05-20 02:42:59] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 0 ms to minimize.
[2022-05-20 02:42:59] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2022-05-20 02:42:59] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 0 ms to minimize.
[2022-05-20 02:42:59] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2022-05-20 02:42:59] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2022-05-20 02:43:00] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2022-05-20 02:43:00] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-05-20 02:43:00] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2022-05-20 02:43:00] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 0 ms to minimize.
[2022-05-20 02:43:00] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2022-05-20 02:43:00] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-20 02:43:00] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 11889 ms
[2022-05-20 02:43:01] [INFO ] After 13603ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2022-05-20 02:43:01] [INFO ] After 14255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 175 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
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 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4401
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 2402 place count 4901 transition count 4401
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 2 with 3592 rules applied. Total rules applied 5994 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 5996 place count 3103 transition count 2603
Applied a total of 5996 rules in 998 ms. Remains 3103 /6103 variables (removed 3000) and now considering 2603/5603 (removed 3000) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:43:02] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:43:04] [INFO ] Implicit Places using invariants in 1747 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:43:04] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:43:08] [INFO ] Implicit Places using invariants and state equation in 4067 ms returned []
Implicit Place search using SMT with State Equation took 5815 ms to find 0 implicit places.
[2022-05-20 02:43:08] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:43:08] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:43:10] [INFO ] Dead Transitions using invariants and state equation in 1629 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/6103 places, 2603/5603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/6103 places, 2603/5603 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 106 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 53 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3273 steps, including 0 resets, run visited all 1 properties in 54 ms. (steps per millisecond=60 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21 reset in 1628 ms.
Product exploration explored 100000 steps with 22 reset in 2019 ms.
Built C files in :
/tmp/ltsmin9293261664786396009
[2022-05-20 02:43:14] [INFO ] Too many transitions (2603) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:43:14] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9293261664786396009
Running compilation step : cd /tmp/ltsmin9293261664786396009;'/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/ltsmin9293261664786396009;'/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/ltsmin9293261664786396009;'/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 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3103 transition count 2602
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 3102 transition count 2602
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 4 place count 3101 transition count 2601
Applied a total of 4 rules in 271 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:43:17] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:43:19] [INFO ] Implicit Places using invariants in 1719 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:43:19] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:43:23] [INFO ] Implicit Places using invariants and state equation in 3898 ms returned []
Implicit Place search using SMT with State Equation took 5620 ms to find 0 implicit places.
[2022-05-20 02:43:23] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:43:23] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:43:24] [INFO ] Dead Transitions using invariants and state equation in 1702 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Built C files in :
/tmp/ltsmin4587309559700465863
[2022-05-20 02:43:24] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:43:24] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4587309559700465863
Running compilation step : cd /tmp/ltsmin4587309559700465863;'/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/ltsmin4587309559700465863;'/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/ltsmin4587309559700465863;'/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:43:28] [INFO ] Flatten gal took : 75 ms
[2022-05-20 02:43:28] [INFO ] Flatten gal took : 76 ms
[2022-05-20 02:43:28] [INFO ] Time to serialize gal into /tmp/LTL13394879825496422509.gal : 7 ms
[2022-05-20 02:43:28] [INFO ] Time to serialize properties into /tmp/LTL15891644905634262098.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/LTL13394879825496422509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15891644905634262098.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/LTL1339487...268
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(p3716!=1)")))||("((p2337==1)&&(p2378==1))"))))
Formula 0 simplified : !X("((p2337==1)&&(p2378==1))" | GF"(p3716!=1)")
Detected timeout of ITS tools.
[2022-05-20 02:43:43] [INFO ] Flatten gal took : 74 ms
[2022-05-20 02:43:43] [INFO ] Applying decomposition
[2022-05-20 02:43:43] [INFO ] Flatten gal took : 74 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/graph13079347435205348728.txt' '-o' '/tmp/graph13079347435205348728.bin' '-w' '/tmp/graph13079347435205348728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13079347435205348728.bin' '-l' '-1' '-v' '-w' '/tmp/graph13079347435205348728.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:43:43] [INFO ] Decomposing Gal with order
[2022-05-20 02:43:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:43:43] [INFO ] Removed a total of 602 redundant transitions.
[2022-05-20 02:43:43] [INFO ] Flatten gal took : 116 ms
[2022-05-20 02:43:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 1198 labels/synchronizations in 23 ms.
[2022-05-20 02:43:44] [INFO ] Time to serialize gal into /tmp/LTL3562851760895624638.gal : 14 ms
[2022-05-20 02:43:44] [INFO ] Time to serialize properties into /tmp/LTL738276120721932465.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/LTL3562851760895624638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL738276120721932465.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/LTL3562851...244
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(i30.i1.i0.u596.p3716!=1)")))||("((i19.i0.i2.u369.p2337==1)&&(i19.i0.i3.u375.p2378==1))"))))
Formula 0 simplified : !X("((i19.i0.i2.u369.p2337==1)&&(i19.i0.i3.u375.p2378==1))" | GF"(i30.i1.i0.u596.p3716!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin202223838592131475
[2022-05-20 02:43:59] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin202223838592131475
Running compilation step : cd /tmp/ltsmin202223838592131475;'/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/ltsmin202223838592131475;'/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/ltsmin202223838592131475;'/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-LTLFireability-09 finished in 151192 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&X((X(G(p1))&&(X(p2)||p0))))))'
Support contains 2 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 6103 transition count 5603
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 6103 transition count 5603
Applied a total of 18 rules in 1220 ms. Remains 6103 /6112 variables (removed 9) and now considering 5603/5612 (removed 9) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:44:03] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:44:05] [INFO ] Implicit Places using invariants in 2127 ms returned []
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:44:05] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 02:44:07] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 4252 ms to find 0 implicit places.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:44:07] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 02:44:11] [INFO ] Dead Transitions using invariants and state equation in 3884 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6112 places, 5603/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 6103/6112 places, 5603/5612 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-10 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: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(EQ s1796 1), p1:(EQ s3504 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-10 finished in 9575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 6103 transition count 5603
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 6103 transition count 5603
Applied a total of 18 rules in 1188 ms. Remains 6103 /6112 variables (removed 9) and now considering 5603/5612 (removed 9) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:44:12] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 02:44:15] [INFO ] Implicit Places using invariants in 2169 ms returned []
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:44:15] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 02:44:17] [INFO ] Implicit Places using invariants and state equation in 2183 ms returned []
Implicit Place search using SMT with State Equation took 4353 ms to find 0 implicit places.
// Phase 1: matrix 5603 rows 6103 cols
[2022-05-20 02:44:17] [INFO ] Computed 1101 place invariants in 26 ms
[2022-05-20 02:44:21] [INFO ] Dead Transitions using invariants and state equation in 3899 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6112 places, 5603/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 6103/6112 places, 5603/5612 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s2442 0) (EQ s1069 0) (EQ s3511 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2420 steps with 0 reset in 28 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-11 finished in 9607 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G((F(X(F(p0))) U p1))))))'
Support contains 2 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 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 6111 transition count 4910
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5410 transition count 4910
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 5410 transition count 4409
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 4909 transition count 4409
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2414 place count 4899 transition count 4399
Iterating global reduction 2 with 10 rules applied. Total rules applied 2424 place count 4899 transition count 4399
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2424 place count 4899 transition count 4396
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2430 place count 4896 transition count 4396
Performed 1790 Post agglomeration using F-continuation condition.Transition count delta: 1790
Deduced a syphon composed of 1790 places in 6 ms
Reduce places removed 1790 places and 0 transitions.
Iterating global reduction 2 with 3580 rules applied. Total rules applied 6010 place count 3106 transition count 2606
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 6012 place count 3104 transition count 2604
Applied a total of 6012 rules in 1392 ms. Remains 3104 /6112 variables (removed 3008) and now considering 2604/5612 (removed 3008) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:44:22] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:44:24] [INFO ] Implicit Places using invariants in 1765 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:44:24] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:44:28] [INFO ] Implicit Places using invariants and state equation in 3830 ms returned []
Implicit Place search using SMT with State Equation took 5595 ms to find 0 implicit places.
[2022-05-20 02:44:28] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2022-05-20 02:44:28] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:44:30] [INFO ] Dead Transitions using invariants and state equation in 1702 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3104/6112 places, 2604/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/6112 places, 2604/5612 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s123 1), p0:(NEQ s2826 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6646 steps with 0 reset in 116 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-12 finished in 9004 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6102 transition count 5602
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6102 transition count 5602
Applied a total of 20 rules in 1134 ms. Remains 6102 /6112 variables (removed 10) and now considering 5602/5612 (removed 10) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:44:31] [INFO ] Computed 1101 place invariants in 20 ms
[2022-05-20 02:44:33] [INFO ] Implicit Places using invariants in 2145 ms returned []
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:44:33] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:44:35] [INFO ] Implicit Places using invariants and state equation in 2041 ms returned []
Implicit Place search using SMT with State Equation took 4187 ms to find 0 implicit places.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:44:35] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 02:44:39] [INFO ] Dead Transitions using invariants and state equation in 3827 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6112 places, 5602/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 6102/6112 places, 5602/5612 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2173 1) (EQ s2192 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 10 reset in 1531 ms.
Product exploration explored 100000 steps with 10 reset in 1860 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 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 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219521 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219521 steps, saw 214007 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:44:46] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 02:44:47] [INFO ] [Real]Absence check using 1101 positive place invariants in 686 ms returned sat
[2022-05-20 02:44:52] [INFO ] After 6344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:44:54] [INFO ] [Nat]Absence check using 1101 positive place invariants in 655 ms returned sat
[2022-05-20 02:44:58] [INFO ] After 4611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:45:01] [INFO ] Deduced a trap composed of 16 places in 2309 ms of which 3 ms to minimize.
[2022-05-20 02:45:03] [INFO ] Deduced a trap composed of 25 places in 2331 ms of which 4 ms to minimize.
[2022-05-20 02:45:06] [INFO ] Deduced a trap composed of 21 places in 2343 ms of which 3 ms to minimize.
[2022-05-20 02:45:08] [INFO ] Deduced a trap composed of 19 places in 2284 ms of which 3 ms to minimize.
[2022-05-20 02:45:11] [INFO ] Deduced a trap composed of 23 places in 2264 ms of which 4 ms to minimize.
[2022-05-20 02:45:13] [INFO ] Deduced a trap composed of 20 places in 2236 ms of which 3 ms to minimize.
[2022-05-20 02:45:16] [INFO ] Deduced a trap composed of 30 places in 2271 ms of which 3 ms to minimize.
[2022-05-20 02:45:18] [INFO ] Deduced a trap composed of 23 places in 2275 ms of which 3 ms to minimize.
[2022-05-20 02:45:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:45:18] [INFO ] After 25911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 79 ms.
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6102/6102 places, 5602/5602 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 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4401
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 4901 transition count 4401
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 6 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 5998 place count 3103 transition count 2603
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 6895 place count 3103 transition count 2603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6896 place count 3102 transition count 2602
Applied a total of 6896 rules in 1100 ms. Remains 3102 /6102 variables (removed 3000) and now considering 2602/5602 (removed 3000) transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/6102 places, 2602/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 116046 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116046 steps, saw 109228 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:45:23] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:45:23] [INFO ] [Real]Absence check using 1051 positive place invariants in 201 ms returned sat
[2022-05-20 02:45:23] [INFO ] [Real]Absence check using 1051 positive and 50 generalized place invariants in 12 ms returned sat
[2022-05-20 02:45:25] [INFO ] After 2374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:45:26] [INFO ] [Nat]Absence check using 1051 positive place invariants in 191 ms returned sat
[2022-05-20 02:45:26] [INFO ] [Nat]Absence check using 1051 positive and 50 generalized place invariants in 10 ms returned sat
[2022-05-20 02:45:27] [INFO ] After 1642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:45:28] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2022-05-20 02:45:28] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2022-05-20 02:45:28] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 1 ms to minimize.
[2022-05-20 02:45:29] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 0 ms to minimize.
[2022-05-20 02:45:29] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 0 ms to minimize.
[2022-05-20 02:45:29] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2022-05-20 02:45:30] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2022-05-20 02:45:30] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 0 ms to minimize.
[2022-05-20 02:45:30] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2022-05-20 02:45:31] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
[2022-05-20 02:45:31] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:45:31] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:45:32] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2022-05-20 02:45:32] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2022-05-20 02:45:32] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 0 ms to minimize.
[2022-05-20 02:45:33] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
[2022-05-20 02:45:33] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 1 ms to minimize.
[2022-05-20 02:45:33] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2022-05-20 02:45:34] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 1 ms to minimize.
[2022-05-20 02:45:34] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2022-05-20 02:45:35] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2022-05-20 02:45:35] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2022-05-20 02:45:35] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 0 ms to minimize.
[2022-05-20 02:45:36] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2022-05-20 02:45:36] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2022-05-20 02:45:36] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2022-05-20 02:45:37] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2022-05-20 02:45:37] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 0 ms to minimize.
[2022-05-20 02:45:37] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2022-05-20 02:45:37] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 0 ms to minimize.
[2022-05-20 02:45:38] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2022-05-20 02:45:38] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 0 ms to minimize.
[2022-05-20 02:45:38] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2022-05-20 02:45:39] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2022-05-20 02:45:39] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2022-05-20 02:45:39] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2022-05-20 02:45:39] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2022-05-20 02:45:40] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2022-05-20 02:45:40] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2022-05-20 02:45:40] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 0 ms to minimize.
[2022-05-20 02:45:41] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2022-05-20 02:45:41] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 0 ms to minimize.
[2022-05-20 02:45:41] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2022-05-20 02:45:41] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 0 ms to minimize.
[2022-05-20 02:45:42] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 0 ms to minimize.
[2022-05-20 02:45:42] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2022-05-20 02:45:42] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 1 ms to minimize.
[2022-05-20 02:45:43] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2022-05-20 02:45:43] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2022-05-20 02:45:43] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2022-05-20 02:45:43] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 0 ms to minimize.
[2022-05-20 02:45:44] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 1 ms to minimize.
[2022-05-20 02:45:44] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2022-05-20 02:45:44] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 0 ms to minimize.
[2022-05-20 02:45:44] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2022-05-20 02:45:45] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 0 ms to minimize.
[2022-05-20 02:45:45] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2022-05-20 02:45:45] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2022-05-20 02:45:45] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2022-05-20 02:45:46] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2022-05-20 02:45:46] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2022-05-20 02:45:46] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2022-05-20 02:45:46] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2022-05-20 02:45:47] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2022-05-20 02:45:47] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2022-05-20 02:45:47] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2022-05-20 02:45:47] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2022-05-20 02:45:47] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2022-05-20 02:45:48] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2022-05-20 02:45:48] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2022-05-20 02:45:48] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2022-05-20 02:45:48] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2022-05-20 02:45:48] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2022-05-20 02:45:48] [INFO ] Trap strengthening (SAT) tested/added 74/73 trap constraints in 21073 ms
[2022-05-20 02:45:48] [INFO ] After 22795ms 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:45:49] [INFO ] After 23431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 94 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 121 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 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:45:49] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:45:51] [INFO ] Implicit Places using invariants in 2169 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:45:51] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 02:45:56] [INFO ] Implicit Places using invariants and state equation in 5370 ms returned []
Implicit Place search using SMT with State Equation took 7540 ms to find 0 implicit places.
[2022-05-20 02:45:56] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:45:57] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 02:45:58] [INFO ] Dead Transitions using invariants and state equation in 1762 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 124 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:45:58] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 02:45:59] [INFO ] [Real]Absence check using 1051 positive place invariants in 190 ms returned sat
[2022-05-20 02:45:59] [INFO ] [Real]Absence check using 1051 positive and 50 generalized place invariants in 10 ms returned sat
[2022-05-20 02:46:01] [INFO ] After 2380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:46:01] [INFO ] [Nat]Absence check using 1051 positive place invariants in 192 ms returned sat
[2022-05-20 02:46:01] [INFO ] [Nat]Absence check using 1051 positive and 50 generalized place invariants in 11 ms returned sat
[2022-05-20 02:46:03] [INFO ] After 1666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:46:03] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2022-05-20 02:46:04] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 1 ms to minimize.
[2022-05-20 02:46:04] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 1 ms to minimize.
[2022-05-20 02:46:04] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2022-05-20 02:46:05] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2022-05-20 02:46:05] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 1 ms to minimize.
[2022-05-20 02:46:05] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2022-05-20 02:46:06] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2022-05-20 02:46:06] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2022-05-20 02:46:06] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:46:07] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2022-05-20 02:46:07] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2022-05-20 02:46:07] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2022-05-20 02:46:08] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2022-05-20 02:46:08] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2022-05-20 02:46:08] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 0 ms to minimize.
[2022-05-20 02:46:09] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2022-05-20 02:46:09] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 1 ms to minimize.
[2022-05-20 02:46:10] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 1 ms to minimize.
[2022-05-20 02:46:10] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2022-05-20 02:46:10] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2022-05-20 02:46:11] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2022-05-20 02:46:11] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 1 ms to minimize.
[2022-05-20 02:46:11] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2022-05-20 02:46:12] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2022-05-20 02:46:12] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2022-05-20 02:46:12] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2022-05-20 02:46:13] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 0 ms to minimize.
[2022-05-20 02:46:13] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 0 ms to minimize.
[2022-05-20 02:46:13] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2022-05-20 02:46:13] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 0 ms to minimize.
[2022-05-20 02:46:14] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2022-05-20 02:46:14] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2022-05-20 02:46:14] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2022-05-20 02:46:15] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2022-05-20 02:46:15] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2022-05-20 02:46:15] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2022-05-20 02:46:15] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 0 ms to minimize.
[2022-05-20 02:46:16] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2022-05-20 02:46:16] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2022-05-20 02:46:16] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2022-05-20 02:46:17] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2022-05-20 02:46:17] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2022-05-20 02:46:17] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 0 ms to minimize.
[2022-05-20 02:46:17] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2022-05-20 02:46:18] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2022-05-20 02:46:18] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2022-05-20 02:46:18] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2022-05-20 02:46:19] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2022-05-20 02:46:19] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 0 ms to minimize.
[2022-05-20 02:46:19] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2022-05-20 02:46:19] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 1 ms to minimize.
[2022-05-20 02:46:20] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2022-05-20 02:46:20] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2022-05-20 02:46:20] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2022-05-20 02:46:20] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2022-05-20 02:46:21] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2022-05-20 02:46:21] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2022-05-20 02:46:21] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2022-05-20 02:46:21] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2022-05-20 02:46:22] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2022-05-20 02:46:22] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2022-05-20 02:46:22] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2022-05-20 02:46:22] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2022-05-20 02:46:22] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2022-05-20 02:46:23] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2022-05-20 02:46:23] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2022-05-20 02:46:23] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2022-05-20 02:46:23] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2022-05-20 02:46:23] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2022-05-20 02:46:24] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2022-05-20 02:46:24] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2022-05-20 02:46:24] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2022-05-20 02:46:24] [INFO ] Trap strengthening (SAT) tested/added 74/73 trap constraints in 21110 ms
[2022-05-20 02:46:24] [INFO ] After 22853ms 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:46:24] [INFO ] After 23484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:46:25] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 02:46:38] [INFO ] [Real]Absence check using 1101 positive place invariants in 6830 ms returned sat
[2022-05-20 02:46:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:46:40] [INFO ] [Real]Absence check using state equation in 1753 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 6102 places. Attempting structural reductions.
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.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 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 1402 place count 5400 transition count 4400
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 2402 place count 4900 transition count 4400
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 2 with 3592 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 2 with 2 rules applied. Total rules applied 5996 place count 3102 transition count 2602
Applied a total of 5996 rules in 997 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:46:41] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:46:42] [INFO ] Implicit Places using invariants in 1777 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:46:42] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:46:46] [INFO ] Implicit Places using invariants and state equation in 4052 ms returned []
Implicit Place search using SMT with State Equation took 5830 ms to find 0 implicit places.
[2022-05-20 02:46:46] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:46:46] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 02:46:48] [INFO ] Dead Transitions using invariants and state equation in 1721 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 106 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 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97196 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97196 steps, saw 87685 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:46:52] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:46:52] [INFO ] [Real]Absence check using 1101 positive place invariants in 213 ms returned sat
[2022-05-20 02:46:54] [INFO ] After 1888ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:46:54] [INFO ] [Nat]Absence check using 1101 positive place invariants in 202 ms returned sat
[2022-05-20 02:46:55] [INFO ] After 1359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:46:56] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2022-05-20 02:46:56] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2022-05-20 02:46:56] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2022-05-20 02:46:56] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2022-05-20 02:46:56] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2022-05-20 02:46:56] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2022-05-20 02:46:57] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2022-05-20 02:46:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1169 ms
[2022-05-20 02:46:57] [INFO ] After 2603ms 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:46:57] [INFO ] After 3249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 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 242 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 187 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Finished probabilistic random walk after 92477 steps, run visited all 1 properties in 1775 ms. (steps per millisecond=52 )
Probabilistic random walk after 92477 steps, saw 91355 distinct states, run finished after 1779 ms. (steps per millisecond=51 ) 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 156 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:46:59] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 02:47:05] [INFO ] [Real]Absence check using 1101 positive place invariants in 1553 ms returned sat
[2022-05-20 02:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:47:14] [INFO ] [Real]Absence check using state equation in 9883 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24 reset in 1594 ms.
Product exploration explored 100000 steps with 24 reset in 2103 ms.
Built C files in :
/tmp/ltsmin5398382066853750072
[2022-05-20 02:47:18] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:47:18] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5398382066853750072
Running compilation step : cd /tmp/ltsmin5398382066853750072;'/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/ltsmin5398382066853750072;'/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/ltsmin5398382066853750072;'/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 128 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:47:21] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:47:23] [INFO ] Implicit Places using invariants in 1775 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:47:23] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:47:27] [INFO ] Implicit Places using invariants and state equation in 4025 ms returned []
Implicit Place search using SMT with State Equation took 5800 ms to find 0 implicit places.
[2022-05-20 02:47:27] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:47:27] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:47:29] [INFO ] Dead Transitions using invariants and state equation in 1693 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Built C files in :
/tmp/ltsmin14988239787153382908
[2022-05-20 02:47:29] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2022-05-20 02:47:29] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14988239787153382908
Running compilation step : cd /tmp/ltsmin14988239787153382908;'/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/ltsmin14988239787153382908;'/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/ltsmin14988239787153382908;'/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:47:32] [INFO ] Flatten gal took : 75 ms
[2022-05-20 02:47:32] [INFO ] Flatten gal took : 76 ms
[2022-05-20 02:47:32] [INFO ] Time to serialize gal into /tmp/LTL16426142447545658089.gal : 6 ms
[2022-05-20 02:47:32] [INFO ] Time to serialize properties into /tmp/LTL7583846373346822983.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/LTL16426142447545658089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7583846373346822983.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/LTL1642614...267
Read 1 LTL properties
Checking formula 0 : !((X(F("((p2411==1)&&(p2434==1))"))))
Formula 0 simplified : !XF"((p2411==1)&&(p2434==1))"
Detected timeout of ITS tools.
[2022-05-20 02:47:47] [INFO ] Flatten gal took : 76 ms
[2022-05-20 02:47:47] [INFO ] Applying decomposition
[2022-05-20 02:47:47] [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/graph14739781002596344624.txt' '-o' '/tmp/graph14739781002596344624.bin' '-w' '/tmp/graph14739781002596344624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14739781002596344624.bin' '-l' '-1' '-v' '-w' '/tmp/graph14739781002596344624.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:47:48] [INFO ] Decomposing Gal with order
[2022-05-20 02:47:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:47:48] [INFO ] Removed a total of 603 redundant transitions.
[2022-05-20 02:47:48] [INFO ] Flatten gal took : 117 ms
[2022-05-20 02:47:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1198 labels/synchronizations in 26 ms.
[2022-05-20 02:47:48] [INFO ] Time to serialize gal into /tmp/LTL8855315458506766625.gal : 30 ms
[2022-05-20 02:47:48] [INFO ] Time to serialize properties into /tmp/LTL18382982573967188804.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/LTL8855315458506766625.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18382982573967188804.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/LTL8855315...246
Read 1 LTL properties
Checking formula 0 : !((X(F("((i20.i0.i3.u380.p2411==1)&&(i20.i0.i4.u385.p2434==1))"))))
Formula 0 simplified : !XF"((i20.i0.i3.u380.p2411==1)&&(i20.i0.i4.u385.p2434==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2726243524803284011
[2022-05-20 02:48:03] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2726243524803284011
Running compilation step : cd /tmp/ltsmin2726243524803284011;'/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/ltsmin2726243524803284011;'/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/ltsmin2726243524803284011;'/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-LTLFireability-13 finished in 216276 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6102 transition count 5602
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6102 transition count 5602
Applied a total of 20 rules in 1169 ms. Remains 6102 /6112 variables (removed 10) and now considering 5602/5612 (removed 10) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:48:07] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 02:48:09] [INFO ] Implicit Places using invariants in 2099 ms returned []
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:48:09] [INFO ] Computed 1101 place invariants in 16 ms
[2022-05-20 02:48:11] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 4180 ms to find 0 implicit places.
// Phase 1: matrix 5602 rows 6102 cols
[2022-05-20 02:48:11] [INFO ] Computed 1101 place invariants in 19 ms
[2022-05-20 02:48:15] [INFO ] Dead Transitions using invariants and state equation in 3467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6112 places, 5602/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 6102/6112 places, 5602/5612 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s1770 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 4645 ms.
Product exploration explored 100000 steps with 50000 reset in 4653 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-100B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100B-LTLFireability-14 finished in 18393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(F(p0)) U X(X((X(F(p1))&&p2)))))'
Support contains 5 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6104 transition count 5604
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6104 transition count 5604
Applied a total of 16 rules in 1152 ms. Remains 6104 /6112 variables (removed 8) and now considering 5604/5612 (removed 8) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:48:26] [INFO ] Computed 1101 place invariants in 20 ms
[2022-05-20 02:48:28] [INFO ] Implicit Places using invariants in 2095 ms returned []
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:48:28] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:48:30] [INFO ] Implicit Places using invariants and state equation in 1974 ms returned []
Implicit Place search using SMT with State Equation took 4071 ms to find 0 implicit places.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:48:30] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 02:48:33] [INFO ] Dead Transitions using invariants and state equation in 3765 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6104/6112 places, 5604/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 6104/6112 places, 5604/5612 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (AND p1 p0), (AND p1 p0 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, p0]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p2), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=p2, acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 0}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 0}, { cond=(NOT p0), acceptance={} source=8 dest: 8}]], initial=3, aps=[p0:(AND (EQ s4034 1) (EQ s4053 1) (EQ s2603 1)), p1:(NEQ s4539 1), p2:(EQ s5518 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 1662 ms.
Product exploration explored 100000 steps with 6 reset in 2035 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 9 states, 22 edges and 3 AP to 9 states, 21 edges and 3 AP.
Stuttering acceptance computed with spot in 287 ms :[true, p1, p0, (AND p1 p0), (AND p1 p0 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:48:39] [INFO ] Computed 1101 place invariants in 16 ms
[2022-05-20 02:48:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 628 ms returned sat
[2022-05-20 02:48:45] [INFO ] After 6726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 02:48:47] [INFO ] [Nat]Absence check using 1101 positive place invariants in 630 ms returned sat
[2022-05-20 02:48:54] [INFO ] After 5865ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 02:48:56] [INFO ] Deduced a trap composed of 45 places in 2433 ms of which 3 ms to minimize.
[2022-05-20 02:48:59] [INFO ] Deduced a trap composed of 22 places in 2457 ms of which 3 ms to minimize.
[2022-05-20 02:49:02] [INFO ] Deduced a trap composed of 31 places in 2387 ms of which 3 ms to minimize.
[2022-05-20 02:49:04] [INFO ] Deduced a trap composed of 21 places in 2361 ms of which 4 ms to minimize.
[2022-05-20 02:49:07] [INFO ] Deduced a trap composed of 21 places in 2334 ms of which 4 ms to minimize.
[2022-05-20 02:49:09] [INFO ] Deduced a trap composed of 24 places in 2315 ms of which 3 ms to minimize.
[2022-05-20 02:49:12] [INFO ] Deduced a trap composed of 34 places in 2280 ms of which 3 ms to minimize.
[2022-05-20 02:49:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:49:12] [INFO ] After 26239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1324 ms.
Support contains 5 out of 6104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6104/6104 places, 5604/5604 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 6104 transition count 4903
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5403 transition count 4903
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 5403 transition count 4404
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 4904 transition count 4404
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 6 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5994 place count 3107 transition count 2607
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 6891 place count 3107 transition count 2607
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6892 place count 3106 transition count 2606
Applied a total of 6892 rules in 1108 ms. Remains 3106 /6104 variables (removed 2998) and now considering 2606/5604 (removed 2998) transitions.
Finished structural reductions, in 1 iterations. Remains : 3106/6104 places, 2606/5604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:49:15] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 02:49:16] [INFO ] [Real]Absence check using 1055 positive place invariants in 193 ms returned sat
[2022-05-20 02:49:16] [INFO ] [Real]Absence check using 1055 positive and 46 generalized place invariants in 10 ms returned sat
[2022-05-20 02:49:18] [INFO ] After 2704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 02:49:18] [INFO ] [Nat]Absence check using 1055 positive place invariants in 193 ms returned sat
[2022-05-20 02:49:18] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 9 ms returned sat
[2022-05-20 02:49:21] [INFO ] After 2261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 02:49:21] [INFO ] Deduced a trap composed of 6 places in 352 ms of which 1 ms to minimize.
[2022-05-20 02:49:22] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 1 ms to minimize.
[2022-05-20 02:49:22] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2022-05-20 02:49:23] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2022-05-20 02:49:23] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 1 ms to minimize.
[2022-05-20 02:49:24] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 0 ms to minimize.
[2022-05-20 02:49:24] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 1 ms to minimize.
[2022-05-20 02:49:24] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 1 ms to minimize.
[2022-05-20 02:49:25] [INFO ] Deduced a trap composed of 6 places in 309 ms of which 1 ms to minimize.
[2022-05-20 02:49:25] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 1 ms to minimize.
[2022-05-20 02:49:26] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 0 ms to minimize.
[2022-05-20 02:49:26] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 0 ms to minimize.
[2022-05-20 02:49:27] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2022-05-20 02:49:27] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2022-05-20 02:49:27] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2022-05-20 02:49:28] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 1 ms to minimize.
[2022-05-20 02:49:28] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 0 ms to minimize.
[2022-05-20 02:49:28] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2022-05-20 02:49:29] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 1 ms to minimize.
[2022-05-20 02:49:29] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2022-05-20 02:49:29] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 0 ms to minimize.
[2022-05-20 02:49:30] [INFO ] Deduced a trap composed of 14 places in 256 ms of which 1 ms to minimize.
[2022-05-20 02:49:30] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2022-05-20 02:49:30] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2022-05-20 02:49:31] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2022-05-20 02:49:31] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 1 ms to minimize.
[2022-05-20 02:49:31] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 1 ms to minimize.
[2022-05-20 02:49:32] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2022-05-20 02:49:32] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2022-05-20 02:49:32] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2022-05-20 02:49:33] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2022-05-20 02:49:33] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2022-05-20 02:49:33] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 0 ms to minimize.
[2022-05-20 02:49:34] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 0 ms to minimize.
[2022-05-20 02:49:34] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2022-05-20 02:49:34] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 0 ms to minimize.
[2022-05-20 02:49:34] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2022-05-20 02:49:35] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2022-05-20 02:49:35] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2022-05-20 02:49:35] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2022-05-20 02:49:36] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 1 ms to minimize.
[2022-05-20 02:49:36] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 0 ms to minimize.
[2022-05-20 02:49:36] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2022-05-20 02:49:36] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2022-05-20 02:49:37] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
[2022-05-20 02:49:37] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 0 ms to minimize.
[2022-05-20 02:49:37] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2022-05-20 02:49:38] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2022-05-20 02:49:38] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 0 ms to minimize.
[2022-05-20 02:49:38] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2022-05-20 02:49:38] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2022-05-20 02:49:39] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 0 ms to minimize.
[2022-05-20 02:49:39] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2022-05-20 02:49:39] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2022-05-20 02:49:39] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2022-05-20 02:49:40] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 0 ms to minimize.
[2022-05-20 02:49:40] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2022-05-20 02:49:40] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2022-05-20 02:49:40] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2022-05-20 02:49:41] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 1 ms to minimize.
[2022-05-20 02:49:41] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2022-05-20 02:49:41] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2022-05-20 02:49:42] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2022-05-20 02:49:42] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 0 ms to minimize.
[2022-05-20 02:49:42] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2022-05-20 02:49:42] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2022-05-20 02:49:42] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2022-05-20 02:49:43] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2022-05-20 02:49:43] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 0 ms to minimize.
[2022-05-20 02:49:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:49:43] [INFO ] After 25176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 581 ms.
Support contains 5 out of 3106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3106/3106 places, 2606/2606 transitions.
Applied a total of 0 rules in 121 ms. Remains 3106 /3106 variables (removed 0) and now considering 2606/2606 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3106/3106 places, 2606/2606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 78643 steps, run timeout after 3094 ms. (steps per millisecond=25 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 78643 steps, saw 71455 distinct states, run finished after 3094 ms. (steps per millisecond=25 ) properties seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:49:48] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 02:49:48] [INFO ] [Real]Absence check using 1055 positive place invariants in 191 ms returned sat
[2022-05-20 02:49:48] [INFO ] [Real]Absence check using 1055 positive and 46 generalized place invariants in 9 ms returned sat
[2022-05-20 02:49:51] [INFO ] After 2848ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:49:51] [INFO ] [Nat]Absence check using 1055 positive place invariants in 193 ms returned sat
[2022-05-20 02:49:51] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 10 ms returned sat
[2022-05-20 02:49:53] [INFO ] After 1744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:49:53] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 1 ms to minimize.
[2022-05-20 02:49:54] [INFO ] Deduced a trap composed of 5 places in 368 ms of which 1 ms to minimize.
[2022-05-20 02:49:54] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 1 ms to minimize.
[2022-05-20 02:49:55] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 0 ms to minimize.
[2022-05-20 02:49:55] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 0 ms to minimize.
[2022-05-20 02:49:56] [INFO ] Deduced a trap composed of 6 places in 359 ms of which 1 ms to minimize.
[2022-05-20 02:49:56] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 1 ms to minimize.
[2022-05-20 02:49:57] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 1 ms to minimize.
[2022-05-20 02:49:57] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 1 ms to minimize.
[2022-05-20 02:49:57] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 1 ms to minimize.
[2022-05-20 02:49:58] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 0 ms to minimize.
[2022-05-20 02:49:58] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2022-05-20 02:49:59] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 1 ms to minimize.
[2022-05-20 02:49:59] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 0 ms to minimize.
[2022-05-20 02:49:59] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2022-05-20 02:50:00] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2022-05-20 02:50:00] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2022-05-20 02:50:00] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2022-05-20 02:50:01] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
[2022-05-20 02:50:01] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2022-05-20 02:50:01] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2022-05-20 02:50:02] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 0 ms to minimize.
[2022-05-20 02:50:02] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2022-05-20 02:50:02] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 0 ms to minimize.
[2022-05-20 02:50:03] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2022-05-20 02:50:03] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 0 ms to minimize.
[2022-05-20 02:50:03] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2022-05-20 02:50:04] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 0 ms to minimize.
[2022-05-20 02:50:04] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2022-05-20 02:50:04] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 0 ms to minimize.
[2022-05-20 02:50:05] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 0 ms to minimize.
[2022-05-20 02:50:05] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2022-05-20 02:50:05] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2022-05-20 02:50:05] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 0 ms to minimize.
[2022-05-20 02:50:06] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2022-05-20 02:50:06] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2022-05-20 02:50:06] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2022-05-20 02:50:07] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2022-05-20 02:50:07] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2022-05-20 02:50:07] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 0 ms to minimize.
[2022-05-20 02:50:07] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2022-05-20 02:50:08] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 0 ms to minimize.
[2022-05-20 02:50:08] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2022-05-20 02:50:08] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 0 ms to minimize.
[2022-05-20 02:50:09] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2022-05-20 02:50:09] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 1 ms to minimize.
[2022-05-20 02:50:09] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2022-05-20 02:50:09] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2022-05-20 02:50:10] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2022-05-20 02:50:10] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2022-05-20 02:50:10] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2022-05-20 02:50:10] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 1 ms to minimize.
[2022-05-20 02:50:11] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2022-05-20 02:50:11] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2022-05-20 02:50:11] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2022-05-20 02:50:12] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 0 ms to minimize.
[2022-05-20 02:50:12] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2022-05-20 02:50:12] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 0 ms to minimize.
[2022-05-20 02:50:12] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 0 ms to minimize.
[2022-05-20 02:50:13] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2022-05-20 02:50:13] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2022-05-20 02:50:13] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2022-05-20 02:50:13] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2022-05-20 02:50:14] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2022-05-20 02:50:14] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 0 ms to minimize.
[2022-05-20 02:50:14] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 0 ms to minimize.
[2022-05-20 02:50:14] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2022-05-20 02:50:14] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2022-05-20 02:50:15] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2022-05-20 02:50:15] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2022-05-20 02:50:15] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2022-05-20 02:50:15] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 0 ms to minimize.
[2022-05-20 02:50:16] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2022-05-20 02:50:16] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2022-05-20 02:50:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:50:16] [INFO ] After 25128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 101 ms.
Support contains 4 out of 3106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3106/3106 places, 2606/2606 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 3105 transition count 2605
Applied a total of 2 rules in 241 ms. Remains 3105 /3106 variables (removed 1) and now considering 2605/2606 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3105/3106 places, 2605/2606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 118527 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118527 steps, saw 110407 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2022-05-20 02:50:19] [INFO ] Computed 1101 place invariants in 40 ms
[2022-05-20 02:50:20] [INFO ] [Real]Absence check using 1056 positive place invariants in 190 ms returned sat
[2022-05-20 02:50:20] [INFO ] [Real]Absence check using 1056 positive and 45 generalized place invariants in 9 ms returned sat
[2022-05-20 02:50:22] [INFO ] After 2425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:50:22] [INFO ] [Nat]Absence check using 1056 positive place invariants in 196 ms returned sat
[2022-05-20 02:50:22] [INFO ] [Nat]Absence check using 1056 positive and 45 generalized place invariants in 9 ms returned sat
[2022-05-20 02:50:24] [INFO ] After 1759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:50:25] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 1 ms to minimize.
[2022-05-20 02:50:25] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2022-05-20 02:50:25] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2022-05-20 02:50:26] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 1 ms to minimize.
[2022-05-20 02:50:26] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2022-05-20 02:50:27] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 1 ms to minimize.
[2022-05-20 02:50:27] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 1 ms to minimize.
[2022-05-20 02:50:27] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2022-05-20 02:50:28] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 1 ms to minimize.
[2022-05-20 02:50:28] [INFO ] Deduced a trap composed of 7 places in 308 ms of which 0 ms to minimize.
[2022-05-20 02:50:29] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2022-05-20 02:50:29] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 1 ms to minimize.
[2022-05-20 02:50:29] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 1 ms to minimize.
[2022-05-20 02:50:30] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 1 ms to minimize.
[2022-05-20 02:50:30] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2022-05-20 02:50:31] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 1 ms to minimize.
[2022-05-20 02:50:31] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 1 ms to minimize.
[2022-05-20 02:50:31] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2022-05-20 02:50:32] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2022-05-20 02:50:32] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2022-05-20 02:50:32] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 0 ms to minimize.
[2022-05-20 02:50:33] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 1 ms to minimize.
[2022-05-20 02:50:33] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
[2022-05-20 02:50:33] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2022-05-20 02:50:34] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2022-05-20 02:50:34] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 0 ms to minimize.
[2022-05-20 02:50:34] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2022-05-20 02:50:35] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2022-05-20 02:50:35] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2022-05-20 02:50:35] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 1 ms to minimize.
[2022-05-20 02:50:36] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2022-05-20 02:50:36] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2022-05-20 02:50:36] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2022-05-20 02:50:37] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 1 ms to minimize.
[2022-05-20 02:50:37] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
[2022-05-20 02:50:37] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 0 ms to minimize.
[2022-05-20 02:50:37] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2022-05-20 02:50:38] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2022-05-20 02:50:38] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2022-05-20 02:50:38] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2022-05-20 02:50:39] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2022-05-20 02:50:39] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 1 ms to minimize.
[2022-05-20 02:50:39] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 0 ms to minimize.
[2022-05-20 02:50:40] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2022-05-20 02:50:40] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2022-05-20 02:50:40] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 0 ms to minimize.
[2022-05-20 02:50:40] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 0 ms to minimize.
[2022-05-20 02:50:41] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2022-05-20 02:50:41] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2022-05-20 02:50:41] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 0 ms to minimize.
[2022-05-20 02:50:42] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2022-05-20 02:50:42] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 1 ms to minimize.
[2022-05-20 02:50:42] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2022-05-20 02:50:42] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2022-05-20 02:50:43] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 0 ms to minimize.
[2022-05-20 02:50:43] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 1 ms to minimize.
[2022-05-20 02:50:43] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2022-05-20 02:50:44] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 1 ms to minimize.
[2022-05-20 02:50:44] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2022-05-20 02:50:44] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2022-05-20 02:50:44] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2022-05-20 02:50:45] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2022-05-20 02:50:45] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2022-05-20 02:50:45] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2022-05-20 02:50:45] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2022-05-20 02:50:46] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2022-05-20 02:50:46] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2022-05-20 02:50:46] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2022-05-20 02:50:46] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-05-20 02:50:46] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2022-05-20 02:50:47] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2022-05-20 02:50:47] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2022-05-20 02:50:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:50:47] [INFO ] After 25121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 85 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 120 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 122 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2022-05-20 02:50:47] [INFO ] Computed 1101 place invariants in 38 ms
[2022-05-20 02:50:49] [INFO ] Implicit Places using invariants in 2190 ms returned []
// Phase 1: matrix 2605 rows 3105 cols
[2022-05-20 02:50:49] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 02:50:55] [INFO ] Implicit Places using invariants and state equation in 5828 ms returned []
Implicit Place search using SMT with State Equation took 8019 ms to find 0 implicit places.
[2022-05-20 02:50:55] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 2605 rows 3105 cols
[2022-05-20 02:50:55] [INFO ] Computed 1101 place invariants in 40 ms
[2022-05-20 02:50:57] [INFO ] Dead Transitions using invariants and state equation in 1769 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3105/3105 places, 2605/2605 transitions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND p0 p2)), (F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F (AND p1 p0)), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 369 ms. Reduced automaton from 9 states, 21 edges and 3 AP to 9 states, 21 edges and 3 AP.
Stuttering acceptance computed with spot in 269 ms :[true, p1, p0, (AND p1 p0), (AND p1 p0 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 273 ms :[true, p1, p0, (AND p1 p0), (AND p1 p0 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Support contains 5 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Applied a total of 0 rules in 566 ms. Remains 6104 /6104 variables (removed 0) and now considering 5604/5604 (removed 0) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:50:59] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 02:51:01] [INFO ] Implicit Places using invariants in 2122 ms returned []
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:51:01] [INFO ] Computed 1101 place invariants in 26 ms
[2022-05-20 02:51:03] [INFO ] Implicit Places using invariants and state equation in 2136 ms returned []
Implicit Place search using SMT with State Equation took 4261 ms to find 0 implicit places.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:51:03] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 02:51:07] [INFO ] Dead Transitions using invariants and state equation in 3796 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6104/6104 places, 5604/5604 transitions.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 9 states, 21 edges and 3 AP to 9 states, 21 edges and 3 AP.
Stuttering acceptance computed with spot in 269 ms :[true, p1, p0, (AND p1 p0), (AND p1 p0 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:51:08] [INFO ] Computed 1101 place invariants in 16 ms
[2022-05-20 02:51:10] [INFO ] [Real]Absence check using 1101 positive place invariants in 661 ms returned sat
[2022-05-20 02:51:15] [INFO ] After 6769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 02:51:16] [INFO ] [Nat]Absence check using 1101 positive place invariants in 663 ms returned sat
[2022-05-20 02:51:23] [INFO ] After 5943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 02:51:25] [INFO ] Deduced a trap composed of 45 places in 2388 ms of which 4 ms to minimize.
[2022-05-20 02:51:28] [INFO ] Deduced a trap composed of 22 places in 2375 ms of which 3 ms to minimize.
[2022-05-20 02:51:31] [INFO ] Deduced a trap composed of 31 places in 2420 ms of which 4 ms to minimize.
[2022-05-20 02:51:33] [INFO ] Deduced a trap composed of 21 places in 2338 ms of which 3 ms to minimize.
[2022-05-20 02:51:36] [INFO ] Deduced a trap composed of 21 places in 2339 ms of which 4 ms to minimize.
[2022-05-20 02:51:38] [INFO ] Deduced a trap composed of 24 places in 2352 ms of which 4 ms to minimize.
[2022-05-20 02:51:41] [INFO ] Deduced a trap composed of 34 places in 2321 ms of which 3 ms to minimize.
[2022-05-20 02:51:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:51:41] [INFO ] After 26296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1300 ms.
Support contains 5 out of 6104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6104/6104 places, 5604/5604 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 6104 transition count 4903
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5403 transition count 4903
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 5403 transition count 4404
Deduced a syphon composed of 499 places in 20 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4904 transition count 4404
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 6 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5994 place count 3107 transition count 2607
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 6891 place count 3107 transition count 2607
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6892 place count 3106 transition count 2606
Applied a total of 6892 rules in 1105 ms. Remains 3106 /6104 variables (removed 2998) and now considering 2606/5604 (removed 2998) transitions.
Finished structural reductions, in 1 iterations. Remains : 3106/6104 places, 2606/5604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:51:44] [INFO ] Computed 1101 place invariants in 38 ms
[2022-05-20 02:51:45] [INFO ] [Real]Absence check using 1055 positive place invariants in 197 ms returned sat
[2022-05-20 02:51:45] [INFO ] [Real]Absence check using 1055 positive and 46 generalized place invariants in 10 ms returned sat
[2022-05-20 02:51:47] [INFO ] After 2718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 02:51:48] [INFO ] [Nat]Absence check using 1055 positive place invariants in 191 ms returned sat
[2022-05-20 02:51:48] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 9 ms returned sat
[2022-05-20 02:51:50] [INFO ] After 2223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 02:51:51] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 1 ms to minimize.
[2022-05-20 02:51:51] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 1 ms to minimize.
[2022-05-20 02:51:52] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 1 ms to minimize.
[2022-05-20 02:51:52] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 0 ms to minimize.
[2022-05-20 02:51:52] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 1 ms to minimize.
[2022-05-20 02:51:53] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 1 ms to minimize.
[2022-05-20 02:51:53] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2022-05-20 02:51:54] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2022-05-20 02:51:54] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 0 ms to minimize.
[2022-05-20 02:51:55] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 1 ms to minimize.
[2022-05-20 02:51:55] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 0 ms to minimize.
[2022-05-20 02:51:55] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 1 ms to minimize.
[2022-05-20 02:51:56] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 1 ms to minimize.
[2022-05-20 02:51:56] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2022-05-20 02:51:56] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 1 ms to minimize.
[2022-05-20 02:51:57] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 1 ms to minimize.
[2022-05-20 02:51:57] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2022-05-20 02:51:58] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2022-05-20 02:51:58] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 1 ms to minimize.
[2022-05-20 02:51:58] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2022-05-20 02:51:59] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 0 ms to minimize.
[2022-05-20 02:51:59] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 1 ms to minimize.
[2022-05-20 02:51:59] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2022-05-20 02:52:00] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 0 ms to minimize.
[2022-05-20 02:52:00] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2022-05-20 02:52:00] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 1 ms to minimize.
[2022-05-20 02:52:01] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 1 ms to minimize.
[2022-05-20 02:52:01] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 1 ms to minimize.
[2022-05-20 02:52:01] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2022-05-20 02:52:02] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2022-05-20 02:52:02] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2022-05-20 02:52:02] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2022-05-20 02:52:03] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2022-05-20 02:52:03] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2022-05-20 02:52:03] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2022-05-20 02:52:03] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 1 ms to minimize.
[2022-05-20 02:52:04] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2022-05-20 02:52:04] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2022-05-20 02:52:04] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 1 ms to minimize.
[2022-05-20 02:52:05] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 0 ms to minimize.
[2022-05-20 02:52:05] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 0 ms to minimize.
[2022-05-20 02:52:05] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 1 ms to minimize.
[2022-05-20 02:52:05] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2022-05-20 02:52:06] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2022-05-20 02:52:06] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 0 ms to minimize.
[2022-05-20 02:52:06] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 0 ms to minimize.
[2022-05-20 02:52:07] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 0 ms to minimize.
[2022-05-20 02:52:07] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2022-05-20 02:52:07] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 0 ms to minimize.
[2022-05-20 02:52:07] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 1 ms to minimize.
[2022-05-20 02:52:08] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 0 ms to minimize.
[2022-05-20 02:52:08] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2022-05-20 02:52:08] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2022-05-20 02:52:08] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2022-05-20 02:52:09] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2022-05-20 02:52:09] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2022-05-20 02:52:09] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2022-05-20 02:52:09] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 1 ms to minimize.
[2022-05-20 02:52:10] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2022-05-20 02:52:10] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2022-05-20 02:52:10] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2022-05-20 02:52:11] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2022-05-20 02:52:11] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2022-05-20 02:52:11] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2022-05-20 02:52:11] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2022-05-20 02:52:12] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2022-05-20 02:52:12] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2022-05-20 02:52:12] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2022-05-20 02:52:15] [INFO ] Deduced a trap composed of 2 places in 2529 ms of which 3 ms to minimize.
[2022-05-20 02:52:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 02:52:15] [INFO ] After 27543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 644 ms.
Support contains 5 out of 3106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3106/3106 places, 2606/2606 transitions.
Applied a total of 0 rules in 138 ms. Remains 3106 /3106 variables (removed 0) and now considering 2606/2606 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3106/3106 places, 2606/2606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 79646 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 79646 steps, saw 72415 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 2606 rows 3106 cols
[2022-05-20 02:52:19] [INFO ] Computed 1101 place invariants in 51 ms
[2022-05-20 02:52:20] [INFO ] [Real]Absence check using 1055 positive place invariants in 193 ms returned sat
[2022-05-20 02:52:20] [INFO ] [Real]Absence check using 1055 positive and 46 generalized place invariants in 9 ms returned sat
[2022-05-20 02:52:22] [INFO ] After 2879ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:52:23] [INFO ] [Nat]Absence check using 1055 positive place invariants in 196 ms returned sat
[2022-05-20 02:52:23] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 9 ms returned sat
[2022-05-20 02:52:25] [INFO ] After 1775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:52:25] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 1 ms to minimize.
[2022-05-20 02:52:26] [INFO ] Deduced a trap composed of 5 places in 375 ms of which 0 ms to minimize.
[2022-05-20 02:52:26] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2022-05-20 02:52:27] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 0 ms to minimize.
[2022-05-20 02:52:27] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 1 ms to minimize.
[2022-05-20 02:52:27] [INFO ] Deduced a trap composed of 6 places in 364 ms of which 1 ms to minimize.
[2022-05-20 02:52:28] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2022-05-20 02:52:28] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 1 ms to minimize.
[2022-05-20 02:52:29] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 1 ms to minimize.
[2022-05-20 02:52:29] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 1 ms to minimize.
[2022-05-20 02:52:30] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 0 ms to minimize.
[2022-05-20 02:52:30] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 0 ms to minimize.
[2022-05-20 02:52:31] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 0 ms to minimize.
[2022-05-20 02:52:31] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 1 ms to minimize.
[2022-05-20 02:52:31] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2022-05-20 02:52:32] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2022-05-20 02:52:32] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2022-05-20 02:52:32] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2022-05-20 02:52:33] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
[2022-05-20 02:52:33] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2022-05-20 02:52:33] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2022-05-20 02:52:34] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:52:34] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2022-05-20 02:52:34] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2022-05-20 02:52:35] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:52:35] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:52:35] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2022-05-20 02:52:36] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2022-05-20 02:52:36] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 0 ms to minimize.
[2022-05-20 02:52:36] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 1 ms to minimize.
[2022-05-20 02:52:36] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2022-05-20 02:52:37] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2022-05-20 02:52:37] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2022-05-20 02:52:37] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2022-05-20 02:52:38] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 0 ms to minimize.
[2022-05-20 02:52:38] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2022-05-20 02:52:38] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2022-05-20 02:52:39] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2022-05-20 02:52:39] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2022-05-20 02:52:39] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 0 ms to minimize.
[2022-05-20 02:52:39] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2022-05-20 02:52:40] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2022-05-20 02:52:40] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2022-05-20 02:52:40] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2022-05-20 02:52:41] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2022-05-20 02:52:41] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 0 ms to minimize.
[2022-05-20 02:52:41] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2022-05-20 02:52:41] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2022-05-20 02:52:42] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2022-05-20 02:52:42] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2022-05-20 02:52:42] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2022-05-20 02:52:42] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2022-05-20 02:52:43] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2022-05-20 02:52:43] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2022-05-20 02:52:43] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2022-05-20 02:52:44] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2022-05-20 02:52:44] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2022-05-20 02:52:44] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2022-05-20 02:52:44] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 0 ms to minimize.
[2022-05-20 02:52:45] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2022-05-20 02:52:45] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2022-05-20 02:52:45] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2022-05-20 02:52:45] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2022-05-20 02:52:46] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2022-05-20 02:52:46] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 0 ms to minimize.
[2022-05-20 02:52:46] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2022-05-20 02:52:46] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2022-05-20 02:52:46] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2022-05-20 02:52:47] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2022-05-20 02:52:47] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2022-05-20 02:52:47] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2022-05-20 02:52:47] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2022-05-20 02:52:47] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 22690 ms
[2022-05-20 02:52:47] [INFO ] After 24470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-20 02:52:47] [INFO ] After 25008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 101 ms.
Support contains 4 out of 3106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3106/3106 places, 2606/2606 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 3105 transition count 2605
Applied a total of 2 rules in 234 ms. Remains 3105 /3106 variables (removed 1) and now considering 2605/2606 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3105/3106 places, 2605/2606 transitions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND p0 p2)), (F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F (AND p1 p0)), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 4 factoid took 364 ms. Reduced automaton from 9 states, 21 edges and 3 AP to 9 states, 21 edges and 3 AP.
Stuttering acceptance computed with spot in 323 ms :[true, p1, p0, (AND p1 p0), (AND p1 p0 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 301 ms :[true, p1, p0, (AND p1 p0), (AND p1 p0 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 292 ms :[true, p1, p0, (AND p1 p0), (AND p1 p0 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 6 reset in 1620 ms.
Product exploration explored 100000 steps with 6 reset in 1981 ms.
Applying partial POR strategy [true, true, true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 268 ms :[true, p1, p0, (AND p1 p0), (AND p1 p0 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Support contains 5 out of 6104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6104 transition count 5604
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 700 place count 6104 transition count 5605
Deduced a syphon composed of 901 places in 24 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 901 place count 6104 transition count 5605
Performed 2096 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2997 places in 11 ms
Iterating global reduction 1 with 2096 rules applied. Total rules applied 2997 place count 6104 transition count 5605
Renaming transitions due to excessive name length > 1024 char.
Discarding 700 places :
Symmetric choice reduction at 1 with 700 rule applications. Total rules 3697 place count 5404 transition count 4905
Deduced a syphon composed of 2297 places in 10 ms
Iterating global reduction 1 with 700 rules applied. Total rules applied 4397 place count 5404 transition count 4905
Deduced a syphon composed of 2297 places in 10 ms
Applied a total of 4397 rules in 3814 ms. Remains 5404 /6104 variables (removed 700) and now considering 4905/5604 (removed 699) transitions.
[2022-05-20 02:52:57] [INFO ] Redundant transitions in 225 ms returned []
// Phase 1: matrix 4905 rows 5404 cols
[2022-05-20 02:52:57] [INFO ] Computed 1101 place invariants in 119 ms
[2022-05-20 02:53:00] [INFO ] Dead Transitions using invariants and state equation in 3283 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5404/6104 places, 4905/5604 transitions.
Finished structural reductions, in 1 iterations. Remains : 5404/6104 places, 4905/5604 transitions.
Product exploration explored 100000 steps with 12 reset in 1608 ms.
Product exploration explored 100000 steps with 12 reset in 1952 ms.
Built C files in :
/tmp/ltsmin10866580189177142644
[2022-05-20 02:53:04] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10866580189177142644
Running compilation step : cd /tmp/ltsmin10866580189177142644;'/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/ltsmin10866580189177142644;'/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/ltsmin10866580189177142644;'/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 5 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Applied a total of 0 rules in 574 ms. Remains 6104 /6104 variables (removed 0) and now considering 5604/5604 (removed 0) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:53:07] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 02:53:10] [INFO ] Implicit Places using invariants in 2125 ms returned []
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:53:10] [INFO ] Computed 1101 place invariants in 16 ms
[2022-05-20 02:53:12] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned []
Implicit Place search using SMT with State Equation took 4215 ms to find 0 implicit places.
// Phase 1: matrix 5604 rows 6104 cols
[2022-05-20 02:53:12] [INFO ] Computed 1101 place invariants in 16 ms
[2022-05-20 02:53:16] [INFO ] Dead Transitions using invariants and state equation in 3872 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6104/6104 places, 5604/5604 transitions.
Built C files in :
/tmp/ltsmin8225103139617019813
[2022-05-20 02:53:16] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8225103139617019813
Running compilation step : cd /tmp/ltsmin8225103139617019813;'/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/ltsmin8225103139617019813;'/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/ltsmin8225103139617019813;'/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:53:19] [INFO ] Flatten gal took : 135 ms
[2022-05-20 02:53:19] [INFO ] Flatten gal took : 140 ms
[2022-05-20 02:53:19] [INFO ] Time to serialize gal into /tmp/LTL18393097655510172734.gal : 13 ms
[2022-05-20 02:53:19] [INFO ] Time to serialize properties into /tmp/LTL1940846388782374041.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/LTL18393097655510172734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1940846388782374041.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/LTL1839309...267
Read 1 LTL properties
Checking formula 0 : !((!((X(F("(((p4488==1)&&(p4511==1))&&(p2892==1))")))U(X(X((X(F("(p5054!=1)")))&&("(p6146==1)")))))))
Formula 0 simplified : XF"(((p4488==1)&&(p4511==1))&&(p2892==1))" U XX("(p6146==1)" & XF"(p5054!=1)")
Detected timeout of ITS tools.
[2022-05-20 02:53:34] [INFO ] Flatten gal took : 141 ms
[2022-05-20 02:53:34] [INFO ] Applying decomposition
[2022-05-20 02:53:34] [INFO ] Flatten gal took : 144 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/graph10140694758394343551.txt' '-o' '/tmp/graph10140694758394343551.bin' '-w' '/tmp/graph10140694758394343551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10140694758394343551.bin' '-l' '-1' '-v' '-w' '/tmp/graph10140694758394343551.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:53:35] [INFO ] Decomposing Gal with order
[2022-05-20 02:53:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:53:36] [INFO ] Removed a total of 900 redundant transitions.
[2022-05-20 02:53:37] [INFO ] Flatten gal took : 223 ms
[2022-05-20 02:53:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2022-05-20 02:53:37] [INFO ] Time to serialize gal into /tmp/LTL9015733354700195982.gal : 33 ms
[2022-05-20 02:53:37] [INFO ] Time to serialize properties into /tmp/LTL7743564374388483533.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/LTL9015733354700195982.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7743564374388483533.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/LTL9015733...245
Read 1 LTL properties
Checking formula 0 : !((!((X(F("(((i45.u1591.p4488==1)&&(i45.u1598.p4511==1))&&(i30.u1024.p2892==1))")))U(X(X((X(F("(i50.u1788.p5054!=1)")))&&("(i64.i0.i1....181
Formula 0 simplified : XF"(((i45.u1591.p4488==1)&&(i45.u1598.p4511==1))&&(i30.u1024.p2892==1))" U XX("(i64.i0.i1.i0.u2180.p6146==1)" & XF"(i50.u1788.p5054!...160
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1908977079148973447
[2022-05-20 02:53:52] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1908977079148973447
Running compilation step : cd /tmp/ltsmin1908977079148973447;'/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/ltsmin1908977079148973447;'/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/ltsmin1908977079148973447;'/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-LTLFireability-15 finished in 330221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((X(G(p0))||X(G(p1)))))&&F(p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(G(F((X(p0) U p0))))&&p1))))'
Found a CL insensitive property : ShieldPPPs-PT-100B-LTLFireability-04
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 2 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 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 6111 transition count 4909
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5409 transition count 4909
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 5409 transition count 4409
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 4909 transition count 4409
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2412 place count 4901 transition count 4401
Iterating global reduction 2 with 8 rules applied. Total rules applied 2420 place count 4901 transition count 4401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2420 place count 4901 transition count 4400
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 2422 place count 4900 transition count 4400
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 2 with 3592 rules applied. Total rules applied 6014 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 6016 place count 3102 transition count 2602
Applied a total of 6016 rules in 1447 ms. Remains 3102 /6112 variables (removed 3010) and now considering 2602/5612 (removed 3010) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:53:57] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:53:58] [INFO ] Implicit Places using invariants in 1723 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:53:58] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:54:02] [INFO ] Implicit Places using invariants and state equation in 3911 ms returned []
Implicit Place search using SMT with State Equation took 5636 ms to find 0 implicit places.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:54:02] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 02:54:04] [INFO ] Dead Transitions using invariants and state equation in 1726 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3102/6112 places, 2602/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/6112 places, 2602/5612 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s639 1), p1:(EQ s2851 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 28 reset in 1661 ms.
Product exploration explored 100000 steps with 25 reset in 2076 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)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 272 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:54:08] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:54:09] [INFO ] [Real]Absence check using 1101 positive place invariants in 201 ms returned sat
[2022-05-20 02:54:10] [INFO ] After 1400ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:54:10] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2022-05-20 02:54:11] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2022-05-20 02:54:11] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-05-20 02:54:11] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2022-05-20 02:54:11] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2022-05-20 02:54:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 843 ms
[2022-05-20 02:54:11] [INFO ] After 2313ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:54:11] [INFO ] After 2856ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:54:12] [INFO ] [Nat]Absence check using 1101 positive place invariants in 202 ms returned sat
[2022-05-20 02:54:13] [INFO ] After 1359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:54:13] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2022-05-20 02:54:13] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2022-05-20 02:54:14] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2022-05-20 02:54:14] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2022-05-20 02:54:14] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2022-05-20 02:54:14] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2022-05-20 02:54:14] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2022-05-20 02:54:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1095 ms
[2022-05-20 02:54:14] [INFO ] After 2520ms 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:54:14] [INFO ] After 3156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 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 346 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 189 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 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 156137 steps, run timeout after 3002 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156137 steps, saw 154498 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:54:18] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 02:54:19] [INFO ] [Real]Absence check using 1101 positive place invariants in 202 ms returned sat
[2022-05-20 02:54:20] [INFO ] After 1367ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:54:20] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2022-05-20 02:54:20] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 0 ms to minimize.
[2022-05-20 02:54:21] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2022-05-20 02:54:21] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2022-05-20 02:54:21] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2022-05-20 02:54:21] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-05-20 02:54:21] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2022-05-20 02:54:21] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2022-05-20 02:54:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1523 ms
[2022-05-20 02:54:22] [INFO ] After 2960ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:54:22] [INFO ] After 3499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:54:22] [INFO ] [Nat]Absence check using 1101 positive place invariants in 200 ms returned sat
[2022-05-20 02:54:24] [INFO ] After 1402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:54:24] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2022-05-20 02:54:24] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2022-05-20 02:54:24] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2022-05-20 02:54:24] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 0 ms to minimize.
[2022-05-20 02:54:24] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2022-05-20 02:54:25] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2022-05-20 02:54:25] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2022-05-20 02:54:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1299 ms
[2022-05-20 02:54:25] [INFO ] After 2765ms 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:54:25] [INFO ] After 3390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 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 114 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 116 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:54:25] [INFO ] Computed 1101 place invariants in 38 ms
[2022-05-20 02:54:27] [INFO ] Implicit Places using invariants in 2167 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:54:27] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 02:54:32] [INFO ] Implicit Places using invariants and state equation in 4679 ms returned []
Implicit Place search using SMT with State Equation took 6847 ms to find 0 implicit places.
[2022-05-20 02:54:32] [INFO ] Redundant transitions in 79 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:54:32] [INFO ] Computed 1101 place invariants in 38 ms
[2022-05-20 02:54:34] [INFO ] Dead Transitions using invariants and state equation in 1778 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 115 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:54:34] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 02:54:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 206 ms returned sat
[2022-05-20 02:54:36] [INFO ] After 1381ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:54:36] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2022-05-20 02:54:36] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 0 ms to minimize.
[2022-05-20 02:54:37] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2022-05-20 02:54:37] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2022-05-20 02:54:37] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 0 ms to minimize.
[2022-05-20 02:54:37] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2022-05-20 02:54:37] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2022-05-20 02:54:37] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2022-05-20 02:54:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1538 ms
[2022-05-20 02:54:38] [INFO ] After 2986ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:54:38] [INFO ] After 3536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:54:38] [INFO ] [Nat]Absence check using 1101 positive place invariants in 207 ms returned sat
[2022-05-20 02:54:40] [INFO ] After 1408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:54:40] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2022-05-20 02:54:40] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2022-05-20 02:54:40] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2022-05-20 02:54:40] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2022-05-20 02:54:40] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2022-05-20 02:54:41] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-05-20 02:54:41] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2022-05-20 02:54:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1292 ms
[2022-05-20 02:54:41] [INFO ] After 2763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-20 02:54:41] [INFO ] After 3397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:54:42] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 02:54:46] [INFO ] [Real]Absence check using 1101 positive place invariants in 1477 ms returned sat
[2022-05-20 02:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:54:57] [INFO ] [Real]Absence check using state equation in 10246 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:54:57] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:55:01] [INFO ] [Real]Absence check using 1101 positive place invariants in 1432 ms returned sat
[2022-05-20 02:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:55:12] [INFO ] [Real]Absence check using state equation in 10159 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 3102 places. Attempting structural reductions.
Starting structural reductions in LTL 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:55:12] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 02:55:13] [INFO ] Implicit Places using invariants in 1745 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:55:13] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 02:55:17] [INFO ] Implicit Places using invariants and state equation in 3985 ms returned []
Implicit Place search using SMT with State Equation took 5730 ms to find 0 implicit places.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:55:17] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 02:55:19] [INFO ] Dead Transitions using invariants and state equation in 1739 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 : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 224 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:55:20] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:55:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 202 ms returned sat
[2022-05-20 02:55:22] [INFO ] After 1355ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:55:22] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2022-05-20 02:55:22] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2022-05-20 02:55:22] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2022-05-20 02:55:22] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2022-05-20 02:55:23] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2022-05-20 02:55:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 807 ms
[2022-05-20 02:55:23] [INFO ] After 2227ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:55:23] [INFO ] After 2778ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:55:23] [INFO ] [Nat]Absence check using 1101 positive place invariants in 204 ms returned sat
[2022-05-20 02:55:25] [INFO ] After 1397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:55:25] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 0 ms to minimize.
[2022-05-20 02:55:25] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-20 02:55:25] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2022-05-20 02:55:25] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-20 02:55:25] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2022-05-20 02:55:26] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2022-05-20 02:55:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2022-05-20 02:55:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1103 ms
[2022-05-20 02:55:26] [INFO ] After 2566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2022-05-20 02:55:26] [INFO ] After 3198ms 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 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 348 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 187 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 157266 steps, run timeout after 3002 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157266 steps, saw 155620 distinct states, run finished after 3003 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:55:30] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 02:55:30] [INFO ] [Real]Absence check using 1101 positive place invariants in 208 ms returned sat
[2022-05-20 02:55:31] [INFO ] After 1341ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:55:32] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2022-05-20 02:55:32] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2022-05-20 02:55:32] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2022-05-20 02:55:32] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2022-05-20 02:55:32] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2022-05-20 02:55:33] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2022-05-20 02:55:33] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2022-05-20 02:55:33] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2022-05-20 02:55:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1527 ms
[2022-05-20 02:55:33] [INFO ] After 2937ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:55:33] [INFO ] After 3478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:55:34] [INFO ] [Nat]Absence check using 1101 positive place invariants in 202 ms returned sat
[2022-05-20 02:55:35] [INFO ] After 1392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:55:35] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2022-05-20 02:55:35] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2022-05-20 02:55:36] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2022-05-20 02:55:36] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2022-05-20 02:55:36] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2022-05-20 02:55:36] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-05-20 02:55:36] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2022-05-20 02:55:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1283 ms
[2022-05-20 02:55:36] [INFO ] After 2737ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2022-05-20 02:55:36] [INFO ] After 3364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 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 113 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 113 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:55:37] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 02:55:39] [INFO ] Implicit Places using invariants in 2131 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:55:39] [INFO ] Computed 1101 place invariants in 28 ms
[2022-05-20 02:55:43] [INFO ] Implicit Places using invariants and state equation in 4652 ms returned []
Implicit Place search using SMT with State Equation took 6785 ms to find 0 implicit places.
[2022-05-20 02:55:44] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 02:55:44] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 02:55:45] [INFO ] Dead Transitions using invariants and state equation in 1754 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 113 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:55:45] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:55:46] [INFO ] [Real]Absence check using 1101 positive place invariants in 202 ms returned sat
[2022-05-20 02:55:47] [INFO ] After 1365ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:55:48] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2022-05-20 02:55:48] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2022-05-20 02:55:48] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2022-05-20 02:55:48] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2022-05-20 02:55:48] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2022-05-20 02:55:49] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-05-20 02:55:49] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2022-05-20 02:55:49] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2022-05-20 02:55:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1523 ms
[2022-05-20 02:55:49] [INFO ] After 2960ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:55:49] [INFO ] After 3499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:55:49] [INFO ] [Nat]Absence check using 1101 positive place invariants in 204 ms returned sat
[2022-05-20 02:55:51] [INFO ] After 1393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:55:51] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2022-05-20 02:55:51] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2022-05-20 02:55:51] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2022-05-20 02:55:52] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2022-05-20 02:55:52] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2022-05-20 02:55:52] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-05-20 02:55:52] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2022-05-20 02:55:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1283 ms
[2022-05-20 02:55:52] [INFO ] After 2740ms 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:55:52] [INFO ] After 3365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:55:53] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:55:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 1441 ms returned sat
[2022-05-20 02:55:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:56:08] [INFO ] [Real]Absence check using state equation in 10338 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:56:08] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 02:56:13] [INFO ] [Real]Absence check using 1101 positive place invariants in 1559 ms returned sat
[2022-05-20 02:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:56:23] [INFO ] [Real]Absence check using state equation in 10008 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 28 reset in 1615 ms.
Product exploration explored 100000 steps with 23 reset in 2141 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
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.
[2022-05-20 02:56:27] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:56:27] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:56:29] [INFO ] Dead Transitions using invariants and state equation in 1705 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Product exploration explored 100000 steps with 24 reset in 1603 ms.
Product exploration explored 100000 steps with 23 reset in 2092 ms.
Built C files in :
/tmp/ltsmin6083763054214877466
[2022-05-20 02:56:33] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6083763054214877466
Running compilation step : cd /tmp/ltsmin6083763054214877466;'/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/ltsmin6083763054214877466;'/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/ltsmin6083763054214877466;'/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 LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 108 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:56:36] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:56:38] [INFO ] Implicit Places using invariants in 1733 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:56:38] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:56:42] [INFO ] Implicit Places using invariants and state equation in 3947 ms returned []
Implicit Place search using SMT with State Equation took 5681 ms to find 0 implicit places.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 02:56:42] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:56:43] [INFO ] Dead Transitions using invariants and state equation in 1696 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Built C files in :
/tmp/ltsmin17231948932749758315
[2022-05-20 02:56:43] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17231948932749758315
Running compilation step : cd /tmp/ltsmin17231948932749758315;'/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/ltsmin17231948932749758315;'/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/ltsmin17231948932749758315;'/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:56:46] [INFO ] Flatten gal took : 75 ms
[2022-05-20 02:56:47] [INFO ] Flatten gal took : 76 ms
[2022-05-20 02:56:47] [INFO ] Time to serialize gal into /tmp/LTL5109646264728147588.gal : 7 ms
[2022-05-20 02:56:47] [INFO ] Time to serialize properties into /tmp/LTL11443472475174649008.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/LTL5109646264728147588.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11443472475174649008.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/LTL5109646...267
Read 1 LTL properties
Checking formula 0 : !((F(X((X(G(F((X("(p1476==1)"))U("(p1476==1)")))))&&("(p6257==1)")))))
Formula 0 simplified : !FX("(p6257==1)" & XGF(X"(p1476==1)" U "(p1476==1)"))
Detected timeout of ITS tools.
[2022-05-20 02:57:02] [INFO ] Flatten gal took : 76 ms
[2022-05-20 02:57:02] [INFO ] Applying decomposition
[2022-05-20 02:57:02] [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/graph53661049856582615.txt' '-o' '/tmp/graph53661049856582615.bin' '-w' '/tmp/graph53661049856582615.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph53661049856582615.bin' '-l' '-1' '-v' '-w' '/tmp/graph53661049856582615.weights' '-q' '0' '-e' '0.001'
[2022-05-20 02:57:02] [INFO ] Decomposing Gal with order
[2022-05-20 02:57:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:57:02] [INFO ] Removed a total of 602 redundant transitions.
[2022-05-20 02:57:02] [INFO ] Flatten gal took : 114 ms
[2022-05-20 02:57:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1192 labels/synchronizations in 15 ms.
[2022-05-20 02:57:02] [INFO ] Time to serialize gal into /tmp/LTL1010806765583129163.gal : 16 ms
[2022-05-20 02:57:02] [INFO ] Time to serialize properties into /tmp/LTL17900130003957122345.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1010806765583129163.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17900130003957122345.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/LTL1010806...246
Read 1 LTL properties
Checking formula 0 : !((F(X((X(G(F((X("(i12.i0.i2.u228.p1476==1)"))U("(i12.i0.i2.u228.p1476==1)")))))&&("(i52.i0.i3.u1013.p6257==1)")))))
Formula 0 simplified : !FX("(i52.i0.i3.u1013.p6257==1)" & XGF(X"(i12.i0.i2.u228.p1476==1)" U "(i12.i0.i2.u228.p1476==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8593788512647969507
[2022-05-20 02:57:17] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8593788512647969507
Running compilation step : cd /tmp/ltsmin8593788512647969507;'/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/ltsmin8593788512647969507;'/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/ltsmin8593788512647969507;'/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-LTLFireability-04 finished in 205605 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0)||G(p1)||p2) U G(p1)))'
Found a SL insensitive property : ShieldPPPs-PT-100B-LTLFireability-06
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Support contains 4 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 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 6111 transition count 4909
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5409 transition count 4909
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 5409 transition count 4409
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 4909 transition count 4409
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2414 place count 4899 transition count 4399
Iterating global reduction 2 with 10 rules applied. Total rules applied 2424 place count 4899 transition count 4399
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2424 place count 4899 transition count 4396
Deduced a syphon composed of 3 places in 20 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2430 place count 4896 transition count 4396
Performed 1791 Post agglomeration using F-continuation condition.Transition count delta: 1791
Deduced a syphon composed of 1791 places in 6 ms
Reduce places removed 1791 places and 0 transitions.
Iterating global reduction 2 with 3582 rules applied. Total rules applied 6012 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 6014 place count 3103 transition count 2603
Applied a total of 6014 rules in 1407 ms. Remains 3103 /6112 variables (removed 3009) and now considering 2603/5612 (removed 3009) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:57:22] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 02:57:24] [INFO ] Implicit Places using invariants in 1713 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:57:24] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 02:57:28] [INFO ] Implicit Places using invariants and state equation in 4054 ms returned []
Implicit Place search using SMT with State Equation took 5768 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:57:28] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 02:57:30] [INFO ] Dead Transitions using invariants and state equation in 1711 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3103/6112 places, 2603/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/6112 places, 2603/5612 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s1 1), p2:(EQ s804 1), p0:(AND (EQ s2841 1) (EQ s2851 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33470 reset in 2763 ms.
Product exploration explored 100000 steps with 33261 reset in 2983 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/3103 stabilizing places and 2/2603 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 9 factoid took 608 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:57:36] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 02:57:37] [INFO ] [Real]Absence check using 1101 positive place invariants in 208 ms returned sat
[2022-05-20 02:57:38] [INFO ] After 1356ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:57:39] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 1 ms to minimize.
[2022-05-20 02:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 510 ms
[2022-05-20 02:57:39] [INFO ] After 1938ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:57:39] [INFO ] After 2483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:57:39] [INFO ] [Nat]Absence check using 1101 positive place invariants in 205 ms returned sat
[2022-05-20 02:57:41] [INFO ] After 1353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:57:41] [INFO ] Deduced a trap composed of 29 places in 312 ms of which 1 ms to minimize.
[2022-05-20 02:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 500 ms
[2022-05-20 02:57:41] [INFO ] After 1922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2022-05-20 02:57:41] [INFO ] After 2547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Partial Free-agglomeration rule applied 681 times.
Drop transitions removed 681 transitions
Iterating global reduction 0 with 681 rules applied. Total rules applied 681 place count 3103 transition count 2603
Applied a total of 681 rules in 233 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 159339 steps, run timeout after 3003 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159339 steps, saw 157682 distinct states, run finished after 3003 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:57:45] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 02:57:46] [INFO ] [Real]Absence check using 1089 positive place invariants in 207 ms returned sat
[2022-05-20 02:57:46] [INFO ] [Real]Absence check using 1089 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-20 02:57:47] [INFO ] After 1394ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:57:48] [INFO ] Deduced a trap composed of 17 places in 586 ms of which 1 ms to minimize.
[2022-05-20 02:57:48] [INFO ] Deduced a trap composed of 29 places in 564 ms of which 1 ms to minimize.
[2022-05-20 02:57:49] [INFO ] Deduced a trap composed of 34 places in 574 ms of which 1 ms to minimize.
[2022-05-20 02:57:50] [INFO ] Deduced a trap composed of 17 places in 515 ms of which 2 ms to minimize.
[2022-05-20 02:57:50] [INFO ] Deduced a trap composed of 39 places in 478 ms of which 1 ms to minimize.
[2022-05-20 02:57:51] [INFO ] Deduced a trap composed of 29 places in 469 ms of which 1 ms to minimize.
[2022-05-20 02:57:51] [INFO ] Deduced a trap composed of 17 places in 397 ms of which 1 ms to minimize.
[2022-05-20 02:57:52] [INFO ] Deduced a trap composed of 23 places in 407 ms of which 1 ms to minimize.
[2022-05-20 02:57:52] [INFO ] Deduced a trap composed of 40 places in 379 ms of which 1 ms to minimize.
[2022-05-20 02:57:53] [INFO ] Deduced a trap composed of 45 places in 382 ms of which 1 ms to minimize.
[2022-05-20 02:57:53] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 1 ms to minimize.
[2022-05-20 02:57:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6265 ms
[2022-05-20 02:57:53] [INFO ] After 7732ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:57:53] [INFO ] After 8291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:57:54] [INFO ] [Nat]Absence check using 1089 positive place invariants in 209 ms returned sat
[2022-05-20 02:57:54] [INFO ] [Nat]Absence check using 1089 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-20 02:57:57] [INFO ] After 3024ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:57:58] [INFO ] Deduced a trap composed of 17 places in 683 ms of which 1 ms to minimize.
[2022-05-20 02:57:58] [INFO ] Deduced a trap composed of 17 places in 646 ms of which 2 ms to minimize.
[2022-05-20 02:57:59] [INFO ] Deduced a trap composed of 17 places in 637 ms of which 1 ms to minimize.
[2022-05-20 02:58:00] [INFO ] Deduced a trap composed of 17 places in 609 ms of which 1 ms to minimize.
[2022-05-20 02:58:01] [INFO ] Deduced a trap composed of 17 places in 572 ms of which 1 ms to minimize.
[2022-05-20 02:58:01] [INFO ] Deduced a trap composed of 23 places in 599 ms of which 1 ms to minimize.
[2022-05-20 02:58:02] [INFO ] Deduced a trap composed of 78 places in 602 ms of which 1 ms to minimize.
[2022-05-20 02:58:03] [INFO ] Deduced a trap composed of 23 places in 608 ms of which 2 ms to minimize.
[2022-05-20 02:58:03] [INFO ] Deduced a trap composed of 17 places in 601 ms of which 1 ms to minimize.
[2022-05-20 02:58:04] [INFO ] Deduced a trap composed of 87 places in 566 ms of which 1 ms to minimize.
[2022-05-20 02:58:05] [INFO ] Deduced a trap composed of 34 places in 568 ms of which 1 ms to minimize.
[2022-05-20 02:58:05] [INFO ] Deduced a trap composed of 29 places in 563 ms of which 1 ms to minimize.
[2022-05-20 02:58:06] [INFO ] Deduced a trap composed of 29 places in 561 ms of which 2 ms to minimize.
[2022-05-20 02:58:07] [INFO ] Deduced a trap composed of 23 places in 557 ms of which 1 ms to minimize.
[2022-05-20 02:58:07] [INFO ] Deduced a trap composed of 34 places in 546 ms of which 2 ms to minimize.
[2022-05-20 02:58:08] [INFO ] Deduced a trap composed of 97 places in 504 ms of which 1 ms to minimize.
[2022-05-20 02:58:08] [INFO ] Deduced a trap composed of 23 places in 328 ms of which 1 ms to minimize.
[2022-05-20 02:58:09] [INFO ] Deduced a trap composed of 17 places in 342 ms of which 1 ms to minimize.
[2022-05-20 02:58:09] [INFO ] Deduced a trap composed of 17 places in 327 ms of which 0 ms to minimize.
[2022-05-20 02:58:10] [INFO ] Deduced a trap composed of 17 places in 335 ms of which 1 ms to minimize.
[2022-05-20 02:58:10] [INFO ] Deduced a trap composed of 39 places in 394 ms of which 1 ms to minimize.
[2022-05-20 02:58:11] [INFO ] Deduced a trap composed of 17 places in 341 ms of which 1 ms to minimize.
[2022-05-20 02:58:11] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 1 ms to minimize.
[2022-05-20 02:58:11] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 14395 ms
[2022-05-20 02:58:11] [INFO ] After 17544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-20 02:58:12] [INFO ] After 18210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 116 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 115 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:58:12] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 02:58:14] [INFO ] Implicit Places using invariants in 2148 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:58:14] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:58:19] [INFO ] Implicit Places using invariants and state equation in 4890 ms returned []
Implicit Place search using SMT with State Equation took 7040 ms to find 0 implicit places.
[2022-05-20 02:58:19] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:58:19] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 02:58:21] [INFO ] Dead Transitions using invariants and state equation in 1753 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 117 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:58:21] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 02:58:21] [INFO ] [Real]Absence check using 1089 positive place invariants in 205 ms returned sat
[2022-05-20 02:58:21] [INFO ] [Real]Absence check using 1089 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-20 02:58:23] [INFO ] After 1369ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:58:23] [INFO ] Deduced a trap composed of 17 places in 590 ms of which 1 ms to minimize.
[2022-05-20 02:58:24] [INFO ] Deduced a trap composed of 29 places in 572 ms of which 1 ms to minimize.
[2022-05-20 02:58:25] [INFO ] Deduced a trap composed of 34 places in 579 ms of which 2 ms to minimize.
[2022-05-20 02:58:25] [INFO ] Deduced a trap composed of 17 places in 542 ms of which 1 ms to minimize.
[2022-05-20 02:58:26] [INFO ] Deduced a trap composed of 39 places in 492 ms of which 1 ms to minimize.
[2022-05-20 02:58:27] [INFO ] Deduced a trap composed of 29 places in 476 ms of which 1 ms to minimize.
[2022-05-20 02:58:27] [INFO ] Deduced a trap composed of 17 places in 385 ms of which 1 ms to minimize.
[2022-05-20 02:58:28] [INFO ] Deduced a trap composed of 23 places in 411 ms of which 1 ms to minimize.
[2022-05-20 02:58:28] [INFO ] Deduced a trap composed of 40 places in 407 ms of which 1 ms to minimize.
[2022-05-20 02:58:29] [INFO ] Deduced a trap composed of 45 places in 388 ms of which 1 ms to minimize.
[2022-05-20 02:58:29] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 1 ms to minimize.
[2022-05-20 02:58:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6377 ms
[2022-05-20 02:58:29] [INFO ] After 7829ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:58:29] [INFO ] After 8386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:58:30] [INFO ] [Nat]Absence check using 1089 positive place invariants in 204 ms returned sat
[2022-05-20 02:58:30] [INFO ] [Nat]Absence check using 1089 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-20 02:58:33] [INFO ] After 3037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:58:34] [INFO ] Deduced a trap composed of 17 places in 675 ms of which 1 ms to minimize.
[2022-05-20 02:58:34] [INFO ] Deduced a trap composed of 17 places in 644 ms of which 1 ms to minimize.
[2022-05-20 02:58:35] [INFO ] Deduced a trap composed of 17 places in 636 ms of which 1 ms to minimize.
[2022-05-20 02:58:36] [INFO ] Deduced a trap composed of 17 places in 616 ms of which 1 ms to minimize.
[2022-05-20 02:58:36] [INFO ] Deduced a trap composed of 17 places in 581 ms of which 1 ms to minimize.
[2022-05-20 02:58:37] [INFO ] Deduced a trap composed of 23 places in 599 ms of which 1 ms to minimize.
[2022-05-20 02:58:38] [INFO ] Deduced a trap composed of 78 places in 612 ms of which 1 ms to minimize.
[2022-05-20 02:58:39] [INFO ] Deduced a trap composed of 23 places in 620 ms of which 1 ms to minimize.
[2022-05-20 02:58:39] [INFO ] Deduced a trap composed of 17 places in 609 ms of which 2 ms to minimize.
[2022-05-20 02:58:40] [INFO ] Deduced a trap composed of 87 places in 566 ms of which 2 ms to minimize.
[2022-05-20 02:58:41] [INFO ] Deduced a trap composed of 34 places in 563 ms of which 1 ms to minimize.
[2022-05-20 02:58:41] [INFO ] Deduced a trap composed of 29 places in 555 ms of which 1 ms to minimize.
[2022-05-20 02:58:42] [INFO ] Deduced a trap composed of 29 places in 585 ms of which 1 ms to minimize.
[2022-05-20 02:58:43] [INFO ] Deduced a trap composed of 23 places in 563 ms of which 1 ms to minimize.
[2022-05-20 02:58:43] [INFO ] Deduced a trap composed of 34 places in 553 ms of which 2 ms to minimize.
[2022-05-20 02:58:44] [INFO ] Deduced a trap composed of 97 places in 494 ms of which 1 ms to minimize.
[2022-05-20 02:58:44] [INFO ] Deduced a trap composed of 23 places in 331 ms of which 1 ms to minimize.
[2022-05-20 02:58:45] [INFO ] Deduced a trap composed of 17 places in 338 ms of which 1 ms to minimize.
[2022-05-20 02:58:45] [INFO ] Deduced a trap composed of 17 places in 331 ms of which 1 ms to minimize.
[2022-05-20 02:58:46] [INFO ] Deduced a trap composed of 17 places in 344 ms of which 1 ms to minimize.
[2022-05-20 02:58:46] [INFO ] Deduced a trap composed of 39 places in 404 ms of which 1 ms to minimize.
[2022-05-20 02:58:47] [INFO ] Deduced a trap composed of 17 places in 333 ms of which 0 ms to minimize.
[2022-05-20 02:58:47] [INFO ] Deduced a trap composed of 23 places in 346 ms of which 1 ms to minimize.
[2022-05-20 02:58:47] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 14452 ms
[2022-05-20 02:58:47] [INFO ] After 17615ms 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:58:47] [INFO ] After 18243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND (NOT p1) p0)), (F p0), (F p1), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 9 factoid took 740 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:58:48] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 02:58:53] [INFO ] [Real]Absence check using 1101 positive place invariants in 1429 ms returned sat
[2022-05-20 02:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:59:03] [INFO ] [Real]Absence check using state equation in 10369 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 109 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:59:04] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 02:59:05] [INFO ] Implicit Places using invariants in 1776 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:59:05] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 02:59:09] [INFO ] Implicit Places using invariants and state equation in 4083 ms returned []
Implicit Place search using SMT with State Equation took 5859 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:59:09] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 02:59:11] [INFO ] Dead Transitions using invariants and state equation in 1741 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
Detected a total of 2/3103 stabilizing places and 2/2603 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 878 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:59:13] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 02:59:13] [INFO ] [Real]Absence check using 1101 positive place invariants in 205 ms returned sat
[2022-05-20 02:59:14] [INFO ] After 1353ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:59:15] [INFO ] Deduced a trap composed of 29 places in 313 ms of which 1 ms to minimize.
[2022-05-20 02:59:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 512 ms
[2022-05-20 02:59:15] [INFO ] After 1937ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:59:15] [INFO ] After 2485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:59:16] [INFO ] [Nat]Absence check using 1101 positive place invariants in 209 ms returned sat
[2022-05-20 02:59:17] [INFO ] After 1348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:59:17] [INFO ] Deduced a trap composed of 29 places in 311 ms of which 1 ms to minimize.
[2022-05-20 02:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 504 ms
[2022-05-20 02:59:17] [INFO ] After 1924ms 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:59:18] [INFO ] After 2574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Partial Free-agglomeration rule applied 681 times.
Drop transitions removed 681 transitions
Iterating global reduction 0 with 681 rules applied. Total rules applied 681 place count 3103 transition count 2603
Applied a total of 681 rules in 251 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 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 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 148321 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148321 steps, saw 146735 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:59:21] [INFO ] Computed 1101 place invariants in 41 ms
[2022-05-20 02:59:22] [INFO ] [Real]Absence check using 1089 positive place invariants in 203 ms returned sat
[2022-05-20 02:59:22] [INFO ] [Real]Absence check using 1089 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-20 02:59:23] [INFO ] After 1373ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:59:24] [INFO ] Deduced a trap composed of 17 places in 575 ms of which 2 ms to minimize.
[2022-05-20 02:59:24] [INFO ] Deduced a trap composed of 29 places in 570 ms of which 1 ms to minimize.
[2022-05-20 02:59:25] [INFO ] Deduced a trap composed of 34 places in 574 ms of which 2 ms to minimize.
[2022-05-20 02:59:26] [INFO ] Deduced a trap composed of 17 places in 526 ms of which 1 ms to minimize.
[2022-05-20 02:59:26] [INFO ] Deduced a trap composed of 39 places in 472 ms of which 1 ms to minimize.
[2022-05-20 02:59:27] [INFO ] Deduced a trap composed of 29 places in 466 ms of which 1 ms to minimize.
[2022-05-20 02:59:27] [INFO ] Deduced a trap composed of 17 places in 401 ms of which 1 ms to minimize.
[2022-05-20 02:59:28] [INFO ] Deduced a trap composed of 23 places in 407 ms of which 1 ms to minimize.
[2022-05-20 02:59:28] [INFO ] Deduced a trap composed of 40 places in 373 ms of which 1 ms to minimize.
[2022-05-20 02:59:29] [INFO ] Deduced a trap composed of 45 places in 371 ms of which 1 ms to minimize.
[2022-05-20 02:59:29] [INFO ] Deduced a trap composed of 29 places in 314 ms of which 1 ms to minimize.
[2022-05-20 02:59:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6239 ms
[2022-05-20 02:59:29] [INFO ] After 7685ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:59:29] [INFO ] After 8232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 02:59:30] [INFO ] [Nat]Absence check using 1089 positive place invariants in 204 ms returned sat
[2022-05-20 02:59:30] [INFO ] [Nat]Absence check using 1089 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-20 02:59:33] [INFO ] After 3008ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 02:59:34] [INFO ] Deduced a trap composed of 17 places in 674 ms of which 2 ms to minimize.
[2022-05-20 02:59:35] [INFO ] Deduced a trap composed of 17 places in 638 ms of which 1 ms to minimize.
[2022-05-20 02:59:35] [INFO ] Deduced a trap composed of 17 places in 631 ms of which 2 ms to minimize.
[2022-05-20 02:59:36] [INFO ] Deduced a trap composed of 17 places in 609 ms of which 1 ms to minimize.
[2022-05-20 02:59:37] [INFO ] Deduced a trap composed of 17 places in 586 ms of which 1 ms to minimize.
[2022-05-20 02:59:37] [INFO ] Deduced a trap composed of 23 places in 604 ms of which 1 ms to minimize.
[2022-05-20 02:59:38] [INFO ] Deduced a trap composed of 78 places in 591 ms of which 1 ms to minimize.
[2022-05-20 02:59:39] [INFO ] Deduced a trap composed of 23 places in 628 ms of which 1 ms to minimize.
[2022-05-20 02:59:39] [INFO ] Deduced a trap composed of 17 places in 602 ms of which 1 ms to minimize.
[2022-05-20 02:59:40] [INFO ] Deduced a trap composed of 87 places in 570 ms of which 1 ms to minimize.
[2022-05-20 02:59:41] [INFO ] Deduced a trap composed of 34 places in 560 ms of which 2 ms to minimize.
[2022-05-20 02:59:41] [INFO ] Deduced a trap composed of 29 places in 565 ms of which 1 ms to minimize.
[2022-05-20 02:59:42] [INFO ] Deduced a trap composed of 29 places in 555 ms of which 1 ms to minimize.
[2022-05-20 02:59:43] [INFO ] Deduced a trap composed of 23 places in 548 ms of which 1 ms to minimize.
[2022-05-20 02:59:43] [INFO ] Deduced a trap composed of 34 places in 540 ms of which 1 ms to minimize.
[2022-05-20 02:59:44] [INFO ] Deduced a trap composed of 97 places in 476 ms of which 2 ms to minimize.
[2022-05-20 02:59:44] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 0 ms to minimize.
[2022-05-20 02:59:45] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 1 ms to minimize.
[2022-05-20 02:59:45] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 1 ms to minimize.
[2022-05-20 02:59:46] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 1 ms to minimize.
[2022-05-20 02:59:46] [INFO ] Deduced a trap composed of 39 places in 404 ms of which 1 ms to minimize.
[2022-05-20 02:59:47] [INFO ] Deduced a trap composed of 17 places in 334 ms of which 0 ms to minimize.
[2022-05-20 02:59:47] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 1 ms to minimize.
[2022-05-20 02:59:47] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 14308 ms
[2022-05-20 02:59:47] [INFO ] After 17447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-20 02:59:47] [INFO ] After 18085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 118 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 117 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:59:48] [INFO ] Computed 1101 place invariants in 44 ms
[2022-05-20 02:59:50] [INFO ] Implicit Places using invariants in 2165 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:59:50] [INFO ] Computed 1101 place invariants in 40 ms
[2022-05-20 02:59:55] [INFO ] Implicit Places using invariants and state equation in 4860 ms returned []
Implicit Place search using SMT with State Equation took 7026 ms to find 0 implicit places.
[2022-05-20 02:59:55] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:59:55] [INFO ] Computed 1101 place invariants in 40 ms
[2022-05-20 02:59:57] [INFO ] Dead Transitions using invariants and state equation in 1768 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 117 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 02:59:57] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 02:59:57] [INFO ] [Real]Absence check using 1089 positive place invariants in 206 ms returned sat
[2022-05-20 02:59:57] [INFO ] [Real]Absence check using 1089 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-20 02:59:59] [INFO ] After 1379ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 02:59:59] [INFO ] Deduced a trap composed of 17 places in 587 ms of which 1 ms to minimize.
[2022-05-20 03:00:00] [INFO ] Deduced a trap composed of 29 places in 559 ms of which 1 ms to minimize.
[2022-05-20 03:00:01] [INFO ] Deduced a trap composed of 34 places in 579 ms of which 2 ms to minimize.
[2022-05-20 03:00:01] [INFO ] Deduced a trap composed of 17 places in 529 ms of which 1 ms to minimize.
[2022-05-20 03:00:02] [INFO ] Deduced a trap composed of 39 places in 486 ms of which 1 ms to minimize.
[2022-05-20 03:00:03] [INFO ] Deduced a trap composed of 29 places in 481 ms of which 1 ms to minimize.
[2022-05-20 03:00:03] [INFO ] Deduced a trap composed of 17 places in 404 ms of which 1 ms to minimize.
[2022-05-20 03:00:04] [INFO ] Deduced a trap composed of 23 places in 400 ms of which 1 ms to minimize.
[2022-05-20 03:00:04] [INFO ] Deduced a trap composed of 40 places in 383 ms of which 1 ms to minimize.
[2022-05-20 03:00:04] [INFO ] Deduced a trap composed of 45 places in 379 ms of which 1 ms to minimize.
[2022-05-20 03:00:05] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 1 ms to minimize.
[2022-05-20 03:00:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6296 ms
[2022-05-20 03:00:05] [INFO ] After 7749ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 03:00:05] [INFO ] After 8305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 03:00:06] [INFO ] [Nat]Absence check using 1089 positive place invariants in 202 ms returned sat
[2022-05-20 03:00:06] [INFO ] [Nat]Absence check using 1089 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-20 03:00:09] [INFO ] After 3031ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 03:00:09] [INFO ] Deduced a trap composed of 17 places in 668 ms of which 1 ms to minimize.
[2022-05-20 03:00:10] [INFO ] Deduced a trap composed of 17 places in 654 ms of which 1 ms to minimize.
[2022-05-20 03:00:11] [INFO ] Deduced a trap composed of 17 places in 624 ms of which 1 ms to minimize.
[2022-05-20 03:00:12] [INFO ] Deduced a trap composed of 17 places in 618 ms of which 1 ms to minimize.
[2022-05-20 03:00:12] [INFO ] Deduced a trap composed of 17 places in 592 ms of which 1 ms to minimize.
[2022-05-20 03:00:13] [INFO ] Deduced a trap composed of 23 places in 598 ms of which 2 ms to minimize.
[2022-05-20 03:00:14] [INFO ] Deduced a trap composed of 78 places in 600 ms of which 1 ms to minimize.
[2022-05-20 03:00:14] [INFO ] Deduced a trap composed of 23 places in 617 ms of which 1 ms to minimize.
[2022-05-20 03:00:15] [INFO ] Deduced a trap composed of 17 places in 600 ms of which 1 ms to minimize.
[2022-05-20 03:00:16] [INFO ] Deduced a trap composed of 87 places in 566 ms of which 2 ms to minimize.
[2022-05-20 03:00:17] [INFO ] Deduced a trap composed of 34 places in 565 ms of which 1 ms to minimize.
[2022-05-20 03:00:17] [INFO ] Deduced a trap composed of 29 places in 564 ms of which 1 ms to minimize.
[2022-05-20 03:00:18] [INFO ] Deduced a trap composed of 29 places in 567 ms of which 2 ms to minimize.
[2022-05-20 03:00:19] [INFO ] Deduced a trap composed of 23 places in 553 ms of which 1 ms to minimize.
[2022-05-20 03:00:19] [INFO ] Deduced a trap composed of 34 places in 548 ms of which 2 ms to minimize.
[2022-05-20 03:00:20] [INFO ] Deduced a trap composed of 97 places in 503 ms of which 1 ms to minimize.
[2022-05-20 03:00:20] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 0 ms to minimize.
[2022-05-20 03:00:21] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 1 ms to minimize.
[2022-05-20 03:00:21] [INFO ] Deduced a trap composed of 17 places in 327 ms of which 1 ms to minimize.
[2022-05-20 03:00:22] [INFO ] Deduced a trap composed of 17 places in 331 ms of which 1 ms to minimize.
[2022-05-20 03:00:22] [INFO ] Deduced a trap composed of 39 places in 377 ms of which 1 ms to minimize.
[2022-05-20 03:00:22] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 0 ms to minimize.
[2022-05-20 03:00:23] [INFO ] Deduced a trap composed of 23 places in 345 ms of which 1 ms to minimize.
[2022-05-20 03:00:23] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 14342 ms
[2022-05-20 03:00:23] [INFO ] After 17502ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-05-20 03:00:23] [INFO ] After 18160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p1) p0)), (F p0), (F p1), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 9 factoid took 609 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 03:00:24] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 03:00:29] [INFO ] [Real]Absence check using 1101 positive place invariants in 1459 ms returned sat
[2022-05-20 03:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 03:00:39] [INFO ] [Real]Absence check using state equation in 10268 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Product exploration explored 100000 steps with 33546 reset in 2782 ms.
Product exploration explored 100000 steps with 33210 reset in 2977 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Support contains 4 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 129 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2022-05-20 03:00:46] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 03:00:46] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 03:00:47] [INFO ] Dead Transitions using invariants and state equation in 1746 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Product exploration timeout after 67500 steps with 22619 reset in 10004 ms.
Product exploration timeout after 66750 steps with 22161 reset in 10002 ms.
Built C files in :
/tmp/ltsmin11649200282199360990
[2022-05-20 03:01:07] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11649200282199360990
Running compilation step : cd /tmp/ltsmin11649200282199360990;'/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/ltsmin11649200282199360990;'/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/ltsmin11649200282199360990;'/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 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 121 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 03:01:10] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 03:01:12] [INFO ] Implicit Places using invariants in 1760 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 03:01:12] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 03:01:16] [INFO ] Implicit Places using invariants and state equation in 4036 ms returned []
Implicit Place search using SMT with State Equation took 5798 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 03:01:16] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 03:01:18] [INFO ] Dead Transitions using invariants and state equation in 1740 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Built C files in :
/tmp/ltsmin17344579250740349679
[2022-05-20 03:01:18] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17344579250740349679
Running compilation step : cd /tmp/ltsmin17344579250740349679;'/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/ltsmin17344579250740349679;'/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/ltsmin17344579250740349679;'/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 03:01:21] [INFO ] Flatten gal took : 81 ms
[2022-05-20 03:01:21] [INFO ] Flatten gal took : 83 ms
[2022-05-20 03:01:21] [INFO ] Time to serialize gal into /tmp/LTL13784413471034566305.gal : 7 ms
[2022-05-20 03:01:21] [INFO ] Time to serialize properties into /tmp/LTL3007416262921653704.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/LTL13784413471034566305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3007416262921653704.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/LTL1378441...267
Read 1 LTL properties
Checking formula 0 : !(((((X(!("((p6230==1)&&(p6250==1))")))||(G("(p73==1)")))||("(p1828==1)"))U(G("(p73==1)"))))
Formula 0 simplified : !(("(p1828==1)" | X!"((p6230==1)&&(p6250==1))" | G"(p73==1)") U G"(p73==1)")
Detected timeout of ITS tools.
[2022-05-20 03:01:36] [INFO ] Flatten gal took : 82 ms
[2022-05-20 03:01:36] [INFO ] Applying decomposition
[2022-05-20 03:01:37] [INFO ] Flatten gal took : 81 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/graph11791475096687401081.txt' '-o' '/tmp/graph11791475096687401081.bin' '-w' '/tmp/graph11791475096687401081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11791475096687401081.bin' '-l' '-1' '-v' '-w' '/tmp/graph11791475096687401081.weights' '-q' '0' '-e' '0.001'
[2022-05-20 03:01:37] [INFO ] Decomposing Gal with order
[2022-05-20 03:01:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 03:01:37] [INFO ] Removed a total of 601 redundant transitions.
[2022-05-20 03:01:37] [INFO ] Flatten gal took : 116 ms
[2022-05-20 03:01:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1204 labels/synchronizations in 39 ms.
[2022-05-20 03:01:37] [INFO ] Time to serialize gal into /tmp/LTL10425693934643174207.gal : 17 ms
[2022-05-20 03:01:37] [INFO ] Time to serialize properties into /tmp/LTL8221717408199403098.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/LTL10425693934643174207.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8221717408199403098.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/LTL1042569...246
Read 1 LTL properties
Checking formula 0 : !(((((X(!("((i51.i0.i2.u1010.p6230==1)&&(i51.i0.i1.u1013.p6250==1))")))||(G("(i14.i1.i0.u0.p73==1)")))||("(i13.u286.p1828==1)"))U(G("(...180
Formula 0 simplified : !(("(i13.u286.p1828==1)" | X!"((i51.i0.i2.u1010.p6230==1)&&(i51.i0.i1.u1013.p6250==1))" | G"(i14.i1.i0.u0.p73==1)") U G"(i14.i1.i0.u...166
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7660899728133452372
[2022-05-20 03:01:52] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7660899728133452372
Running compilation step : cd /tmp/ltsmin7660899728133452372;'/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/ltsmin7660899728133452372;'/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/ltsmin7660899728133452372;'/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-LTLFireability-06 finished in 274837 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a CL insensitive property : ShieldPPPs-PT-100B-LTLFireability-13
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 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 6111 transition count 4910
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5410 transition count 4910
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 5410 transition count 4410
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 4910 transition count 4410
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2412 place count 4900 transition count 4400
Iterating global reduction 2 with 10 rules applied. Total rules applied 2422 place count 4900 transition count 4400
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2422 place count 4900 transition count 4397
Deduced a syphon composed of 3 places in 17 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2428 place count 4897 transition count 4397
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 6 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 6014 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 6016 place count 3102 transition count 2602
Applied a total of 6016 rules in 1423 ms. Remains 3102 /6112 variables (removed 3010) and now considering 2602/5612 (removed 3010) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 03:01:57] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 03:01:59] [INFO ] Implicit Places using invariants in 1809 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 03:01:59] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 03:02:03] [INFO ] Implicit Places using invariants and state equation in 3918 ms returned []
Implicit Place search using SMT with State Equation took 5730 ms to find 0 implicit places.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 03:02:03] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 03:02:04] [INFO ] Dead Transitions using invariants and state equation in 1750 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3102/6112 places, 2602/5612 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/6112 places, 2602/5612 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1072 1) (EQ s1084 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 24 reset in 1604 ms.
Product exploration explored 100000 steps with 24 reset in 2098 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 24 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98058 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98058 steps, saw 88453 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 03:02:12] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 03:02:12] [INFO ] [Real]Absence check using 1101 positive place invariants in 205 ms returned sat
[2022-05-20 03:02:14] [INFO ] After 1914ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 03:02:14] [INFO ] [Nat]Absence check using 1101 positive place invariants in 214 ms returned sat
[2022-05-20 03:02:15] [INFO ] After 1403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 03:02:16] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-05-20 03:02:16] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2022-05-20 03:02:16] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2022-05-20 03:02:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 506 ms
[2022-05-20 03:02:16] [INFO ] After 1978ms 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 03:02:16] [INFO ] After 2639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 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 244 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 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Finished probabilistic random walk after 92452 steps, run visited all 1 properties in 1818 ms. (steps per millisecond=50 )
Probabilistic random walk after 92452 steps, saw 91314 distinct states, run finished after 1822 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 117 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 03:02:19] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 03:02:24] [INFO ] [Real]Absence check using 1101 positive place invariants in 1556 ms returned sat
[2022-05-20 03:02:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 03:02:34] [INFO ] [Real]Absence check using state equation in 9809 ms returned unknown
Could not prove EG (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 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 03:02:34] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 03:02:36] [INFO ] Implicit Places using invariants in 1791 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 03:02:36] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 03:02:40] [INFO ] Implicit Places using invariants and state equation in 4097 ms returned []
Implicit Place search using SMT with State Equation took 5889 ms to find 0 implicit places.
[2022-05-20 03:02:40] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 03:02:40] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 03:02:42] [INFO ] Dead Transitions using invariants and state equation in 1745 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 107 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 41 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98019 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98019 steps, saw 88418 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 03:02:45] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 03:02:46] [INFO ] [Real]Absence check using 1101 positive place invariants in 207 ms returned sat
[2022-05-20 03:02:47] [INFO ] After 1920ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 03:02:48] [INFO ] [Nat]Absence check using 1101 positive place invariants in 207 ms returned sat
[2022-05-20 03:02:49] [INFO ] After 1426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 03:02:49] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2022-05-20 03:02:49] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2022-05-20 03:02:49] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2022-05-20 03:02:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 507 ms
[2022-05-20 03:02:50] [INFO ] After 2000ms 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 03:02:50] [INFO ] After 2639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 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 237 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 194 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 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Finished probabilistic random walk after 92452 steps, run visited all 1 properties in 1887 ms. (steps per millisecond=48 )
Probabilistic random walk after 92452 steps, saw 91314 distinct states, run finished after 1891 ms. (steps per millisecond=48 ) 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 140 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 03:02:52] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 03:02:57] [INFO ] [Real]Absence check using 1101 positive place invariants in 1519 ms returned sat
[2022-05-20 03:02:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 03:03:07] [INFO ] [Real]Absence check using state equation in 9990 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24 reset in 1633 ms.
Product exploration explored 100000 steps with 24 reset in 2095 ms.
Built C files in :
/tmp/ltsmin18197438908979141564
[2022-05-20 03:03:11] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2022-05-20 03:03:11] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18197438908979141564
Running compilation step : cd /tmp/ltsmin18197438908979141564;'/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/ltsmin18197438908979141564;'/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/ltsmin18197438908979141564;'/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 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 03:03:14] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 03:03:16] [INFO ] Implicit Places using invariants in 1758 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 03:03:16] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 03:03:20] [INFO ] Implicit Places using invariants and state equation in 3896 ms returned []
Implicit Place search using SMT with State Equation took 5654 ms to find 0 implicit places.
[2022-05-20 03:03:20] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2602 rows 3102 cols
[2022-05-20 03:03:20] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 03:03:22] [INFO ] Dead Transitions using invariants and state equation in 1745 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 2602/2602 transitions.
Built C files in :
/tmp/ltsmin9449253888697642627
[2022-05-20 03:03:22] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2022-05-20 03:03:22] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9449253888697642627
Running compilation step : cd /tmp/ltsmin9449253888697642627;'/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/ltsmin9449253888697642627;'/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/ltsmin9449253888697642627;'/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 03:03:25] [INFO ] Flatten gal took : 77 ms
[2022-05-20 03:03:25] [INFO ] Flatten gal took : 78 ms
[2022-05-20 03:03:25] [INFO ] Time to serialize gal into /tmp/LTL13203034274764283720.gal : 6 ms
[2022-05-20 03:03:25] [INFO ] Time to serialize properties into /tmp/LTL12719457392948887983.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/LTL13203034274764283720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12719457392948887983.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/LTL1320303...268
Read 1 LTL properties
Checking formula 0 : !((X(F("((p2411==1)&&(p2434==1))"))))
Formula 0 simplified : !XF"((p2411==1)&&(p2434==1))"
Detected timeout of ITS tools.
[2022-05-20 03:03:40] [INFO ] Flatten gal took : 76 ms
[2022-05-20 03:03:40] [INFO ] Applying decomposition
[2022-05-20 03:03:40] [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/graph180805034537222084.txt' '-o' '/tmp/graph180805034537222084.bin' '-w' '/tmp/graph180805034537222084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph180805034537222084.bin' '-l' '-1' '-v' '-w' '/tmp/graph180805034537222084.weights' '-q' '0' '-e' '0.001'
[2022-05-20 03:03:40] [INFO ] Decomposing Gal with order
[2022-05-20 03:03:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 03:03:41] [INFO ] Removed a total of 602 redundant transitions.
[2022-05-20 03:03:41] [INFO ] Flatten gal took : 115 ms
[2022-05-20 03:03:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1198 labels/synchronizations in 42 ms.
[2022-05-20 03:03:41] [INFO ] Time to serialize gal into /tmp/LTL9507276273962417243.gal : 12 ms
[2022-05-20 03:03:41] [INFO ] Time to serialize properties into /tmp/LTL13731382985546049219.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/LTL9507276273962417243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13731382985546049219.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/LTL9507276...246
Read 1 LTL properties
Checking formula 0 : !((X(F("((i19.i0.i3.u381.p2411==1)&&(i19.i0.i4.u385.p2434==1))"))))
Formula 0 simplified : !XF"((i19.i0.i3.u381.p2411==1)&&(i19.i0.i4.u385.p2434==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13716260669456140542
[2022-05-20 03:03:56] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13716260669456140542
Running compilation step : cd /tmp/ltsmin13716260669456140542;'/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/ltsmin13716260669456140542;'/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/ltsmin13716260669456140542;'/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-LTLFireability-13 finished in 123500 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(F(p0)) U X(X((X(F(p1))&&p2)))))'
[2022-05-20 03:03:59] [INFO ] Flatten gal took : 135 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8959525564954339913
[2022-05-20 03:03:59] [INFO ] Too many transitions (5612) to apply POR reductions. Disabling POR matrices.
[2022-05-20 03:03:59] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8959525564954339913
Running compilation step : cd /tmp/ltsmin8959525564954339913;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '102' '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 03:03:59] [INFO ] Applying decomposition
[2022-05-20 03:03:59] [INFO ] Flatten gal took : 140 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/graph1267271291766995350.txt' '-o' '/tmp/graph1267271291766995350.bin' '-w' '/tmp/graph1267271291766995350.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1267271291766995350.bin' '-l' '-1' '-v' '-w' '/tmp/graph1267271291766995350.weights' '-q' '0' '-e' '0.001'
[2022-05-20 03:04:00] [INFO ] Decomposing Gal with order
[2022-05-20 03:04:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 03:04:01] [INFO ] Removed a total of 900 redundant transitions.
[2022-05-20 03:04:02] [INFO ] Flatten gal took : 211 ms
[2022-05-20 03:04:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-05-20 03:04:02] [INFO ] Time to serialize gal into /tmp/LTLFireability11999139844001297622.gal : 27 ms
[2022-05-20 03:04:02] [INFO ] Time to serialize properties into /tmp/LTLFireability15537444495621331319.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/LTLFireability11999139844001297622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15537444495621331319.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 7 LTL properties
Checking formula 0 : !(((F(G((X(G("(((i28.u1009.p2840==1)&&(i28.u1024.p2880==1))&&(i28.u1030.p2900==1))")))||(X(G("(i29.u1076.p3030==0)"))))))&&(F("(i28.u1...173
Formula 0 simplified : !(FG(XG"(((i28.u1009.p2840==1)&&(i28.u1024.p2880==1))&&(i28.u1030.p2900==1))" | XG"(i29.u1076.p3030==0)") & F"(i28.u1009.p2840==1)")
Compilation finished in 21211 ms.
Running link step : cd /tmp/ltsmin8959525564954339913;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin8959525564954339913;'/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)))||X([]((LTLAPp1==true))))))&&<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin8959525564954339913;'/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)))||X([]((LTLAPp1==true))))))&&<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8959525564954339913;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X((X([](<>((X((LTLAPp3==true)) U (LTLAPp3==true)))))&&(LTLAPp4==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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-100B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-100B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025300524"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;