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.r168-tall-165277017300860.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 PolyORBNT-PT-S10J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017300860
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 40K Apr 30 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 192K Apr 30 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 30 03:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 30 03:46 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 11K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J30-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652972591761

Running Version 202205111006
[2022-05-19 15:03:12] [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-19 15:03:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:03:13] [INFO ] Load time of PNML (sax parser for PT used): 616 ms
[2022-05-19 15:03:13] [INFO ] Transformed 664 places.
[2022-05-19 15:03:13] [INFO ] Transformed 12050 transitions.
[2022-05-19 15:03:13] [INFO ] Parsed PT model containing 664 places and 12050 transitions in 832 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 499 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Applied a total of 10 rules in 97 ms. Remains 654 /664 variables (removed 10) and now considering 1940/1940 (removed 0) transitions.
[2022-05-19 15:03:14] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 654 cols
[2022-05-19 15:03:14] [INFO ] Computed 82 place invariants in 144 ms
[2022-05-19 15:03:15] [INFO ] Dead Transitions using invariants and state equation in 1690 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2022-05-19 15:03:15] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 654 cols
[2022-05-19 15:03:15] [INFO ] Computed 82 place invariants in 58 ms
[2022-05-19 15:03:16] [INFO ] Implicit Places using invariants in 301 ms returned []
[2022-05-19 15:03:16] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 654 cols
[2022-05-19 15:03:16] [INFO ] Computed 82 place invariants in 45 ms
[2022-05-19 15:03:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:03:17] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 1752 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 21 ms. Remains 654 /654 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 654/664 places, 1325/1940 transitions.
Support contains 499 out of 654 places after structural reductions.
[2022-05-19 15:03:17] [INFO ] Flatten gal took : 187 ms
[2022-05-19 15:03:18] [INFO ] Flatten gal took : 142 ms
[2022-05-19 15:03:18] [INFO ] Input system was already deterministic with 1325 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 832 ms. (steps per millisecond=12 ) properties (out of 22) seen :4
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :8
Running SMT prover for 10 properties.
[2022-05-19 15:03:19] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 654 cols
[2022-05-19 15:03:19] [INFO ] Computed 82 place invariants in 33 ms
[2022-05-19 15:03:20] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2022-05-19 15:03:20] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 26 ms returned sat
[2022-05-19 15:03:20] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-19 15:03:20] [INFO ] [Nat]Absence check using 63 positive place invariants in 20 ms returned sat
[2022-05-19 15:03:20] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 25 ms returned sat
[2022-05-19 15:03:26] [INFO ] After 5336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-19 15:03:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:03:33] [INFO ] After 6856ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-05-19 15:03:35] [INFO ] Deduced a trap composed of 171 places in 400 ms of which 5 ms to minimize.
[2022-05-19 15:03:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 555 ms
[2022-05-19 15:03:41] [INFO ] Deduced a trap composed of 309 places in 324 ms of which 2 ms to minimize.
[2022-05-19 15:03:42] [INFO ] Deduced a trap composed of 309 places in 309 ms of which 1 ms to minimize.
[2022-05-19 15:03:45] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 4101 ms
[2022-05-19 15:03:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 15:03:45] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 68 ms.
Support contains 416 out of 654 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 654 transition count 1321
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 650 transition count 1321
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 650 transition count 1319
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 648 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 647 transition count 1318
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 647 transition count 1318
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 645 transition count 1316
Applied a total of 18 rules in 247 ms. Remains 645 /654 variables (removed 9) and now considering 1316/1325 (removed 9) transitions.
[2022-05-19 15:03:46] [INFO ] Flow matrix only has 1307 transitions (discarded 9 similar events)
// Phase 1: matrix 1307 rows 645 cols
[2022-05-19 15:03:46] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 15:03:47] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 645/654 places, 1316/1325 transitions.
Incomplete random walk after 10000 steps, including 746 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-19 15:03:47] [INFO ] Flow matrix only has 1307 transitions (discarded 9 similar events)
// Phase 1: matrix 1307 rows 645 cols
[2022-05-19 15:03:47] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 15:03:47] [INFO ] [Real]Absence check using 62 positive place invariants in 14 ms returned sat
[2022-05-19 15:03:47] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 28 ms returned sat
[2022-05-19 15:03:47] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 15:03:48] [INFO ] [Nat]Absence check using 62 positive place invariants in 14 ms returned sat
[2022-05-19 15:03:48] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 36 ms returned sat
[2022-05-19 15:03:49] [INFO ] After 1417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 15:03:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:03:57] [INFO ] After 8299ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-19 15:03:59] [INFO ] Deduced a trap composed of 292 places in 303 ms of which 2 ms to minimize.
[2022-05-19 15:03:59] [INFO ] Deduced a trap composed of 305 places in 344 ms of which 2 ms to minimize.
[2022-05-19 15:03:59] [INFO ] Deduced a trap composed of 300 places in 325 ms of which 1 ms to minimize.
[2022-05-19 15:04:00] [INFO ] Deduced a trap composed of 304 places in 304 ms of which 0 ms to minimize.
[2022-05-19 15:04:09] [INFO ] Deduced a trap composed of 290 places in 306 ms of which 1 ms to minimize.
[2022-05-19 15:04:10] [INFO ] Deduced a trap composed of 298 places in 357 ms of which 1 ms to minimize.
[2022-05-19 15:04:10] [INFO ] Deduced a trap composed of 292 places in 304 ms of which 0 ms to minimize.
[2022-05-19 15:04:11] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 1 ms to minimize.
[2022-05-19 15:04:11] [INFO ] Deduced a trap composed of 306 places in 296 ms of which 1 ms to minimize.
[2022-05-19 15:04:12] [INFO ] Deduced a trap composed of 306 places in 304 ms of which 1 ms to minimize.
[2022-05-19 15:04:12] [INFO ] Deduced a trap composed of 290 places in 313 ms of which 0 ms to minimize.
[2022-05-19 15:04:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 15:04:12] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 17 ms.
Support contains 7 out of 645 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 645/645 places, 1316/1316 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 645 transition count 1284
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 613 transition count 1284
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 613 transition count 1252
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 581 transition count 1252
Applied a total of 128 rules in 72 ms. Remains 581 /645 variables (removed 64) and now considering 1252/1316 (removed 64) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/645 places, 1252/1316 transitions.
Incomplete random walk after 10000 steps, including 716 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 15:04:13] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:04:13] [INFO ] Computed 82 place invariants in 31 ms
[2022-05-19 15:04:13] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2022-05-19 15:04:13] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 21 ms returned sat
[2022-05-19 15:04:13] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 15:04:13] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2022-05-19 15:04:13] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 25 ms returned sat
[2022-05-19 15:04:14] [INFO ] After 872ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 15:04:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:04:16] [INFO ] After 1759ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 15:04:17] [INFO ] Deduced a trap composed of 233 places in 281 ms of which 1 ms to minimize.
[2022-05-19 15:04:17] [INFO ] Deduced a trap composed of 222 places in 317 ms of which 0 ms to minimize.
[2022-05-19 15:04:17] [INFO ] Deduced a trap composed of 220 places in 291 ms of which 1 ms to minimize.
[2022-05-19 15:04:18] [INFO ] Deduced a trap composed of 231 places in 293 ms of which 1 ms to minimize.
[2022-05-19 15:04:26] [INFO ] Deduced a trap composed of 186 places in 304 ms of which 0 ms to minimize.
[2022-05-19 15:04:26] [INFO ] Deduced a trap composed of 249 places in 307 ms of which 1 ms to minimize.
[2022-05-19 15:04:26] [INFO ] Deduced a trap composed of 232 places in 335 ms of which 1 ms to minimize.
[2022-05-19 15:04:27] [INFO ] Deduced a trap composed of 181 places in 286 ms of which 1 ms to minimize.
[2022-05-19 15:04:28] [INFO ] Deduced a trap composed of 200 places in 264 ms of which 1 ms to minimize.
[2022-05-19 15:04:28] [INFO ] Deduced a trap composed of 235 places in 281 ms of which 1 ms to minimize.
[2022-05-19 15:04:29] [INFO ] Deduced a trap composed of 224 places in 302 ms of which 0 ms to minimize.
[2022-05-19 15:04:29] [INFO ] Deduced a trap composed of 246 places in 276 ms of which 1 ms to minimize.
[2022-05-19 15:04:29] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 1 ms to minimize.
[2022-05-19 15:04:30] [INFO ] Deduced a trap composed of 237 places in 295 ms of which 0 ms to minimize.
[2022-05-19 15:04:30] [INFO ] Deduced a trap composed of 231 places in 291 ms of which 1 ms to minimize.
[2022-05-19 15:04:31] [INFO ] Deduced a trap composed of 245 places in 309 ms of which 1 ms to minimize.
[2022-05-19 15:04:31] [INFO ] Deduced a trap composed of 233 places in 297 ms of which 0 ms to minimize.
[2022-05-19 15:04:31] [INFO ] Deduced a trap composed of 226 places in 279 ms of which 0 ms to minimize.
[2022-05-19 15:04:32] [INFO ] Deduced a trap composed of 233 places in 279 ms of which 0 ms to minimize.
[2022-05-19 15:04:32] [INFO ] Deduced a trap composed of 231 places in 302 ms of which 1 ms to minimize.
[2022-05-19 15:04:32] [INFO ] Deduced a trap composed of 223 places in 300 ms of which 2 ms to minimize.
[2022-05-19 15:04:33] [INFO ] Deduced a trap composed of 239 places in 286 ms of which 0 ms to minimize.
[2022-05-19 15:04:33] [INFO ] Deduced a trap composed of 235 places in 296 ms of which 1 ms to minimize.
[2022-05-19 15:04:34] [INFO ] Deduced a trap composed of 227 places in 319 ms of which 1 ms to minimize.
[2022-05-19 15:04:34] [INFO ] Deduced a trap composed of 243 places in 296 ms of which 1 ms to minimize.
[2022-05-19 15:04:34] [INFO ] Deduced a trap composed of 229 places in 297 ms of which 1 ms to minimize.
[2022-05-19 15:04:35] [INFO ] Deduced a trap composed of 229 places in 294 ms of which 1 ms to minimize.
[2022-05-19 15:04:35] [INFO ] Deduced a trap composed of 229 places in 294 ms of which 0 ms to minimize.
[2022-05-19 15:04:36] [INFO ] Deduced a trap composed of 246 places in 294 ms of which 1 ms to minimize.
[2022-05-19 15:04:36] [INFO ] Deduced a trap composed of 235 places in 299 ms of which 0 ms to minimize.
[2022-05-19 15:04:36] [INFO ] Deduced a trap composed of 239 places in 293 ms of which 0 ms to minimize.
[2022-05-19 15:04:37] [INFO ] Deduced a trap composed of 241 places in 284 ms of which 1 ms to minimize.
[2022-05-19 15:04:37] [INFO ] Deduced a trap composed of 227 places in 305 ms of which 1 ms to minimize.
[2022-05-19 15:04:38] [INFO ] Deduced a trap composed of 235 places in 294 ms of which 0 ms to minimize.
[2022-05-19 15:04:38] [INFO ] Deduced a trap composed of 233 places in 299 ms of which 1 ms to minimize.
[2022-05-19 15:04:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 15:04:38] [INFO ] After 25257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 43 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Incomplete random walk after 10000 steps, including 689 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 282835 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 282835 steps, saw 46479 distinct states, run finished after 3002 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 15:04:41] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:04:41] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 15:04:42] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2022-05-19 15:04:42] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2022-05-19 15:04:42] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 15:04:42] [INFO ] [Nat]Absence check using 63 positive place invariants in 11 ms returned sat
[2022-05-19 15:04:42] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2022-05-19 15:04:43] [INFO ] After 856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 15:04:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:04:44] [INFO ] After 1758ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 15:04:45] [INFO ] Deduced a trap composed of 233 places in 303 ms of which 0 ms to minimize.
[2022-05-19 15:04:45] [INFO ] Deduced a trap composed of 222 places in 324 ms of which 1 ms to minimize.
[2022-05-19 15:04:46] [INFO ] Deduced a trap composed of 220 places in 311 ms of which 0 ms to minimize.
[2022-05-19 15:04:46] [INFO ] Deduced a trap composed of 231 places in 273 ms of which 1 ms to minimize.
[2022-05-19 15:04:54] [INFO ] Deduced a trap composed of 186 places in 309 ms of which 1 ms to minimize.
[2022-05-19 15:04:55] [INFO ] Deduced a trap composed of 249 places in 290 ms of which 1 ms to minimize.
[2022-05-19 15:04:55] [INFO ] Deduced a trap composed of 232 places in 301 ms of which 5 ms to minimize.
[2022-05-19 15:04:55] [INFO ] Deduced a trap composed of 181 places in 299 ms of which 1 ms to minimize.
[2022-05-19 15:04:57] [INFO ] Deduced a trap composed of 200 places in 279 ms of which 1 ms to minimize.
[2022-05-19 15:04:57] [INFO ] Deduced a trap composed of 235 places in 291 ms of which 1 ms to minimize.
[2022-05-19 15:04:57] [INFO ] Deduced a trap composed of 224 places in 285 ms of which 1 ms to minimize.
[2022-05-19 15:04:58] [INFO ] Deduced a trap composed of 246 places in 280 ms of which 0 ms to minimize.
[2022-05-19 15:04:58] [INFO ] Deduced a trap composed of 230 places in 348 ms of which 0 ms to minimize.
[2022-05-19 15:04:58] [INFO ] Deduced a trap composed of 237 places in 308 ms of which 1 ms to minimize.
[2022-05-19 15:04:59] [INFO ] Deduced a trap composed of 231 places in 281 ms of which 1 ms to minimize.
[2022-05-19 15:04:59] [INFO ] Deduced a trap composed of 245 places in 285 ms of which 1 ms to minimize.
[2022-05-19 15:04:59] [INFO ] Deduced a trap composed of 233 places in 336 ms of which 2 ms to minimize.
[2022-05-19 15:05:00] [INFO ] Deduced a trap composed of 226 places in 280 ms of which 2 ms to minimize.
[2022-05-19 15:05:00] [INFO ] Deduced a trap composed of 233 places in 278 ms of which 9 ms to minimize.
[2022-05-19 15:05:01] [INFO ] Deduced a trap composed of 231 places in 288 ms of which 2 ms to minimize.
[2022-05-19 15:05:01] [INFO ] Deduced a trap composed of 223 places in 268 ms of which 0 ms to minimize.
[2022-05-19 15:05:01] [INFO ] Deduced a trap composed of 239 places in 282 ms of which 1 ms to minimize.
[2022-05-19 15:05:02] [INFO ] Deduced a trap composed of 235 places in 291 ms of which 0 ms to minimize.
[2022-05-19 15:05:02] [INFO ] Deduced a trap composed of 227 places in 275 ms of which 1 ms to minimize.
[2022-05-19 15:05:02] [INFO ] Deduced a trap composed of 243 places in 293 ms of which 0 ms to minimize.
[2022-05-19 15:05:03] [INFO ] Deduced a trap composed of 229 places in 297 ms of which 1 ms to minimize.
[2022-05-19 15:05:03] [INFO ] Deduced a trap composed of 229 places in 290 ms of which 1 ms to minimize.
[2022-05-19 15:05:04] [INFO ] Deduced a trap composed of 229 places in 290 ms of which 0 ms to minimize.
[2022-05-19 15:05:04] [INFO ] Deduced a trap composed of 246 places in 276 ms of which 0 ms to minimize.
[2022-05-19 15:05:04] [INFO ] Deduced a trap composed of 235 places in 289 ms of which 0 ms to minimize.
[2022-05-19 15:05:05] [INFO ] Deduced a trap composed of 239 places in 287 ms of which 0 ms to minimize.
[2022-05-19 15:05:05] [INFO ] Deduced a trap composed of 241 places in 283 ms of which 1 ms to minimize.
[2022-05-19 15:05:06] [INFO ] Deduced a trap composed of 227 places in 275 ms of which 1 ms to minimize.
[2022-05-19 15:05:06] [INFO ] Deduced a trap composed of 235 places in 266 ms of which 0 ms to minimize.
[2022-05-19 15:05:06] [INFO ] Deduced a trap composed of 233 places in 270 ms of which 1 ms to minimize.
[2022-05-19 15:05:07] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 21850 ms
[2022-05-19 15:05:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 15:05:07] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 49 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 31 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2022-05-19 15:05:07] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:05:07] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 15:05:07] [INFO ] Implicit Places using invariants in 649 ms returned []
[2022-05-19 15:05:07] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:05:07] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 15:05:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:05:16] [INFO ] Implicit Places using invariants and state equation in 9070 ms returned []
Implicit Place search using SMT with State Equation took 9731 ms to find 0 implicit places.
[2022-05-19 15:05:17] [INFO ] Redundant transitions in 87 ms returned []
[2022-05-19 15:05:17] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:05:17] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 15:05:17] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!G(p0)&&F(p1)) U !F((F(p0) U p2))))'
Support contains 415 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 654 transition count 1320
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 649 transition count 1320
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 10 place count 649 transition count 1285
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 80 place count 614 transition count 1285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 613 transition count 1284
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 613 transition count 1284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 611 transition count 1282
Applied a total of 86 rules in 95 ms. Remains 611 /654 variables (removed 43) and now considering 1282/1325 (removed 43) transitions.
[2022-05-19 15:05:18] [INFO ] Flow matrix only has 1273 transitions (discarded 9 similar events)
// Phase 1: matrix 1273 rows 611 cols
[2022-05-19 15:05:18] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 15:05:19] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
[2022-05-19 15:05:19] [INFO ] Flow matrix only has 1273 transitions (discarded 9 similar events)
// Phase 1: matrix 1273 rows 611 cols
[2022-05-19 15:05:19] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 15:05:19] [INFO ] Implicit Places using invariants in 313 ms returned []
[2022-05-19 15:05:19] [INFO ] Flow matrix only has 1273 transitions (discarded 9 similar events)
// Phase 1: matrix 1273 rows 611 cols
[2022-05-19 15:05:19] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 15:05:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:05:21] [INFO ] Implicit Places using invariants and state equation in 2544 ms returned []
Implicit Place search using SMT with State Equation took 2858 ms to find 0 implicit places.
[2022-05-19 15:05:21] [INFO ] Redundant transitions in 28 ms returned []
[2022-05-19 15:05:21] [INFO ] Flow matrix only has 1273 transitions (discarded 9 similar events)
// Phase 1: matrix 1273 rows 611 cols
[2022-05-19 15:05:21] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 15:05:22] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 611/654 places, 1282/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 611/654 places, 1282/1325 transitions.
Stuttering acceptance computed with spot in 228 ms :[p2, p0, (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s145 1) (GEQ s332 1) (GEQ s563 1)) (AND (GEQ s332 1) (GEQ s384 1) (GEQ s563 1)) (AND (GEQ s65 1) (GEQ s332 1) (GEQ s563 1)) (AND (GEQ s33...], 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 21 steps with 0 reset in 8 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-00 finished in 4863 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U ((p0&&F(p1))||G(!p0))))'
Support contains 32 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 654 transition count 1320
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 649 transition count 1320
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 649 transition count 1317
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 646 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 645 transition count 1316
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 645 transition count 1316
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 643 transition count 1314
Applied a total of 22 rules in 99 ms. Remains 643 /654 variables (removed 11) and now considering 1314/1325 (removed 11) transitions.
[2022-05-19 15:05:23] [INFO ] Flow matrix only has 1305 transitions (discarded 9 similar events)
// Phase 1: matrix 1305 rows 643 cols
[2022-05-19 15:05:23] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 15:05:23] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
[2022-05-19 15:05:23] [INFO ] Flow matrix only has 1305 transitions (discarded 9 similar events)
// Phase 1: matrix 1305 rows 643 cols
[2022-05-19 15:05:23] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 15:05:24] [INFO ] Implicit Places using invariants in 752 ms returned []
[2022-05-19 15:05:24] [INFO ] Flow matrix only has 1305 transitions (discarded 9 similar events)
// Phase 1: matrix 1305 rows 643 cols
[2022-05-19 15:05:24] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-19 15:05:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:05:31] [INFO ] Implicit Places using invariants and state equation in 7163 ms returned []
Implicit Place search using SMT with State Equation took 7916 ms to find 0 implicit places.
[2022-05-19 15:05:31] [INFO ] Redundant transitions in 31 ms returned []
[2022-05-19 15:05:31] [INFO ] Flow matrix only has 1305 transitions (discarded 9 similar events)
// Phase 1: matrix 1305 rows 643 cols
[2022-05-19 15:05:31] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 15:05:32] [INFO ] Dead Transitions using invariants and state equation in 902 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 643/654 places, 1314/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 643/654 places, 1314/1325 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (GEQ s4 1) (GEQ s68 1) (GEQ s374 1) (GEQ s560 1) (GEQ s499 1) (GEQ s11 1) (GEQ s133 1) (GEQ s383 1) (GEQ s444 1) (GEQ s501 1) (GEQ s137 1) (GEQ s39...], 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]]
Stuttering criterion allowed to conclude after 238 steps with 18 reset in 6 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-01 finished in 9873 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(!(p0 U X(p1)))))'
Support contains 34 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1324
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1324
Applied a total of 2 rules in 27 ms. Remains 653 /654 variables (removed 1) and now considering 1324/1325 (removed 1) transitions.
[2022-05-19 15:05:32] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:05:32] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 15:05:34] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
[2022-05-19 15:05:34] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:05:34] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 15:05:34] [INFO ] Implicit Places using invariants in 683 ms returned []
[2022-05-19 15:05:34] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:05:34] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:05:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:05:42] [INFO ] Implicit Places using invariants and state equation in 7295 ms returned []
Implicit Place search using SMT with State Equation took 7979 ms to find 0 implicit places.
[2022-05-19 15:05:42] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:05:42] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 15:05:43] [INFO ] Dead Transitions using invariants and state equation in 1143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/654 places, 1324/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/654 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s79 1) (GEQ s168 1) (GEQ s603 1)) (AND (GEQ s79 1) (GEQ s542 1) (GEQ s603 1)) (AND (GEQ s79 1) (GEQ s106 1) (GEQ s603 1)) (AND (GEQ s79 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6404 steps with 2112 reset in 105 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-03 finished in 10495 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U X(p1)) U X(G(((p2 U p1)&&p0))))))'
Support contains 35 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1255
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 85 ms. Remains 582 /654 variables (removed 72) and now considering 1253/1325 (removed 72) transitions.
[2022-05-19 15:05:43] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 15:05:43] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 15:05:44] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
[2022-05-19 15:05:44] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 15:05:44] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 15:05:44] [INFO ] Implicit Places using invariants in 656 ms returned []
[2022-05-19 15:05:44] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 15:05:44] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:05:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:05:51] [INFO ] Implicit Places using invariants and state equation in 6564 ms returned []
Implicit Place search using SMT with State Equation took 7226 ms to find 0 implicit places.
[2022-05-19 15:05:51] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-19 15:05:51] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 15:05:51] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 15:05:52] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/654 places, 1253/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/654 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s449 1), p1:(OR (AND (GEQ s136 1) (GEQ s313 1) (GEQ s535 1)) (AND (GEQ s313 1) (GEQ s364 1) (GEQ s535 1)) (AND (GEQ s60 1) (GEQ s313 1) (GEQ s535 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-05 finished in 9005 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0))&&(p1||((!p1 U (p2 U !p1))&&p3)))))'
Support contains 4 out of 654 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 : 654/654 places, 1325/1325 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 654 transition count 1292
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 621 transition count 1290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 70 place count 619 transition count 1258
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 134 place count 587 transition count 1258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 586 transition count 1257
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 586 transition count 1257
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 584 transition count 1255
Applied a total of 140 rules in 134 ms. Remains 584 /654 variables (removed 70) and now considering 1255/1325 (removed 70) transitions.
[2022-05-19 15:05:52] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 15:05:52] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 15:05:53] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
[2022-05-19 15:05:53] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 15:05:53] [INFO ] Computed 82 place invariants in 24 ms
[2022-05-19 15:05:53] [INFO ] Implicit Places using invariants in 711 ms returned []
[2022-05-19 15:05:53] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 15:05:53] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 15:05:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:06:01] [INFO ] Implicit Places using invariants and state equation in 7404 ms returned []
Implicit Place search using SMT with State Equation took 8116 ms to find 0 implicit places.
[2022-05-19 15:06:01] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-19 15:06:01] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 15:06:01] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-19 15:06:02] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/654 places, 1255/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 584/654 places, 1255/1325 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p3), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p3 (NOT p0))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s494 1), p3:(GEQ s278 1), p0:(AND (GEQ s251 1) (GEQ s327 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-06 finished in 9951 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((p0&&(X((p1 U p2))||G(p3)))))))'
Support contains 376 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1324
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1324
Applied a total of 2 rules in 19 ms. Remains 653 /654 variables (removed 1) and now considering 1324/1325 (removed 1) transitions.
[2022-05-19 15:06:02] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:02] [INFO ] Computed 82 place invariants in 27 ms
[2022-05-19 15:06:03] [INFO ] Dead Transitions using invariants and state equation in 1159 ms found 0 transitions.
[2022-05-19 15:06:03] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:03] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 15:06:04] [INFO ] Implicit Places using invariants in 464 ms returned []
[2022-05-19 15:06:04] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:04] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 15:06:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:06:07] [INFO ] Implicit Places using invariants and state equation in 3899 ms returned []
Implicit Place search using SMT with State Equation took 4366 ms to find 0 implicit places.
[2022-05-19 15:06:07] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:07] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:06:09] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/654 places, 1324/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/654 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 p3 (NOT p2)) (AND p3 (NOT p2) p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s144 1) (GEQ s600 1)) (AND (GEQ s459 1) (GEQ s580 1)) (AND (GEQ s176 1) (GEQ s504 1)) (AND (GEQ s21 1) (GEQ s52 1)) (AND (GEQ s267 1) (GE...], 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]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-07 finished in 6963 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p1)&&p2)||p0))))'
Support contains 6 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1324
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1324
Applied a total of 2 rules in 24 ms. Remains 653 /654 variables (removed 1) and now considering 1324/1325 (removed 1) transitions.
[2022-05-19 15:06:09] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:09] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 15:06:10] [INFO ] Dead Transitions using invariants and state equation in 1130 ms found 0 transitions.
[2022-05-19 15:06:10] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:10] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:06:11] [INFO ] Implicit Places using invariants in 735 ms returned []
[2022-05-19 15:06:11] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:11] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:06:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:06:20] [INFO ] Implicit Places using invariants and state equation in 8847 ms returned []
Implicit Place search using SMT with State Equation took 9593 ms to find 0 implicit places.
[2022-05-19 15:06:20] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:20] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 15:06:21] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/654 places, 1324/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/654 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s139 1) (LT s223 1) (LT s561 1)), p2:(OR (GEQ s314 1) (AND (GEQ s284 1) (GEQ s366 1))), p1:(AND (GEQ s139 1) (GEQ s223 1) (GEQ s561 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 5601 reset in 623 ms.
Product exploration explored 100000 steps with 5598 reset in 684 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 p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 463 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 558 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 133479 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133479 steps, saw 38527 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-19 15:06:26] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:26] [INFO ] Computed 82 place invariants in 26 ms
[2022-05-19 15:06:26] [INFO ] [Real]Absence check using 62 positive place invariants in 12 ms returned sat
[2022-05-19 15:06:26] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 24 ms returned sat
[2022-05-19 15:06:27] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-19 15:06:27] [INFO ] [Nat]Absence check using 62 positive place invariants in 14 ms returned sat
[2022-05-19 15:06:27] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 24 ms returned sat
[2022-05-19 15:06:29] [INFO ] After 1889ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-19 15:06:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:06:29] [INFO ] After 578ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-05-19 15:06:29] [INFO ] After 856ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 977 ms.
[2022-05-19 15:06:30] [INFO ] After 3905ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 653 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 653 transition count 1290
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 619 transition count 1289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 70 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 138 place count 584 transition count 1255
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 144 place count 581 transition count 1252
Applied a total of 144 rules in 90 ms. Remains 581 /653 variables (removed 72) and now considering 1252/1324 (removed 72) transitions.
[2022-05-19 15:06:31] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:06:31] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 15:06:31] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/653 places, 1252/1324 transitions.
Incomplete random walk after 10000 steps, including 708 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Finished Best-First random walk after 4382 steps, including 31 resets, run visited all 3 properties in 16 ms. (steps per millisecond=273 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 393 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 15 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 15:06:32] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:32] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:06:33] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
[2022-05-19 15:06:33] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:33] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 15:06:34] [INFO ] Implicit Places using invariants in 705 ms returned []
[2022-05-19 15:06:34] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:34] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 15:06:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:06:43] [INFO ] Implicit Places using invariants and state equation in 9330 ms returned []
Implicit Place search using SMT with State Equation took 10042 ms to find 0 implicit places.
[2022-05-19 15:06:43] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:43] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:06:45] [INFO ] Dead Transitions using invariants and state equation in 1406 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 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 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR p0 p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 253 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 138462 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138462 steps, saw 40150 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-19 15:06:48] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:48] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:06:48] [INFO ] [Real]Absence check using 62 positive place invariants in 12 ms returned sat
[2022-05-19 15:06:48] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 23 ms returned sat
[2022-05-19 15:06:49] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 15:06:49] [INFO ] [Nat]Absence check using 62 positive place invariants in 13 ms returned sat
[2022-05-19 15:06:49] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 24 ms returned sat
[2022-05-19 15:06:50] [INFO ] After 1758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 15:06:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:06:51] [INFO ] After 454ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 15:06:52] [INFO ] After 1983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 748 ms.
[2022-05-19 15:06:53] [INFO ] After 4643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 6 out of 653 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 653 transition count 1290
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 619 transition count 1289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 70 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 138 place count 584 transition count 1255
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 144 place count 581 transition count 1252
Applied a total of 144 rules in 73 ms. Remains 581 /653 variables (removed 72) and now considering 1252/1324 (removed 72) transitions.
[2022-05-19 15:06:53] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:06:53] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 15:06:54] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/653 places, 1252/1324 transitions.
Finished random walk after 168 steps, including 10 resets, run visited all 2 properties in 3 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR p0 p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR p0 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 62 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 5606 reset in 531 ms.
Product exploration explored 100000 steps with 5600 reset in 568 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 68 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1324
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 35 place count 653 transition count 1325
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 653 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 652 transition count 1324
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 652 transition count 1324
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 652 transition count 1324
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 108 place count 618 transition count 1290
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 142 place count 618 transition count 1290
Deduced a syphon composed of 37 places in 1 ms
Applied a total of 142 rules in 248 ms. Remains 618 /653 variables (removed 35) and now considering 1290/1324 (removed 34) transitions.
[2022-05-19 15:06:56] [INFO ] Flow matrix only has 1281 transitions (discarded 9 similar events)
// Phase 1: matrix 1281 rows 618 cols
[2022-05-19 15:06:56] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 15:06:57] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
[2022-05-19 15:06:57] [INFO ] Redundant transitions in 37 ms returned []
[2022-05-19 15:06:57] [INFO ] Flow matrix only has 1281 transitions (discarded 9 similar events)
// Phase 1: matrix 1281 rows 618 cols
[2022-05-19 15:06:57] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 15:06:58] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 618/653 places, 1290/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 618/653 places, 1290/1324 transitions.
Entered a terminal (fully accepting) state of product in 15166 steps with 1126 reset in 251 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-08 finished in 49154 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 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1324
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1324
Applied a total of 2 rules in 28 ms. Remains 653 /654 variables (removed 1) and now considering 1324/1325 (removed 1) transitions.
[2022-05-19 15:06:58] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:58] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:06:59] [INFO ] Dead Transitions using invariants and state equation in 1329 ms found 0 transitions.
[2022-05-19 15:06:59] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:06:59] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:07:00] [INFO ] Implicit Places using invariants in 694 ms returned []
[2022-05-19 15:07:00] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:07:00] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 15:07:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:07:10] [INFO ] Implicit Places using invariants and state equation in 9664 ms returned []
Implicit Place search using SMT with State Equation took 10382 ms to find 0 implicit places.
[2022-05-19 15:07:10] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:07:10] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 15:07:11] [INFO ] Dead Transitions using invariants and state equation in 1048 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/654 places, 1324/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/654 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s382 2)], 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 835 ms.
Product exploration explored 100000 steps with 50000 reset in 783 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-09 finished in 14606 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(G(p0))))&&F(p1)))'
Support contains 7 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1324
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1324
Applied a total of 2 rules in 32 ms. Remains 653 /654 variables (removed 1) and now considering 1324/1325 (removed 1) transitions.
[2022-05-19 15:07:13] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:07:13] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 15:07:14] [INFO ] Dead Transitions using invariants and state equation in 1125 ms found 0 transitions.
[2022-05-19 15:07:14] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:07:14] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 15:07:14] [INFO ] Implicit Places using invariants in 657 ms returned []
[2022-05-19 15:07:14] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:07:14] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 15:07:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:07:23] [INFO ] Implicit Places using invariants and state equation in 8359 ms returned []
Implicit Place search using SMT with State Equation took 9025 ms to find 0 implicit places.
[2022-05-19 15:07:23] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 15:07:23] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 15:07:24] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/654 places, 1324/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/654 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s102 7) (GEQ s180 1) (GEQ s445 1) (GEQ s511 1) (GEQ s572 1)), p0:(OR (LT s284 1) (LT s342 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-11 finished in 11419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1253
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 580 transition count 1251
Applied a total of 148 rules in 91 ms. Remains 580 /654 variables (removed 74) and now considering 1251/1325 (removed 74) transitions.
[2022-05-19 15:07:24] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 15:07:24] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:07:25] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
[2022-05-19 15:07:25] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 15:07:25] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:07:26] [INFO ] Implicit Places using invariants in 666 ms returned []
[2022-05-19 15:07:26] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 15:07:26] [INFO ] Computed 82 place invariants in 24 ms
[2022-05-19 15:07:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:07:34] [INFO ] Implicit Places using invariants and state equation in 8237 ms returned []
Implicit Place search using SMT with State Equation took 8914 ms to find 0 implicit places.
[2022-05-19 15:07:34] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-19 15:07:34] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 15:07:34] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 15:07:35] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/654 places, 1251/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/654 places, 1251/1325 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s340 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-12 finished in 10793 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((((F(p0)&&p0) U F(p1))&&p0))))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Applied a total of 0 rules in 25 ms. Remains 654 /654 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
[2022-05-19 15:07:35] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 654 cols
[2022-05-19 15:07:35] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 15:07:36] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
[2022-05-19 15:07:36] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 654 cols
[2022-05-19 15:07:36] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 15:07:37] [INFO ] Implicit Places using invariants in 699 ms returned []
[2022-05-19 15:07:37] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 654 cols
[2022-05-19 15:07:37] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:07:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:07:44] [INFO ] Implicit Places using invariants and state equation in 7077 ms returned []
Implicit Place search using SMT with State Equation took 7793 ms to find 0 implicit places.
[2022-05-19 15:07:44] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 654 cols
[2022-05-19 15:07:44] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 15:07:45] [INFO ] Dead Transitions using invariants and state equation in 1051 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 654/654 places, 1325/1325 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s314 1), p1:(GEQ s485 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-13 finished in 10053 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(F(X(p0))))||p1)))'
Support contains 3 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1255
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 84 ms. Remains 582 /654 variables (removed 72) and now considering 1253/1325 (removed 72) transitions.
[2022-05-19 15:07:45] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 15:07:45] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 15:07:46] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
[2022-05-19 15:07:46] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 15:07:46] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 15:07:46] [INFO ] Implicit Places using invariants in 657 ms returned []
[2022-05-19 15:07:46] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 15:07:46] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 15:07:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:08:00] [INFO ] Implicit Places using invariants and state equation in 13413 ms returned []
Implicit Place search using SMT with State Equation took 14071 ms to find 0 implicit places.
[2022-05-19 15:08:00] [INFO ] Redundant transitions in 28 ms returned []
[2022-05-19 15:08:00] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 15:08:00] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 15:08:01] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/654 places, 1253/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/654 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s187 1)), p0:(LT s424 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7354 reset in 788 ms.
Product exploration explored 100000 steps with 7361 reset in 696 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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 297 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5761 steps, including 431 resets, run visited all 1 properties in 44 ms. (steps per millisecond=130 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 273 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 582 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 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 33 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2022-05-19 15:08:03] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 15:08:03] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 15:08:04] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
[2022-05-19 15:08:04] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 15:08:04] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 15:08:04] [INFO ] Implicit Places using invariants in 643 ms returned []
[2022-05-19 15:08:04] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 15:08:04] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 15:08:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:08:14] [INFO ] Implicit Places using invariants and state equation in 9201 ms returned []
Implicit Place search using SMT with State Equation took 9844 ms to find 0 implicit places.
[2022-05-19 15:08:14] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-19 15:08:14] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 15:08:14] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 15:08:14] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/582 places, 1253/1253 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 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4621 steps, including 333 resets, run visited all 1 properties in 38 ms. (steps per millisecond=121 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7352 reset in 675 ms.
Product exploration explored 100000 steps with 7313 reset in 700 ms.
Built C files in :
/tmp/ltsmin16736875923571934783
[2022-05-19 15:08:16] [INFO ] Computing symmetric may disable matrix : 1253 transitions.
[2022-05-19 15:08:17] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:08:17] [INFO ] Computing symmetric may enable matrix : 1253 transitions.
[2022-05-19 15:08:17] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:08:17] [INFO ] Computing Do-Not-Accords matrix : 1253 transitions.
[2022-05-19 15:08:17] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:08:17] [INFO ] Built C files in 330ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16736875923571934783
Running compilation step : cd /tmp/ltsmin16736875923571934783;'/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/ltsmin16736875923571934783;'/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/ltsmin16736875923571934783;'/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 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 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 582 transition count 1252
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 581 transition count 1252
Applied a total of 2 rules in 35 ms. Remains 581 /582 variables (removed 1) and now considering 1252/1253 (removed 1) transitions.
[2022-05-19 15:08:20] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:08:20] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 15:08:21] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
[2022-05-19 15:08:21] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:08:21] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 15:08:22] [INFO ] Implicit Places using invariants in 697 ms returned []
[2022-05-19 15:08:22] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:08:22] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 15:08:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:08:29] [INFO ] Implicit Places using invariants and state equation in 7262 ms returned []
Implicit Place search using SMT with State Equation took 7959 ms to find 0 implicit places.
[2022-05-19 15:08:29] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-19 15:08:29] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:08:29] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 15:08:30] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/582 places, 1252/1253 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/582 places, 1252/1253 transitions.
Built C files in :
/tmp/ltsmin15478957265675677384
[2022-05-19 15:08:30] [INFO ] Computing symmetric may disable matrix : 1252 transitions.
[2022-05-19 15:08:30] [INFO ] Computation of Complete disable matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:08:30] [INFO ] Computing symmetric may enable matrix : 1252 transitions.
[2022-05-19 15:08:30] [INFO ] Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:08:30] [INFO ] Computing Do-Not-Accords matrix : 1252 transitions.
[2022-05-19 15:08:30] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:08:30] [INFO ] Built C files in 260ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15478957265675677384
Running compilation step : cd /tmp/ltsmin15478957265675677384;'/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/ltsmin15478957265675677384;'/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/ltsmin15478957265675677384;'/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-19 15:08:33] [INFO ] Flatten gal took : 85 ms
[2022-05-19 15:08:33] [INFO ] Flatten gal took : 78 ms
[2022-05-19 15:08:33] [INFO ] Time to serialize gal into /tmp/LTL9075900468109872225.gal : 18 ms
[2022-05-19 15:08:33] [INFO ] Time to serialize properties into /tmp/LTL15582605733511801505.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/LTL9075900468109872225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15582605733511801505.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/LTL9075900...267
Read 1 LTL properties
Checking formula 0 : !((G((G(X(F(X("(place_520_1<1)")))))||("((JobCnt>=1)&&(place_782_1>=1))"))))
Formula 0 simplified : !G("((JobCnt>=1)&&(place_782_1>=1))" | GXFX"(place_520_1<1)")
Detected timeout of ITS tools.
[2022-05-19 15:08:48] [INFO ] Flatten gal took : 81 ms
[2022-05-19 15:08:48] [INFO ] Applying decomposition
[2022-05-19 15:08:48] [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/graph13165434477067901181.txt' '-o' '/tmp/graph13165434477067901181.bin' '-w' '/tmp/graph13165434477067901181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13165434477067901181.bin' '-l' '-1' '-v' '-w' '/tmp/graph13165434477067901181.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:08:49] [INFO ] Decomposing Gal with order
[2022-05-19 15:08:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:08:49] [INFO ] Removed a total of 3070 redundant transitions.
[2022-05-19 15:08:49] [INFO ] Flatten gal took : 342 ms
[2022-05-19 15:08:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 346 labels/synchronizations in 56 ms.
[2022-05-19 15:08:49] [INFO ] Time to serialize gal into /tmp/LTL6263570367733855780.gal : 15 ms
[2022-05-19 15:08:49] [INFO ] Time to serialize properties into /tmp/LTL14787431520726135875.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/LTL6263570367733855780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14787431520726135875.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/LTL6263570...246
Read 1 LTL properties
Checking formula 0 : !((G((G(X(F(X("(i7.u24.place_520_1<1)")))))||("((i4.u0.JobCnt>=1)&&(i0.u2.place_782_1>=1))"))))
Formula 0 simplified : !G("((i4.u0.JobCnt>=1)&&(i0.u2.place_782_1>=1))" | GXFX"(i7.u24.place_520_1<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2770702874061785989
[2022-05-19 15:09:04] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2770702874061785989
Running compilation step : cd /tmp/ltsmin2770702874061785989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2660 ms.
Running link step : cd /tmp/ltsmin2770702874061785989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin2770702874061785989;'/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((LTLAPp0==true)))))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-14 finished in 94605 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 1325/1325 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 581 transition count 1252
Applied a total of 146 rules in 86 ms. Remains 581 /654 variables (removed 73) and now considering 1252/1325 (removed 73) transitions.
[2022-05-19 15:09:20] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:09:20] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 15:09:20] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
[2022-05-19 15:09:20] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:09:20] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 15:09:21] [INFO ] Implicit Places using invariants in 670 ms returned []
[2022-05-19 15:09:21] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:09:21] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 15:09:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:09:29] [INFO ] Implicit Places using invariants and state equation in 8129 ms returned []
Implicit Place search using SMT with State Equation took 8800 ms to find 0 implicit places.
[2022-05-19 15:09:29] [INFO ] Redundant transitions in 22 ms returned []
[2022-05-19 15:09:29] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:09:29] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 15:09:30] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/654 places, 1252/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/654 places, 1252/1325 transitions.
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s67 1) (LT s384 1) (LT s534 1) (LT s277 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7151 reset in 763 ms.
Product exploration explored 100000 steps with 7146 reset in 782 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 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 43 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 705 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 288186 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 288186 steps, saw 47329 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 15:09:35] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:09:35] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 15:09:35] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2022-05-19 15:09:35] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2022-05-19 15:09:35] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 15:09:35] [INFO ] [Nat]Absence check using 63 positive place invariants in 11 ms returned sat
[2022-05-19 15:09:35] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2022-05-19 15:09:36] [INFO ] After 1260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 15:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:09:45] [INFO ] After 9038ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-19 15:09:45] [INFO ] After 10420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 33 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2022-05-19 15:09:45] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:09:45] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 15:09:46] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Incomplete random walk after 10000 steps, including 705 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 289624 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289624 steps, saw 47556 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 15:09:49] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:09:49] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-19 15:09:49] [INFO ] [Real]Absence check using 63 positive place invariants in 11 ms returned sat
[2022-05-19 15:09:49] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2022-05-19 15:09:49] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 15:09:49] [INFO ] [Nat]Absence check using 63 positive place invariants in 11 ms returned sat
[2022-05-19 15:09:49] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2022-05-19 15:09:51] [INFO ] After 1269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 15:09:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:10:00] [INFO ] After 9069ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-19 15:10:00] [INFO ] After 10457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 40 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 39 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2022-05-19 15:10:00] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:10:00] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 15:10:00] [INFO ] Implicit Places using invariants in 665 ms returned []
[2022-05-19 15:10:00] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:10:00] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 15:10:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:10:08] [INFO ] Implicit Places using invariants and state equation in 7729 ms returned []
Implicit Place search using SMT with State Equation took 8398 ms to find 0 implicit places.
[2022-05-19 15:10:08] [INFO ] Redundant transitions in 28 ms returned []
[2022-05-19 15:10:08] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:10:08] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 15:10:09] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 581 transition count 1243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 581 transition count 1242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 580 transition count 1242
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 580 transition count 1241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 579 transition count 1241
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 579 transition count 1231
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 569 transition count 1231
Applied a total of 33 rules in 150 ms. Remains 569 /581 variables (removed 12) and now considering 1231/1252 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1231 rows 569 cols
[2022-05-19 15:10:09] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 15:10:09] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2022-05-19 15:10:09] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2022-05-19 15:10:10] [INFO ] After 778ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 15:10:10] [INFO ] [Nat]Absence check using 63 positive place invariants in 12 ms returned sat
[2022-05-19 15:10:10] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 24 ms returned sat
[2022-05-19 15:10:11] [INFO ] After 761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 15:10:12] [INFO ] Deduced a trap composed of 218 places in 291 ms of which 17 ms to minimize.
[2022-05-19 15:10:12] [INFO ] Deduced a trap composed of 226 places in 263 ms of which 1 ms to minimize.
[2022-05-19 15:10:12] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 0 ms to minimize.
[2022-05-19 15:10:13] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 1 ms to minimize.
[2022-05-19 15:10:13] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2022-05-19 15:10:13] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2022-05-19 15:10:13] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 1 ms to minimize.
[2022-05-19 15:10:14] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 1 ms to minimize.
[2022-05-19 15:10:14] [INFO ] Deduced a trap composed of 222 places in 260 ms of which 0 ms to minimize.
[2022-05-19 15:10:15] [INFO ] Deduced a trap composed of 237 places in 264 ms of which 1 ms to minimize.
[2022-05-19 15:10:15] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2022-05-19 15:10:16] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 0 ms to minimize.
[2022-05-19 15:10:16] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 1 ms to minimize.
[2022-05-19 15:10:16] [INFO ] Deduced a trap composed of 224 places in 254 ms of which 1 ms to minimize.
[2022-05-19 15:10:17] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 1 ms to minimize.
[2022-05-19 15:10:17] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 1 ms to minimize.
[2022-05-19 15:10:17] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 1 ms to minimize.
[2022-05-19 15:10:18] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 0 ms to minimize.
[2022-05-19 15:10:18] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 0 ms to minimize.
[2022-05-19 15:10:18] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 0 ms to minimize.
[2022-05-19 15:10:19] [INFO ] Deduced a trap composed of 232 places in 241 ms of which 0 ms to minimize.
[2022-05-19 15:10:19] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 1 ms to minimize.
[2022-05-19 15:10:19] [INFO ] Deduced a trap composed of 231 places in 240 ms of which 0 ms to minimize.
[2022-05-19 15:10:20] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2022-05-19 15:10:20] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 0 ms to minimize.
[2022-05-19 15:10:20] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 0 ms to minimize.
[2022-05-19 15:10:21] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 0 ms to minimize.
[2022-05-19 15:10:21] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 1 ms to minimize.
[2022-05-19 15:10:22] [INFO ] Deduced a trap composed of 228 places in 268 ms of which 1 ms to minimize.
[2022-05-19 15:10:22] [INFO ] Deduced a trap composed of 222 places in 262 ms of which 1 ms to minimize.
[2022-05-19 15:10:22] [INFO ] Deduced a trap composed of 226 places in 262 ms of which 0 ms to minimize.
[2022-05-19 15:10:23] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 1 ms to minimize.
[2022-05-19 15:10:23] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 1 ms to minimize.
[2022-05-19 15:10:23] [INFO ] Deduced a trap composed of 224 places in 268 ms of which 1 ms to minimize.
[2022-05-19 15:10:24] [INFO ] Deduced a trap composed of 240 places in 271 ms of which 1 ms to minimize.
[2022-05-19 15:10:24] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 1 ms to minimize.
[2022-05-19 15:10:24] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2022-05-19 15:10:25] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 1 ms to minimize.
[2022-05-19 15:10:25] [INFO ] Deduced a trap composed of 228 places in 256 ms of which 0 ms to minimize.
[2022-05-19 15:10:25] [INFO ] Deduced a trap composed of 231 places in 261 ms of which 0 ms to minimize.
[2022-05-19 15:10:26] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 0 ms to minimize.
[2022-05-19 15:10:26] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 0 ms to minimize.
[2022-05-19 15:10:26] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 1 ms to minimize.
[2022-05-19 15:10:27] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 0 ms to minimize.
[2022-05-19 15:10:27] [INFO ] Deduced a trap composed of 222 places in 255 ms of which 1 ms to minimize.
[2022-05-19 15:10:27] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 0 ms to minimize.
[2022-05-19 15:10:28] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 1 ms to minimize.
[2022-05-19 15:10:28] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 1 ms to minimize.
[2022-05-19 15:10:28] [INFO ] Deduced a trap composed of 226 places in 273 ms of which 0 ms to minimize.
[2022-05-19 15:10:29] [INFO ] Deduced a trap composed of 221 places in 266 ms of which 0 ms to minimize.
[2022-05-19 15:10:29] [INFO ] Deduced a trap composed of 229 places in 241 ms of which 1 ms to minimize.
[2022-05-19 15:10:29] [INFO ] Deduced a trap composed of 226 places in 238 ms of which 0 ms to minimize.
[2022-05-19 15:10:30] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 0 ms to minimize.
[2022-05-19 15:10:30] [INFO ] Deduced a trap composed of 224 places in 257 ms of which 1 ms to minimize.
[2022-05-19 15:10:31] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 1 ms to minimize.
[2022-05-19 15:10:31] [INFO ] Deduced a trap composed of 222 places in 254 ms of which 0 ms to minimize.
[2022-05-19 15:10:31] [INFO ] Deduced a trap composed of 226 places in 246 ms of which 0 ms to minimize.
[2022-05-19 15:10:32] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 0 ms to minimize.
[2022-05-19 15:10:32] [INFO ] Deduced a trap composed of 224 places in 239 ms of which 0 ms to minimize.
[2022-05-19 15:10:32] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 1 ms to minimize.
[2022-05-19 15:10:33] [INFO ] Deduced a trap composed of 229 places in 242 ms of which 0 ms to minimize.
[2022-05-19 15:10:33] [INFO ] Deduced a trap composed of 232 places in 244 ms of which 1 ms to minimize.
[2022-05-19 15:10:33] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 1 ms to minimize.
[2022-05-19 15:10:34] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 1 ms to minimize.
[2022-05-19 15:10:34] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 0 ms to minimize.
[2022-05-19 15:10:34] [INFO ] Deduced a trap composed of 224 places in 260 ms of which 1 ms to minimize.
[2022-05-19 15:10:35] [INFO ] Deduced a trap composed of 240 places in 263 ms of which 0 ms to minimize.
[2022-05-19 15:10:35] [INFO ] Deduced a trap composed of 230 places in 274 ms of which 1 ms to minimize.
[2022-05-19 15:10:36] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2022-05-19 15:10:36] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 0 ms to minimize.
[2022-05-19 15:10:37] [INFO ] Deduced a trap composed of 224 places in 240 ms of which 0 ms to minimize.
[2022-05-19 15:10:37] [INFO ] Deduced a trap composed of 224 places in 269 ms of which 1 ms to minimize.
[2022-05-19 15:10:37] [INFO ] Deduced a trap composed of 239 places in 262 ms of which 0 ms to minimize.
[2022-05-19 15:10:38] [INFO ] Deduced a trap composed of 231 places in 261 ms of which 0 ms to minimize.
[2022-05-19 15:10:38] [INFO ] Deduced a trap composed of 233 places in 262 ms of which 0 ms to minimize.
[2022-05-19 15:10:38] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 1 ms to minimize.
[2022-05-19 15:10:39] [INFO ] Deduced a trap composed of 234 places in 240 ms of which 0 ms to minimize.
[2022-05-19 15:10:39] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 0 ms to minimize.
[2022-05-19 15:10:39] [INFO ] Deduced a trap composed of 235 places in 237 ms of which 1 ms to minimize.
[2022-05-19 15:10:40] [INFO ] Deduced a trap composed of 228 places in 235 ms of which 0 ms to minimize.
[2022-05-19 15:10:40] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 0 ms to minimize.
[2022-05-19 15:10:40] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 1 ms to minimize.
[2022-05-19 15:10:41] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 0 ms to minimize.
[2022-05-19 15:10:41] [INFO ] Deduced a trap composed of 226 places in 233 ms of which 1 ms to minimize.
[2022-05-19 15:10:42] [INFO ] Deduced a trap composed of 225 places in 233 ms of which 1 ms to minimize.
[2022-05-19 15:10:42] [INFO ] Deduced a trap composed of 233 places in 237 ms of which 1 ms to minimize.
[2022-05-19 15:10:42] [INFO ] Deduced a trap composed of 236 places in 238 ms of which 1 ms to minimize.
[2022-05-19 15:10:43] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 0 ms to minimize.
[2022-05-19 15:10:43] [INFO ] Deduced a trap composed of 224 places in 230 ms of which 1 ms to minimize.
[2022-05-19 15:10:43] [INFO ] Deduced a trap composed of 234 places in 236 ms of which 0 ms to minimize.
[2022-05-19 15:10:44] [INFO ] Deduced a trap composed of 237 places in 267 ms of which 0 ms to minimize.
[2022-05-19 15:10:44] [INFO ] Deduced a trap composed of 226 places in 263 ms of which 0 ms to minimize.
[2022-05-19 15:10:45] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 0 ms to minimize.
[2022-05-19 15:10:45] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 1 ms to minimize.
[2022-05-19 15:10:45] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2022-05-19 15:10:46] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2022-05-19 15:10:46] [INFO ] Deduced a trap composed of 232 places in 235 ms of which 0 ms to minimize.
[2022-05-19 15:10:46] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 1 ms to minimize.
[2022-05-19 15:10:47] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 0 ms to minimize.
[2022-05-19 15:10:47] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 0 ms to minimize.
[2022-05-19 15:10:47] [INFO ] Deduced a trap composed of 228 places in 242 ms of which 0 ms to minimize.
[2022-05-19 15:10:48] [INFO ] Deduced a trap composed of 237 places in 255 ms of which 0 ms to minimize.
[2022-05-19 15:10:49] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 1 ms to minimize.
[2022-05-19 15:10:49] [INFO ] Deduced a trap composed of 231 places in 250 ms of which 0 ms to minimize.
[2022-05-19 15:10:50] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 0 ms to minimize.
[2022-05-19 15:10:50] [INFO ] Deduced a trap composed of 227 places in 235 ms of which 0 ms to minimize.
[2022-05-19 15:10:50] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 0 ms to minimize.
[2022-05-19 15:10:51] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 1 ms to minimize.
[2022-05-19 15:10:52] [INFO ] Deduced a trap composed of 240 places in 277 ms of which 1 ms to minimize.
[2022-05-19 15:10:53] [INFO ] Deduced a trap composed of 222 places in 257 ms of which 0 ms to minimize.
[2022-05-19 15:10:53] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 0 ms to minimize.
[2022-05-19 15:10:54] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 0 ms to minimize.
[2022-05-19 15:10:54] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2022-05-19 15:10:55] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2022-05-19 15:10:55] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2022-05-19 15:10:56] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 1 ms to minimize.
[2022-05-19 15:10:57] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 0 ms to minimize.
[2022-05-19 15:11:00] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 1 ms to minimize.
[2022-05-19 15:11:01] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2022-05-19 15:11:03] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 0 ms to minimize.
[2022-05-19 15:11:05] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 0 ms to minimize.
[2022-05-19 15:11:05] [INFO ] Deduced a trap composed of 224 places in 243 ms of which 1 ms to minimize.
[2022-05-19 15:11:06] [INFO ] Deduced a trap composed of 234 places in 236 ms of which 0 ms to minimize.
[2022-05-19 15:11:06] [INFO ] Deduced a trap composed of 222 places in 242 ms of which 1 ms to minimize.
[2022-05-19 15:11:06] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 0 ms to minimize.
[2022-05-19 15:11:07] [INFO ] Deduced a trap composed of 238 places in 238 ms of which 1 ms to minimize.
[2022-05-19 15:11:08] [INFO ] Deduced a trap composed of 225 places in 256 ms of which 1 ms to minimize.
[2022-05-19 15:11:08] [INFO ] Deduced a trap composed of 235 places in 243 ms of which 0 ms to minimize.
[2022-05-19 15:11:08] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 1 ms to minimize.
[2022-05-19 15:11:08] [INFO ] Deduced a trap composed of 234 places in 241 ms of which 1 ms to minimize.
[2022-05-19 15:11:09] [INFO ] Deduced a trap composed of 231 places in 241 ms of which 1 ms to minimize.
[2022-05-19 15:11:10] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 0 ms to minimize.
[2022-05-19 15:11:10] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2022-05-19 15:11:11] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 1 ms to minimize.
[2022-05-19 15:11:11] [INFO ] Deduced a trap composed of 224 places in 265 ms of which 1 ms to minimize.
[2022-05-19 15:11:12] [INFO ] Deduced a trap composed of 220 places in 259 ms of which 1 ms to minimize.
[2022-05-19 15:11:12] [INFO ] Deduced a trap composed of 225 places in 265 ms of which 1 ms to minimize.
[2022-05-19 15:11:13] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 0 ms to minimize.
[2022-05-19 15:11:13] [INFO ] Deduced a trap composed of 238 places in 246 ms of which 1 ms to minimize.
[2022-05-19 15:11:14] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 1 ms to minimize.
[2022-05-19 15:11:14] [INFO ] Deduced a trap composed of 224 places in 235 ms of which 0 ms to minimize.
[2022-05-19 15:11:14] [INFO ] Deduced a trap composed of 234 places in 238 ms of which 1 ms to minimize.
[2022-05-19 15:11:15] [INFO ] Deduced a trap composed of 226 places in 233 ms of which 0 ms to minimize.
[2022-05-19 15:11:15] [INFO ] Deduced a trap composed of 234 places in 242 ms of which 2 ms to minimize.
[2022-05-19 15:11:16] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 0 ms to minimize.
[2022-05-19 15:11:16] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 0 ms to minimize.
[2022-05-19 15:11:16] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 0 ms to minimize.
[2022-05-19 15:11:17] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2022-05-19 15:11:17] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2022-05-19 15:11:18] [INFO ] Deduced a trap composed of 222 places in 241 ms of which 1 ms to minimize.
[2022-05-19 15:11:18] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 1 ms to minimize.
[2022-05-19 15:11:18] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 1 ms to minimize.
[2022-05-19 15:11:19] [INFO ] Deduced a trap composed of 224 places in 242 ms of which 0 ms to minimize.
[2022-05-19 15:11:19] [INFO ] Deduced a trap composed of 228 places in 242 ms of which 0 ms to minimize.
[2022-05-19 15:11:20] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2022-05-19 15:11:22] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 1 ms to minimize.
[2022-05-19 15:11:23] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 1 ms to minimize.
[2022-05-19 15:11:24] [INFO ] Deduced a trap composed of 222 places in 237 ms of which 0 ms to minimize.
[2022-05-19 15:11:27] [INFO ] Deduced a trap composed of 226 places in 243 ms of which 0 ms to minimize.
[2022-05-19 15:11:27] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 2 ms to minimize.
[2022-05-19 15:11:27] [INFO ] Deduced a trap composed of 232 places in 233 ms of which 1 ms to minimize.
[2022-05-19 15:11:27] [INFO ] Deduced a trap composed of 224 places in 242 ms of which 1 ms to minimize.
[2022-05-19 15:11:28] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 0 ms to minimize.
[2022-05-19 15:11:28] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 0 ms to minimize.
[2022-05-19 15:11:29] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 1 ms to minimize.
[2022-05-19 15:11:29] [INFO ] Deduced a trap composed of 223 places in 235 ms of which 1 ms to minimize.
[2022-05-19 15:11:29] [INFO ] Deduced a trap composed of 240 places in 238 ms of which 2 ms to minimize.
[2022-05-19 15:11:30] [INFO ] Deduced a trap composed of 238 places in 235 ms of which 1 ms to minimize.
[2022-05-19 15:11:30] [INFO ] Deduced a trap composed of 222 places in 242 ms of which 1 ms to minimize.
[2022-05-19 15:11:30] [INFO ] Deduced a trap composed of 235 places in 245 ms of which 1 ms to minimize.
[2022-05-19 15:11:31] [INFO ] Deduced a trap composed of 229 places in 255 ms of which 1 ms to minimize.
[2022-05-19 15:11:31] [INFO ] Deduced a trap composed of 232 places in 239 ms of which 1 ms to minimize.
[2022-05-19 15:11:31] [INFO ] Deduced a trap composed of 228 places in 238 ms of which 0 ms to minimize.
[2022-05-19 15:11:32] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 1 ms to minimize.
[2022-05-19 15:11:32] [INFO ] Deduced a trap composed of 231 places in 234 ms of which 1 ms to minimize.
[2022-05-19 15:11:32] [INFO ] Deduced a trap composed of 233 places in 238 ms of which 0 ms to minimize.
[2022-05-19 15:11:33] [INFO ] Deduced a trap composed of 219 places in 257 ms of which 1 ms to minimize.
[2022-05-19 15:11:33] [INFO ] Deduced a trap composed of 235 places in 253 ms of which 1 ms to minimize.
[2022-05-19 15:11:33] [INFO ] Deduced a trap composed of 235 places in 260 ms of which 1 ms to minimize.
[2022-05-19 15:11:34] [INFO ] Deduced a trap composed of 227 places in 256 ms of which 0 ms to minimize.
[2022-05-19 15:11:34] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 0 ms to minimize.
[2022-05-19 15:11:34] [INFO ] Deduced a trap composed of 231 places in 242 ms of which 1 ms to minimize.
[2022-05-19 15:11:34] [INFO ] Deduced a trap composed of 236 places in 229 ms of which 1 ms to minimize.
[2022-05-19 15:11:35] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 1 ms to minimize.
[2022-05-19 15:11:39] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 0 ms to minimize.
[2022-05-19 15:11:48] [INFO ] Trap strengthening (SAT) tested/added 185/185 trap constraints in 96642 ms
[2022-05-19 15:11:49] [INFO ] After 98803ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 15:11:49] [INFO ] After 98932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-19 15:11:49] [INFO ] Flatten gal took : 68 ms
[2022-05-19 15:11:49] [INFO ] Flatten gal took : 67 ms
[2022-05-19 15:11:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13667003577117940280.gal : 9 ms
[2022-05-19 15:11:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5481280383172761152.prop : 61 ms
Invoking ITS tools like this :cd /tmp/redAtoms3721885849770168534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13667003577117940280.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5481280383172761152.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5481280383172761152.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :25 after 26
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :26 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 45
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :45 after 88
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :88 after 1371
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1371 after 1464
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1464 after 1685
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1685 after 2093
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2093 after 6425
Detected timeout of ITS tools.
[2022-05-19 15:12:04] [INFO ] Flatten gal took : 63 ms
[2022-05-19 15:12:04] [INFO ] Applying decomposition
[2022-05-19 15:12:04] [INFO ] Flatten gal took : 63 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/graph8237402435169853712.txt' '-o' '/tmp/graph8237402435169853712.bin' '-w' '/tmp/graph8237402435169853712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8237402435169853712.bin' '-l' '-1' '-v' '-w' '/tmp/graph8237402435169853712.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:12:04] [INFO ] Decomposing Gal with order
[2022-05-19 15:12:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:12:05] [INFO ] Removed a total of 1380 redundant transitions.
[2022-05-19 15:12:05] [INFO ] Flatten gal took : 203 ms
[2022-05-19 15:12:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 645 labels/synchronizations in 41 ms.
[2022-05-19 15:12:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9350451271038465147.gal : 10 ms
[2022-05-19 15:12:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17488846236484570870.prop : 219 ms
Invoking ITS tools like this :cd /tmp/redAtoms3721885849770168534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9350451271038465147.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17488846236484570870.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality17488846236484570870.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5106753221230456855
[2022-05-19 15:12:20] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5106753221230456855
Running compilation step : cd /tmp/ltsmin5106753221230456855;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2634 ms.
Running link step : cd /tmp/ltsmin5106753221230456855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5106753221230456855;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 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 35 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Support contains 4 out of 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 34 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2022-05-19 15:12:35] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:12:35] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 15:12:36] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
[2022-05-19 15:12:36] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:12:36] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 15:12:37] [INFO ] Implicit Places using invariants in 680 ms returned []
[2022-05-19 15:12:37] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:12:37] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 15:12:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:12:45] [INFO ] Implicit Places using invariants and state equation in 8222 ms returned []
Implicit Place search using SMT with State Equation took 8904 ms to find 0 implicit places.
[2022-05-19 15:12:45] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-19 15:12:45] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:12:45] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 15:12:46] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 667 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 291707 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291707 steps, saw 47829 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 15:12:49] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:12:49] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 15:12:49] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2022-05-19 15:12:49] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 21 ms returned sat
[2022-05-19 15:12:49] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 15:12:49] [INFO ] [Nat]Absence check using 63 positive place invariants in 11 ms returned sat
[2022-05-19 15:12:49] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 24 ms returned sat
[2022-05-19 15:12:51] [INFO ] After 1265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 15:12:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:13:00] [INFO ] After 9054ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-19 15:13:00] [INFO ] After 10451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 28 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2022-05-19 15:13:00] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:13:00] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 15:13:00] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Incomplete random walk after 10000 steps, including 683 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 280279 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 280279 steps, saw 46114 distinct states, run finished after 3002 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 15:13:03] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:13:03] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 15:13:04] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2022-05-19 15:13:04] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2022-05-19 15:13:04] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 15:13:04] [INFO ] [Nat]Absence check using 63 positive place invariants in 12 ms returned sat
[2022-05-19 15:13:04] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 24 ms returned sat
[2022-05-19 15:13:05] [INFO ] After 1268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 15:13:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:13:14] [INFO ] After 9046ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-19 15:13:14] [INFO ] After 10447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 41 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 27 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2022-05-19 15:13:14] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:13:14] [INFO ] Computed 82 place invariants in 26 ms
[2022-05-19 15:13:15] [INFO ] Implicit Places using invariants in 687 ms returned []
[2022-05-19 15:13:15] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:13:15] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:13:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:13:22] [INFO ] Implicit Places using invariants and state equation in 7333 ms returned []
Implicit Place search using SMT with State Equation took 8022 ms to find 0 implicit places.
[2022-05-19 15:13:22] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-19 15:13:22] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:13:22] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 15:13:23] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 581 transition count 1243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 581 transition count 1242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 580 transition count 1242
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 580 transition count 1241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 579 transition count 1241
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 579 transition count 1231
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 569 transition count 1231
Applied a total of 33 rules in 128 ms. Remains 569 /581 variables (removed 12) and now considering 1231/1252 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1231 rows 569 cols
[2022-05-19 15:13:23] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 15:13:23] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2022-05-19 15:13:23] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2022-05-19 15:13:24] [INFO ] After 760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 15:13:24] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2022-05-19 15:13:24] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2022-05-19 15:13:25] [INFO ] After 719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 15:13:25] [INFO ] Deduced a trap composed of 218 places in 258 ms of which 1 ms to minimize.
[2022-05-19 15:13:26] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 0 ms to minimize.
[2022-05-19 15:13:26] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 1 ms to minimize.
[2022-05-19 15:13:26] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 0 ms to minimize.
[2022-05-19 15:13:27] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 0 ms to minimize.
[2022-05-19 15:13:27] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 0 ms to minimize.
[2022-05-19 15:13:27] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 0 ms to minimize.
[2022-05-19 15:13:28] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 1 ms to minimize.
[2022-05-19 15:13:28] [INFO ] Deduced a trap composed of 222 places in 257 ms of which 0 ms to minimize.
[2022-05-19 15:13:29] [INFO ] Deduced a trap composed of 237 places in 253 ms of which 0 ms to minimize.
[2022-05-19 15:13:29] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 0 ms to minimize.
[2022-05-19 15:13:29] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2022-05-19 15:13:30] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2022-05-19 15:13:30] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 0 ms to minimize.
[2022-05-19 15:13:30] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 1 ms to minimize.
[2022-05-19 15:13:31] [INFO ] Deduced a trap composed of 226 places in 262 ms of which 1 ms to minimize.
[2022-05-19 15:13:31] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 0 ms to minimize.
[2022-05-19 15:13:32] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2022-05-19 15:13:32] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 0 ms to minimize.
[2022-05-19 15:13:32] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 1 ms to minimize.
[2022-05-19 15:13:32] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 0 ms to minimize.
[2022-05-19 15:13:33] [INFO ] Deduced a trap composed of 232 places in 245 ms of which 0 ms to minimize.
[2022-05-19 15:13:33] [INFO ] Deduced a trap composed of 231 places in 241 ms of which 1 ms to minimize.
[2022-05-19 15:13:34] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 1 ms to minimize.
[2022-05-19 15:13:34] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2022-05-19 15:13:34] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 0 ms to minimize.
[2022-05-19 15:13:35] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 0 ms to minimize.
[2022-05-19 15:13:35] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 1 ms to minimize.
[2022-05-19 15:13:36] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 0 ms to minimize.
[2022-05-19 15:13:36] [INFO ] Deduced a trap composed of 222 places in 263 ms of which 1 ms to minimize.
[2022-05-19 15:13:36] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 1 ms to minimize.
[2022-05-19 15:13:36] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2022-05-19 15:13:37] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 0 ms to minimize.
[2022-05-19 15:13:37] [INFO ] Deduced a trap composed of 224 places in 263 ms of which 1 ms to minimize.
[2022-05-19 15:13:38] [INFO ] Deduced a trap composed of 240 places in 253 ms of which 0 ms to minimize.
[2022-05-19 15:13:38] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 0 ms to minimize.
[2022-05-19 15:13:38] [INFO ] Deduced a trap composed of 232 places in 236 ms of which 0 ms to minimize.
[2022-05-19 15:13:38] [INFO ] Deduced a trap composed of 232 places in 234 ms of which 0 ms to minimize.
[2022-05-19 15:13:39] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 1 ms to minimize.
[2022-05-19 15:13:39] [INFO ] Deduced a trap composed of 231 places in 256 ms of which 0 ms to minimize.
[2022-05-19 15:13:40] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 0 ms to minimize.
[2022-05-19 15:13:40] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 0 ms to minimize.
[2022-05-19 15:13:40] [INFO ] Deduced a trap composed of 236 places in 242 ms of which 0 ms to minimize.
[2022-05-19 15:13:41] [INFO ] Deduced a trap composed of 226 places in 250 ms of which 0 ms to minimize.
[2022-05-19 15:13:41] [INFO ] Deduced a trap composed of 222 places in 252 ms of which 0 ms to minimize.
[2022-05-19 15:13:41] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 0 ms to minimize.
[2022-05-19 15:13:41] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 0 ms to minimize.
[2022-05-19 15:13:42] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 0 ms to minimize.
[2022-05-19 15:13:42] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 1 ms to minimize.
[2022-05-19 15:13:43] [INFO ] Deduced a trap composed of 221 places in 262 ms of which 1 ms to minimize.
[2022-05-19 15:13:43] [INFO ] Deduced a trap composed of 229 places in 259 ms of which 0 ms to minimize.
[2022-05-19 15:13:43] [INFO ] Deduced a trap composed of 226 places in 263 ms of which 1 ms to minimize.
[2022-05-19 15:13:44] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 1 ms to minimize.
[2022-05-19 15:13:44] [INFO ] Deduced a trap composed of 224 places in 260 ms of which 1 ms to minimize.
[2022-05-19 15:13:44] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 0 ms to minimize.
[2022-05-19 15:13:45] [INFO ] Deduced a trap composed of 222 places in 262 ms of which 0 ms to minimize.
[2022-05-19 15:13:45] [INFO ] Deduced a trap composed of 226 places in 260 ms of which 1 ms to minimize.
[2022-05-19 15:13:45] [INFO ] Deduced a trap composed of 228 places in 267 ms of which 1 ms to minimize.
[2022-05-19 15:13:46] [INFO ] Deduced a trap composed of 224 places in 256 ms of which 1 ms to minimize.
[2022-05-19 15:13:46] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 0 ms to minimize.
[2022-05-19 15:13:46] [INFO ] Deduced a trap composed of 229 places in 255 ms of which 0 ms to minimize.
[2022-05-19 15:13:47] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 1 ms to minimize.
[2022-05-19 15:13:47] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 0 ms to minimize.
[2022-05-19 15:13:48] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 0 ms to minimize.
[2022-05-19 15:13:48] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 1 ms to minimize.
[2022-05-19 15:13:48] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 0 ms to minimize.
[2022-05-19 15:13:49] [INFO ] Deduced a trap composed of 240 places in 239 ms of which 0 ms to minimize.
[2022-05-19 15:13:49] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 0 ms to minimize.
[2022-05-19 15:13:49] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 0 ms to minimize.
[2022-05-19 15:13:50] [INFO ] Deduced a trap composed of 228 places in 245 ms of which 1 ms to minimize.
[2022-05-19 15:13:50] [INFO ] Deduced a trap composed of 224 places in 256 ms of which 0 ms to minimize.
[2022-05-19 15:13:51] [INFO ] Deduced a trap composed of 224 places in 239 ms of which 1 ms to minimize.
[2022-05-19 15:13:51] [INFO ] Deduced a trap composed of 239 places in 243 ms of which 1 ms to minimize.
[2022-05-19 15:13:51] [INFO ] Deduced a trap composed of 231 places in 264 ms of which 0 ms to minimize.
[2022-05-19 15:13:52] [INFO ] Deduced a trap composed of 233 places in 250 ms of which 1 ms to minimize.
[2022-05-19 15:13:52] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 0 ms to minimize.
[2022-05-19 15:13:52] [INFO ] Deduced a trap composed of 234 places in 240 ms of which 0 ms to minimize.
[2022-05-19 15:13:53] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2022-05-19 15:13:53] [INFO ] Deduced a trap composed of 235 places in 257 ms of which 0 ms to minimize.
[2022-05-19 15:13:53] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 1 ms to minimize.
[2022-05-19 15:13:54] [INFO ] Deduced a trap composed of 228 places in 256 ms of which 0 ms to minimize.
[2022-05-19 15:13:54] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 1 ms to minimize.
[2022-05-19 15:13:55] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 1 ms to minimize.
[2022-05-19 15:13:55] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 0 ms to minimize.
[2022-05-19 15:13:55] [INFO ] Deduced a trap composed of 225 places in 289 ms of which 0 ms to minimize.
[2022-05-19 15:13:56] [INFO ] Deduced a trap composed of 233 places in 255 ms of which 0 ms to minimize.
[2022-05-19 15:13:56] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 0 ms to minimize.
[2022-05-19 15:13:57] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 0 ms to minimize.
[2022-05-19 15:13:57] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 0 ms to minimize.
[2022-05-19 15:13:57] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 0 ms to minimize.
[2022-05-19 15:13:57] [INFO ] Deduced a trap composed of 237 places in 257 ms of which 1 ms to minimize.
[2022-05-19 15:13:58] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 1 ms to minimize.
[2022-05-19 15:13:59] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 1 ms to minimize.
[2022-05-19 15:13:59] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 1 ms to minimize.
[2022-05-19 15:13:59] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 0 ms to minimize.
[2022-05-19 15:14:00] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2022-05-19 15:14:00] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2022-05-19 15:14:00] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 1 ms to minimize.
[2022-05-19 15:14:01] [INFO ] Deduced a trap composed of 238 places in 250 ms of which 1 ms to minimize.
[2022-05-19 15:14:01] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 1 ms to minimize.
[2022-05-19 15:14:01] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 1 ms to minimize.
[2022-05-19 15:14:02] [INFO ] Deduced a trap composed of 237 places in 258 ms of which 0 ms to minimize.
[2022-05-19 15:14:03] [INFO ] Deduced a trap composed of 238 places in 257 ms of which 1 ms to minimize.
[2022-05-19 15:14:03] [INFO ] Deduced a trap composed of 231 places in 279 ms of which 0 ms to minimize.
[2022-05-19 15:14:04] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 1 ms to minimize.
[2022-05-19 15:14:04] [INFO ] Deduced a trap composed of 227 places in 253 ms of which 1 ms to minimize.
[2022-05-19 15:14:04] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 0 ms to minimize.
[2022-05-19 15:14:05] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2022-05-19 15:14:06] [INFO ] Deduced a trap composed of 240 places in 253 ms of which 0 ms to minimize.
[2022-05-19 15:14:07] [INFO ] Deduced a trap composed of 222 places in 248 ms of which 1 ms to minimize.
[2022-05-19 15:14:07] [INFO ] Deduced a trap composed of 234 places in 239 ms of which 0 ms to minimize.
[2022-05-19 15:14:08] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 0 ms to minimize.
[2022-05-19 15:14:08] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 1 ms to minimize.
[2022-05-19 15:14:09] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 1 ms to minimize.
[2022-05-19 15:14:09] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2022-05-19 15:14:09] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 1 ms to minimize.
[2022-05-19 15:14:10] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 0 ms to minimize.
[2022-05-19 15:14:14] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 1 ms to minimize.
[2022-05-19 15:14:15] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 0 ms to minimize.
[2022-05-19 15:14:16] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 1 ms to minimize.
[2022-05-19 15:14:18] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2022-05-19 15:14:18] [INFO ] Deduced a trap composed of 224 places in 243 ms of which 0 ms to minimize.
[2022-05-19 15:14:19] [INFO ] Deduced a trap composed of 234 places in 278 ms of which 1 ms to minimize.
[2022-05-19 15:14:20] [INFO ] Deduced a trap composed of 222 places in 230 ms of which 1 ms to minimize.
[2022-05-19 15:14:20] [INFO ] Deduced a trap composed of 226 places in 262 ms of which 1 ms to minimize.
[2022-05-19 15:14:20] [INFO ] Deduced a trap composed of 238 places in 248 ms of which 0 ms to minimize.
[2022-05-19 15:14:21] [INFO ] Deduced a trap composed of 225 places in 238 ms of which 0 ms to minimize.
[2022-05-19 15:14:21] [INFO ] Deduced a trap composed of 235 places in 249 ms of which 3 ms to minimize.
[2022-05-19 15:14:22] [INFO ] Deduced a trap composed of 224 places in 254 ms of which 1 ms to minimize.
[2022-05-19 15:14:22] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 1 ms to minimize.
[2022-05-19 15:14:22] [INFO ] Deduced a trap composed of 231 places in 254 ms of which 1 ms to minimize.
[2022-05-19 15:14:23] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 1 ms to minimize.
[2022-05-19 15:14:24] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 0 ms to minimize.
[2022-05-19 15:14:24] [INFO ] Deduced a trap composed of 230 places in 229 ms of which 0 ms to minimize.
[2022-05-19 15:14:25] [INFO ] Deduced a trap composed of 224 places in 240 ms of which 0 ms to minimize.
[2022-05-19 15:14:25] [INFO ] Deduced a trap composed of 220 places in 227 ms of which 0 ms to minimize.
[2022-05-19 15:14:25] [INFO ] Deduced a trap composed of 225 places in 235 ms of which 0 ms to minimize.
[2022-05-19 15:14:26] [INFO ] Deduced a trap composed of 234 places in 231 ms of which 0 ms to minimize.
[2022-05-19 15:14:27] [INFO ] Deduced a trap composed of 238 places in 237 ms of which 0 ms to minimize.
[2022-05-19 15:14:27] [INFO ] Deduced a trap composed of 230 places in 233 ms of which 1 ms to minimize.
[2022-05-19 15:14:28] [INFO ] Deduced a trap composed of 224 places in 239 ms of which 1 ms to minimize.
[2022-05-19 15:14:28] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 1 ms to minimize.
[2022-05-19 15:14:28] [INFO ] Deduced a trap composed of 226 places in 260 ms of which 1 ms to minimize.
[2022-05-19 15:14:29] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2022-05-19 15:14:29] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 0 ms to minimize.
[2022-05-19 15:14:29] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 1 ms to minimize.
[2022-05-19 15:14:30] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 1 ms to minimize.
[2022-05-19 15:14:30] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 0 ms to minimize.
[2022-05-19 15:14:31] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2022-05-19 15:14:31] [INFO ] Deduced a trap composed of 222 places in 254 ms of which 1 ms to minimize.
[2022-05-19 15:14:32] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 1 ms to minimize.
[2022-05-19 15:14:32] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 1 ms to minimize.
[2022-05-19 15:14:32] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 0 ms to minimize.
[2022-05-19 15:14:33] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 1 ms to minimize.
[2022-05-19 15:14:34] [INFO ] Deduced a trap composed of 232 places in 239 ms of which 1 ms to minimize.
[2022-05-19 15:14:35] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 1 ms to minimize.
[2022-05-19 15:14:37] [INFO ] Deduced a trap composed of 228 places in 268 ms of which 0 ms to minimize.
[2022-05-19 15:14:38] [INFO ] Deduced a trap composed of 222 places in 259 ms of which 1 ms to minimize.
[2022-05-19 15:14:40] [INFO ] Deduced a trap composed of 226 places in 229 ms of which 1 ms to minimize.
[2022-05-19 15:14:40] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 1 ms to minimize.
[2022-05-19 15:14:41] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 0 ms to minimize.
[2022-05-19 15:14:41] [INFO ] Deduced a trap composed of 224 places in 287 ms of which 1 ms to minimize.
[2022-05-19 15:14:42] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 0 ms to minimize.
[2022-05-19 15:14:42] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 1 ms to minimize.
[2022-05-19 15:14:42] [INFO ] Deduced a trap composed of 242 places in 250 ms of which 1 ms to minimize.
[2022-05-19 15:14:43] [INFO ] Deduced a trap composed of 223 places in 251 ms of which 0 ms to minimize.
[2022-05-19 15:14:43] [INFO ] Deduced a trap composed of 240 places in 236 ms of which 1 ms to minimize.
[2022-05-19 15:14:43] [INFO ] Deduced a trap composed of 238 places in 248 ms of which 1 ms to minimize.
[2022-05-19 15:14:44] [INFO ] Deduced a trap composed of 222 places in 234 ms of which 1 ms to minimize.
[2022-05-19 15:14:44] [INFO ] Deduced a trap composed of 235 places in 231 ms of which 1 ms to minimize.
[2022-05-19 15:14:44] [INFO ] Deduced a trap composed of 229 places in 234 ms of which 1 ms to minimize.
[2022-05-19 15:14:45] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 0 ms to minimize.
[2022-05-19 15:14:45] [INFO ] Deduced a trap composed of 228 places in 280 ms of which 1 ms to minimize.
[2022-05-19 15:14:45] [INFO ] Deduced a trap composed of 228 places in 245 ms of which 1 ms to minimize.
[2022-05-19 15:14:46] [INFO ] Deduced a trap composed of 231 places in 241 ms of which 0 ms to minimize.
[2022-05-19 15:14:46] [INFO ] Deduced a trap composed of 233 places in 251 ms of which 0 ms to minimize.
[2022-05-19 15:14:46] [INFO ] Deduced a trap composed of 219 places in 249 ms of which 0 ms to minimize.
[2022-05-19 15:14:47] [INFO ] Deduced a trap composed of 235 places in 254 ms of which 0 ms to minimize.
[2022-05-19 15:14:47] [INFO ] Deduced a trap composed of 235 places in 250 ms of which 0 ms to minimize.
[2022-05-19 15:14:47] [INFO ] Deduced a trap composed of 227 places in 247 ms of which 1 ms to minimize.
[2022-05-19 15:14:47] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 0 ms to minimize.
[2022-05-19 15:14:48] [INFO ] Deduced a trap composed of 231 places in 248 ms of which 1 ms to minimize.
[2022-05-19 15:14:48] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 0 ms to minimize.
[2022-05-19 15:14:48] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 1 ms to minimize.
[2022-05-19 15:14:53] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 1 ms to minimize.
[2022-05-19 15:15:02] [INFO ] Trap strengthening (SAT) tested/added 185/185 trap constraints in 96598 ms
[2022-05-19 15:15:03] [INFO ] After 98771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 15:15:03] [INFO ] After 98897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-19 15:15:03] [INFO ] Flatten gal took : 60 ms
[2022-05-19 15:15:03] [INFO ] Flatten gal took : 75 ms
[2022-05-19 15:15:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18213961058608453615.gal : 16 ms
[2022-05-19 15:15:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18145232164773325023.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15528807950660469516;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18213961058608453615.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18145232164773325023.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality18145232164773325023.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :25 after 26
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :26 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 45
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :45 after 88
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :88 after 1371
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1371 after 1464
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1464 after 1685
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1685 after 2093
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2093 after 6425
Detected timeout of ITS tools.
[2022-05-19 15:15:18] [INFO ] Flatten gal took : 60 ms
[2022-05-19 15:15:18] [INFO ] Applying decomposition
[2022-05-19 15:15:18] [INFO ] Flatten gal took : 57 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/graph9554906300807417375.txt' '-o' '/tmp/graph9554906300807417375.bin' '-w' '/tmp/graph9554906300807417375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9554906300807417375.bin' '-l' '-1' '-v' '-w' '/tmp/graph9554906300807417375.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:15:18] [INFO ] Decomposing Gal with order
[2022-05-19 15:15:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:15:18] [INFO ] Removed a total of 3524 redundant transitions.
[2022-05-19 15:15:18] [INFO ] Flatten gal took : 121 ms
[2022-05-19 15:15:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 28 ms.
[2022-05-19 15:15:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8329652860246007281.gal : 8 ms
[2022-05-19 15:15:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality320339779248235701.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15528807950660469516;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8329652860246007281.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality320339779248235701.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/ReachabilityCardinality320339779248235701.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1 after 151827
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :151827 after 245112
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :245112 after 245112
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :245112 after 245112
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :245112 after 245112
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :245112 after 245157
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12147913400646814323
[2022-05-19 15:15:34] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12147913400646814323
Running compilation step : cd /tmp/ltsmin12147913400646814323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2586 ms.
Running link step : cd /tmp/ltsmin12147913400646814323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12147913400646814323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 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 36 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 7109 reset in 738 ms.
Product exploration explored 100000 steps with 7140 reset in 899 ms.
Built C files in :
/tmp/ltsmin14586589964531803708
[2022-05-19 15:15:51] [INFO ] Computing symmetric may disable matrix : 1252 transitions.
[2022-05-19 15:15:51] [INFO ] Computation of Complete disable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:15:51] [INFO ] Computing symmetric may enable matrix : 1252 transitions.
[2022-05-19 15:15:51] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:15:51] [INFO ] Computing Do-Not-Accords matrix : 1252 transitions.
[2022-05-19 15:15:51] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:15:51] [INFO ] Built C files in 252ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14586589964531803708
Running compilation step : cd /tmp/ltsmin14586589964531803708;'/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/ltsmin14586589964531803708;'/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/ltsmin14586589964531803708;'/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 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 37 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2022-05-19 15:15:54] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:15:54] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 15:15:55] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
[2022-05-19 15:15:55] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:15:55] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 15:15:55] [INFO ] Implicit Places using invariants in 656 ms returned []
[2022-05-19 15:15:55] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:15:55] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 15:15:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:16:03] [INFO ] Implicit Places using invariants and state equation in 7357 ms returned []
Implicit Place search using SMT with State Equation took 8013 ms to find 0 implicit places.
[2022-05-19 15:16:03] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-19 15:16:03] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:16:03] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 15:16:03] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Built C files in :
/tmp/ltsmin7633160208581379487
[2022-05-19 15:16:03] [INFO ] Computing symmetric may disable matrix : 1252 transitions.
[2022-05-19 15:16:03] [INFO ] Computation of Complete disable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:16:03] [INFO ] Computing symmetric may enable matrix : 1252 transitions.
[2022-05-19 15:16:03] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:16:03] [INFO ] Computing Do-Not-Accords matrix : 1252 transitions.
[2022-05-19 15:16:03] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:16:04] [INFO ] Built C files in 245ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7633160208581379487
Running compilation step : cd /tmp/ltsmin7633160208581379487;'/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/ltsmin7633160208581379487;'/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/ltsmin7633160208581379487;'/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-19 15:16:07] [INFO ] Flatten gal took : 65 ms
[2022-05-19 15:16:07] [INFO ] Flatten gal took : 64 ms
[2022-05-19 15:16:07] [INFO ] Time to serialize gal into /tmp/LTL2526216211280177775.gal : 7 ms
[2022-05-19 15:16:07] [INFO ] Time to serialize properties into /tmp/LTL8518903322415291727.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/LTL2526216211280177775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8518903322415291727.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/LTL2526216...266
Read 1 LTL properties
Checking formula 0 : !((G("(((mi1<1)||(QueueJobB_1_19<1))||((block<1)||(QueueJobE_1<1)))")))
Formula 0 simplified : !G"(((mi1<1)||(QueueJobB_1_19<1))||((block<1)||(QueueJobE_1<1)))"
Detected timeout of ITS tools.
[2022-05-19 15:16:22] [INFO ] Flatten gal took : 61 ms
[2022-05-19 15:16:22] [INFO ] Applying decomposition
[2022-05-19 15:16:22] [INFO ] Flatten gal took : 62 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/graph8281641125039102047.txt' '-o' '/tmp/graph8281641125039102047.bin' '-w' '/tmp/graph8281641125039102047.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8281641125039102047.bin' '-l' '-1' '-v' '-w' '/tmp/graph8281641125039102047.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:16:22] [INFO ] Decomposing Gal with order
[2022-05-19 15:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:16:22] [INFO ] Removed a total of 3069 redundant transitions.
[2022-05-19 15:16:22] [INFO ] Flatten gal took : 154 ms
[2022-05-19 15:16:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 330 labels/synchronizations in 22 ms.
[2022-05-19 15:16:22] [INFO ] Time to serialize gal into /tmp/LTL1978396778836534558.gal : 27 ms
[2022-05-19 15:16:22] [INFO ] Time to serialize properties into /tmp/LTL16584820647513219550.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/LTL1978396778836534558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16584820647513219550.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/LTL1978396...246
Read 1 LTL properties
Checking formula 0 : !((G("(((i5.u21.mi1<1)||(i5.u21.QueueJobB_1_19<1))||((i5.u11.block<1)||(i5.u21.QueueJobE_1<1)))")))
Formula 0 simplified : !G"(((i5.u21.mi1<1)||(i5.u21.QueueJobB_1_19<1))||((i5.u11.block<1)||(i5.u21.QueueJobE_1<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16204677717728982561
[2022-05-19 15:16:38] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16204677717728982561
Running compilation step : cd /tmp/ltsmin16204677717728982561;'/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/ltsmin16204677717728982561;'/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/ltsmin16204677717728982561;'/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 PolyORBNT-PT-S10J30-LTLFireability-15 finished in 441120 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(F(X(p0))))||p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
[2022-05-19 15:16:41] [INFO ] Flatten gal took : 65 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13508517261322329787
[2022-05-19 15:16:41] [INFO ] Computing symmetric may disable matrix : 1325 transitions.
[2022-05-19 15:16:41] [INFO ] Applying decomposition
[2022-05-19 15:16:41] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:16:41] [INFO ] Computing symmetric may enable matrix : 1325 transitions.
[2022-05-19 15:16:41] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:16:41] [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/graph17938539556988271053.txt' '-o' '/tmp/graph17938539556988271053.bin' '-w' '/tmp/graph17938539556988271053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17938539556988271053.bin' '-l' '-1' '-v' '-w' '/tmp/graph17938539556988271053.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:16:41] [INFO ] Decomposing Gal with order
[2022-05-19 15:16:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:16:41] [INFO ] Computing Do-Not-Accords matrix : 1325 transitions.
[2022-05-19 15:16:41] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:16:41] [INFO ] Built C files in 421ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13508517261322329787
Running compilation step : cd /tmp/ltsmin13508517261322329787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 15:16:41] [INFO ] Removed a total of 1001 redundant transitions.
[2022-05-19 15:16:41] [INFO ] Flatten gal took : 124 ms
[2022-05-19 15:16:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 280 labels/synchronizations in 13 ms.
[2022-05-19 15:16:41] [INFO ] Time to serialize gal into /tmp/LTLFireability16095959303091441711.gal : 12 ms
[2022-05-19 15:16:41] [INFO ] Time to serialize properties into /tmp/LTLFireability3581074387987312788.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/LTLFireability16095959303091441711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3581074387987312788.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((G((G(X(F(X("(u38.place_520_1<1)")))))||("((i10.u29.JobCnt>=1)&&(i19.i0.u23.place_782_1>=1))"))))
Formula 0 simplified : !G("((i10.u29.JobCnt>=1)&&(i19.i0.u23.place_782_1>=1))" | GXFX"(u38.place_520_1<1)")
Compilation finished in 5179 ms.
Running link step : cd /tmp/ltsmin13508517261322329787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin13508517261322329787;'/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((LTLAPp0==true)))))||(LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.100: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.100: LTL layer: formula: [](([](X(<>(X((LTLAPp0==true)))))||(LTLAPp1==true)))
pins2lts-mc-linux64( 0/ 8), 0.109: "[](([](X(<>(X((LTLAPp0==true)))))||(LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.129: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.143: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.150: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.160: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.159: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.159: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.160: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.165: buchi has 3 states
pins2lts-mc-linux64( 2/ 8), 0.163: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.166: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.297: DFS-FIFO for weak LTL, using special progress label 1329
pins2lts-mc-linux64( 0/ 8), 0.297: There are 1330 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.297: State length is 655, there are 1331 groups
pins2lts-mc-linux64( 0/ 8), 0.297: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.297: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.297: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.297: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.375: ~1 levels ~960 states ~8280 transitions
pins2lts-mc-linux64( 4/ 8), 0.440: ~1 levels ~1920 states ~15512 transitions
pins2lts-mc-linux64( 2/ 8), 0.569: ~1 levels ~3840 states ~17424 transitions
pins2lts-mc-linux64( 7/ 8), 0.845: ~1 levels ~7680 states ~57768 transitions
pins2lts-mc-linux64( 7/ 8), 1.435: ~1 levels ~15360 states ~114024 transitions
pins2lts-mc-linux64( 7/ 8), 3.467: ~1 levels ~30720 states ~422480 transitions
pins2lts-mc-linux64( 7/ 8), 6.340: ~1 levels ~61440 states ~972152 transitions
pins2lts-mc-linux64( 7/ 8), 9.310: ~1 levels ~122880 states ~1300088 transitions
pins2lts-mc-linux64( 7/ 8), 16.351: ~1 levels ~245760 states ~2410272 transitions
pins2lts-mc-linux64( 7/ 8), 37.221: ~1 levels ~491520 states ~7457632 transitions
pins2lts-mc-linux64( 7/ 8), 96.048: ~1 levels ~983040 states ~23746672 transitions
pins2lts-mc-linux64( 7/ 8), 208.182: ~1 levels ~1966080 states ~55648432 transitions
pins2lts-mc-linux64( 3/ 8), 265.331: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 265.883:
pins2lts-mc-linux64( 0/ 8), 265.883: mean standard work distribution: 8.8% (states) 3.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 265.883:
pins2lts-mc-linux64( 0/ 8), 265.883: Explored 2223855 states 72932607 transitions, fanout: 32.796
pins2lts-mc-linux64( 0/ 8), 265.883: Total exploration time 265.560 sec (265.060 sec minimum, 265.246 sec on average)
pins2lts-mc-linux64( 0/ 8), 265.883: States per second: 8374, Transitions per second: 274637
pins2lts-mc-linux64( 0/ 8), 265.883:
pins2lts-mc-linux64( 0/ 8), 265.883: Progress states detected: 23724506
pins2lts-mc-linux64( 0/ 8), 265.883: Redundant explorations: -90.6264
pins2lts-mc-linux64( 0/ 8), 265.883:
pins2lts-mc-linux64( 0/ 8), 265.883: Queue width: 8B, total height: 32636841, memory: 249.00MB
pins2lts-mc-linux64( 0/ 8), 265.883: Tree memory: 437.0MB, 19.3 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 265.883: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 265.883: Stored 1352 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 265.883: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 265.883: Est. total memory use: 686.0MB (~1273.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13508517261322329787;'/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((LTLAPp0==true)))))||(LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13508517261322329787;'/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((LTLAPp0==true)))))||(LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 15:42:13] [INFO ] Flatten gal took : 384 ms
[2022-05-19 15:42:14] [INFO ] Time to serialize gal into /tmp/LTLFireability14386974005518679777.gal : 41 ms
[2022-05-19 15:42:14] [INFO ] Time to serialize properties into /tmp/LTLFireability9658820858752584453.ltl : 5 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/LTLFireability14386974005518679777.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9658820858752584453.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/LTLFireabi...289
Read 2 LTL properties
Checking formula 0 : !((G((G(X(F(X("(place_520_1<1)")))))||("((JobCnt>=1)&&(place_782_1>=1))"))))
Formula 0 simplified : !G("((JobCnt>=1)&&(place_782_1>=1))" | GXFX"(place_520_1<1)")

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="PolyORBNT-PT-S10J30"
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 PolyORBNT-PT-S10J30, 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 r168-tall-165277017300860"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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