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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 230K Apr 30 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 935K Apr 30 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Apr 30 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 857K Apr 30 09:39 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 96K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 275K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 293K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 40K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 877K 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 Peterson-PT-6-LTLFireability-00
FORMULA_NAME Peterson-PT-6-LTLFireability-01
FORMULA_NAME Peterson-PT-6-LTLFireability-02
FORMULA_NAME Peterson-PT-6-LTLFireability-03
FORMULA_NAME Peterson-PT-6-LTLFireability-04
FORMULA_NAME Peterson-PT-6-LTLFireability-05
FORMULA_NAME Peterson-PT-6-LTLFireability-06
FORMULA_NAME Peterson-PT-6-LTLFireability-07
FORMULA_NAME Peterson-PT-6-LTLFireability-08
FORMULA_NAME Peterson-PT-6-LTLFireability-09
FORMULA_NAME Peterson-PT-6-LTLFireability-10
FORMULA_NAME Peterson-PT-6-LTLFireability-11
FORMULA_NAME Peterson-PT-6-LTLFireability-12
FORMULA_NAME Peterson-PT-6-LTLFireability-13
FORMULA_NAME Peterson-PT-6-LTLFireability-14
FORMULA_NAME Peterson-PT-6-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652786091822

Running Version 202205111006
[2022-05-17 11:14:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 11:14:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 11:14:53] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2022-05-17 11:14:53] [INFO ] Transformed 1330 places.
[2022-05-17 11:14:53] [INFO ] Transformed 2030 transitions.
[2022-05-17 11:14:53] [INFO ] Found NUPN structural information;
[2022-05-17 11:14:53] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2022-05-17 11:14:53] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Peterson-PT-6-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1079 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 50 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 11:14:54] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:14:54] [INFO ] Computed 27 place invariants in 40 ms
[2022-05-17 11:14:54] [INFO ] Implicit Places using invariants in 387 ms returned []
[2022-05-17 11:14:54] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:14:54] [INFO ] Computed 27 place invariants in 9 ms
[2022-05-17 11:14:55] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:14:55] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2022-05-17 11:14:55] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:14:55] [INFO ] Computed 27 place invariants in 8 ms
[2022-05-17 11:14:56] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1079 out of 1330 places after structural reductions.
[2022-05-17 11:14:57] [INFO ] Flatten gal took : 199 ms
[2022-05-17 11:14:57] [INFO ] Flatten gal took : 136 ms
[2022-05-17 11:14:57] [INFO ] Input system was already deterministic with 2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 32) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-17 11:14:58] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:14:58] [INFO ] Computed 27 place invariants in 6 ms
[2022-05-17 11:14:59] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2022-05-17 11:14:59] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 11:15:00] [INFO ] After 1981ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 11:15:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2022-05-17 11:15:01] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 11:15:02] [INFO ] After 858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-17 11:15:02] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:15:02] [INFO ] After 586ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-17 11:15:03] [INFO ] Deduced a trap composed of 54 places in 516 ms of which 5 ms to minimize.
[2022-05-17 11:15:03] [INFO ] Deduced a trap composed of 74 places in 536 ms of which 1 ms to minimize.
[2022-05-17 11:15:04] [INFO ] Deduced a trap composed of 37 places in 496 ms of which 2 ms to minimize.
[2022-05-17 11:15:05] [INFO ] Deduced a trap composed of 61 places in 501 ms of which 2 ms to minimize.
[2022-05-17 11:15:05] [INFO ] Deduced a trap composed of 82 places in 509 ms of which 2 ms to minimize.
[2022-05-17 11:15:06] [INFO ] Deduced a trap composed of 62 places in 493 ms of which 1 ms to minimize.
[2022-05-17 11:15:06] [INFO ] Deduced a trap composed of 61 places in 498 ms of which 1 ms to minimize.
[2022-05-17 11:15:07] [INFO ] Deduced a trap composed of 58 places in 484 ms of which 2 ms to minimize.
[2022-05-17 11:15:07] [INFO ] Deduced a trap composed of 82 places in 487 ms of which 1 ms to minimize.
[2022-05-17 11:15:08] [INFO ] Deduced a trap composed of 57 places in 521 ms of which 2 ms to minimize.
[2022-05-17 11:15:09] [INFO ] Deduced a trap composed of 277 places in 503 ms of which 1 ms to minimize.
[2022-05-17 11:15:09] [INFO ] Deduced a trap composed of 258 places in 508 ms of which 1 ms to minimize.
[2022-05-17 11:15:10] [INFO ] Deduced a trap composed of 261 places in 508 ms of which 1 ms to minimize.
[2022-05-17 11:15:10] [INFO ] Deduced a trap composed of 27 places in 527 ms of which 3 ms to minimize.
[2022-05-17 11:15:11] [INFO ] Deduced a trap composed of 24 places in 518 ms of which 1 ms to minimize.
[2022-05-17 11:15:12] [INFO ] Deduced a trap composed of 61 places in 523 ms of which 0 ms to minimize.
[2022-05-17 11:15:12] [INFO ] Deduced a trap composed of 25 places in 522 ms of which 1 ms to minimize.
[2022-05-17 11:15:13] [INFO ] Deduced a trap composed of 20 places in 508 ms of which 1 ms to minimize.
[2022-05-17 11:15:13] [INFO ] Deduced a trap composed of 24 places in 510 ms of which 0 ms to minimize.
[2022-05-17 11:15:14] [INFO ] Deduced a trap composed of 25 places in 517 ms of which 1 ms to minimize.
[2022-05-17 11:15:15] [INFO ] Deduced a trap composed of 20 places in 513 ms of which 1 ms to minimize.
[2022-05-17 11:15:15] [INFO ] Deduced a trap composed of 117 places in 375 ms of which 1 ms to minimize.
[2022-05-17 11:15:16] [INFO ] Deduced a trap composed of 230 places in 377 ms of which 0 ms to minimize.
[2022-05-17 11:15:16] [INFO ] Deduced a trap composed of 296 places in 379 ms of which 2 ms to minimize.
[2022-05-17 11:15:16] [INFO ] Deduced a trap composed of 231 places in 373 ms of which 1 ms to minimize.
[2022-05-17 11:15:17] [INFO ] Deduced a trap composed of 297 places in 364 ms of which 1 ms to minimize.
[2022-05-17 11:15:17] [INFO ] Deduced a trap composed of 92 places in 418 ms of which 1 ms to minimize.
[2022-05-17 11:15:18] [INFO ] Deduced a trap composed of 253 places in 377 ms of which 0 ms to minimize.
[2022-05-17 11:15:18] [INFO ] Deduced a trap composed of 301 places in 367 ms of which 1 ms to minimize.
[2022-05-17 11:15:19] [INFO ] Deduced a trap composed of 151 places in 361 ms of which 0 ms to minimize.
[2022-05-17 11:15:19] [INFO ] Deduced a trap composed of 116 places in 417 ms of which 1 ms to minimize.
[2022-05-17 11:15:20] [INFO ] Deduced a trap composed of 105 places in 418 ms of which 1 ms to minimize.
[2022-05-17 11:15:20] [INFO ] Deduced a trap composed of 131 places in 416 ms of which 1 ms to minimize.
[2022-05-17 11:15:21] [INFO ] Deduced a trap composed of 105 places in 409 ms of which 1 ms to minimize.
[2022-05-17 11:15:21] [INFO ] Deduced a trap composed of 105 places in 429 ms of which 0 ms to minimize.
[2022-05-17 11:15:22] [INFO ] Deduced a trap composed of 105 places in 447 ms of which 1 ms to minimize.
[2022-05-17 11:15:22] [INFO ] Deduced a trap composed of 246 places in 433 ms of which 1 ms to minimize.
[2022-05-17 11:15:23] [INFO ] Deduced a trap composed of 246 places in 437 ms of which 6 ms to minimize.
[2022-05-17 11:15:23] [INFO ] Deduced a trap composed of 187 places in 454 ms of which 1 ms to minimize.
[2022-05-17 11:15:24] [INFO ] Deduced a trap composed of 238 places in 372 ms of which 1 ms to minimize.
[2022-05-17 11:15:24] [INFO ] Deduced a trap composed of 248 places in 400 ms of which 1 ms to minimize.
[2022-05-17 11:15:25] [INFO ] Deduced a trap composed of 121 places in 350 ms of which 1 ms to minimize.
[2022-05-17 11:15:25] [INFO ] Deduced a trap composed of 229 places in 373 ms of which 1 ms to minimize.
[2022-05-17 11:15:26] [INFO ] Deduced a trap composed of 271 places in 319 ms of which 1 ms to minimize.
[2022-05-17 11:15:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 11:15:26] [INFO ] After 25316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 89 ms.
Support contains 48 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 567 transitions
Trivial Post-agglo rules discarded 567 transitions
Performed 567 trivial Post agglomeration. Transition count delta: 567
Iterating post reduction 0 with 567 rules applied. Total rules applied 567 place count 1330 transition count 1463
Reduce places removed 567 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 570 rules applied. Total rules applied 1137 place count 763 transition count 1460
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1140 place count 760 transition count 1460
Performed 298 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 298 Pre rules applied. Total rules applied 1140 place count 760 transition count 1162
Deduced a syphon composed of 298 places in 2 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 3 with 596 rules applied. Total rules applied 1736 place count 462 transition count 1162
Applied a total of 1736 rules in 137 ms. Remains 462 /1330 variables (removed 868) and now considering 1162/2030 (removed 868) transitions.
Finished structural reductions, in 1 iterations. Remains : 462/1330 places, 1162/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-17 11:15:26] [INFO ] Flow matrix only has 952 transitions (discarded 210 similar events)
// Phase 1: matrix 952 rows 462 cols
[2022-05-17 11:15:26] [INFO ] Computed 27 place invariants in 4 ms
[2022-05-17 11:15:26] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-05-17 11:15:26] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 11:15:27] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 11:15:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 11:15:27] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-17 11:15:27] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 11:15:27] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:15:27] [INFO ] After 153ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 11:15:28] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2022-05-17 11:15:28] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 1 ms to minimize.
[2022-05-17 11:15:28] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2022-05-17 11:15:28] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 1 ms to minimize.
[2022-05-17 11:15:28] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 1 ms to minimize.
[2022-05-17 11:15:28] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 1 ms to minimize.
[2022-05-17 11:15:29] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 1 ms to minimize.
[2022-05-17 11:15:29] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 1 ms to minimize.
[2022-05-17 11:15:29] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2022-05-17 11:15:29] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 0 ms to minimize.
[2022-05-17 11:15:30] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2022-05-17 11:15:30] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 0 ms to minimize.
[2022-05-17 11:15:30] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 3 ms to minimize.
[2022-05-17 11:15:30] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 0 ms to minimize.
[2022-05-17 11:15:30] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-05-17 11:15:31] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2022-05-17 11:15:31] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 1 ms to minimize.
[2022-05-17 11:15:31] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 0 ms to minimize.
[2022-05-17 11:15:31] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3557 ms
[2022-05-17 11:15:31] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2022-05-17 11:15:31] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 1 ms to minimize.
[2022-05-17 11:15:31] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 1 ms to minimize.
[2022-05-17 11:15:32] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 3 ms to minimize.
[2022-05-17 11:15:32] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2022-05-17 11:15:32] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2022-05-17 11:15:32] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2022-05-17 11:15:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1217 ms
[2022-05-17 11:15:32] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2022-05-17 11:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 11:15:32] [INFO ] After 5299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 244 ms.
[2022-05-17 11:15:33] [INFO ] After 5957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 14 ms.
Support contains 45 out of 462 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 462/462 places, 1162/1162 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 1161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 461 transition count 1161
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 461 transition count 1159
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 6 place count 459 transition count 1159
Applied a total of 6 rules in 41 ms. Remains 459 /462 variables (removed 3) and now considering 1159/1162 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 459/462 places, 1159/1162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 512424 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 512424 steps, saw 69433 distinct states, run finished after 3004 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-17 11:15:36] [INFO ] Flow matrix only has 949 transitions (discarded 210 similar events)
// Phase 1: matrix 949 rows 459 cols
[2022-05-17 11:15:36] [INFO ] Computed 27 place invariants in 4 ms
[2022-05-17 11:15:36] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 11:15:36] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-17 11:15:36] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 11:15:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 11:15:36] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-17 11:15:37] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 11:15:37] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:15:37] [INFO ] After 138ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 11:15:37] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 0 ms to minimize.
[2022-05-17 11:15:37] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 0 ms to minimize.
[2022-05-17 11:15:37] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 0 ms to minimize.
[2022-05-17 11:15:38] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 0 ms to minimize.
[2022-05-17 11:15:38] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 0 ms to minimize.
[2022-05-17 11:15:38] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2022-05-17 11:15:38] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2022-05-17 11:15:38] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2022-05-17 11:15:39] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 0 ms to minimize.
[2022-05-17 11:15:39] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2022-05-17 11:15:39] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2022-05-17 11:15:39] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2022-05-17 11:15:39] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2022-05-17 11:15:39] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2450 ms
[2022-05-17 11:15:39] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2022-05-17 11:15:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-05-17 11:15:40] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 0 ms to minimize.
[2022-05-17 11:15:40] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2022-05-17 11:15:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2022-05-17 11:15:40] [INFO ] After 3306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 192 ms.
[2022-05-17 11:15:40] [INFO ] After 3917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 7 ms.
Support contains 45 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 1159/1159 transitions.
Applied a total of 0 rules in 33 ms. Remains 459 /459 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 459/459 places, 1159/1159 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 1159/1159 transitions.
Applied a total of 0 rules in 24 ms. Remains 459 /459 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
[2022-05-17 11:15:40] [INFO ] Flow matrix only has 949 transitions (discarded 210 similar events)
// Phase 1: matrix 949 rows 459 cols
[2022-05-17 11:15:40] [INFO ] Computed 27 place invariants in 8 ms
[2022-05-17 11:15:40] [INFO ] Implicit Places using invariants in 268 ms returned [440, 441, 443, 451, 452, 453, 454]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 270 ms to find 7 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 452/459 places, 1159/1159 transitions.
Applied a total of 0 rules in 22 ms. Remains 452 /452 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 452/459 places, 1159/1159 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 527208 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 527208 steps, saw 71311 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-17 11:15:44] [INFO ] Flow matrix only has 949 transitions (discarded 210 similar events)
// Phase 1: matrix 949 rows 452 cols
[2022-05-17 11:15:44] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 11:15:44] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 11:15:44] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 11:15:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 11:15:44] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 11:15:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:15:45] [INFO ] After 144ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 11:15:45] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2022-05-17 11:15:45] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 0 ms to minimize.
[2022-05-17 11:15:45] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-05-17 11:15:45] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2022-05-17 11:15:45] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2022-05-17 11:15:46] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2022-05-17 11:15:46] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2022-05-17 11:15:46] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2022-05-17 11:15:46] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2022-05-17 11:15:46] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2022-05-17 11:15:46] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2022-05-17 11:15:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1917 ms
[2022-05-17 11:15:47] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2022-05-17 11:15:47] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2022-05-17 11:15:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2022-05-17 11:15:47] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2022-05-17 11:15:47] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 0 ms to minimize.
[2022-05-17 11:15:47] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2022-05-17 11:15:48] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 0 ms to minimize.
[2022-05-17 11:15:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 631 ms
[2022-05-17 11:15:48] [INFO ] After 3239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 176 ms.
[2022-05-17 11:15:48] [INFO ] After 3829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 45 out of 452 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 452/452 places, 1159/1159 transitions.
Applied a total of 0 rules in 18 ms. Remains 452 /452 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 452/452 places, 1159/1159 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 452/452 places, 1159/1159 transitions.
Applied a total of 0 rules in 17 ms. Remains 452 /452 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
[2022-05-17 11:15:48] [INFO ] Flow matrix only has 949 transitions (discarded 210 similar events)
// Phase 1: matrix 949 rows 452 cols
[2022-05-17 11:15:48] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 11:15:48] [INFO ] Implicit Places using invariants in 264 ms returned []
[2022-05-17 11:15:48] [INFO ] Flow matrix only has 949 transitions (discarded 210 similar events)
// Phase 1: matrix 949 rows 452 cols
[2022-05-17 11:15:48] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 11:15:48] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:15:50] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
[2022-05-17 11:15:50] [INFO ] Redundant transitions in 70 ms returned []
[2022-05-17 11:15:50] [INFO ] Flow matrix only has 949 transitions (discarded 210 similar events)
// Phase 1: matrix 949 rows 452 cols
[2022-05-17 11:15:50] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 11:15:50] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 452/452 places, 1159/1159 transitions.
Graph (trivial) has 803 edges and 452 vertex of which 285 / 452 are part of one of the 42 SCC in 4 ms
Free SCC test removed 243 places
Drop transitions removed 486 transitions
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 696 transitions.
Performed 6 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 203 transition count 454
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 37 rules applied. Total rules applied 50 place count 181 transition count 491
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 64 place count 174 transition count 484
Graph (trivial) has 89 edges and 174 vertex of which 76 / 174 are part of one of the 7 SCC in 0 ms
Free SCC test removed 69 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 105 transition count 484
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 0 with 76 rules applied. Total rules applied 141 place count 105 transition count 408
Drop transitions removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 1 with 53 rules applied. Total rules applied 194 place count 105 transition count 355
Graph (complete) has 397 edges and 105 vertex of which 63 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.3 ms
Discarding 42 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 195 place count 63 transition count 355
Drop transitions removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 447 place count 63 transition count 103
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 453 place count 63 transition count 97
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 459 place count 57 transition count 97
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 461 place count 57 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 463 place count 55 transition count 95
Applied a total of 463 rules in 41 ms. Remains 55 /452 variables (removed 397) and now considering 95/1159 (removed 1064) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 95 rows 55 cols
[2022-05-17 11:15:50] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 11:15:50] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 11:15:50] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 11:15:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 11:15:50] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 11:15:50] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-17 11:15:50] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-17 11:15:50] [INFO ] Flatten gal took : 6 ms
[2022-05-17 11:15:50] [INFO ] Flatten gal took : 3 ms
[2022-05-17 11:15:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10613213452671932962.gal : 1 ms
[2022-05-17 11:15:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12154270846428365850.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2320068598372731186;'/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/ReachabilityCardinality10613213452671932962.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12154270846428365850.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/ReachabilityCardinality12154270846428365850.prop.
Reachability property AtomicPropp26 is true.
Reachability property AtomicPropp6 is true.
SDD proceeding with computation,2 properties remain. new max is 2
SDD size :1 after 7
Reachability property AtomicPropp31 is true.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :7 after 36
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :36 after 63
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :63 after 405
Reachability property AtomicPropp21 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1701,0.021739,4256,2,94,13,682,6,0,318,194,0
Total reachable state count : 1701

Verifying 4 reachability properties.
Reachability property AtomicPropp6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp6,162,0.024196,4256,2,73,13,682,7,0,388,194,0
Reachability property AtomicPropp21 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp21,81,0.024356,4256,2,72,13,682,8,0,390,194,0
Reachability property AtomicPropp26 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp26,1,0.024497,4256,2,56,13,682,9,0,392,194,0
Reachability property AtomicPropp31 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp31,9,0.024631,4256,2,64,13,682,10,0,394,194,0
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' '!(X(X(G(p0))))'
Support contains 35 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 28 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 11:15:51] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:15:51] [INFO ] Computed 27 place invariants in 6 ms
[2022-05-17 11:15:51] [INFO ] Implicit Places using invariants in 516 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 518 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 26 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 1396 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s333 1) (EQ s335 1) (EQ s334 1) (EQ s340 1) (EQ s337 1) (EQ s336 1) (EQ s339 1) (EQ s338 1) (EQ s285 1) (EQ s348 1) (EQ s286 1) (EQ s287 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Peterson-PT-6-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-00 finished in 2032 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(G(p1))&&p0)))))'
Support contains 266 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 21 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 11:15:53] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:15:53] [INFO ] Computed 27 place invariants in 18 ms
[2022-05-17 11:15:53] [INFO ] Implicit Places using invariants in 480 ms returned []
[2022-05-17 11:15:53] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:15:53] [INFO ] Computed 27 place invariants in 10 ms
[2022-05-17 11:15:54] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:15:59] [INFO ] Implicit Places using invariants and state equation in 5855 ms returned []
Implicit Place search using SMT with State Equation took 6339 ms to find 0 implicit places.
[2022-05-17 11:15:59] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:15:59] [INFO ] Computed 27 place invariants in 18 ms
[2022-05-17 11:16:00] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 1057 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (AND (EQ s683 1) (EQ s1303 1)) (AND (EQ s682 1) (EQ s1208 1)) (AND (EQ s678 1) (EQ s1304 1)) (AND (EQ s677 1) (EQ s1301 1)) (AND (EQ s680 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 1125 ms.
Stack based approach found an accepted trace after 942 steps with 0 reset with depth 943 and stack size 942 in 20 ms.
FORMULA Peterson-PT-6-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-01 finished in 9622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(F(G(p0)))||X(p1)||F(X(p2))))))'
Support contains 112 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 34 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 11:16:02] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:16:03] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-17 11:16:03] [INFO ] Implicit Places using invariants in 346 ms returned []
[2022-05-17 11:16:03] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:16:03] [INFO ] Computed 27 place invariants in 6 ms
[2022-05-17 11:16:04] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:16:07] [INFO ] Implicit Places using invariants and state equation in 3824 ms returned []
Implicit Place search using SMT with State Equation took 4172 ms to find 0 implicit places.
[2022-05-17 11:16:07] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:16:07] [INFO ] Computed 27 place invariants in 8 ms
[2022-05-17 11:16:08] [INFO ] Dead Transitions using invariants and state equation in 1019 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s683 1) (EQ s1303 1)) (AND (EQ s682 1) (EQ s1208 1)) (AND (EQ s678 1) (EQ s1304 1)) (AND (EQ s677 1) (EQ s1301 1)) (AND (EQ s680 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2910 reset in 470 ms.
Product exploration explored 100000 steps with 2951 reset in 498 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 p1 (NOT p2) (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 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 199 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 409 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 3 factoid took 175 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 151 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 112 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 35 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 11:16:10] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:16:10] [INFO ] Computed 27 place invariants in 9 ms
[2022-05-17 11:16:10] [INFO ] Implicit Places using invariants in 356 ms returned []
[2022-05-17 11:16:10] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:16:10] [INFO ] Computed 27 place invariants in 10 ms
[2022-05-17 11:16:11] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:16:14] [INFO ] Implicit Places using invariants and state equation in 3806 ms returned []
Implicit Place search using SMT with State Equation took 4166 ms to find 0 implicit places.
[2022-05-17 11:16:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:16:14] [INFO ] Computed 27 place invariants in 4 ms
[2022-05-17 11:16:15] [INFO ] Dead Transitions using invariants and state equation in 1036 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1330/1330 places, 2030/2030 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 p1 (NOT p2) (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 390 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 152 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 378 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=126 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 3 factoid took 290 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 171 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 1453 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 2892 reset in 432 ms.
Product exploration explored 100000 steps with 2932 reset in 457 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 112 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1330 transition count 2030
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 252 Pre rules applied. Total rules applied 336 place count 1330 transition count 2210
Deduced a syphon composed of 588 places in 1 ms
Iterating global reduction 1 with 252 rules applied. Total rules applied 588 place count 1330 transition count 2210
Discarding 150 places :
Symmetric choice reduction at 1 with 150 rule applications. Total rules 738 place count 1180 transition count 2060
Deduced a syphon composed of 438 places in 1 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 888 place count 1180 transition count 2060
Performed 329 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 767 places in 1 ms
Iterating global reduction 1 with 329 rules applied. Total rules applied 1217 place count 1180 transition count 2060
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 1510 place count 887 transition count 1767
Deduced a syphon composed of 474 places in 1 ms
Iterating global reduction 1 with 293 rules applied. Total rules applied 1803 place count 887 transition count 1767
Deduced a syphon composed of 474 places in 0 ms
Applied a total of 1803 rules in 376 ms. Remains 887 /1330 variables (removed 443) and now considering 1767/2030 (removed 263) transitions.
[2022-05-17 11:16:19] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-17 11:16:19] [INFO ] Flow matrix only has 1557 transitions (discarded 210 similar events)
// Phase 1: matrix 1557 rows 887 cols
[2022-05-17 11:16:19] [INFO ] Computed 27 place invariants in 6 ms
[2022-05-17 11:16:20] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 887/1330 places, 1767/2030 transitions.
Finished structural reductions, in 1 iterations. Remains : 887/1330 places, 1767/2030 transitions.
Product exploration explored 100000 steps with 1123 reset in 588 ms.
Product exploration explored 100000 steps with 1170 reset in 531 ms.
Built C files in :
/tmp/ltsmin11090779127611962062
[2022-05-17 11:16:21] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11090779127611962062
Running compilation step : cd /tmp/ltsmin11090779127611962062;'/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/ltsmin11090779127611962062;'/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/ltsmin11090779127611962062;'/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 112 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 30 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 11:16:24] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:16:24] [INFO ] Computed 27 place invariants in 4 ms
[2022-05-17 11:16:25] [INFO ] Implicit Places using invariants in 330 ms returned []
[2022-05-17 11:16:25] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:16:25] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-17 11:16:25] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:16:29] [INFO ] Implicit Places using invariants and state equation in 3925 ms returned []
Implicit Place search using SMT with State Equation took 4265 ms to find 0 implicit places.
[2022-05-17 11:16:29] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:16:29] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-17 11:16:30] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1330/1330 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin4949658912739100313
[2022-05-17 11:16:30] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4949658912739100313
Running compilation step : cd /tmp/ltsmin4949658912739100313;'/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/ltsmin4949658912739100313;'/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/ltsmin4949658912739100313;'/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-17 11:16:33] [INFO ] Flatten gal took : 79 ms
[2022-05-17 11:16:33] [INFO ] Flatten gal took : 75 ms
[2022-05-17 11:16:33] [INFO ] Time to serialize gal into /tmp/LTL4236054306929504061.gal : 9 ms
[2022-05-17 11:16:33] [INFO ] Time to serialize properties into /tmp/LTL11020172922425618389.ltl : 281 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/LTL4236054306929504061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11020172922425618389.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/LTL4236054...267
Read 1 LTL properties
Checking formula 0 : !((G(X(((G(F(G("(((((WantSection_4_T==1)&&(CS_4==1))||((WantSection_5_T==1)&&(CS_5==1)))||(((WantSection_2_T==1)&&(CS_2==1))||((WantSe...2184
Formula 0 simplified : !GX(GFG"(((((WantSection_4_T==1)&&(CS_4==1))||((WantSection_5_T==1)&&(CS_5==1)))||(((WantSection_2_T==1)&&(CS_2==1))||((WantSection_...2162
Detected timeout of ITS tools.
[2022-05-17 11:16:48] [INFO ] Flatten gal took : 77 ms
[2022-05-17 11:16:48] [INFO ] Applying decomposition
[2022-05-17 11:16:48] [INFO ] Flatten gal took : 69 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/graph17780873554401154862.txt' '-o' '/tmp/graph17780873554401154862.bin' '-w' '/tmp/graph17780873554401154862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17780873554401154862.bin' '-l' '-1' '-v' '-w' '/tmp/graph17780873554401154862.weights' '-q' '0' '-e' '0.001'
[2022-05-17 11:16:49] [INFO ] Decomposing Gal with order
[2022-05-17 11:16:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:16:49] [INFO ] Removed a total of 1787 redundant transitions.
[2022-05-17 11:16:49] [INFO ] Flatten gal took : 170 ms
[2022-05-17 11:16:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2022-05-17 11:16:49] [INFO ] Time to serialize gal into /tmp/LTL8631354937144120494.gal : 21 ms
[2022-05-17 11:16:49] [INFO ] Time to serialize properties into /tmp/LTL11437145476651300076.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8631354937144120494.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11437145476651300076.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/LTL8631354...246
Read 1 LTL properties
Checking formula 0 : !((G(X(((G(F(G("(((((i31.u432.WantSection_4_T==1)&&(i5.u289.CS_4==1))||((i8.u202.WantSection_5_T==1)&&(i5.u80.CS_5==1)))||(((i31.u406....3389
Formula 0 simplified : !GX(GFG"(((((i31.u432.WantSection_4_T==1)&&(i5.u289.CS_4==1))||((i8.u202.WantSection_5_T==1)&&(i5.u80.CS_5==1)))||(((i31.u406.WantSe...3367
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9418776614941999872
[2022-05-17 11:17:04] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9418776614941999872
Running compilation step : cd /tmp/ltsmin9418776614941999872;'/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/ltsmin9418776614941999872;'/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/ltsmin9418776614941999872;'/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 Peterson-PT-6-LTLFireability-02 finished in 64690 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)||X(p1))) U !X((F(p3)||p2))))'
Support contains 301 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 40 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 11:17:07] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:17:07] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-17 11:17:08] [INFO ] Implicit Places using invariants in 387 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 389 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 34 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR p3 p2), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), (OR p3 p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1)), p3]
Running random walk in product with property : Peterson-PT-6-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={} source=2 dest: 1}, { cond=(OR p2 p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p3), acceptance={} source=5 dest: 1}, { cond=p3, acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(NOT p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s260 1) (EQ s261 1) (EQ s262 1) (EQ s263 1) (EQ s256 1) (EQ s257 1) (EQ s258 1) (EQ s259 1) (EQ s268 1) (EQ s269 1) (EQ s270 1) (EQ s271 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33289 reset in 4651 ms.
Product exploration explored 100000 steps with 33418 reset in 4640 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (OR p2 p3))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (X (NOT p3))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (OR p2 p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 664 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 6 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 244 ms :[(OR p2 p3), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), (OR p2 p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1)), p3]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 683 ms. (steps per millisecond=14 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1129 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-17 11:17:21] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2022-05-17 11:17:21] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-17 11:17:22] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (OR p2 p3))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (X (NOT p3))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (OR p2 p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (G (NOT (AND (NOT p0) (NOT p1) p3))), (G (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (OR p3 p2)), (F (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (F p3), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 18 factoid took 868 ms. Reduced automaton from 6 states, 12 edges and 4 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(OR p2 p3), (OR p2 p3), p3]
Stuttering acceptance computed with spot in 101 ms :[(OR p2 p3), (OR p2 p3), p3]
Support contains 301 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 105 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 11:17:23] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2022-05-17 11:17:23] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-17 11:17:24] [INFO ] Implicit Places using invariants in 340 ms returned []
[2022-05-17 11:17:24] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2022-05-17 11:17:24] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 11:17:25] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:17:27] [INFO ] Implicit Places using invariants and state equation in 2771 ms returned []
Implicit Place search using SMT with State Equation took 3112 ms to find 0 implicit places.
[2022-05-17 11:17:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2022-05-17 11:17:27] [INFO ] Computed 20 place invariants in 13 ms
[2022-05-17 11:17:28] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1323/1323 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (NOT (OR p3 p2))), (X (AND (NOT p3) (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR p3 p2)))), (X (X (AND (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 216 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(OR p3 p2), (OR p3 p2), p3]
Finished random walk after 12 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (NOT (OR p3 p2))), (X (AND (NOT p3) (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR p3 p2)))), (X (X (AND (NOT p3) (NOT p2))))]
False Knowledge obtained : [(F (OR p2 p3)), (F p3), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 6 factoid took 270 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(OR p3 p2), (OR p3 p2), p3]
Stuttering acceptance computed with spot in 91 ms :[(OR p3 p2), (OR p3 p2), p3]
Stuttering acceptance computed with spot in 97 ms :[(OR p3 p2), (OR p3 p2), p3]
Product exploration explored 100000 steps with 0 reset in 2350 ms.
Stack based approach found an accepted trace after 1524 steps with 0 reset with depth 1525 and stack size 1525 in 37 ms.
FORMULA Peterson-PT-6-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-03 finished in 23804 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p1)||p0) U (p2 U p3))||X(X(p4))))'
Support contains 392 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 40 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 11:17:31] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:17:31] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-17 11:17:31] [INFO ] Implicit Places using invariants in 219 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 221 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 47 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 686 ms :[(AND (NOT p3) (NOT p4)), (NOT p4), (OR (AND (NOT p1) p2 (NOT p4)) (AND (NOT p1) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p4))), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND p0 (NOT p1) (NOT p3) (NOT p4)), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND p0 (NOT p1) (NOT p3) (NOT p4)), (NOT p1), (NOT p3), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 6}, { cond=(OR (AND p3 p1) (AND p2 p1) (AND p0 p1)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 8}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 10}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=5 dest: 10}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=5 dest: 11}], [{ cond=(NOT p4), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p4)), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p4)), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1 (NOT p4)), acceptance={} source=9 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=9 dest: 13}, { cond=(OR (AND (NOT p3) p0 (NOT p4)) (AND (NOT p3) p1 (NOT p4))), acceptance={} source=9 dest: 14}, { cond=(AND (NOT p3) p2 (NOT p0) p1 (NOT p4)), acceptance={} source=9 dest: 15}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p4)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1) (NOT p4)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p0 p1 (NOT p4)), acceptance={} source=11 dest: 12}, { cond=(AND (NOT p3) p2 p0 (NOT p1) (NOT p4)), acceptance={} source=11 dest: 13}, { cond=(AND (NOT p3) p2 p0 p1 (NOT p4)), acceptance={} source=11 dest: 15}], [{ cond=(NOT p1), acceptance={} source=12 dest: 7}, { cond=p1, acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=13 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={0} source=13 dest: 13}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=14 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=14 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=14 dest: 13}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=14 dest: 14}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={0} source=14 dest: 15}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=15 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=15 dest: 12}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=15 dest: 13}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=15 dest: 15}]], initial=0, aps=[p3:(OR (AND (EQ s943 1) (EQ s1182 1)) (AND (EQ s915 1) (EQ s1197 1)) (AND (EQ s914 1) (EQ s1184 1)) (AND (EQ s924 1) (EQ s1195 1)) (AND (EQ s938 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 6105 ms.
Product exploration explored 100000 steps with 33333 reset in 6182 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 p3) (NOT p2) (NOT p0) (NOT p1) p4), (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (AND (NOT p3) p2 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p2) p0 p1))), (X (AND (NOT p3) p2)), (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)) (AND p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p3) p2 p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2 p0 p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p3 p1) (AND p2 p1) (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p3) p2 p0 p1 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p3) p2 (NOT p4))))), (X (X (NOT (OR (AND (NOT p3) p0 (NOT p4)) (AND (NOT p3) p1 (NOT p4)))))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1 (NOT p4))))), (X (X p4)), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1 (NOT p4))))), (X (X (NOT (AND p1 (NOT p4)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p4))
Knowledge based reduction with 28 factoid took 949 ms. Reduced automaton from 16 states, 47 edges and 5 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-PT-6-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-6-LTLFireability-04 finished in 14292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!G(p0)) U (((!p2 U p0)&&(p3 U p4))||p1)))'
Support contains 427 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 257 Post agglomeration using F-continuation condition.Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 1330 transition count 1773
Reduce places removed 257 places and 0 transitions.
Iterating post reduction 1 with 257 rules applied. Total rules applied 514 place count 1073 transition count 1773
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 514 place count 1073 transition count 1738
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 584 place count 1038 transition count 1738
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 644 place count 1008 transition count 1708
Applied a total of 644 rules in 121 ms. Remains 1008 /1330 variables (removed 322) and now considering 1708/2030 (removed 322) transitions.
[2022-05-17 11:17:45] [INFO ] Flow matrix only has 1498 transitions (discarded 210 similar events)
// Phase 1: matrix 1498 rows 1008 cols
[2022-05-17 11:17:45] [INFO ] Computed 27 place invariants in 6 ms
[2022-05-17 11:17:46] [INFO ] Implicit Places using invariants in 328 ms returned [973, 974, 976, 993, 994, 995, 996]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 330 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/1330 places, 1708/2030 transitions.
Applied a total of 0 rules in 22 ms. Remains 1001 /1001 variables (removed 0) and now considering 1708/1708 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1001/1330 places, 1708/2030 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (AND (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1))), p0, p0, false, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p4)), (AND (NOT p1) (NOT p4)), (AND p0 (NOT p4))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0) p2) (AND (NOT p1) (NOT p4) (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={0} source=0 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0) p2) (AND (NOT p1) (NOT p4) (NOT p3))), acceptance={0} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2) p4) (AND (NOT p1) (NOT p0) (NOT p2) p3)), acceptance={0} source=0 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2) p4) (AND (NOT p1) (NOT p0) (NOT p2) p3)), acceptance={0} source=0 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p4) p3) (AND (NOT p1) (NOT p2) (NOT p4) p3)), acceptance={0} source=0 dest: 5}, { cond=(OR (AND (NOT p1) p0 (NOT p4) p3) (AND (NOT p1) (NOT p2) (NOT p4) p3)), acceptance={0} source=0 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={0} source=0 dest: 7}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p4) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p4) p3), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p4) p3), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p4) p3), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={0} source=6 dest: 7}], [{ cond=(AND p0 (NOT p4) (NOT p3)), acceptance={0} source=7 dest: 1}, { cond=(AND p0 (NOT p4) p3), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (EQ s860 1) (EQ s939 1) (EQ s927 1) (EQ s916 1) (EQ s981 1) (EQ s928 1) (EQ s907 1) (EQ s859 1) (EQ s858 1) (EQ s915 1) (EQ s906 1) (EQ s978 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 3826 reset in 2260 ms.
Stack based approach found an accepted trace after 584 steps with 20 reset with depth 20 and stack size 20 in 13 ms.
FORMULA Peterson-PT-6-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-05 finished in 3102 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(X(X(p0))) U !F(p1))&&X(F(p0)))))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 43 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 11:17:48] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:17:48] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-17 11:17:49] [INFO ] Implicit Places using invariants in 450 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 453 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 45 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p0) p1), (NOT p0), (NOT p0), (AND p1 (NOT p0)), p1, (NOT p0), true, (AND (NOT p0) p1), p1]
Running random walk in product with property : Peterson-PT-6-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 7}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=p1, acceptance={} source=8 dest: 6}, { cond=(NOT p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s343 1), p1:(AND (EQ s949 1) (EQ s1204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 250 ms.
Stack based approach found an accepted trace after 108 steps with 0 reset with depth 109 and stack size 109 in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-08 finished in 1171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))||G(p1)) U p2))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 1330 transition count 1445
Reduce places removed 585 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 586 rules applied. Total rules applied 1171 place count 745 transition count 1444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1172 place count 744 transition count 1444
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 292 Pre rules applied. Total rules applied 1172 place count 744 transition count 1152
Deduced a syphon composed of 292 places in 0 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1756 place count 452 transition count 1152
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1836 place count 412 transition count 1112
Applied a total of 1836 rules in 59 ms. Remains 412 /1330 variables (removed 918) and now considering 1112/2030 (removed 918) transitions.
[2022-05-17 11:17:50] [INFO ] Flow matrix only has 902 transitions (discarded 210 similar events)
// Phase 1: matrix 902 rows 412 cols
[2022-05-17 11:17:50] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-17 11:17:50] [INFO ] Implicit Places using invariants in 257 ms returned [391, 392, 394, 402, 403, 404, 405]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 258 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 405/1330 places, 1112/2030 transitions.
Applied a total of 0 rules in 14 ms. Remains 405 /405 variables (removed 0) and now considering 1112/1112 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 405/1330 places, 1112/2030 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s225 1) (NEQ s261 1)), p1:(EQ s353 1), p0:(EQ s225 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 370 reset in 223 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-09 finished in 898 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||X(p1)||p2))))'
Support contains 4 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 39 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 11:17:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:17:50] [INFO ] Computed 27 place invariants in 10 ms
[2022-05-17 11:17:51] [INFO ] Implicit Places using invariants in 474 ms returned [1205, 1206, 1208, 1301, 1302, 1303]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 476 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1324/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 39 ms. Remains 1324 /1324 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1324/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p2:(AND (EQ s678 1) (EQ s1298 1)), p0:(EQ s311 1), p1:(EQ s900 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2234 reset in 320 ms.
Stack based approach found an accepted trace after 294 steps with 10 reset with depth 197 and stack size 197 in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-11 finished in 995 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))||G(p1)))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 41 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 11:17:51] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:17:51] [INFO ] Computed 27 place invariants in 10 ms
[2022-05-17 11:17:52] [INFO ] Implicit Places using invariants in 459 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 460 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 37 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1069 1), p1:(AND (EQ s1194 1) (EQ s1311 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 183 ms.
Stack based approach found an accepted trace after 413 steps with 0 reset with depth 414 and stack size 414 in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-12 finished in 836 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(F(p0)) U (F(p1)||p2))||p2)))'
Support contains 5 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 1330 transition count 1445
Reduce places removed 585 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 586 rules applied. Total rules applied 1171 place count 745 transition count 1444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1172 place count 744 transition count 1444
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 293 Pre rules applied. Total rules applied 1172 place count 744 transition count 1151
Deduced a syphon composed of 293 places in 0 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 3 with 586 rules applied. Total rules applied 1758 place count 451 transition count 1151
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1842 place count 409 transition count 1109
Applied a total of 1842 rules in 54 ms. Remains 409 /1330 variables (removed 921) and now considering 1109/2030 (removed 921) transitions.
[2022-05-17 11:17:52] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
// Phase 1: matrix 899 rows 409 cols
[2022-05-17 11:17:52] [INFO ] Computed 27 place invariants in 4 ms
[2022-05-17 11:17:53] [INFO ] Implicit Places using invariants in 257 ms returned [389, 390, 392, 400, 401, 402, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 273 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/1330 places, 1109/2030 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 402/1330 places, 1109/2030 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s340 1) (EQ s352 1)), p1:(EQ s351 1), p0:(AND (EQ s358 1) (EQ s401 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 2 reset in 195 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-13 finished in 657 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(F(X(F(p0)))) U G(p0)))'
Support contains 1 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1330 transition count 1443
Reduce places removed 587 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 588 rules applied. Total rules applied 1175 place count 743 transition count 1442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 293 Pre rules applied. Total rules applied 1176 place count 742 transition count 1149
Deduced a syphon composed of 293 places in 1 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 3 with 586 rules applied. Total rules applied 1762 place count 449 transition count 1149
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1846 place count 407 transition count 1107
Applied a total of 1846 rules in 59 ms. Remains 407 /1330 variables (removed 923) and now considering 1107/2030 (removed 923) transitions.
[2022-05-17 11:17:53] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 407 cols
[2022-05-17 11:17:53] [INFO ] Computed 27 place invariants in 4 ms
[2022-05-17 11:17:53] [INFO ] Implicit Places using invariants in 245 ms returned [388, 389, 391, 399, 400, 401, 402]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 246 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/1330 places, 1107/2030 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 400/1330 places, 1107/2030 transitions.
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-14 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:(EQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-14 finished in 382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(F(G(p0)))||X(p1)||F(X(p2))))))'
Found a SL insensitive property : Peterson-PT-6-LTLFireability-02
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 112 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 287 Pre rules applied. Total rules applied 1176 place count 742 transition count 1155
Deduced a syphon composed of 287 places in 1 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 2 with 574 rules applied. Total rules applied 1750 place count 455 transition count 1155
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1834 place count 413 transition count 1113
Applied a total of 1834 rules in 47 ms. Remains 413 /1330 variables (removed 917) and now considering 1113/2030 (removed 917) transitions.
[2022-05-17 11:17:54] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2022-05-17 11:17:54] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-17 11:17:54] [INFO ] Implicit Places using invariants in 174 ms returned []
[2022-05-17 11:17:54] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2022-05-17 11:17:54] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-17 11:17:54] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:17:55] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1385 ms to find 0 implicit places.
[2022-05-17 11:17:55] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2022-05-17 11:17:55] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-17 11:17:55] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 413/1330 places, 1113/2030 transitions.
Finished structural reductions, in 1 iterations. Remains : 413/1330 places, 1113/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s306 1) (EQ s400 1)) (AND (EQ s305 1) (EQ s390 1)) (AND (EQ s302 1) (EQ s401 1)) (AND (EQ s301 1) (EQ s398 1)) (AND (EQ s303 1) (EQ s399 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1107 reset in 301 ms.
Product exploration explored 100000 steps with 1018 reset in 340 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 p1 (NOT p2) (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 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 120 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 142 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 3 factoid took 201 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 131 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 112 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 1113/1113 transitions.
Applied a total of 0 rules in 5 ms. Remains 413 /413 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2022-05-17 11:17:57] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2022-05-17 11:17:57] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-17 11:17:57] [INFO ] Implicit Places using invariants in 186 ms returned []
[2022-05-17 11:17:57] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2022-05-17 11:17:57] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-17 11:17:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:17:58] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
[2022-05-17 11:17:58] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2022-05-17 11:17:58] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-17 11:17:58] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1113/1113 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 p1 (NOT p2) (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 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 157 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 446 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=111 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 3 factoid took 166 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 128 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 1074 reset in 332 ms.
Product exploration explored 100000 steps with 1069 reset in 330 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 112 out of 413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 413 /413 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2022-05-17 11:18:00] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-17 11:18:00] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2022-05-17 11:18:00] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-17 11:18:01] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1113/1113 transitions.
Product exploration explored 100000 steps with 1115 reset in 334 ms.
Product exploration explored 100000 steps with 1158 reset in 351 ms.
Built C files in :
/tmp/ltsmin550565087131424631
[2022-05-17 11:18:01] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin550565087131424631
Running compilation step : cd /tmp/ltsmin550565087131424631;'/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 1751 ms.
Running link step : cd /tmp/ltsmin550565087131424631;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin550565087131424631;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4225377851311744973.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 112 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 413 /413 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2022-05-17 11:18:16] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2022-05-17 11:18:16] [INFO ] Computed 27 place invariants in 3 ms
[2022-05-17 11:18:17] [INFO ] Implicit Places using invariants in 201 ms returned []
[2022-05-17 11:18:17] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2022-05-17 11:18:17] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-17 11:18:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:18:18] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1426 ms to find 0 implicit places.
[2022-05-17 11:18:18] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2022-05-17 11:18:18] [INFO ] Computed 27 place invariants in 3 ms
[2022-05-17 11:18:18] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1113/1113 transitions.
Built C files in :
/tmp/ltsmin9115663394136248946
[2022-05-17 11:18:18] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9115663394136248946
Running compilation step : cd /tmp/ltsmin9115663394136248946;'/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 1740 ms.
Running link step : cd /tmp/ltsmin9115663394136248946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9115663394136248946;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16721277021123260815.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 11:18:33] [INFO ] Flatten gal took : 34 ms
[2022-05-17 11:18:33] [INFO ] Flatten gal took : 35 ms
[2022-05-17 11:18:33] [INFO ] Time to serialize gal into /tmp/LTL10692640151338413743.gal : 4 ms
[2022-05-17 11:18:33] [INFO ] Time to serialize properties into /tmp/LTL8569091151580532938.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10692640151338413743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8569091151580532938.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/LTL1069264...267
Read 1 LTL properties
Checking formula 0 : !((G(X(((G(F(G("(((((WantSection_4_T==1)&&(CS_4==1))||((WantSection_5_T==1)&&(CS_5==1)))||(((WantSection_2_T==1)&&(CS_2==1))||((WantSe...2184
Formula 0 simplified : !GX(GFG"(((((WantSection_4_T==1)&&(CS_4==1))||((WantSection_5_T==1)&&(CS_5==1)))||(((WantSection_2_T==1)&&(CS_2==1))||((WantSection_...2162
Detected timeout of ITS tools.
[2022-05-17 11:18:49] [INFO ] Flatten gal took : 31 ms
[2022-05-17 11:18:49] [INFO ] Applying decomposition
[2022-05-17 11:18:49] [INFO ] Flatten gal took : 31 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/graph74866149326671082.txt' '-o' '/tmp/graph74866149326671082.bin' '-w' '/tmp/graph74866149326671082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph74866149326671082.bin' '-l' '-1' '-v' '-w' '/tmp/graph74866149326671082.weights' '-q' '0' '-e' '0.001'
[2022-05-17 11:18:49] [INFO ] Decomposing Gal with order
[2022-05-17 11:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:18:49] [INFO ] Removed a total of 1575 redundant transitions.
[2022-05-17 11:18:49] [INFO ] Flatten gal took : 69 ms
[2022-05-17 11:18:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 420 labels/synchronizations in 27 ms.
[2022-05-17 11:18:49] [INFO ] Time to serialize gal into /tmp/LTL16240191598294115714.gal : 7 ms
[2022-05-17 11:18:49] [INFO ] Time to serialize properties into /tmp/LTL17572979762378437640.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16240191598294115714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17572979762378437640.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/LTL1624019...247
Read 1 LTL properties
Checking formula 0 : !((G(X(((G(F(G("(((((i3.u48.WantSection_4_T==1)&&(i7.u26.CS_4==1))||((i9.u46.WantSection_5_T==1)&&(i3.u8.CS_5==1)))||(((i8.u21.WantSec...2984
Formula 0 simplified : !GX(GFG"(((((i3.u48.WantSection_4_T==1)&&(i7.u26.CS_4==1))||((i9.u46.WantSection_5_T==1)&&(i3.u8.CS_5==1)))||(((i8.u21.WantSection_2...2962
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16416430602707431408
[2022-05-17 11:19:04] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16416430602707431408
Running compilation step : cd /tmp/ltsmin16416430602707431408;'/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 1750 ms.
Running link step : cd /tmp/ltsmin16416430602707431408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16416430602707431408;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(([](<>([]((LTLAPp0==true))))||X((LTLAPp1==true))||<>(X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-PT-6-LTLFireability-02 finished in 85708 ms.
[2022-05-17 11:19:19] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17096221216047981270
[2022-05-17 11:19:19] [INFO ] Too many transitions (2030) to apply POR reductions. Disabling POR matrices.
[2022-05-17 11:19:19] [INFO ] Applying decomposition
[2022-05-17 11:19:19] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17096221216047981270
Running compilation step : cd /tmp/ltsmin17096221216047981270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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-17 11:19:19] [INFO ] Flatten gal took : 53 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/graph2711387525570013255.txt' '-o' '/tmp/graph2711387525570013255.bin' '-w' '/tmp/graph2711387525570013255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2711387525570013255.bin' '-l' '-1' '-v' '-w' '/tmp/graph2711387525570013255.weights' '-q' '0' '-e' '0.001'
[2022-05-17 11:19:19] [INFO ] Decomposing Gal with order
[2022-05-17 11:19:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:19:19] [INFO ] Removed a total of 1787 redundant transitions.
[2022-05-17 11:19:19] [INFO ] Flatten gal took : 97 ms
[2022-05-17 11:19:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-17 11:19:20] [INFO ] Time to serialize gal into /tmp/LTLFireability17869506949879147297.gal : 13 ms
[2022-05-17 11:19:20] [INFO ] Time to serialize properties into /tmp/LTLFireability9810533922477623274.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17869506949879147297.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9810533922477623274.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 1 LTL properties
Checking formula 0 : !((G(X(((G(F(G("(((((i30.u486.WantSection_4_T==1)&&(i30.u337.CS_4==1))||((i32.i1.i0.u484.WantSection_5_T==1)&&(i30.u104.CS_5==1)))||((...3572
Formula 0 simplified : !GX(GFG"(((((i30.u486.WantSection_4_T==1)&&(i30.u337.CS_4==1))||((i32.i1.i0.u484.WantSection_5_T==1)&&(i30.u104.CS_5==1)))||(((i10.u...3550
Compilation finished in 3837 ms.
Running link step : cd /tmp/ltsmin17096221216047981270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17096221216047981270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(([](<>([]((LTLAPp0==true))))||X((LTLAPp1==true))||<>(X((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 11:40:53] [INFO ] Applying decomposition
[2022-05-17 11:40:53] [INFO ] Flatten gal took : 477 ms
[2022-05-17 11:40:53] [INFO ] Decomposing Gal with order
[2022-05-17 11:40:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:40:55] [INFO ] Removed a total of 1380 redundant transitions.
[2022-05-17 11:40:58] [INFO ] Flatten gal took : 4281 ms
[2022-05-17 11:40:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 183 ms.
[2022-05-17 11:40:59] [INFO ] Time to serialize gal into /tmp/LTLFireability88827937573777067.gal : 97 ms
[2022-05-17 11:40:59] [INFO ] Time to serialize properties into /tmp/LTLFireability3163728250942422283.ltl : 8 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/LTLFireability88827937573777067.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3163728250942422283.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...265
Read 1 LTL properties
Checking formula 0 : !((G(X(((G(F(G("(((((u16.WantSection_4_T==1)&&(u4.CS_4==1))||((u22.WantSection_5_T==1)&&(u3.CS_5==1)))||(((u17.WantSection_2_T==1)&&(u...2586
Formula 0 simplified : !GX(GFG"(((((u16.WantSection_4_T==1)&&(u4.CS_4==1))||((u22.WantSection_5_T==1)&&(u3.CS_5==1)))||(((u17.WantSection_2_T==1)&&(u6.CS_2...2564
Detected timeout of ITS tools.
[2022-05-17 12:02:28] [INFO ] Flatten gal took : 443 ms
[2022-05-17 12:02:30] [INFO ] Input system was already deterministic with 2030 transitions.
[2022-05-17 12:02:30] [INFO ] Transformed 1330 places.
[2022-05-17 12:02:30] [INFO ] Transformed 2030 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 12:02:31] [INFO ] Time to serialize gal into /tmp/LTLFireability4635452307294018637.gal : 27 ms
[2022-05-17 12:02:31] [INFO ] Time to serialize properties into /tmp/LTLFireability3559476954297524173.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4635452307294018637.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3559476954297524173.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(((G(F(G("(((((WantSection_4_T==1)&&(CS_4==1))||((WantSection_5_T==1)&&(CS_5==1)))||(((WantSection_2_T==1)&&(CS_2==1))||((WantSe...2184
Formula 0 simplified : !GX(GFG"(((((WantSection_4_T==1)&&(CS_4==1))||((WantSection_5_T==1)&&(CS_5==1)))||(((WantSection_2_T==1)&&(CS_2==1))||((WantSection_...2162

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="Peterson-PT-6"
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 Peterson-PT-6, 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-165277016200084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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