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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 55K Apr 30 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 229K Apr 30 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 355K Apr 30 03:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 30 03:51 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 19K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 268K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 799K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652976610824

Running Version 202205111006
[2022-05-19 16:10:11] [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 16:10:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 16:10:12] [INFO ] Load time of PNML (sax parser for PT used): 714 ms
[2022-05-19 16:10:12] [INFO ] Transformed 1234 places.
[2022-05-19 16:10:12] [INFO ] Transformed 12920 transitions.
[2022-05-19 16:10:12] [INFO ] Parsed PT model containing 1234 places and 12920 transitions in 945 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 65 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2022-05-19 16:10:12] [INFO ] Reduced 9285 identical enabling conditions.
[2022-05-19 16:10:13] [INFO ] Reduced 45 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 104 out of 1234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Applied a total of 10 rules in 216 ms. Remains 1224 /1234 variables (removed 10) and now considering 2810/2810 (removed 0) transitions.
[2022-05-19 16:10:13] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1224 cols
[2022-05-19 16:10:13] [INFO ] Computed 142 place invariants in 261 ms
[2022-05-19 16:10:17] [INFO ] Dead Transitions using invariants and state equation in 4135 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 16:10:17] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:10:17] [INFO ] Computed 142 place invariants in 148 ms
[2022-05-19 16:10:19] [INFO ] Implicit Places using invariants in 1936 ms returned []
[2022-05-19 16:10:19] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:10:19] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 16:10:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:10:50] [INFO ] Performed 863/1224 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 16:10:56] [INFO ] Implicit Places using invariants and state equation in 36786 ms returned []
Implicit Place search using SMT with State Equation took 38725 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1224/1234 places, 2195/2810 transitions.
Applied a total of 0 rules in 50 ms. Remains 1224 /1224 variables (removed 0) and now considering 2195/2195 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1224/1234 places, 2195/2810 transitions.
Support contains 104 out of 1224 places after structural reductions.
[2022-05-19 16:10:56] [INFO ] Flatten gal took : 300 ms
[2022-05-19 16:10:57] [INFO ] Flatten gal took : 179 ms
[2022-05-19 16:10:57] [INFO ] Input system was already deterministic with 2195 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 991 ms. (steps per millisecond=10 ) properties (out of 26) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=7 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 12) seen :1
Running SMT prover for 11 properties.
[2022-05-19 16:10:59] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:10:59] [INFO ] Computed 142 place invariants in 59 ms
[2022-05-19 16:10:59] [INFO ] [Real]Absence check using 121 positive place invariants in 40 ms returned sat
[2022-05-19 16:10:59] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 63 ms returned sat
[2022-05-19 16:11:01] [INFO ] After 2233ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:7
[2022-05-19 16:11:02] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2022-05-19 16:11:02] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 49 ms returned sat
[2022-05-19 16:11:14] [INFO ] After 12723ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2022-05-19 16:11:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:11:20] [INFO ] After 5064ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :4 sat :7
[2022-05-19 16:11:21] [INFO ] Deduced a trap composed of 610 places in 731 ms of which 9 ms to minimize.
[2022-05-19 16:11:22] [INFO ] Deduced a trap composed of 623 places in 863 ms of which 2 ms to minimize.
[2022-05-19 16:11:23] [INFO ] Deduced a trap composed of 349 places in 737 ms of which 2 ms to minimize.
[2022-05-19 16:11:24] [INFO ] Deduced a trap composed of 626 places in 965 ms of which 3 ms to minimize.
[2022-05-19 16:11:25] [INFO ] Deduced a trap composed of 591 places in 646 ms of which 1 ms to minimize.
[2022-05-19 16:11:26] [INFO ] Deduced a trap composed of 597 places in 680 ms of which 2 ms to minimize.
[2022-05-19 16:11:27] [INFO ] Deduced a trap composed of 349 places in 664 ms of which 1 ms to minimize.
[2022-05-19 16:11:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 16:11:27] [INFO ] After 25410ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0 real:7
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 11 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1224 transition count 2131
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 1160 transition count 2130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 1159 transition count 2130
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 1159 transition count 2066
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 1095 transition count 2066
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 262 place count 1093 transition count 2064
Applied a total of 262 rules in 458 ms. Remains 1093 /1224 variables (removed 131) and now considering 2064/2195 (removed 131) transitions.
[2022-05-19 16:11:27] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 16:11:27] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 16:11:29] [INFO ] Dead Transitions using invariants and state equation in 1959 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1093/1224 places, 2064/2195 transitions.
Incomplete random walk after 10000 steps, including 703 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-19 16:11:30] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 16:11:30] [INFO ] Computed 142 place invariants in 46 ms
[2022-05-19 16:11:30] [INFO ] [Real]Absence check using 121 positive place invariants in 25 ms returned sat
[2022-05-19 16:11:30] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 48 ms returned sat
[2022-05-19 16:11:31] [INFO ] After 1240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 16:11:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 26 ms returned sat
[2022-05-19 16:11:31] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 46 ms returned sat
[2022-05-19 16:11:34] [INFO ] After 2877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 16:11:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:11:36] [INFO ] After 2369ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 16:11:37] [INFO ] Deduced a trap composed of 483 places in 500 ms of which 1 ms to minimize.
[2022-05-19 16:11:38] [INFO ] Deduced a trap composed of 454 places in 498 ms of which 1 ms to minimize.
[2022-05-19 16:11:38] [INFO ] Deduced a trap composed of 459 places in 506 ms of which 1 ms to minimize.
[2022-05-19 16:11:39] [INFO ] Deduced a trap composed of 432 places in 497 ms of which 1 ms to minimize.
[2022-05-19 16:11:40] [INFO ] Deduced a trap composed of 457 places in 528 ms of which 1 ms to minimize.
[2022-05-19 16:11:40] [INFO ] Deduced a trap composed of 448 places in 514 ms of which 1 ms to minimize.
[2022-05-19 16:11:41] [INFO ] Deduced a trap composed of 459 places in 530 ms of which 1 ms to minimize.
[2022-05-19 16:11:42] [INFO ] Deduced a trap composed of 459 places in 533 ms of which 1 ms to minimize.
[2022-05-19 16:11:42] [INFO ] Deduced a trap composed of 454 places in 511 ms of which 1 ms to minimize.
[2022-05-19 16:11:43] [INFO ] Deduced a trap composed of 455 places in 524 ms of which 1 ms to minimize.
[2022-05-19 16:11:43] [INFO ] Deduced a trap composed of 452 places in 500 ms of which 0 ms to minimize.
[2022-05-19 16:11:44] [INFO ] Deduced a trap composed of 448 places in 542 ms of which 1 ms to minimize.
[2022-05-19 16:11:45] [INFO ] Deduced a trap composed of 465 places in 516 ms of which 0 ms to minimize.
[2022-05-19 16:11:46] [INFO ] Deduced a trap composed of 464 places in 510 ms of which 1 ms to minimize.
[2022-05-19 16:11:46] [INFO ] Deduced a trap composed of 432 places in 514 ms of which 1 ms to minimize.
[2022-05-19 16:11:47] [INFO ] Deduced a trap composed of 438 places in 527 ms of which 1 ms to minimize.
[2022-05-19 16:11:48] [INFO ] Deduced a trap composed of 462 places in 530 ms of which 1 ms to minimize.
[2022-05-19 16:11:48] [INFO ] Deduced a trap composed of 457 places in 528 ms of which 1 ms to minimize.
[2022-05-19 16:11:49] [INFO ] Deduced a trap composed of 440 places in 525 ms of which 1 ms to minimize.
[2022-05-19 16:11:50] [INFO ] Deduced a trap composed of 464 places in 529 ms of which 1 ms to minimize.
[2022-05-19 16:11:51] [INFO ] Deduced a trap composed of 464 places in 533 ms of which 1 ms to minimize.
[2022-05-19 16:11:51] [INFO ] Deduced a trap composed of 460 places in 514 ms of which 1 ms to minimize.
[2022-05-19 16:11:52] [INFO ] Deduced a trap composed of 452 places in 522 ms of which 1 ms to minimize.
[2022-05-19 16:11:53] [INFO ] Deduced a trap composed of 444 places in 494 ms of which 1 ms to minimize.
[2022-05-19 16:11:54] [INFO ] Deduced a trap composed of 454 places in 514 ms of which 1 ms to minimize.
[2022-05-19 16:11:54] [INFO ] Deduced a trap composed of 452 places in 495 ms of which 1 ms to minimize.
[2022-05-19 16:11:55] [INFO ] Deduced a trap composed of 480 places in 494 ms of which 1 ms to minimize.
[2022-05-19 16:11:56] [INFO ] Deduced a trap composed of 428 places in 515 ms of which 0 ms to minimize.
[2022-05-19 16:11:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 16:11:56] [INFO ] After 25138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1093 transition count 2062
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1091 transition count 2062
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 1090 transition count 2061
Applied a total of 6 rules in 122 ms. Remains 1090 /1093 variables (removed 3) and now considering 2061/2064 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1093 places, 2061/2064 transitions.
Incomplete random walk after 10000 steps, including 736 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 119410 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119410 steps, saw 21395 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-19 16:11:59] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 16:11:59] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 16:12:00] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2022-05-19 16:12:00] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 53 ms returned sat
[2022-05-19 16:12:00] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 16:12:00] [INFO ] [Nat]Absence check using 121 positive place invariants in 24 ms returned sat
[2022-05-19 16:12:00] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 50 ms returned sat
[2022-05-19 16:12:02] [INFO ] After 1601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 16:12:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:12:04] [INFO ] After 2620ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 16:12:05] [INFO ] Deduced a trap composed of 449 places in 516 ms of which 1 ms to minimize.
[2022-05-19 16:12:05] [INFO ] Deduced a trap composed of 461 places in 529 ms of which 2 ms to minimize.
[2022-05-19 16:12:06] [INFO ] Deduced a trap composed of 441 places in 526 ms of which 1 ms to minimize.
[2022-05-19 16:12:07] [INFO ] Deduced a trap composed of 452 places in 531 ms of which 1 ms to minimize.
[2022-05-19 16:12:07] [INFO ] Deduced a trap composed of 457 places in 523 ms of which 1 ms to minimize.
[2022-05-19 16:12:08] [INFO ] Deduced a trap composed of 437 places in 517 ms of which 1 ms to minimize.
[2022-05-19 16:12:08] [INFO ] Deduced a trap composed of 459 places in 523 ms of which 1 ms to minimize.
[2022-05-19 16:12:09] [INFO ] Deduced a trap composed of 452 places in 524 ms of which 2 ms to minimize.
[2022-05-19 16:12:10] [INFO ] Deduced a trap composed of 487 places in 536 ms of which 1 ms to minimize.
[2022-05-19 16:12:10] [INFO ] Deduced a trap composed of 451 places in 529 ms of which 1 ms to minimize.
[2022-05-19 16:12:11] [INFO ] Deduced a trap composed of 460 places in 523 ms of which 1 ms to minimize.
[2022-05-19 16:12:12] [INFO ] Deduced a trap composed of 438 places in 526 ms of which 1 ms to minimize.
[2022-05-19 16:12:12] [INFO ] Deduced a trap composed of 452 places in 513 ms of which 1 ms to minimize.
[2022-05-19 16:12:13] [INFO ] Deduced a trap composed of 449 places in 536 ms of which 1 ms to minimize.
[2022-05-19 16:12:14] [INFO ] Deduced a trap composed of 463 places in 518 ms of which 1 ms to minimize.
[2022-05-19 16:12:15] [INFO ] Deduced a trap composed of 444 places in 513 ms of which 1 ms to minimize.
[2022-05-19 16:12:15] [INFO ] Deduced a trap composed of 469 places in 514 ms of which 1 ms to minimize.
[2022-05-19 16:12:16] [INFO ] Deduced a trap composed of 464 places in 512 ms of which 1 ms to minimize.
[2022-05-19 16:12:17] [INFO ] Deduced a trap composed of 467 places in 529 ms of which 0 ms to minimize.
[2022-05-19 16:12:18] [INFO ] Deduced a trap composed of 442 places in 499 ms of which 1 ms to minimize.
[2022-05-19 16:12:19] [INFO ] Deduced a trap composed of 444 places in 509 ms of which 2 ms to minimize.
[2022-05-19 16:12:20] [INFO ] Deduced a trap composed of 442 places in 518 ms of which 2 ms to minimize.
[2022-05-19 16:12:20] [INFO ] Deduced a trap composed of 438 places in 515 ms of which 1 ms to minimize.
[2022-05-19 16:12:21] [INFO ] Deduced a trap composed of 454 places in 512 ms of which 1 ms to minimize.
[2022-05-19 16:12:22] [INFO ] Deduced a trap composed of 468 places in 532 ms of which 1 ms to minimize.
[2022-05-19 16:12:23] [INFO ] Deduced a trap composed of 446 places in 518 ms of which 1 ms to minimize.
[2022-05-19 16:12:24] [INFO ] Deduced a trap composed of 446 places in 540 ms of which 1 ms to minimize.
[2022-05-19 16:12:24] [INFO ] Deduced a trap composed of 456 places in 532 ms of which 1 ms to minimize.
[2022-05-19 16:12:25] [INFO ] Deduced a trap composed of 475 places in 511 ms of which 1 ms to minimize.
[2022-05-19 16:12:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 16:12:25] [INFO ] After 25114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 58 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 57 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2022-05-19 16:12:25] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 16:12:25] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 16:12:27] [INFO ] Implicit Places using invariants in 2121 ms returned []
[2022-05-19 16:12:27] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 16:12:27] [INFO ] Computed 142 place invariants in 53 ms
[2022-05-19 16:12:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:12:48] [INFO ] Implicit Places using invariants and state equation in 21409 ms returned []
Implicit Place search using SMT with State Equation took 23532 ms to find 0 implicit places.
[2022-05-19 16:12:49] [INFO ] Redundant transitions in 144 ms returned []
[2022-05-19 16:12:49] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 16:12:49] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 16:12:50] [INFO ] Dead Transitions using invariants and state equation in 1809 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-LTLFireability-15 TRUE 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' '!(G(F(p0)))'
Support contains 1 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 1224 transition count 2130
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 1159 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 132 place count 1158 transition count 2065
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 260 place count 1094 transition count 2065
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 1093 transition count 2064
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 1093 transition count 2064
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 266 place count 1091 transition count 2062
Applied a total of 266 rules in 324 ms. Remains 1091 /1224 variables (removed 133) and now considering 2062/2195 (removed 133) transitions.
[2022-05-19 16:12:51] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:12:51] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 16:12:53] [INFO ] Dead Transitions using invariants and state equation in 1675 ms found 0 transitions.
[2022-05-19 16:12:53] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:12:53] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 16:12:55] [INFO ] Implicit Places using invariants in 1989 ms returned []
[2022-05-19 16:12:55] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:12:55] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 16:12:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:13:17] [INFO ] Implicit Places using invariants and state equation in 22128 ms returned []
Implicit Place search using SMT with State Equation took 24119 ms to find 0 implicit places.
[2022-05-19 16:13:17] [INFO ] Redundant transitions in 122 ms returned []
[2022-05-19 16:13:17] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:13:17] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 16:13:19] [INFO ] Dead Transitions using invariants and state equation in 1707 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1091/1224 places, 2062/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1224 places, 2062/2195 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLFireability-00 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:(GEQ s993 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 246 steps with 29 reset in 12 ms.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J60-LTLFireability-00 finished in 28227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1224 transition count 2129
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 132 place count 1158 transition count 2065
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 260 place count 1094 transition count 2065
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 1093 transition count 2064
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 1093 transition count 2064
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 1091 transition count 2062
Applied a total of 266 rules in 208 ms. Remains 1091 /1224 variables (removed 133) and now considering 2062/2195 (removed 133) transitions.
[2022-05-19 16:13:19] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:13:19] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 16:13:21] [INFO ] Dead Transitions using invariants and state equation in 1755 ms found 0 transitions.
[2022-05-19 16:13:21] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:13:21] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 16:13:23] [INFO ] Implicit Places using invariants in 2099 ms returned []
[2022-05-19 16:13:23] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:13:23] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 16:13:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:13:51] [INFO ] Implicit Places using invariants and state equation in 27764 ms returned []
Implicit Place search using SMT with State Equation took 29866 ms to find 0 implicit places.
[2022-05-19 16:13:51] [INFO ] Redundant transitions in 56 ms returned []
[2022-05-19 16:13:51] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:13:51] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 16:13:53] [INFO ] Dead Transitions using invariants and state equation in 1854 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1091/1224 places, 2062/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1224 places, 2062/2195 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s966 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7085 reset in 1232 ms.
Product exploration explored 100000 steps with 7164 reset in 1144 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 354 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 28 ms :[(NOT p0)]
Finished random walk after 27 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 64 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2022-05-19 16:13:56] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:13:56] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 16:13:58] [INFO ] Dead Transitions using invariants and state equation in 1817 ms found 0 transitions.
[2022-05-19 16:13:58] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:13:58] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 16:14:00] [INFO ] Implicit Places using invariants in 2058 ms returned []
[2022-05-19 16:14:00] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:14:00] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 16:14:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:14:31] [INFO ] Performed 1020/1091 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 16:14:33] [INFO ] Implicit Places using invariants and state equation in 33422 ms returned []
Implicit Place search using SMT with State Equation took 35482 ms to find 0 implicit places.
[2022-05-19 16:14:33] [INFO ] Redundant transitions in 56 ms returned []
[2022-05-19 16:14:33] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:14:33] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 16:14:35] [INFO ] Dead Transitions using invariants and state equation in 1791 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 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 37 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7185 reset in 1092 ms.
Product exploration explored 100000 steps with 7201 reset in 1130 ms.
Built C files in :
/tmp/ltsmin17011194642681015087
[2022-05-19 16:14:38] [INFO ] Too many transitions (2062) to apply POR reductions. Disabling POR matrices.
[2022-05-19 16:14:38] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17011194642681015087
Running compilation step : cd /tmp/ltsmin17011194642681015087;'/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/ltsmin17011194642681015087;'/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/ltsmin17011194642681015087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 129 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2022-05-19 16:14:41] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:14:41] [INFO ] Computed 142 place invariants in 67 ms
[2022-05-19 16:14:43] [INFO ] Dead Transitions using invariants and state equation in 1900 ms found 0 transitions.
[2022-05-19 16:14:43] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:14:43] [INFO ] Computed 142 place invariants in 37 ms
[2022-05-19 16:14:45] [INFO ] Implicit Places using invariants in 1905 ms returned []
[2022-05-19 16:14:45] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:14:45] [INFO ] Computed 142 place invariants in 37 ms
[2022-05-19 16:14:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:15:11] [INFO ] Implicit Places using invariants and state equation in 26283 ms returned []
Implicit Place search using SMT with State Equation took 28192 ms to find 0 implicit places.
[2022-05-19 16:15:11] [INFO ] Redundant transitions in 59 ms returned []
[2022-05-19 16:15:11] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:15:12] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 16:15:13] [INFO ] Dead Transitions using invariants and state equation in 1860 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Built C files in :
/tmp/ltsmin1887886835021658638
[2022-05-19 16:15:13] [INFO ] Too many transitions (2062) to apply POR reductions. Disabling POR matrices.
[2022-05-19 16:15:13] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1887886835021658638
Running compilation step : cd /tmp/ltsmin1887886835021658638;'/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/ltsmin1887886835021658638;'/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/ltsmin1887886835021658638;'/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 16:15:17] [INFO ] Flatten gal took : 116 ms
[2022-05-19 16:15:17] [INFO ] Flatten gal took : 114 ms
[2022-05-19 16:15:17] [INFO ] Time to serialize gal into /tmp/LTL11540388682705772864.gal : 21 ms
[2022-05-19 16:15:17] [INFO ] Time to serialize properties into /tmp/LTL7498553787834978078.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/LTL11540388682705772864.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7498553787834978078.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/LTL1154038...267
Read 1 LTL properties
Checking formula 0 : !((F(G("(QueueJobE_1<1)"))))
Formula 0 simplified : !FG"(QueueJobE_1<1)"
Detected timeout of ITS tools.
[2022-05-19 16:15:32] [INFO ] Flatten gal took : 106 ms
[2022-05-19 16:15:32] [INFO ] Applying decomposition
[2022-05-19 16:15:32] [INFO ] Flatten gal took : 105 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/graph11324326500979081865.txt' '-o' '/tmp/graph11324326500979081865.bin' '-w' '/tmp/graph11324326500979081865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11324326500979081865.bin' '-l' '-1' '-v' '-w' '/tmp/graph11324326500979081865.weights' '-q' '0' '-e' '0.001'
[2022-05-19 16:15:33] [INFO ] Decomposing Gal with order
[2022-05-19 16:15:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 16:15:33] [INFO ] Removed a total of 4239 redundant transitions.
[2022-05-19 16:15:33] [INFO ] Flatten gal took : 465 ms
[2022-05-19 16:15:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 80 ms.
[2022-05-19 16:15:33] [INFO ] Time to serialize gal into /tmp/LTL3177632674153665120.gal : 19 ms
[2022-05-19 16:15:34] [INFO ] Time to serialize properties into /tmp/LTL13150797964983673225.ltl : 344 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/LTL3177632674153665120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13150797964983673225.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/LTL3177632...246
Read 1 LTL properties
Checking formula 0 : !((F(G("(i40.u66.QueueJobE_1<1)"))))
Formula 0 simplified : !FG"(i40.u66.QueueJobE_1<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11329578807798395156
[2022-05-19 16:15:49] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11329578807798395156
Running compilation step : cd /tmp/ltsmin11329578807798395156;'/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/ltsmin11329578807798395156;'/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/ltsmin11329578807798395156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PolyORBNT-PT-S10J60-LTLFireability-01 finished in 152751 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(F((p1||G(!p0)))))))'
Support contains 75 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 82 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 16:15:52] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:15:52] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 16:15:55] [INFO ] Dead Transitions using invariants and state equation in 2944 ms found 0 transitions.
[2022-05-19 16:15:55] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:15:55] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 16:15:57] [INFO ] Implicit Places using invariants in 2000 ms returned []
[2022-05-19 16:15:57] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:15:57] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 16:15:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:16:28] [INFO ] Performed 925/1223 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 16:16:35] [INFO ] Implicit Places using invariants and state equation in 38254 ms returned []
Implicit Place search using SMT with State Equation took 40256 ms to find 0 implicit places.
[2022-05-19 16:16:35] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:16:35] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 16:16:38] [INFO ] Dead Transitions using invariants and state equation in 3034 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s419 1) (GEQ s427 1) (GEQ s1131 1)) (AND (GEQ s360 1) (GEQ s419 1) (GEQ s1131 1)) (AND (GEQ s419 1) (GEQ s1055 1) (GEQ s1131 1)) (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J60-LTLFireability-02 finished in 46593 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 71 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 16:16:38] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:16:38] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 16:16:41] [INFO ] Dead Transitions using invariants and state equation in 2997 ms found 0 transitions.
[2022-05-19 16:16:41] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:16:41] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 16:16:44] [INFO ] Implicit Places using invariants in 2161 ms returned []
[2022-05-19 16:16:44] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:16:44] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 16:16:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:17:15] [INFO ] Performed 620/1223 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 16:17:27] [INFO ] Implicit Places using invariants and state equation in 42935 ms returned []
Implicit Place search using SMT with State Equation took 45097 ms to find 0 implicit places.
[2022-05-19 16:17:27] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:17:27] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 16:17:30] [INFO ] Dead Transitions using invariants and state equation in 3134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s629 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J60-LTLFireability-03 finished in 51426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(X(F(p0)))))&&X(p1)))'
Support contains 13 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 86 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 16:17:30] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:17:30] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 16:17:33] [INFO ] Dead Transitions using invariants and state equation in 3085 ms found 0 transitions.
[2022-05-19 16:17:33] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:17:33] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 16:17:35] [INFO ] Implicit Places using invariants in 2026 ms returned []
[2022-05-19 16:17:35] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:17:35] [INFO ] Computed 142 place invariants in 52 ms
[2022-05-19 16:17:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:18:06] [INFO ] Performed 1010/1223 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 16:18:10] [INFO ] Implicit Places using invariants and state equation in 34748 ms returned []
Implicit Place search using SMT with State Equation took 36776 ms to find 0 implicit places.
[2022-05-19 16:18:10] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:18:10] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 16:18:13] [INFO ] Dead Transitions using invariants and state equation in 3098 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s664 2), p0:(OR (AND (GEQ s26 1) (GEQ s164 1) (GEQ s712 1) (GEQ s950 8)) (AND (GEQ s26 1) (GEQ s164 1) (GEQ s723 1) (GEQ s950 8)) (AND (GEQ s164 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J60-LTLFireability-05 finished in 43228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1 U !p2))))'
Support contains 6 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 92 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 16:18:13] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:18:13] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 16:18:16] [INFO ] Dead Transitions using invariants and state equation in 3071 ms found 0 transitions.
[2022-05-19 16:18:16] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:18:16] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 16:18:18] [INFO ] Implicit Places using invariants in 2174 ms returned []
[2022-05-19 16:18:18] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:18:18] [INFO ] Computed 142 place invariants in 37 ms
[2022-05-19 16:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:18:49] [INFO ] Implicit Places using invariants and state equation in 30317 ms returned []
Implicit Place search using SMT with State Equation took 32494 ms to find 0 implicit places.
[2022-05-19 16:18:49] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:18:49] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 16:18:52] [INFO ] Dead Transitions using invariants and state equation in 2932 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 148 ms :[p2, p2, p2, true, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s184 1) (AND (GEQ s812 1) (GEQ s982 1) (GEQ s1131 1))), p2:(AND (GEQ s553 1) (GEQ s768 1)), p1:(GEQ s184 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1320 ms.
Product exploration explored 100000 steps with 50000 reset in 1288 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p2) (NOT p1))
Knowledge based reduction with 15 factoid took 450 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J60-LTLFireability-08 finished in 41844 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X((G(p0)&&X(p1))))))'
Support contains 3 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Applied a total of 0 rules in 40 ms. Remains 1224 /1224 variables (removed 0) and now considering 2195/2195 (removed 0) transitions.
[2022-05-19 16:18:55] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:18:55] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 16:18:58] [INFO ] Dead Transitions using invariants and state equation in 3075 ms found 0 transitions.
[2022-05-19 16:18:58] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:18:58] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 16:19:00] [INFO ] Implicit Places using invariants in 2225 ms returned []
[2022-05-19 16:19:00] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:19:00] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 16:19:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:19:31] [INFO ] Performed 643/1224 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 16:19:52] [INFO ] Implicit Places using invariants and state equation in 52018 ms returned []
Implicit Place search using SMT with State Equation took 54244 ms to find 0 implicit places.
[2022-05-19 16:19:52] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:19:52] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 16:19:55] [INFO ] Dead Transitions using invariants and state equation in 3089 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1224/1224 places, 2195/2195 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s826 1) (LT s1107 1)), p1:(GEQ s463 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 81166 steps with 4546 reset in 637 ms.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J60-LTLFireability-09 finished in 61282 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(G(p1)||X(p2)))))'
Support contains 5 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 75 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 16:19:56] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:19:56] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 16:19:59] [INFO ] Dead Transitions using invariants and state equation in 3071 ms found 0 transitions.
[2022-05-19 16:19:59] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:19:59] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 16:20:02] [INFO ] Implicit Places using invariants in 2249 ms returned []
[2022-05-19 16:20:02] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:20:02] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 16:20:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:20:32] [INFO ] Performed 750/1223 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 16:20:44] [INFO ] Implicit Places using invariants and state equation in 42154 ms returned []
Implicit Place search using SMT with State Equation took 44405 ms to find 0 implicit places.
[2022-05-19 16:20:44] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:20:44] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 16:20:47] [INFO ] Dead Transitions using invariants and state equation in 3182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s256 1), p1:(AND (GEQ s740 1) (GEQ s1165 1)), p2:(AND (GEQ s553 1) (GEQ s768 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J60-LTLFireability-10 finished in 51007 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((false U p0)))))'
Support contains 4 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 1224 transition count 2130
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 1159 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 132 place count 1158 transition count 2065
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 260 place count 1094 transition count 2065
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 1093 transition count 2064
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 1093 transition count 2064
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 266 place count 1091 transition count 2062
Applied a total of 266 rules in 220 ms. Remains 1091 /1224 variables (removed 133) and now considering 2062/2195 (removed 133) transitions.
[2022-05-19 16:20:47] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:20:47] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 16:20:49] [INFO ] Dead Transitions using invariants and state equation in 1629 ms found 0 transitions.
[2022-05-19 16:20:49] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:20:49] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 16:20:51] [INFO ] Implicit Places using invariants in 1965 ms returned []
[2022-05-19 16:20:51] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:20:51] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 16:20:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:21:18] [INFO ] Implicit Places using invariants and state equation in 27161 ms returned []
Implicit Place search using SMT with State Equation took 29128 ms to find 0 implicit places.
[2022-05-19 16:21:18] [INFO ] Redundant transitions in 56 ms returned []
[2022-05-19 16:21:18] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:21:18] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 16:21:20] [INFO ] Dead Transitions using invariants and state equation in 1710 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1091/1224 places, 2062/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1224 places, 2062/2195 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s993 1) (AND (GEQ s66 1) (GEQ s270 1) (GEQ s964 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J60-LTLFireability-11 finished in 32830 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (X(p0)||(!X(p2)&&p1)))))'
Support contains 4 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 90 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 16:21:20] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:21:20] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 16:21:23] [INFO ] Dead Transitions using invariants and state equation in 2931 ms found 0 transitions.
[2022-05-19 16:21:23] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:21:23] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 16:21:25] [INFO ] Implicit Places using invariants in 2220 ms returned []
[2022-05-19 16:21:25] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:21:25] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 16:21:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:21:52] [INFO ] Implicit Places using invariants and state equation in 26265 ms returned []
Implicit Place search using SMT with State Equation took 28523 ms to find 0 implicit places.
[2022-05-19 16:21:52] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:21:52] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 16:21:55] [INFO ] Dead Transitions using invariants and state equation in 2981 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s184 1), p2:(AND (GEQ s77 1) (GEQ s306 1) (GEQ s577 1)), p1:(AND (GEQ s77 1) (GEQ s306 1) (GEQ s577 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J60-LTLFireability-12 finished in 34710 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!G(F(X(p0)))) U X((F(!F(p0)) U p1)))))'
Support contains 3 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 72 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 16:21:55] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:21:55] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 16:21:58] [INFO ] Dead Transitions using invariants and state equation in 2887 ms found 0 transitions.
[2022-05-19 16:21:58] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:21:58] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 16:22:00] [INFO ] Implicit Places using invariants in 2043 ms returned []
[2022-05-19 16:22:00] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:22:00] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 16:22:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:22:29] [INFO ] Implicit Places using invariants and state equation in 28855 ms returned []
Implicit Place search using SMT with State Equation took 30908 ms to find 0 implicit places.
[2022-05-19 16:22:29] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 16:22:29] [INFO ] Computed 142 place invariants in 48 ms
[2022-05-19 16:22:32] [INFO ] Dead Transitions using invariants and state equation in 2984 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 481 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s359 10) (GEQ s753 1)), p0:(GEQ s1127 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 43223 steps with 2608 reset in 398 ms.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J60-LTLFireability-13 finished in 37752 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((G(p0)||p1)))&&G(G(p2)))))'
Support contains 6 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Applied a total of 0 rules in 37 ms. Remains 1224 /1224 variables (removed 0) and now considering 2195/2195 (removed 0) transitions.
[2022-05-19 16:22:33] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:22:33] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 16:22:36] [INFO ] Dead Transitions using invariants and state equation in 3075 ms found 0 transitions.
[2022-05-19 16:22:36] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:22:36] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 16:22:38] [INFO ] Implicit Places using invariants in 2100 ms returned []
[2022-05-19 16:22:38] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:22:38] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 16:22:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:23:09] [INFO ] Performed 921/1224 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 16:23:20] [INFO ] Implicit Places using invariants and state equation in 42305 ms returned []
Implicit Place search using SMT with State Equation took 44410 ms to find 0 implicit places.
[2022-05-19 16:23:20] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:23:20] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 16:23:23] [INFO ] Dead Transitions using invariants and state equation in 3115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1224/1224 places, 2195/2195 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(OR (LT s96 1) (LT s306 1) (LT s1046 1)), p1:(GEQ s463 1), p0:(OR (LT s553 1) (LT s768 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5598 reset in 857 ms.
Product exploration explored 100000 steps with 5604 reset in 857 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 p2 (NOT p1) p0), (X p2), true, (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (OR (NOT p2) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 228 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 561 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 73309 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73309 steps, saw 22226 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-19 16:23:29] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:23:29] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 16:23:29] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2022-05-19 16:23:29] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 53 ms returned sat
[2022-05-19 16:23:29] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 16:23:29] [INFO ] [Nat]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-19 16:23:29] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 51 ms returned sat
[2022-05-19 16:23:42] [INFO ] After 12922ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 16:23:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:23:51] [INFO ] After 9024ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-19 16:23:51] [INFO ] After 22230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 1224 transition count 2130
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 1159 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 132 place count 1158 transition count 2065
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 260 place count 1094 transition count 2065
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 1093 transition count 2064
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 1093 transition count 2064
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 266 place count 1091 transition count 2062
Applied a total of 266 rules in 228 ms. Remains 1091 /1224 variables (removed 133) and now considering 2062/2195 (removed 133) transitions.
[2022-05-19 16:23:51] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:23:52] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 16:23:53] [INFO ] Dead Transitions using invariants and state equation in 1883 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1224 places, 2062/2195 transitions.
Finished random walk after 212 steps, including 17 resets, run visited all 2 properties in 5 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), true, (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (OR (NOT p2) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 6 factoid took 256 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 155 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Support contains 5 out of 1224 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Applied a total of 0 rules in 36 ms. Remains 1224 /1224 variables (removed 0) and now considering 2195/2195 (removed 0) transitions.
[2022-05-19 16:23:54] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:23:54] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 16:23:57] [INFO ] Dead Transitions using invariants and state equation in 3110 ms found 0 transitions.
[2022-05-19 16:23:57] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:23:57] [INFO ] Computed 142 place invariants in 45 ms
[2022-05-19 16:23:59] [INFO ] Implicit Places using invariants in 2120 ms returned []
[2022-05-19 16:23:59] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:23:59] [INFO ] Computed 142 place invariants in 45 ms
[2022-05-19 16:24:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:24:30] [INFO ] Performed 636/1224 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 16:24:47] [INFO ] Implicit Places using invariants and state equation in 47544 ms returned []
Implicit Place search using SMT with State Equation took 49666 ms to find 0 implicit places.
[2022-05-19 16:24:47] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:24:47] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 16:24:50] [INFO ] Dead Transitions using invariants and state equation in 2976 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1224/1224 places, 2195/2195 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 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 155 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 73917 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73917 steps, saw 22360 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-19 16:24:53] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 16:24:53] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 16:24:54] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2022-05-19 16:24:54] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 54 ms returned sat
[2022-05-19 16:24:54] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 16:24:54] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2022-05-19 16:24:54] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 52 ms returned sat
[2022-05-19 16:25:06] [INFO ] After 12094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 16:25:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:25:07] [INFO ] After 1283ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 16:25:08] [INFO ] After 2118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3845 ms.
[2022-05-19 16:25:12] [INFO ] After 18358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 1224 transition count 2130
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 1159 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 132 place count 1158 transition count 2065
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 260 place count 1094 transition count 2065
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 1093 transition count 2064
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 1093 transition count 2064
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 266 place count 1091 transition count 2062
Applied a total of 266 rules in 185 ms. Remains 1091 /1224 variables (removed 133) and now considering 2062/2195 (removed 133) transitions.
[2022-05-19 16:25:12] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 16:25:12] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 16:25:14] [INFO ] Dead Transitions using invariants and state equation in 1805 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1224 places, 2062/2195 transitions.
Finished random walk after 52 steps, including 3 resets, run visited all 2 properties in 3 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 171 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Entered a terminal (fully accepting) state of product in 28864 steps with 1616 reset in 236 ms.
FORMULA PolyORBNT-PT-S10J60-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J60-LTLFireability-14 finished in 162515 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2022-05-19 16:25:15] [INFO ] Flatten gal took : 117 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10616750392153744246
[2022-05-19 16:25:15] [INFO ] Too many transitions (2195) to apply POR reductions. Disabling POR matrices.
[2022-05-19 16:25:15] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10616750392153744246
Running compilation step : cd /tmp/ltsmin10616750392153744246;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 16:25:15] [INFO ] Applying decomposition
[2022-05-19 16:25:16] [INFO ] Flatten gal took : 119 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/graph685380613181781432.txt' '-o' '/tmp/graph685380613181781432.bin' '-w' '/tmp/graph685380613181781432.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph685380613181781432.bin' '-l' '-1' '-v' '-w' '/tmp/graph685380613181781432.weights' '-q' '0' '-e' '0.001'
[2022-05-19 16:25:16] [INFO ] Decomposing Gal with order
[2022-05-19 16:25:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 16:25:16] [INFO ] Removed a total of 1991 redundant transitions.
[2022-05-19 16:25:17] [INFO ] Flatten gal took : 372 ms
[2022-05-19 16:25:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 633 labels/synchronizations in 68 ms.
[2022-05-19 16:25:17] [INFO ] Time to serialize gal into /tmp/LTLFireability11353469013935200218.gal : 18 ms
[2022-05-19 16:25:17] [INFO ] Time to serialize properties into /tmp/LTLFireability3790809631567828766.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/LTLFireability11353469013935200218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3790809631567828766.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((F(G("(i41.u117.QueueJobE_1<1)"))))
Formula 0 simplified : !FG"(i41.u117.QueueJobE_1<1)"
Compilation finished in 5089 ms.
Running link step : cd /tmp/ltsmin10616750392153744246;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin10616750392153744246;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 16:50:20] [INFO ] Flatten gal took : 411 ms
[2022-05-19 16:50:20] [INFO ] Time to serialize gal into /tmp/LTLFireability14356143773233804681.gal : 66 ms
[2022-05-19 16:50:20] [INFO ] Time to serialize properties into /tmp/LTLFireability14392873709668460686.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/LTLFireability14356143773233804681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14392873709668460686.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...290
Read 1 LTL properties
Checking formula 0 : !((F(G("(QueueJobE_1<1)"))))
Formula 0 simplified : !FG"(QueueJobE_1<1)"

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J60"
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-S10J60, 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-165277017300876"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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