fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277017100740
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for PolyORBNT-COL-S05J30

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
464.188 48162.00 68188.00 432.20 FTFTTTFFFFTFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 8.1K Apr 30 03:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 03:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 03:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 03:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 92K 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-COL-S05J30-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652931896722

Running Version 202205111006
[2022-05-19 03:44:57] [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 03:44:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 03:44:57] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 03:44:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 03:44:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 614 ms
[2022-05-19 03:44:58] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 03:44:58] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 8 ms.
[2022-05-19 03:44:58] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10002 steps, including 799 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 22) seen :5
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 03:44:59] [INFO ] Computed 13 place invariants in 9 ms
[2022-05-19 03:44:59] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-19 03:44:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 03:44:59] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2022-05-19 03:44:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:44:59] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :1 sat :1
[2022-05-19 03:44:59] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 4 ms to minimize.
[2022-05-19 03:44:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-05-19 03:44:59] [INFO ] After 61ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-19 03:44:59] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-19 03:44:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-19 03:44:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:44:59] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-19 03:44:59] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-19 03:44:59] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2022-05-19 03:44:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-19 03:44:59] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-19 03:44:59] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 18 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2022-05-19 03:44:59] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-19 03:44:59] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10003 steps, including 1172 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 352 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Probably explored full state space saw : 335 states, properties seen :0
Probabilistic random walk after 889 steps, saw 335 distinct states, run finished after 12 ms. (steps per millisecond=74 ) properties seen :0
Explored full state space saw : 335 states, properties seen :0
Exhaustive walk after 889 steps, saw 335 distinct states, run finished after 3 ms. (steps per millisecond=296 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 03:44:59] [INFO ] Flatten gal took : 22 ms
[2022-05-19 03:44:59] [INFO ] Flatten gal took : 8 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-19 03:44:59] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 38 ms.
[2022-05-19 03:44:59] [INFO ] Unfolded 11 HLPN properties in 0 ms.
[2022-05-19 03:44:59] [INFO ] Reduced 555 identical enabling conditions.
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 303 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 745
Applied a total of 5 rules in 21 ms. Remains 484 /489 variables (removed 5) and now considering 745/745 (removed 0) transitions.
[2022-05-19 03:44:59] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 484 cols
[2022-05-19 03:44:59] [INFO ] Computed 77 place invariants in 35 ms
[2022-05-19 03:45:00] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2022-05-19 03:45:00] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2022-05-19 03:45:00] [INFO ] Computed 77 place invariants in 21 ms
[2022-05-19 03:45:00] [INFO ] Implicit Places using invariants in 220 ms returned []
[2022-05-19 03:45:00] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2022-05-19 03:45:00] [INFO ] Computed 77 place invariants in 21 ms
[2022-05-19 03:45:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:02] [INFO ] Implicit Places using invariants and state equation in 1744 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 484/489 places, 650/745 transitions.
Applied a total of 0 rules in 10 ms. Remains 484 /484 variables (removed 0) and now considering 650/650 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 484/489 places, 650/745 transitions.
Support contains 303 out of 484 places after structural reductions.
[2022-05-19 03:45:02] [INFO ] Flatten gal took : 71 ms
[2022-05-19 03:45:02] [INFO ] Flatten gal took : 61 ms
[2022-05-19 03:45:02] [INFO ] Input system was already deterministic with 650 transitions.
Incomplete random walk after 10000 steps, including 698 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 17) seen :15
Finished Best-First random walk after 80 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=80 )
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 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
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 146 place count 411 transition count 577
Applied a total of 146 rules in 100 ms. Remains 411 /484 variables (removed 73) and now considering 577/650 (removed 73) transitions.
[2022-05-19 03:45:03] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2022-05-19 03:45:03] [INFO ] Computed 77 place invariants in 21 ms
[2022-05-19 03:45:03] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
[2022-05-19 03:45:03] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2022-05-19 03:45:03] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 03:45:04] [INFO ] Implicit Places using invariants in 310 ms returned []
[2022-05-19 03:45:04] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2022-05-19 03:45:04] [INFO ] Computed 77 place invariants in 25 ms
[2022-05-19 03:45:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:05] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
[2022-05-19 03:45:05] [INFO ] Redundant transitions in 40 ms returned []
[2022-05-19 03:45:05] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2022-05-19 03:45:05] [INFO ] Computed 77 place invariants in 16 ms
[2022-05-19 03:45:05] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/484 places, 577/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/484 places, 577/650 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-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 s405 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 812 steps with 111 reset in 14 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-00 finished in 2657 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 33 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 32 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2022-05-19 03:45:05] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:05] [INFO ] Computed 77 place invariants in 8 ms
[2022-05-19 03:45:06] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
[2022-05-19 03:45:06] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:06] [INFO ] Computed 77 place invariants in 18 ms
[2022-05-19 03:45:06] [INFO ] Implicit Places using invariants in 362 ms returned []
[2022-05-19 03:45:06] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:06] [INFO ] Computed 77 place invariants in 8 ms
[2022-05-19 03:45:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:08] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
[2022-05-19 03:45:08] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:08] [INFO ] Computed 77 place invariants in 10 ms
[2022-05-19 03:45:08] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s32 1) (LT s98 1) (LT s130 1)) (OR (LT s32 1) (LT s98 1) (LT s131 1)) (OR (LT s32 1) (LT s98 1) (LT s132 1)) (OR (LT s32 1) (LT s98 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 217 steps with 14 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-02 finished in 2937 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(G((X(X(p0))||G(p1)||X(p1))) U p1))))'
Support contains 8 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 24 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2022-05-19 03:45:08] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:08] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 03:45:09] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
[2022-05-19 03:45:09] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:09] [INFO ] Computed 77 place invariants in 15 ms
[2022-05-19 03:45:09] [INFO ] Implicit Places using invariants in 334 ms returned []
[2022-05-19 03:45:09] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:09] [INFO ] Computed 77 place invariants in 9 ms
[2022-05-19 03:45:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:11] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 2030 ms to find 0 implicit places.
[2022-05-19 03:45:11] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:11] [INFO ] Computed 77 place invariants in 8 ms
[2022-05-19 03:45:11] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 297 ms :[p0, (AND p1 p0), true, (OR p0 p1), p1, p1, p1, p1]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 3}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 6}]], initial=4, aps=[p1:(OR (AND (GEQ s208 1) (GEQ s411 1) (GEQ s412 1)) (AND (GEQ s204 1) (GEQ s411 1) (GEQ s412 1)) (AND (GEQ s206 1) (GEQ s411 1) (GEQ s412 1)) (AND (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 446 ms.
Product exploration explored 100000 steps with 20000 reset in 424 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 8 states, 13 edges and 2 AP to 7 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 263 ms :[(OR p0 p1), p0, p1, (AND p1 p0), p1, p1, p1]
Incomplete random walk after 10000 steps, including 696 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 257 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 03:45:13] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:13] [INFO ] Computed 77 place invariants in 8 ms
[2022-05-19 03:45:13] [INFO ] [Real]Absence check using 71 positive place invariants in 22 ms returned sat
[2022-05-19 03:45:13] [INFO ] [Real]Absence check using 71 positive and 6 generalized place invariants in 12 ms returned sat
[2022-05-19 03:45:13] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 234 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 240 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Support contains 8 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 649/649 transitions.
Applied a total of 0 rules in 12 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2022-05-19 03:45:14] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:14] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-19 03:45:14] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
[2022-05-19 03:45:14] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:14] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-19 03:45:14] [INFO ] Implicit Places using invariants in 330 ms returned []
[2022-05-19 03:45:14] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:14] [INFO ] Computed 77 place invariants in 11 ms
[2022-05-19 03:45:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:16] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 1657 ms to find 0 implicit places.
[2022-05-19 03:45:16] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:16] [INFO ] Computed 77 place invariants in 11 ms
[2022-05-19 03:45:16] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/483 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 227 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Finished random walk after 471 steps, including 33 resets, run visited all 2 properties in 4 ms. (steps per millisecond=117 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 196 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 236 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 202 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Product exploration explored 100000 steps with 25000 reset in 345 ms.
Product exploration explored 100000 steps with 25000 reset in 366 ms.
Applying partial POR strategy [false, true, false, false, false, false]
Stuttering acceptance computed with spot in 224 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Support contains 8 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 649/649 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 483 transition count 649
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 33 place count 483 transition count 650
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 483 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 482 transition count 649
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 482 transition count 649
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 482 transition count 649
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 105 place count 449 transition count 616
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 138 place count 449 transition count 616
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 138 rules in 99 ms. Remains 449 /483 variables (removed 34) and now considering 616/649 (removed 33) transitions.
[2022-05-19 03:45:19] [INFO ] Flow matrix only has 612 transitions (discarded 4 similar events)
// Phase 1: matrix 612 rows 449 cols
[2022-05-19 03:45:19] [INFO ] Computed 77 place invariants in 19 ms
[2022-05-19 03:45:19] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
[2022-05-19 03:45:19] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-19 03:45:19] [INFO ] Flow matrix only has 612 transitions (discarded 4 similar events)
// Phase 1: matrix 612 rows 449 cols
[2022-05-19 03:45:19] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-19 03:45:19] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 449/483 places, 616/649 transitions.
Finished structural reductions, in 1 iterations. Remains : 449/483 places, 616/649 transitions.
Product exploration explored 100000 steps with 25000 reset in 386 ms.
Product exploration explored 100000 steps with 25000 reset in 365 ms.
Built C files in :
/tmp/ltsmin8233277180658387146
[2022-05-19 03:45:20] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8233277180658387146
Running compilation step : cd /tmp/ltsmin8233277180658387146;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1201 ms.
Running link step : cd /tmp/ltsmin8233277180658387146;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin8233277180658387146;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5241709598017936058.hoa' '--buchi-type=spotba'
LTSmin run took 280 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-05 finished in 13413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U (p0 U p0)))'
Support contains 1 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 484 transition count 616
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 450 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 70 place count 449 transition count 580
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 140 place count 414 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 412 transition count 578
Applied a total of 144 rules in 44 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2022-05-19 03:45:22] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 03:45:22] [INFO ] Computed 77 place invariants in 8 ms
[2022-05-19 03:45:22] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
[2022-05-19 03:45:22] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 03:45:22] [INFO ] Computed 77 place invariants in 9 ms
[2022-05-19 03:45:22] [INFO ] Implicit Places using invariants in 303 ms returned []
[2022-05-19 03:45:22] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 03:45:22] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-19 03:45:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:24] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
[2022-05-19 03:45:24] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-19 03:45:24] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 03:45:24] [INFO ] Computed 77 place invariants in 8 ms
[2022-05-19 03:45:24] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/484 places, 578/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/484 places, 578/650 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), true]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s195 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-07 finished in 2163 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((X(p0)||p1)))||G(p0)))'
Support contains 8 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Applied a total of 0 rules in 17 ms. Remains 484 /484 variables (removed 0) and now considering 650/650 (removed 0) transitions.
[2022-05-19 03:45:24] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2022-05-19 03:45:24] [INFO ] Computed 77 place invariants in 8 ms
[2022-05-19 03:45:24] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
[2022-05-19 03:45:24] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2022-05-19 03:45:24] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-19 03:45:25] [INFO ] Implicit Places using invariants in 349 ms returned []
[2022-05-19 03:45:25] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2022-05-19 03:45:25] [INFO ] Computed 77 place invariants in 9 ms
[2022-05-19 03:45:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:27] [INFO ] Implicit Places using invariants and state equation in 2425 ms returned []
Implicit Place search using SMT with State Equation took 2779 ms to find 0 implicit places.
[2022-05-19 03:45:27] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2022-05-19 03:45:27] [INFO ] Computed 77 place invariants in 9 ms
[2022-05-19 03:45:28] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 484/484 places, 650/650 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s482 1), p0:(OR (AND (GEQ s203 1) (GEQ s205 1) (GEQ s209 9)) (AND (GEQ s203 1) (GEQ s206 1) (GEQ s209 9)) (AND (GEQ s203 1) (GEQ s204 1) (GEQ s209...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-08 finished in 3731 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1 U p2))))))'
Support contains 10 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 484 transition count 617
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 451 transition count 617
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 66 place count 451 transition count 583
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 134 place count 417 transition count 583
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 415 transition count 581
Applied a total of 138 rules in 39 ms. Remains 415 /484 variables (removed 69) and now considering 581/650 (removed 69) transitions.
[2022-05-19 03:45:28] [INFO ] Flow matrix only has 577 transitions (discarded 4 similar events)
// Phase 1: matrix 577 rows 415 cols
[2022-05-19 03:45:28] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 03:45:28] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
[2022-05-19 03:45:28] [INFO ] Flow matrix only has 577 transitions (discarded 4 similar events)
// Phase 1: matrix 577 rows 415 cols
[2022-05-19 03:45:28] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 03:45:28] [INFO ] Implicit Places using invariants in 278 ms returned []
[2022-05-19 03:45:28] [INFO ] Flow matrix only has 577 transitions (discarded 4 similar events)
// Phase 1: matrix 577 rows 415 cols
[2022-05-19 03:45:28] [INFO ] Computed 77 place invariants in 8 ms
[2022-05-19 03:45:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:29] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
[2022-05-19 03:45:29] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-19 03:45:29] [INFO ] Flow matrix only has 577 transitions (discarded 4 similar events)
// Phase 1: matrix 577 rows 415 cols
[2022-05-19 03:45:29] [INFO ] Computed 77 place invariants in 8 ms
[2022-05-19 03:45:30] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 415/484 places, 581/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/484 places, 581/650 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s414 1), p2:(AND (GEQ s164 1) (GEQ s371 1)), p1:(OR (AND (GEQ s201 1) (GEQ s203 1) (GEQ s207 9)) (AND (GEQ s201 1) (GEQ s204 1) (GEQ s207 9)) (AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-09 finished in 2066 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 17 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2022-05-19 03:45:30] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:30] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 03:45:30] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
[2022-05-19 03:45:30] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:30] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 03:45:30] [INFO ] Implicit Places using invariants in 364 ms returned []
[2022-05-19 03:45:31] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:31] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-19 03:45:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:33] [INFO ] Implicit Places using invariants and state equation in 2199 ms returned []
Implicit Place search using SMT with State Equation took 2567 ms to find 0 implicit places.
[2022-05-19 03:45:33] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:33] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 03:45:33] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s164 1) (GEQ s371 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 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-11 finished in 3419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(F(X(p0)))))&&F((X(G(p1))||p2))))'
Support contains 36 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 72 place count 448 transition count 581
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 138 place count 415 transition count 581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 414 transition count 580
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 414 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 412 transition count 578
Applied a total of 144 rules in 57 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2022-05-19 03:45:33] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 03:45:33] [INFO ] Computed 77 place invariants in 9 ms
[2022-05-19 03:45:34] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
[2022-05-19 03:45:34] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 03:45:34] [INFO ] Computed 77 place invariants in 9 ms
[2022-05-19 03:45:34] [INFO ] Implicit Places using invariants in 291 ms returned []
[2022-05-19 03:45:34] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 03:45:34] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 03:45:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:35] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1488 ms to find 0 implicit places.
[2022-05-19 03:45:35] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-19 03:45:35] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 03:45:35] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 03:45:35] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/484 places, 578/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/484 places, 578/650 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s407 1) (GEQ s410 1)), p2:(GEQ s405 1), p1:(OR (AND (GEQ s32 1) (GEQ s97 1) (GEQ s117 1)) (AND (GEQ s32 1) (GEQ s97 1) (GEQ s118 1)) (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-12 finished in 2262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G((G(X(F(p1)))||X(p2)))))'
Support contains 251 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 7 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2022-05-19 03:45:35] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:35] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 03:45:36] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
[2022-05-19 03:45:36] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:36] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-19 03:45:36] [INFO ] Implicit Places using invariants in 240 ms returned []
[2022-05-19 03:45:36] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:36] [INFO ] Computed 77 place invariants in 10 ms
[2022-05-19 03:45:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:37] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2022-05-19 03:45:37] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:37] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 03:45:38] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s32 1) (GEQ s98 1) (GEQ s130 1)) (AND (GEQ s32 1) (GEQ s98 1) (GEQ s131 1)) (AND (GEQ s32 1) (GEQ s98 1) (GEQ s132 1)) (AND (GEQ s32 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 48 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-13 finished in 2278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((F(G(p1))&&p0)))&&F(p2))))'
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 14 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2022-05-19 03:45:38] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:38] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-19 03:45:38] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
[2022-05-19 03:45:38] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:38] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 03:45:38] [INFO ] Implicit Places using invariants in 346 ms returned []
[2022-05-19 03:45:38] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:38] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 03:45:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:40] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 2309 ms to find 0 implicit places.
[2022-05-19 03:45:40] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:40] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-19 03:45:41] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s482 1), p0:(AND (GEQ s164 1) (GEQ s371 1)), p1:(OR (GEQ s482 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-14 finished in 3326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((X(p1)||p0))&&(F(p2) U G(!p1)))))'
Support contains 35 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 13 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2022-05-19 03:45:41] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:41] [INFO ] Computed 77 place invariants in 10 ms
[2022-05-19 03:45:41] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
[2022-05-19 03:45:41] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:41] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 03:45:42] [INFO ] Implicit Places using invariants in 301 ms returned []
[2022-05-19 03:45:42] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:42] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 03:45:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:44] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
[2022-05-19 03:45:44] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 03:45:44] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 03:45:44] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s32 1) (GEQ s71 1) (GEQ s96 1)) (AND (GEQ s32 1) (GEQ s76 1) (GEQ s96 1)) (AND (GEQ s32 1) (GEQ s66 1) (GEQ s96 1)) (AND (GEQ s32 1) (GEQ...], 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 25 steps with 1 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-15 finished in 3289 ms.
All properties solved by simple procedures.
Total runtime 46976 ms.

BK_STOP 1652931944884

--------------------
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-COL-S05J30"
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-COL-S05J30, 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-165277017100740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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