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-165277017300852.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-PT-S10J20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017300852
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 21K Apr 30 04:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 30 04:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 66K Apr 30 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 293K Apr 30 03:44 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 7.9K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 121K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652969043325

Running Version 202205111006
[2022-05-19 14:04:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 14:04:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 14:04:05] [INFO ] Load time of PNML (sax parser for PT used): 633 ms
[2022-05-19 14:04:05] [INFO ] Transformed 474 places.
[2022-05-19 14:04:05] [INFO ] Transformed 11760 transitions.
[2022-05-19 14:04:05] [INFO ] Parsed PT model containing 474 places and 11760 transitions in 830 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 14:04:05] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-19 14:04:05] [INFO ] Reduced 45 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 382 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Applied a total of 0 rules in 62 ms. Remains 474 /474 variables (removed 0) and now considering 1650/1650 (removed 0) transitions.
[2022-05-19 14:04:05] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2022-05-19 14:04:05] [INFO ] Computed 72 place invariants in 88 ms
[2022-05-19 14:04:07] [INFO ] Dead Transitions using invariants and state equation in 1200 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2022-05-19 14:04:07] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2022-05-19 14:04:07] [INFO ] Computed 72 place invariants in 24 ms
[2022-05-19 14:04:07] [INFO ] Implicit Places using invariants in 169 ms returned []
[2022-05-19 14:04:07] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2022-05-19 14:04:07] [INFO ] Computed 72 place invariants in 20 ms
[2022-05-19 14:04:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:04:08] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 474/474 places, 1035/1650 transitions.
Applied a total of 0 rules in 15 ms. Remains 474 /474 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 1035/1650 transitions.
Support contains 382 out of 474 places after structural reductions.
[2022-05-19 14:04:08] [INFO ] Flatten gal took : 188 ms
[2022-05-19 14:04:08] [INFO ] Flatten gal took : 119 ms
[2022-05-19 14:04:09] [INFO ] Input system was already deterministic with 1035 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 896 ms. (steps per millisecond=11 ) properties (out of 30) seen :7
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) seen :10
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :1
Running SMT prover for 9 properties.
[2022-05-19 14:04:10] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2022-05-19 14:04:10] [INFO ] Computed 72 place invariants in 11 ms
[2022-05-19 14:04:10] [INFO ] [Real]Absence check using 45 positive place invariants in 20 ms returned sat
[2022-05-19 14:04:10] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 21 ms returned sat
[2022-05-19 14:04:11] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:5
[2022-05-19 14:04:11] [INFO ] [Nat]Absence check using 45 positive place invariants in 23 ms returned sat
[2022-05-19 14:04:11] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 20 ms returned sat
[2022-05-19 14:04:13] [INFO ] After 1873ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2022-05-19 14:04:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:04:14] [INFO ] After 1814ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :4 sat :5
[2022-05-19 14:04:15] [INFO ] Deduced a trap composed of 227 places in 286 ms of which 6 ms to minimize.
[2022-05-19 14:04:15] [INFO ] Deduced a trap composed of 227 places in 279 ms of which 1 ms to minimize.
[2022-05-19 14:04:15] [INFO ] Deduced a trap composed of 215 places in 251 ms of which 1 ms to minimize.
[2022-05-19 14:04:16] [INFO ] Deduced a trap composed of 225 places in 263 ms of which 1 ms to minimize.
[2022-05-19 14:04:16] [INFO ] Deduced a trap composed of 215 places in 262 ms of which 1 ms to minimize.
[2022-05-19 14:04:16] [INFO ] Deduced a trap composed of 227 places in 249 ms of which 0 ms to minimize.
[2022-05-19 14:04:17] [INFO ] Deduced a trap composed of 229 places in 250 ms of which 0 ms to minimize.
[2022-05-19 14:04:17] [INFO ] Deduced a trap composed of 221 places in 255 ms of which 1 ms to minimize.
[2022-05-19 14:04:17] [INFO ] Deduced a trap composed of 211 places in 252 ms of which 0 ms to minimize.
[2022-05-19 14:04:17] [INFO ] Deduced a trap composed of 217 places in 243 ms of which 0 ms to minimize.
[2022-05-19 14:04:18] [INFO ] Deduced a trap composed of 227 places in 246 ms of which 1 ms to minimize.
[2022-05-19 14:04:18] [INFO ] Deduced a trap composed of 217 places in 249 ms of which 1 ms to minimize.
[2022-05-19 14:04:18] [INFO ] Deduced a trap composed of 219 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:04:19] [INFO ] Deduced a trap composed of 215 places in 246 ms of which 0 ms to minimize.
[2022-05-19 14:04:19] [INFO ] Deduced a trap composed of 215 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:04:19] [INFO ] Deduced a trap composed of 217 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:04:20] [INFO ] Deduced a trap composed of 223 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:04:20] [INFO ] Deduced a trap composed of 225 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:04:20] [INFO ] Deduced a trap composed of 227 places in 224 ms of which 0 ms to minimize.
[2022-05-19 14:04:21] [INFO ] Deduced a trap composed of 221 places in 236 ms of which 2 ms to minimize.
[2022-05-19 14:04:21] [INFO ] Deduced a trap composed of 221 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:04:21] [INFO ] Deduced a trap composed of 223 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:04:21] [INFO ] Deduced a trap composed of 217 places in 229 ms of which 0 ms to minimize.
[2022-05-19 14:04:22] [INFO ] Deduced a trap composed of 221 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:04:22] [INFO ] Deduced a trap composed of 219 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:04:22] [INFO ] Deduced a trap composed of 215 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:04:23] [INFO ] Deduced a trap composed of 221 places in 229 ms of which 0 ms to minimize.
[2022-05-19 14:04:23] [INFO ] Deduced a trap composed of 239 places in 227 ms of which 1 ms to minimize.
[2022-05-19 14:04:24] [INFO ] Deduced a trap composed of 221 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:04:24] [INFO ] Deduced a trap composed of 231 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:04:24] [INFO ] Deduced a trap composed of 219 places in 248 ms of which 1 ms to minimize.
[2022-05-19 14:04:25] [INFO ] Deduced a trap composed of 221 places in 240 ms of which 0 ms to minimize.
[2022-05-19 14:04:25] [INFO ] Deduced a trap composed of 215 places in 243 ms of which 1 ms to minimize.
[2022-05-19 14:04:25] [INFO ] Deduced a trap composed of 207 places in 241 ms of which 0 ms to minimize.
[2022-05-19 14:04:26] [INFO ] Deduced a trap composed of 229 places in 248 ms of which 3 ms to minimize.
[2022-05-19 14:04:26] [INFO ] Deduced a trap composed of 211 places in 243 ms of which 0 ms to minimize.
[2022-05-19 14:04:26] [INFO ] Deduced a trap composed of 219 places in 242 ms of which 0 ms to minimize.
[2022-05-19 14:04:27] [INFO ] Deduced a trap composed of 219 places in 259 ms of which 1 ms to minimize.
[2022-05-19 14:04:27] [INFO ] Deduced a trap composed of 219 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:04:27] [INFO ] Deduced a trap composed of 223 places in 223 ms of which 0 ms to minimize.
[2022-05-19 14:04:27] [INFO ] Deduced a trap composed of 213 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:04:28] [INFO ] Deduced a trap composed of 223 places in 227 ms of which 1 ms to minimize.
[2022-05-19 14:04:29] [INFO ] Deduced a trap composed of 233 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:04:29] [INFO ] Deduced a trap composed of 211 places in 221 ms of which 0 ms to minimize.
[2022-05-19 14:04:30] [INFO ] Deduced a trap composed of 223 places in 227 ms of which 0 ms to minimize.
[2022-05-19 14:04:30] [INFO ] Deduced a trap composed of 227 places in 220 ms of which 0 ms to minimize.
[2022-05-19 14:04:33] [INFO ] Deduced a trap composed of 217 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:04:35] [INFO ] Deduced a trap composed of 221 places in 226 ms of which 0 ms to minimize.
[2022-05-19 14:04:36] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 21078 ms
[2022-05-19 14:04:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:04:36] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0 real:5
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 30 out of 474 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 61 place count 439 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 438 transition count 1009
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 62 place count 438 transition count 985
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 110 place count 414 transition count 985
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 413 transition count 984
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 413 transition count 984
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 411 transition count 982
Applied a total of 116 rules in 187 ms. Remains 411 /474 variables (removed 63) and now considering 982/1035 (removed 53) transitions.
[2022-05-19 14:04:36] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:04:36] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 14:04:36] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/474 places, 982/1035 transitions.
Incomplete random walk after 10000 steps, including 698 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 14:04:36] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:04:36] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:04:36] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2022-05-19 14:04:36] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 15 ms returned sat
[2022-05-19 14:04:37] [INFO ] After 330ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 14:04:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:04:37] [INFO ] After 42ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:04:37] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:04:37] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2022-05-19 14:04:37] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 13 ms returned sat
[2022-05-19 14:04:38] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:04:38] [INFO ] After 45ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:04:38] [INFO ] Deduced a trap composed of 170 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:04:38] [INFO ] Deduced a trap composed of 175 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:04:38] [INFO ] Deduced a trap composed of 166 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:04:39] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 1 ms to minimize.
[2022-05-19 14:04:39] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2022-05-19 14:04:39] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 1 ms to minimize.
[2022-05-19 14:04:40] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 0 ms to minimize.
[2022-05-19 14:04:40] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:04:41] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 2 ms to minimize.
[2022-05-19 14:04:41] [INFO ] Deduced a trap composed of 168 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:04:42] [INFO ] Deduced a trap composed of 171 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:04:42] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:04:42] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 0 ms to minimize.
[2022-05-19 14:04:42] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2022-05-19 14:04:43] [INFO ] Deduced a trap composed of 154 places in 227 ms of which 0 ms to minimize.
[2022-05-19 14:04:43] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 1 ms to minimize.
[2022-05-19 14:04:44] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 0 ms to minimize.
[2022-05-19 14:04:44] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 5 ms to minimize.
[2022-05-19 14:04:44] [INFO ] Deduced a trap composed of 171 places in 223 ms of which 3 ms to minimize.
[2022-05-19 14:04:44] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 5 ms to minimize.
[2022-05-19 14:04:45] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 2 ms to minimize.
[2022-05-19 14:04:45] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:04:45] [INFO ] Deduced a trap composed of 173 places in 213 ms of which 0 ms to minimize.
[2022-05-19 14:04:46] [INFO ] Deduced a trap composed of 181 places in 213 ms of which 1 ms to minimize.
[2022-05-19 14:04:46] [INFO ] Deduced a trap composed of 173 places in 220 ms of which 1 ms to minimize.
[2022-05-19 14:04:46] [INFO ] Deduced a trap composed of 171 places in 215 ms of which 1 ms to minimize.
[2022-05-19 14:04:46] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 1 ms to minimize.
[2022-05-19 14:04:47] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 1 ms to minimize.
[2022-05-19 14:04:47] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2022-05-19 14:04:47] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 0 ms to minimize.
[2022-05-19 14:04:48] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2022-05-19 14:04:48] [INFO ] Deduced a trap composed of 173 places in 211 ms of which 0 ms to minimize.
[2022-05-19 14:04:48] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2022-05-19 14:04:49] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 1 ms to minimize.
[2022-05-19 14:04:49] [INFO ] Deduced a trap composed of 173 places in 209 ms of which 0 ms to minimize.
[2022-05-19 14:04:49] [INFO ] Deduced a trap composed of 177 places in 211 ms of which 0 ms to minimize.
[2022-05-19 14:04:49] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2022-05-19 14:04:50] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2022-05-19 14:04:50] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2022-05-19 14:04:50] [INFO ] Deduced a trap composed of 154 places in 209 ms of which 0 ms to minimize.
[2022-05-19 14:04:50] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2022-05-19 14:04:51] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2022-05-19 14:04:51] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2022-05-19 14:04:52] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2022-05-19 14:04:52] [INFO ] Deduced a trap composed of 167 places in 202 ms of which 1 ms to minimize.
[2022-05-19 14:04:52] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-19 14:04:52] [INFO ] Deduced a trap composed of 173 places in 207 ms of which 1 ms to minimize.
[2022-05-19 14:04:53] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 1 ms to minimize.
[2022-05-19 14:04:53] [INFO ] Deduced a trap composed of 171 places in 205 ms of which 0 ms to minimize.
[2022-05-19 14:04:58] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2022-05-19 14:04:58] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 0 ms to minimize.
[2022-05-19 14:04:59] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 0 ms to minimize.
[2022-05-19 14:04:59] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 0 ms to minimize.
[2022-05-19 14:04:59] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2022-05-19 14:05:00] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2022-05-19 14:05:00] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 0 ms to minimize.
[2022-05-19 14:05:01] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2022-05-19 14:05:02] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 1 ms to minimize.
[2022-05-19 14:05:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:05:02] [INFO ] After 25213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 982/982 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 411 transition count 981
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 410 transition count 981
Applied a total of 2 rules in 43 ms. Remains 410 /411 variables (removed 1) and now considering 981/982 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/411 places, 981/982 transitions.
Incomplete random walk after 10000 steps, including 707 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 379486 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 379486 steps, saw 62341 distinct states, run finished after 3003 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 14:05:05] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:05:05] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-19 14:05:05] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:05:05] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 13 ms returned sat
[2022-05-19 14:05:05] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:05:05] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2022-05-19 14:05:05] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 14 ms returned sat
[2022-05-19 14:05:26] [INFO ] After 20534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:05:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:05:26] [INFO ] After 110ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:05:26] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 0 ms to minimize.
[2022-05-19 14:05:27] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2022-05-19 14:05:27] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2022-05-19 14:05:27] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 1 ms to minimize.
[2022-05-19 14:05:28] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 0 ms to minimize.
[2022-05-19 14:05:28] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 0 ms to minimize.
[2022-05-19 14:05:28] [INFO ] Deduced a trap composed of 169 places in 206 ms of which 0 ms to minimize.
[2022-05-19 14:05:29] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 0 ms to minimize.
[2022-05-19 14:05:29] [INFO ] Deduced a trap composed of 174 places in 204 ms of which 0 ms to minimize.
[2022-05-19 14:05:29] [INFO ] Deduced a trap composed of 179 places in 220 ms of which 0 ms to minimize.
[2022-05-19 14:05:29] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 0 ms to minimize.
[2022-05-19 14:05:30] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 1 ms to minimize.
[2022-05-19 14:05:30] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 0 ms to minimize.
[2022-05-19 14:05:30] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 0 ms to minimize.
[2022-05-19 14:05:30] [INFO ] Trap strengthening (SAT) tested/added 14/14 trap constraints in 4267 ms
[2022-05-19 14:05:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:05:30] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 28 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 24 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-19 14:05:30] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:05:30] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 14:05:31] [INFO ] Implicit Places using invariants in 506 ms returned []
[2022-05-19 14:05:31] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:05:31] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:05:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:05:34] [INFO ] Implicit Places using invariants and state equation in 3089 ms returned []
Implicit Place search using SMT with State Equation took 3597 ms to find 0 implicit places.
[2022-05-19 14:05:34] [INFO ] Redundant transitions in 61 ms returned []
[2022-05-19 14:05:34] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:05:34] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:05:34] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 118 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2022-05-19 14:05:35] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-19 14:05:35] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2022-05-19 14:05:35] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 11 ms returned sat
[2022-05-19 14:05:35] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:05:35] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2022-05-19 14:05:35] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 11 ms returned sat
[2022-05-19 14:05:35] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:05:36] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 1 ms to minimize.
[2022-05-19 14:05:36] [INFO ] Deduced a trap composed of 161 places in 184 ms of which 1 ms to minimize.
[2022-05-19 14:05:36] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 1 ms to minimize.
[2022-05-19 14:05:36] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 1 ms to minimize.
[2022-05-19 14:05:37] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 1 ms to minimize.
[2022-05-19 14:05:37] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 0 ms to minimize.
[2022-05-19 14:05:37] [INFO ] Deduced a trap composed of 159 places in 187 ms of which 0 ms to minimize.
[2022-05-19 14:05:37] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 1 ms to minimize.
[2022-05-19 14:05:37] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 0 ms to minimize.
[2022-05-19 14:05:38] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 0 ms to minimize.
[2022-05-19 14:05:38] [INFO ] Deduced a trap composed of 165 places in 184 ms of which 0 ms to minimize.
[2022-05-19 14:05:38] [INFO ] Deduced a trap composed of 166 places in 171 ms of which 0 ms to minimize.
[2022-05-19 14:05:39] [INFO ] Deduced a trap composed of 165 places in 187 ms of which 0 ms to minimize.
[2022-05-19 14:05:39] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 0 ms to minimize.
[2022-05-19 14:05:39] [INFO ] Deduced a trap composed of 163 places in 183 ms of which 0 ms to minimize.
[2022-05-19 14:05:39] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 1 ms to minimize.
[2022-05-19 14:05:39] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 0 ms to minimize.
[2022-05-19 14:05:40] [INFO ] Deduced a trap composed of 166 places in 181 ms of which 1 ms to minimize.
[2022-05-19 14:05:40] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 1 ms to minimize.
[2022-05-19 14:05:40] [INFO ] Deduced a trap composed of 161 places in 183 ms of which 0 ms to minimize.
[2022-05-19 14:05:41] [INFO ] Deduced a trap composed of 157 places in 180 ms of which 0 ms to minimize.
[2022-05-19 14:05:41] [INFO ] Deduced a trap composed of 163 places in 178 ms of which 1 ms to minimize.
[2022-05-19 14:05:41] [INFO ] Deduced a trap composed of 168 places in 181 ms of which 0 ms to minimize.
[2022-05-19 14:05:42] [INFO ] Deduced a trap composed of 154 places in 196 ms of which 1 ms to minimize.
[2022-05-19 14:05:42] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2022-05-19 14:05:42] [INFO ] Deduced a trap composed of 156 places in 181 ms of which 0 ms to minimize.
[2022-05-19 14:05:43] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 1 ms to minimize.
[2022-05-19 14:05:43] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 0 ms to minimize.
[2022-05-19 14:05:43] [INFO ] Deduced a trap composed of 166 places in 180 ms of which 0 ms to minimize.
[2022-05-19 14:05:44] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 0 ms to minimize.
[2022-05-19 14:05:44] [INFO ] Deduced a trap composed of 156 places in 183 ms of which 1 ms to minimize.
[2022-05-19 14:05:44] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 0 ms to minimize.
[2022-05-19 14:05:44] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 1 ms to minimize.
[2022-05-19 14:05:45] [INFO ] Deduced a trap composed of 161 places in 185 ms of which 0 ms to minimize.
[2022-05-19 14:05:45] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 0 ms to minimize.
[2022-05-19 14:05:45] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 1 ms to minimize.
[2022-05-19 14:05:45] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 0 ms to minimize.
[2022-05-19 14:05:46] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 0 ms to minimize.
[2022-05-19 14:05:46] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 1 ms to minimize.
[2022-05-19 14:05:46] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 1 ms to minimize.
[2022-05-19 14:05:46] [INFO ] Deduced a trap composed of 156 places in 181 ms of which 0 ms to minimize.
[2022-05-19 14:05:47] [INFO ] Deduced a trap composed of 170 places in 179 ms of which 1 ms to minimize.
[2022-05-19 14:05:47] [INFO ] Deduced a trap composed of 152 places in 184 ms of which 0 ms to minimize.
[2022-05-19 14:05:47] [INFO ] Deduced a trap composed of 166 places in 171 ms of which 0 ms to minimize.
[2022-05-19 14:05:47] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 0 ms to minimize.
[2022-05-19 14:05:48] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 0 ms to minimize.
[2022-05-19 14:05:48] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 1 ms to minimize.
[2022-05-19 14:05:48] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 0 ms to minimize.
[2022-05-19 14:05:49] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 0 ms to minimize.
[2022-05-19 14:05:49] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 1 ms to minimize.
[2022-05-19 14:05:49] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 0 ms to minimize.
[2022-05-19 14:05:49] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 1 ms to minimize.
[2022-05-19 14:05:50] [INFO ] Deduced a trap composed of 166 places in 174 ms of which 0 ms to minimize.
[2022-05-19 14:05:50] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 1 ms to minimize.
[2022-05-19 14:05:50] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 13 ms to minimize.
[2022-05-19 14:05:51] [INFO ] Deduced a trap composed of 165 places in 176 ms of which 0 ms to minimize.
[2022-05-19 14:05:51] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 1 ms to minimize.
[2022-05-19 14:05:52] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 1 ms to minimize.
[2022-05-19 14:05:52] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 0 ms to minimize.
[2022-05-19 14:05:52] [INFO ] Deduced a trap composed of 168 places in 185 ms of which 1 ms to minimize.
[2022-05-19 14:05:53] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2022-05-19 14:05:53] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 0 ms to minimize.
[2022-05-19 14:05:53] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 1 ms to minimize.
[2022-05-19 14:05:54] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 1 ms to minimize.
[2022-05-19 14:05:54] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 0 ms to minimize.
[2022-05-19 14:05:55] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 1 ms to minimize.
[2022-05-19 14:05:55] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2022-05-19 14:05:55] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 1 ms to minimize.
[2022-05-19 14:05:56] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 0 ms to minimize.
[2022-05-19 14:05:56] [INFO ] Deduced a trap composed of 168 places in 180 ms of which 1 ms to minimize.
[2022-05-19 14:05:56] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 1 ms to minimize.
[2022-05-19 14:05:57] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 0 ms to minimize.
[2022-05-19 14:05:57] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 0 ms to minimize.
[2022-05-19 14:05:57] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 0 ms to minimize.
[2022-05-19 14:05:57] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 0 ms to minimize.
[2022-05-19 14:05:58] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 1 ms to minimize.
[2022-05-19 14:05:58] [INFO ] Deduced a trap composed of 168 places in 185 ms of which 1 ms to minimize.
[2022-05-19 14:05:59] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 0 ms to minimize.
[2022-05-19 14:05:59] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 1 ms to minimize.
[2022-05-19 14:06:03] [INFO ] Deduced a trap composed of 166 places in 171 ms of which 1 ms to minimize.
[2022-05-19 14:06:04] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 0 ms to minimize.
[2022-05-19 14:06:05] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 1 ms to minimize.
[2022-05-19 14:06:05] [INFO ] Deduced a trap composed of 160 places in 182 ms of which 1 ms to minimize.
[2022-05-19 14:06:05] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 1 ms to minimize.
[2022-05-19 14:06:06] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 0 ms to minimize.
[2022-05-19 14:06:06] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2022-05-19 14:06:06] [INFO ] Deduced a trap composed of 166 places in 182 ms of which 0 ms to minimize.
[2022-05-19 14:06:15] [INFO ] Trap strengthening (SAT) tested/added 87/87 trap constraints in 39912 ms
[2022-05-19 14:06:16] [INFO ] After 40393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 14:06:16] [INFO ] After 40487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-19 14:06:16] [INFO ] Flatten gal took : 65 ms
[2022-05-19 14:06:16] [INFO ] Flatten gal took : 60 ms
[2022-05-19 14:06:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4453152310375328531.gal : 55 ms
[2022-05-19 14:06:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9932710611675147892.prop : 13 ms
Invoking ITS tools like this :cd /tmp/redAtoms2032504547273262399;'/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/ReachabilityCardinality4453152310375328531.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9932710611675147892.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...319
Loading property file /tmp/ReachabilityCardinality9932710611675147892.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 176
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :176 after 178
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :178 after 180
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :180 after 182
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :182 after 188
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :188 after 190
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :190 after 208
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :208 after 295
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :295 after 853
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :853 after 1048
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1048 after 2741
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2741 after 16325
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :16325 after 66103
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :66103 after 540115
Detected timeout of ITS tools.
[2022-05-19 14:06:31] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:06:31] [INFO ] Applying decomposition
[2022-05-19 14:06:31] [INFO ] Flatten gal took : 80 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/graph9423259984323298205.txt' '-o' '/tmp/graph9423259984323298205.bin' '-w' '/tmp/graph9423259984323298205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9423259984323298205.bin' '-l' '-1' '-v' '-w' '/tmp/graph9423259984323298205.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:06:31] [INFO ] Decomposing Gal with order
[2022-05-19 14:06:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:06:32] [INFO ] Removed a total of 1050 redundant transitions.
[2022-05-19 14:06:32] [INFO ] Flatten gal took : 640 ms
[2022-05-19 14:06:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 561 labels/synchronizations in 54 ms.
[2022-05-19 14:06:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12496815142500558116.gal : 12 ms
[2022-05-19 14:06:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3283995851585628905.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2032504547273262399;'/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/ReachabilityCardinality12496815142500558116.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3283995851585628905.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality3283995851585628905.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14101182946742402031
[2022-05-19 14:06:47] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14101182946742402031
Running compilation step : cd /tmp/ltsmin14101182946742402031;'/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 2565 ms.
Running link step : cd /tmp/ltsmin14101182946742402031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 171 ms.
Running LTSmin : cd /tmp/ltsmin14101182946742402031;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBNT-PT-S10J20-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBNT-PT-S10J20-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((p0 U X(p1)))'
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 20 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 14:07:02] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:07:03] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:07:03] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
[2022-05-19 14:07:03] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:07:03] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 14:07:04] [INFO ] Implicit Places using invariants in 462 ms returned []
[2022-05-19 14:07:04] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:07:04] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 14:07:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:07:08] [INFO ] Implicit Places using invariants and state equation in 4325 ms returned []
Implicit Place search using SMT with State Equation took 4792 ms to find 0 implicit places.
[2022-05-19 14:07:08] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:07:08] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 14:07:09] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/474 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s426 4) (GEQ s206 1)), p1:(LT s426 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 871 ms.
Product exploration explored 100000 steps with 50000 reset in 713 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 8 factoid took 200 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-00 finished in 8195 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(((p0 U p1) U p2)) U G(!p1))))'
Support contains 25 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 474 transition count 1010
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 449 transition count 1010
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 449 transition count 986
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 425 transition count 986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 424 transition count 985
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 424 transition count 985
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 423 transition count 984
Applied a total of 102 rules in 107 ms. Remains 423 /474 variables (removed 51) and now considering 984/1035 (removed 51) transitions.
[2022-05-19 14:07:11] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 423 cols
[2022-05-19 14:07:11] [INFO ] Computed 72 place invariants in 10 ms
[2022-05-19 14:07:11] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
[2022-05-19 14:07:11] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 423 cols
[2022-05-19 14:07:11] [INFO ] Computed 72 place invariants in 19 ms
[2022-05-19 14:07:12] [INFO ] Implicit Places using invariants in 419 ms returned []
[2022-05-19 14:07:12] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 423 cols
[2022-05-19 14:07:12] [INFO ] Computed 72 place invariants in 10 ms
[2022-05-19 14:07:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:07:18] [INFO ] Implicit Places using invariants and state equation in 6323 ms returned []
Implicit Place search using SMT with State Equation took 6744 ms to find 0 implicit places.
[2022-05-19 14:07:18] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-19 14:07:18] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 423 cols
[2022-05-19 14:07:18] [INFO ] Computed 72 place invariants in 10 ms
[2022-05-19 14:07:19] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/474 places, 984/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 423/474 places, 984/1035 transitions.
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p0) p1), (NOT p2), (AND (NOT p1) (NOT p2)), p1, p1, false, (AND (NOT p0) (NOT p2) (NOT p1)), true, (NOT p1), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p0 p1), acceptance={} source=0 dest: 6}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s229 1)), p1:(OR (AND (GEQ s180 1) (GEQ s267 1) (GEQ s286 1) (GEQ s319 1)) (AND (GEQ s41 1) (GEQ s64 1) (GEQ s180 1) (GEQ s286 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 15 steps with 1 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-01 finished in 8272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(G(!(X(G(p0)) U F(p1))))))))'
Support contains 33 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 464 transition count 1031
Reduce places removed 4 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 25 rules applied. Total rules applied 29 place count 460 transition count 1010
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 50 place count 439 transition count 1007
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 436 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 435 transition count 1006
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 435 transition count 1006
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 433 transition count 1004
Applied a total of 62 rules in 75 ms. Remains 433 /474 variables (removed 41) and now considering 1004/1035 (removed 31) transitions.
[2022-05-19 14:07:19] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 14:07:19] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:07:20] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
[2022-05-19 14:07:20] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 14:07:20] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:07:20] [INFO ] Implicit Places using invariants in 386 ms returned []
[2022-05-19 14:07:20] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 14:07:20] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:07:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:07:23] [INFO ] Implicit Places using invariants and state equation in 2804 ms returned []
Implicit Place search using SMT with State Equation took 3191 ms to find 0 implicit places.
[2022-05-19 14:07:23] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-19 14:07:23] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 14:07:23] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 14:07:23] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/474 places, 1004/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 433/474 places, 1004/1035 transitions.
Stuttering acceptance computed with spot in 26 ms :[p1]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (AND (GEQ s41 1) (GEQ s52 1) (GEQ s235 1) (GEQ s290 8)) (AND (GEQ s161 1) (GEQ s201 1) (GEQ s235 1) (GEQ s290 8)) (AND (GEQ s235 1) (GEQ s290 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6735 reset in 1403 ms.
Product exploration explored 100000 steps with 6730 reset in 1403 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 649 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[p1]
Finished random walk after 1171 steps, including 82 resets, run visited all 1 properties in 20 ms. (steps per millisecond=58 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[p1]
Stuttering acceptance computed with spot in 30 ms :[p1]
Support contains 33 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 1004/1004 transitions.
Applied a total of 0 rules in 22 ms. Remains 433 /433 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2022-05-19 14:07:27] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 14:07:27] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:07:28] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
[2022-05-19 14:07:28] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 14:07:28] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:07:28] [INFO ] Implicit Places using invariants in 350 ms returned []
[2022-05-19 14:07:28] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 14:07:28] [INFO ] Computed 62 place invariants in 28 ms
[2022-05-19 14:07:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:07:32] [INFO ] Implicit Places using invariants and state equation in 3588 ms returned []
Implicit Place search using SMT with State Equation took 3940 ms to find 0 implicit places.
[2022-05-19 14:07:32] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-19 14:07:32] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 14:07:32] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 14:07:32] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 433/433 places, 1004/1004 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 1273 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[p1]
Finished random walk after 171 steps, including 14 resets, run visited all 1 properties in 4 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[p1]
Stuttering acceptance computed with spot in 35 ms :[p1]
Stuttering acceptance computed with spot in 37 ms :[p1]
Product exploration explored 100000 steps with 6656 reset in 1343 ms.
Product exploration explored 100000 steps with 6744 reset in 1354 ms.
Built C files in :
/tmp/ltsmin15559406069831730472
[2022-05-19 14:07:37] [INFO ] Computing symmetric may disable matrix : 1004 transitions.
[2022-05-19 14:07:37] [INFO ] Computation of Complete disable matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:07:37] [INFO ] Computing symmetric may enable matrix : 1004 transitions.
[2022-05-19 14:07:37] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:07:37] [INFO ] Computing Do-Not-Accords matrix : 1004 transitions.
[2022-05-19 14:07:37] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:07:37] [INFO ] Built C files in 286ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15559406069831730472
Running compilation step : cd /tmp/ltsmin15559406069831730472;'/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/ltsmin15559406069831730472;'/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/ltsmin15559406069831730472;'/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 33 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 1004/1004 transitions.
Applied a total of 0 rules in 27 ms. Remains 433 /433 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2022-05-19 14:07:40] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 14:07:40] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:07:40] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
[2022-05-19 14:07:40] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 14:07:40] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-19 14:07:41] [INFO ] Implicit Places using invariants in 375 ms returned []
[2022-05-19 14:07:41] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 14:07:41] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:07:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:07:43] [INFO ] Implicit Places using invariants and state equation in 2524 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
[2022-05-19 14:07:43] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-19 14:07:43] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 14:07:43] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:07:44] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 433/433 places, 1004/1004 transitions.
Built C files in :
/tmp/ltsmin4601014823822722903
[2022-05-19 14:07:44] [INFO ] Computing symmetric may disable matrix : 1004 transitions.
[2022-05-19 14:07:44] [INFO ] Computation of Complete disable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:07:44] [INFO ] Computing symmetric may enable matrix : 1004 transitions.
[2022-05-19 14:07:44] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:07:44] [INFO ] Computing Do-Not-Accords matrix : 1004 transitions.
[2022-05-19 14:07:44] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:07:44] [INFO ] Built C files in 206ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4601014823822722903
Running compilation step : cd /tmp/ltsmin4601014823822722903;'/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/ltsmin4601014823822722903;'/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/ltsmin4601014823822722903;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 14:07:47] [INFO ] Flatten gal took : 100 ms
[2022-05-19 14:07:47] [INFO ] Flatten gal took : 122 ms
[2022-05-19 14:07:48] [INFO ] Time to serialize gal into /tmp/LTL9089226695116655699.gal : 7 ms
[2022-05-19 14:07:48] [INFO ] Time to serialize properties into /tmp/LTL14334235133018414188.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9089226695116655699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14334235133018414188.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/LTL9089226...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X(G(!((X(G("(((((((((ModifiedSrc_3>=1)&&(ModifiedSrc_10>=1))&&((place_500_1>=1)&&(cSources>=8)))||(((ModifiedSrc_9>=1)&&(Modi...9020
Formula 0 simplified : !XFGXG!(XG"(((((((((ModifiedSrc_3>=1)&&(ModifiedSrc_10>=1))&&((place_500_1>=1)&&(cSources>=8)))||(((ModifiedSrc_9>=1)&&(ModifiedSrc_...9000
Detected timeout of ITS tools.
[2022-05-19 14:08:03] [INFO ] Flatten gal took : 53 ms
[2022-05-19 14:08:03] [INFO ] Applying decomposition
[2022-05-19 14:08:03] [INFO ] Flatten gal took : 52 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/graph9932752449509367623.txt' '-o' '/tmp/graph9932752449509367623.bin' '-w' '/tmp/graph9932752449509367623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9932752449509367623.bin' '-l' '-1' '-v' '-w' '/tmp/graph9932752449509367623.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:08:03] [INFO ] Decomposing Gal with order
[2022-05-19 14:08:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:08:03] [INFO ] Removed a total of 677 redundant transitions.
[2022-05-19 14:08:03] [INFO ] Flatten gal took : 105 ms
[2022-05-19 14:08:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 19 ms.
[2022-05-19 14:08:03] [INFO ] Time to serialize gal into /tmp/LTL11018441617683128631.gal : 8 ms
[2022-05-19 14:08:03] [INFO ] Time to serialize properties into /tmp/LTL9362936458700678373.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/LTL11018441617683128631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9362936458700678373.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/LTL1101844...246
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X(G(!((X(G("(((((((((u20.ModifiedSrc_3>=1)&&(u20.ModifiedSrc_10>=1))&&((u20.place_500_1>=1)&&(u20.cSources>=8)))||(((u20.Modi...10815
Formula 0 simplified : !XFGXG!(XG"(((((((((u20.ModifiedSrc_3>=1)&&(u20.ModifiedSrc_10>=1))&&((u20.place_500_1>=1)&&(u20.cSources>=8)))||(((u20.ModifiedSrc_...10795
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16957527499960637507
[2022-05-19 14:08:18] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16957527499960637507
Running compilation step : cd /tmp/ltsmin16957527499960637507;'/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 1961 ms.
Running link step : cd /tmp/ltsmin16957527499960637507;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16957527499960637507;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](X([](!(X([]((LTLAPp0==true))) U <>((LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-02 finished in 74281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 439 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 52 place count 438 transition count 985
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 100 place count 414 transition count 985
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 413 transition count 984
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 413 transition count 984
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 411 transition count 982
Applied a total of 106 rules in 78 ms. Remains 411 /474 variables (removed 63) and now considering 982/1035 (removed 53) transitions.
[2022-05-19 14:08:33] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:08:33] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 14:08:34] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
[2022-05-19 14:08:34] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:08:34] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:08:34] [INFO ] Implicit Places using invariants in 403 ms returned []
[2022-05-19 14:08:34] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:08:34] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:08:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:08:38] [INFO ] Implicit Places using invariants and state equation in 3672 ms returned []
Implicit Place search using SMT with State Equation took 4076 ms to find 0 implicit places.
[2022-05-19 14:08:38] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-19 14:08:38] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:08:38] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:08:38] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/474 places, 982/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/474 places, 982/1035 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s243 1) (GEQ s266 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-04 finished in 5221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U G(X(((p0 U p1) U p2)))))'
Support contains 255 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 15 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 14:08:38] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:08:38] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 14:08:39] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
[2022-05-19 14:08:39] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:08:39] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:08:39] [INFO ] Implicit Places using invariants in 309 ms returned []
[2022-05-19 14:08:39] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:08:39] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:08:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:08:43] [INFO ] Implicit Places using invariants and state equation in 3996 ms returned []
Implicit Place search using SMT with State Equation took 4307 ms to find 0 implicit places.
[2022-05-19 14:08:43] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:08:43] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:08:44] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/474 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p2 (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s303 1) (GEQ s398 1)), p1:(OR (AND (GEQ s25 1) (GEQ s454 1)) (AND (GEQ s106 1) (GEQ s454 1)) (AND (GEQ s33 1) (GEQ s454 1)) (AND (GEQ s52 1) ...], 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]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-05 finished in 5909 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(!p0 U X(p1))&&(false U p2)))'
Support contains 254 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 473 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 1034
Applied a total of 2 rules in 13 ms. Remains 473 /474 variables (removed 1) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 14:08:44] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 473 cols
[2022-05-19 14:08:44] [INFO ] Computed 72 place invariants in 15 ms
[2022-05-19 14:08:45] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
[2022-05-19 14:08:45] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 473 cols
[2022-05-19 14:08:45] [INFO ] Computed 72 place invariants in 17 ms
[2022-05-19 14:08:45] [INFO ] Implicit Places using invariants in 319 ms returned []
[2022-05-19 14:08:45] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 473 cols
[2022-05-19 14:08:45] [INFO ] Computed 72 place invariants in 19 ms
[2022-05-19 14:08:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:08:50] [INFO ] Implicit Places using invariants and state equation in 4373 ms returned []
Implicit Place search using SMT with State Equation took 4696 ms to find 0 implicit places.
[2022-05-19 14:08:50] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 473 cols
[2022-05-19 14:08:50] [INFO ] Computed 72 place invariants in 17 ms
[2022-05-19 14:08:50] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/474 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 473/474 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, p1, (OR (NOT p2) p1), p1]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s198 1) (GEQ s299 1) (GEQ s322 1) (GEQ s358 1)) (AND (GEQ s45 1) (GEQ s68 1) (GEQ s198 1) (GEQ s322 1)) (AND (GEQ s121 1) (GEQ s198 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-07 finished in 6133 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(!(p0 U !p1)) U p0)&&G(p2))))'
Support contains 5 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 25 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 14:08:50] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:08:50] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-19 14:08:51] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
[2022-05-19 14:08:51] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:08:51] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:08:52] [INFO ] Implicit Places using invariants in 444 ms returned []
[2022-05-19 14:08:52] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:08:52] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:08:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:08:57] [INFO ] Implicit Places using invariants and state equation in 5149 ms returned []
Implicit Place search using SMT with State Equation took 5595 ms to find 0 implicit places.
[2022-05-19 14:08:57] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:08:57] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:08:57] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/474 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0 p1), acceptance={0} source=1 dest: 3}, { cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p2:(LT s392 1), p0:(AND (GEQ s67 1) (GEQ s393 1) (GEQ s423 1)), p1:(LT s210 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-08 finished in 7168 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((F(!(true U p0))&&p1)))))'
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 439 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 52 place count 438 transition count 986
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 98 place count 415 transition count 986
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 414 transition count 985
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 414 transition count 985
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 412 transition count 983
Applied a total of 104 rules in 67 ms. Remains 412 /474 variables (removed 62) and now considering 983/1035 (removed 52) transitions.
[2022-05-19 14:08:58] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 14:08:58] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:08:58] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
[2022-05-19 14:08:58] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 14:08:58] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-19 14:08:59] [INFO ] Implicit Places using invariants in 416 ms returned []
[2022-05-19 14:08:59] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 14:08:59] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:08:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:09:03] [INFO ] Implicit Places using invariants and state equation in 4371 ms returned []
Implicit Place search using SMT with State Equation took 4797 ms to find 0 implicit places.
[2022-05-19 14:09:03] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-19 14:09:03] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 14:09:03] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 14:09:04] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/474 places, 983/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/474 places, 983/1035 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p1) p0), p0]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s159 1), p0:(AND (GEQ s1 1) (GEQ s267 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-11 finished in 6000 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 464 transition count 1011
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 440 transition count 1011
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 48 place count 440 transition count 986
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 98 place count 415 transition count 986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 414 transition count 985
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 414 transition count 985
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 413 transition count 984
Applied a total of 102 rules in 58 ms. Remains 413 /474 variables (removed 61) and now considering 984/1035 (removed 51) transitions.
[2022-05-19 14:09:04] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:09:04] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:09:04] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
[2022-05-19 14:09:04] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:09:04] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:09:05] [INFO ] Implicit Places using invariants in 408 ms returned []
[2022-05-19 14:09:05] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:09:05] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 14:09:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:09:09] [INFO ] Implicit Places using invariants and state equation in 3998 ms returned []
Implicit Place search using SMT with State Equation took 4407 ms to find 0 implicit places.
[2022-05-19 14:09:09] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-19 14:09:09] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:09:09] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-19 14:09:09] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 413/474 places, 984/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 413/474 places, 984/1035 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GEQ s102 1), p0:(GEQ s186 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-12 finished in 5566 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U p1))'
Support contains 4 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 20 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 14:09:09] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:09:09] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:09:10] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
[2022-05-19 14:09:10] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:09:10] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:09:10] [INFO ] Implicit Places using invariants in 455 ms returned []
[2022-05-19 14:09:10] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:09:10] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:09:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:09:15] [INFO ] Implicit Places using invariants and state equation in 4846 ms returned []
Implicit Place search using SMT with State Equation took 5303 ms to find 0 implicit places.
[2022-05-19 14:09:15] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:09:15] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:09:16] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/474 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s178 1), p0:(AND (GEQ s145 1) (GEQ s393 1) (GEQ s423 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25044 reset in 699 ms.
Product exploration explored 100000 steps with 24929 reset in 731 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 14:09:18] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:09:18] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:09:18] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2022-05-19 14:09:18] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 14 ms returned sat
[2022-05-19 14:09:18] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:09:18] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-19 14:09:18] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 14 ms returned sat
[2022-05-19 14:09:19] [INFO ] After 1490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:09:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:09:20] [INFO ] After 472ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:09:20] [INFO ] After 862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 245 ms.
[2022-05-19 14:09:21] [INFO ] After 2696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 463 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 463 transition count 1009
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 438 transition count 1009
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 438 transition count 984
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 413 transition count 984
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 410 transition count 981
Applied a total of 106 rules in 49 ms. Remains 410 /463 variables (removed 53) and now considering 981/1034 (removed 53) transitions.
[2022-05-19 14:09:21] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:09:21] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 14:09:21] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/463 places, 981/1034 transitions.
Finished random walk after 1223 steps, including 81 resets, run visited all 1 properties in 11 ms. (steps per millisecond=111 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
[2022-05-19 14:09:22] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:09:22] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 14:09:22] [INFO ] [Real]Absence check using 45 positive place invariants in 35 ms returned sat
[2022-05-19 14:09:22] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 24 ms returned sat
[2022-05-19 14:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:24] [INFO ] [Real]Absence check using state equation in 1419 ms returned sat
[2022-05-19 14:09:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:09:24] [INFO ] [Nat]Absence check using 45 positive place invariants in 20 ms returned sat
[2022-05-19 14:09:24] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 31 ms returned sat
[2022-05-19 14:09:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:26] [INFO ] [Nat]Absence check using state equation in 1634 ms returned sat
[2022-05-19 14:09:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:09:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 58 ms returned sat
[2022-05-19 14:09:26] [INFO ] Computed and/alt/rep : 691/2267/691 causal constraints (skipped 323 transitions) in 105 ms.
[2022-05-19 14:09:26] [INFO ] Added : 14 causal constraints over 3 iterations in 434 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Applied a total of 0 rules in 9 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
[2022-05-19 14:09:26] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:09:26] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-19 14:09:27] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
[2022-05-19 14:09:27] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:09:27] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 14:09:27] [INFO ] Implicit Places using invariants in 440 ms returned []
[2022-05-19 14:09:27] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:09:27] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-19 14:09:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:09:32] [INFO ] Implicit Places using invariants and state equation in 4635 ms returned []
Implicit Place search using SMT with State Equation took 5076 ms to find 0 implicit places.
[2022-05-19 14:09:32] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:09:32] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:09:33] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/463 places, 1034/1034 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 p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Incomplete random walk after 10000 steps, including 561 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 14:09:33] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:09:33] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-19 14:09:33] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-19 14:09:33] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 15 ms returned sat
[2022-05-19 14:09:33] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:09:33] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-19 14:09:33] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 14 ms returned sat
[2022-05-19 14:09:35] [INFO ] After 1545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:09:35] [INFO ] After 483ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:09:36] [INFO ] After 893ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 254 ms.
[2022-05-19 14:09:36] [INFO ] After 2774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 463 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 463 transition count 1009
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 438 transition count 1009
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 438 transition count 984
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 413 transition count 984
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 410 transition count 981
Applied a total of 106 rules in 46 ms. Remains 410 /463 variables (removed 53) and now considering 981/1034 (removed 53) transitions.
[2022-05-19 14:09:36] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:09:36] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:09:37] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/463 places, 981/1034 transitions.
Finished random walk after 127 steps, including 8 resets, run visited all 1 properties in 3 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
[2022-05-19 14:09:37] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:09:37] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 14:09:38] [INFO ] [Real]Absence check using 45 positive place invariants in 18 ms returned sat
[2022-05-19 14:09:38] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 25 ms returned sat
[2022-05-19 14:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:39] [INFO ] [Real]Absence check using state equation in 1441 ms returned sat
[2022-05-19 14:09:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:09:40] [INFO ] [Nat]Absence check using 45 positive place invariants in 20 ms returned sat
[2022-05-19 14:09:40] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 34 ms returned sat
[2022-05-19 14:09:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:41] [INFO ] [Nat]Absence check using state equation in 1674 ms returned sat
[2022-05-19 14:09:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:09:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 57 ms returned sat
[2022-05-19 14:09:41] [INFO ] Computed and/alt/rep : 691/2267/691 causal constraints (skipped 323 transitions) in 60 ms.
[2022-05-19 14:09:42] [INFO ] Added : 14 causal constraints over 3 iterations in 420 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Product exploration explored 100000 steps with 24986 reset in 717 ms.
Product exploration explored 100000 steps with 24967 reset in 748 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Support contains 4 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 463 transition count 1034
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 24 place count 463 transition count 1035
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 463 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 462 transition count 1034
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 462 transition count 1034
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 462 transition count 1034
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 78 place count 438 transition count 1010
Deduced a syphon composed of 27 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 102 place count 438 transition count 1010
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 102 rules in 116 ms. Remains 438 /463 variables (removed 25) and now considering 1010/1034 (removed 24) transitions.
[2022-05-19 14:09:44] [INFO ] Flow matrix only has 1001 transitions (discarded 9 similar events)
// Phase 1: matrix 1001 rows 438 cols
[2022-05-19 14:09:44] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:09:45] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
[2022-05-19 14:09:45] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-19 14:09:45] [INFO ] Flow matrix only has 1001 transitions (discarded 9 similar events)
// Phase 1: matrix 1001 rows 438 cols
[2022-05-19 14:09:45] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:09:45] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 438/463 places, 1010/1034 transitions.
Finished structural reductions, in 1 iterations. Remains : 438/463 places, 1010/1034 transitions.
Product exploration explored 100000 steps with 25010 reset in 2510 ms.
Product exploration explored 100000 steps with 25161 reset in 2497 ms.
Built C files in :
/tmp/ltsmin15675212932061935245
[2022-05-19 14:09:50] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15675212932061935245
Running compilation step : cd /tmp/ltsmin15675212932061935245;'/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 2064 ms.
Running link step : cd /tmp/ltsmin15675212932061935245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15675212932061935245;'/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/stateBased6965427359824148518.hoa' '--buchi-type=spotba'
LTSmin run took 1429 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-13 finished in 44503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(X(F(p0)))&&p1))))'
Support contains 5 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 50 place count 439 transition count 987
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 96 place count 416 transition count 987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 415 transition count 986
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 415 transition count 986
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 413 transition count 984
Applied a total of 102 rules in 63 ms. Remains 413 /474 variables (removed 61) and now considering 984/1035 (removed 51) transitions.
[2022-05-19 14:09:54] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:09:54] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-19 14:09:54] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
[2022-05-19 14:09:54] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:09:54] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-19 14:09:55] [INFO ] Implicit Places using invariants in 407 ms returned []
[2022-05-19 14:09:55] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:09:55] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:09:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:09:59] [INFO ] Implicit Places using invariants and state equation in 4104 ms returned []
Implicit Place search using SMT with State Equation took 4512 ms to find 0 implicit places.
[2022-05-19 14:09:59] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-19 14:09:59] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:09:59] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 14:09:59] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 413/474 places, 984/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 413/474 places, 984/1035 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s51 1) (LT s225 1) (LT s276 9)), p1:(OR (LT s19 1) (LT s220 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 6925 reset in 873 ms.
Product exploration explored 100000 steps with 6927 reset in 864 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 339 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 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 682 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :1
Finished Best-First random walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 298 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 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 984/984 transitions.
Applied a total of 0 rules in 21 ms. Remains 413 /413 variables (removed 0) and now considering 984/984 (removed 0) transitions.
[2022-05-19 14:10:02] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:10:02] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:10:03] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
[2022-05-19 14:10:03] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:10:03] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:10:03] [INFO ] Implicit Places using invariants in 398 ms returned []
[2022-05-19 14:10:03] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:10:03] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:10:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:10:07] [INFO ] Implicit Places using invariants and state equation in 4093 ms returned []
Implicit Place search using SMT with State Equation took 4491 ms to find 0 implicit places.
[2022-05-19 14:10:07] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-19 14:10:07] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:10:07] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-19 14:10:08] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 984/984 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 565 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 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 680 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :1
Finished Best-First random walk after 46 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 239 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 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 6925 reset in 833 ms.
Product exploration explored 100000 steps with 6948 reset in 853 ms.
Built C files in :
/tmp/ltsmin13045209896736996087
[2022-05-19 14:10:11] [INFO ] Computing symmetric may disable matrix : 984 transitions.
[2022-05-19 14:10:11] [INFO ] Computation of Complete disable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:10:11] [INFO ] Computing symmetric may enable matrix : 984 transitions.
[2022-05-19 14:10:11] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:10:11] [INFO ] Computing Do-Not-Accords matrix : 984 transitions.
[2022-05-19 14:10:11] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:10:11] [INFO ] Built C files in 199ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13045209896736996087
Running compilation step : cd /tmp/ltsmin13045209896736996087;'/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/ltsmin13045209896736996087;'/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/ltsmin13045209896736996087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 984/984 transitions.
Applied a total of 0 rules in 27 ms. Remains 413 /413 variables (removed 0) and now considering 984/984 (removed 0) transitions.
[2022-05-19 14:10:14] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:10:14] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:10:14] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
[2022-05-19 14:10:14] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:10:14] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:10:15] [INFO ] Implicit Places using invariants in 397 ms returned []
[2022-05-19 14:10:15] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:10:15] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:10:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:10:19] [INFO ] Implicit Places using invariants and state equation in 4438 ms returned []
Implicit Place search using SMT with State Equation took 4837 ms to find 0 implicit places.
[2022-05-19 14:10:19] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-19 14:10:19] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:10:19] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:10:20] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 984/984 transitions.
Built C files in :
/tmp/ltsmin2743008565119025227
[2022-05-19 14:10:20] [INFO ] Computing symmetric may disable matrix : 984 transitions.
[2022-05-19 14:10:20] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:10:20] [INFO ] Computing symmetric may enable matrix : 984 transitions.
[2022-05-19 14:10:20] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:10:20] [INFO ] Computing Do-Not-Accords matrix : 984 transitions.
[2022-05-19 14:10:20] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:10:20] [INFO ] Built C files in 200ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2743008565119025227
Running compilation step : cd /tmp/ltsmin2743008565119025227;'/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/ltsmin2743008565119025227;'/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/ltsmin2743008565119025227;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 14:10:23] [INFO ] Flatten gal took : 51 ms
[2022-05-19 14:10:23] [INFO ] Flatten gal took : 50 ms
[2022-05-19 14:10:23] [INFO ] Time to serialize gal into /tmp/LTL7866738964168016559.gal : 224 ms
[2022-05-19 14:10:23] [INFO ] Time to serialize properties into /tmp/LTL6572116341021750547.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7866738964168016559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6572116341021750547.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/LTL7866738...266
Read 1 LTL properties
Checking formula 0 : !((G(F((G(X(F("(((ModifiedSrc_10<1)||(place_500_1<1))||(cSources<9))"))))&&("((JobCnt<1)||(place_782_1<1))")))))
Formula 0 simplified : !GF("((JobCnt<1)||(place_782_1<1))" & GXF"(((ModifiedSrc_10<1)||(place_500_1<1))||(cSources<9))")
Detected timeout of ITS tools.
[2022-05-19 14:10:39] [INFO ] Flatten gal took : 49 ms
[2022-05-19 14:10:39] [INFO ] Applying decomposition
[2022-05-19 14:10:39] [INFO ] Flatten gal took : 48 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/graph5710007328325885830.txt' '-o' '/tmp/graph5710007328325885830.bin' '-w' '/tmp/graph5710007328325885830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5710007328325885830.bin' '-l' '-1' '-v' '-w' '/tmp/graph5710007328325885830.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:10:39] [INFO ] Decomposing Gal with order
[2022-05-19 14:10:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:10:39] [INFO ] Removed a total of 2740 redundant transitions.
[2022-05-19 14:10:39] [INFO ] Flatten gal took : 102 ms
[2022-05-19 14:10:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 273 labels/synchronizations in 31 ms.
[2022-05-19 14:10:39] [INFO ] Time to serialize gal into /tmp/LTL10838221798623092411.gal : 7 ms
[2022-05-19 14:10:39] [INFO ] Time to serialize properties into /tmp/LTL10004279274693227969.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/LTL10838221798623092411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10004279274693227969.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/LTL1083822...247
Read 1 LTL properties
Checking formula 0 : !((G(F((G(X(F("(((i8.u6.ModifiedSrc_10<1)||(i8.u22.place_500_1<1))||(i8.u20.cSources<9))"))))&&("((i11.u36.JobCnt<1)||(i7.u21.place_78...168
Formula 0 simplified : !GF("((i11.u36.JobCnt<1)||(i7.u21.place_782_1<1))" & GXF"(((i8.u6.ModifiedSrc_10<1)||(i8.u22.place_500_1<1))||(i8.u20.cSources<9))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4120765842954976888
[2022-05-19 14:10:54] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4120765842954976888
Running compilation step : cd /tmp/ltsmin4120765842954976888;'/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 1902 ms.
Running link step : cd /tmp/ltsmin4120765842954976888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4120765842954976888;'/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))))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-14 finished in 75341 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(false U X(((false U p0)&&p0))))'
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 24 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 14:11:09] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:11:09] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-19 14:11:10] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
[2022-05-19 14:11:10] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:11:10] [INFO ] Computed 62 place invariants in 21 ms
[2022-05-19 14:11:10] [INFO ] Implicit Places using invariants in 478 ms returned []
[2022-05-19 14:11:10] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:11:10] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:11:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:11:15] [INFO ] Implicit Places using invariants and state equation in 4984 ms returned []
Implicit Place search using SMT with State Equation took 5473 ms to find 0 implicit places.
[2022-05-19 14:11:15] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:11:15] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 14:11:16] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/474 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 77 ms :[p0, p0, true]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 655 ms.
Product exploration explored 100000 steps with 50000 reset in 663 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-15 finished in 8240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(G(!(X(G(p0)) U F(p1))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(X(F(p0)))&&p1))))'
[2022-05-19 14:11:17] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7379254680860529986
[2022-05-19 14:11:18] [INFO ] Computing symmetric may disable matrix : 1035 transitions.
[2022-05-19 14:11:18] [INFO ] Applying decomposition
[2022-05-19 14:11:18] [INFO ] Computation of Complete disable matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:11:18] [INFO ] Computing symmetric may enable matrix : 1035 transitions.
[2022-05-19 14:11:18] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:11:18] [INFO ] Flatten gal took : 53 ms
[2022-05-19 14:11:18] [INFO ] Computing Do-Not-Accords matrix : 1035 transitions.
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/graph2663639305488976795.txt' '-o' '/tmp/graph2663639305488976795.bin' '-w' '/tmp/graph2663639305488976795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2663639305488976795.bin' '-l' '-1' '-v' '-w' '/tmp/graph2663639305488976795.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:11:18] [INFO ] Decomposing Gal with order
[2022-05-19 14:11:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:11:18] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:11:18] [INFO ] Built C files in 256ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7379254680860529986
Running compilation step : cd /tmp/ltsmin7379254680860529986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 14:11:18] [INFO ] Removed a total of 924 redundant transitions.
[2022-05-19 14:11:18] [INFO ] Flatten gal took : 124 ms
[2022-05-19 14:11:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 214 labels/synchronizations in 14 ms.
[2022-05-19 14:11:18] [INFO ] Time to serialize gal into /tmp/LTLFireability1509799897104916006.gal : 9 ms
[2022-05-19 14:11:18] [INFO ] Time to serialize properties into /tmp/LTLFireability1154097416093286730.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/LTLFireability1509799897104916006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1154097416093286730.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...267
Read 2 LTL properties
Checking formula 0 : !((X(F(G(X(G(!((X(G("(((((((((u0.ModifiedSrc_3>=1)&&(u0.ModifiedSrc_10>=1))&&((u0.place_500_1>=1)&&(u0.cSources>=8)))||(((u0.ModifiedS...10449
Formula 0 simplified : !XFGXG!(XG"(((((((((u0.ModifiedSrc_3>=1)&&(u0.ModifiedSrc_10>=1))&&((u0.place_500_1>=1)&&(u0.cSources>=8)))||(((u0.ModifiedSrc_9>=1)...10429
Compilation finished in 3712 ms.
Running link step : cd /tmp/ltsmin7379254680860529986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin7379254680860529986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](X([](!(X([]((LTLAPp0==true))) U <>((LTLAPp1==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.079: LTL layer: formula: X(<>([](X([](!(X([]((LTLAPp0==true))) U <>((LTLAPp1==true))))))))
pins2lts-mc-linux64( 1/ 8), 0.079: "X(<>([](X([](!(X([]((LTLAPp0==true))) U <>((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.080: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.122: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.145: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.147: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.156: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.173: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.176: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.287: There are 1040 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.287: State length is 475, there are 1039 groups
pins2lts-mc-linux64( 0/ 8), 0.287: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.287: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.287: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.287: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.334: [Blue] ~17 levels ~960 states ~3672 transitions
pins2lts-mc-linux64( 5/ 8), 0.398: [Blue] ~17 levels ~1920 states ~7872 transitions
pins2lts-mc-linux64( 5/ 8), 0.674: [Blue] ~30 levels ~3840 states ~13984 transitions
pins2lts-mc-linux64( 5/ 8), 0.965: [Blue] ~30 levels ~7680 states ~23272 transitions
pins2lts-mc-linux64( 5/ 8), 1.701: [Blue] ~30 levels ~15360 states ~42072 transitions
pins2lts-mc-linux64( 5/ 8), 3.992: [Blue] ~30 levels ~30720 states ~79520 transitions
pins2lts-mc-linux64( 6/ 8), 6.541: [Blue] ~30 levels ~61440 states ~149936 transitions
pins2lts-mc-linux64( 5/ 8), 9.471: [Blue] ~30 levels ~122880 states ~318528 transitions
pins2lts-mc-linux64( 5/ 8), 12.796: [Blue] ~30 levels ~245760 states ~636672 transitions
pins2lts-mc-linux64( 5/ 8), 19.038: [Blue] ~30 levels ~491520 states ~1270264 transitions
pins2lts-mc-linux64( 7/ 8), 30.944: [Blue] ~30 levels ~983040 states ~2577856 transitions
pins2lts-mc-linux64( 7/ 8), 53.472: [Blue] ~30 levels ~1966080 states ~5265808 transitions
pins2lts-mc-linux64( 7/ 8), 100.068: [Blue] ~30 levels ~3932160 states ~10672608 transitions
pins2lts-mc-linux64( 6/ 8), 192.666: [Blue] ~30 levels ~7864320 states ~21485016 transitions
pins2lts-mc-linux64( 7/ 8), 375.515: [Blue] ~30 levels ~15728640 states ~44212712 transitions
pins2lts-mc-linux64( 4/ 8), 577.045: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 577.081:
pins2lts-mc-linux64( 0/ 8), 577.081: Explored 24081166 states 67748193 transitions, fanout: 2.813
pins2lts-mc-linux64( 0/ 8), 577.081: Total exploration time 576.770 sec (576.720 sec minimum, 576.750 sec on average)
pins2lts-mc-linux64( 0/ 8), 577.081: States per second: 41752, Transitions per second: 117461
pins2lts-mc-linux64( 0/ 8), 577.081:
pins2lts-mc-linux64( 0/ 8), 577.081: State space has 24082797 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 577.081: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 577.081: blue states: 24081166 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 577.081: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 577.081: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 577.081:
pins2lts-mc-linux64( 0/ 8), 577.081: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 577.081:
pins2lts-mc-linux64( 0/ 8), 577.081: Queue width: 8B, total height: 240, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 577.081: Tree memory: 439.7MB, 19.1 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 577.081: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 577.081: Stored 1069 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 577.081: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 577.081: Est. total memory use: 439.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7379254680860529986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](X([](!(X([]((LTLAPp0==true))) U <>((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7379254680860529986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](X([](!(X([]((LTLAPp0==true))) U <>((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 14:34:19] [INFO ] Flatten gal took : 381 ms
[2022-05-19 14:34:19] [INFO ] Time to serialize gal into /tmp/LTLFireability1795279901478205937.gal : 55 ms
[2022-05-19 14:34:19] [INFO ] Time to serialize properties into /tmp/LTLFireability12206178300700904708.ltl : 13 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/LTLFireability1795279901478205937.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12206178300700904708.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 2 LTL properties
Checking formula 0 : !((X(F(G(X(G(!((X(G("(((((((((ModifiedSrc_3>=1)&&(ModifiedSrc_10>=1))&&((place_500_1>=1)&&(cSources>=8)))||(((ModifiedSrc_9>=1)&&(Modi...9020
Formula 0 simplified : !XFGXG!(XG"(((((((((ModifiedSrc_3>=1)&&(ModifiedSrc_10>=1))&&((place_500_1>=1)&&(cSources>=8)))||(((ModifiedSrc_9>=1)&&(ModifiedSrc_...9000
Detected timeout of ITS tools.
[2022-05-19 14:57:29] [INFO ] Flatten gal took : 264 ms
[2022-05-19 14:57:31] [INFO ] Input system was already deterministic with 1035 transitions.
[2022-05-19 14:57:31] [INFO ] Transformed 474 places.
[2022-05-19 14:57:31] [INFO ] Transformed 1035 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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-19 14:58:02] [INFO ] Time to serialize gal into /tmp/LTLFireability2559555846764567550.gal : 7 ms
[2022-05-19 14:58:02] [INFO ] Time to serialize properties into /tmp/LTLFireability10983182513766351510.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2559555846764567550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10983182513766351510.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...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(G(X(G(!((X(G("(((((((((ModifiedSrc_3>=1)&&(ModifiedSrc_10>=1))&&((place_500_1>=1)&&(cSources>=8)))||(((ModifiedSrc_9>=1)&&(Modi...9020
Formula 0 simplified : !XFGXG!(XG"(((((((((ModifiedSrc_3>=1)&&(ModifiedSrc_10>=1))&&((place_500_1>=1)&&(cSources>=8)))||(((ModifiedSrc_9>=1)&&(ModifiedSrc_...9000

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S10J20, 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-165277017300852"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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