MCC'2023- Execution of r295-tall-167873947900412

About the Execution of LoLa+red for PolyORBLF-COL-S04J04T10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
956.567	374971.00	407178.00	1507.30	FF?FFFTFFTFFFFTF	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873947900412.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is PolyORBLF-COL-S04J04T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947900412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.7K Feb 26 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 13:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 13:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 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 PolyORBLF-COL-S04J04T10-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678838770937

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 00:06:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 00:06:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 00:06:12] [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.
[2023-03-15 00:06:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 00:06:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 686 ms
[2023-03-15 00:06:13] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 870 PT places and 5136.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 00:06:13] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2023-03-15 00:06:13] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-08 FALSE 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
Finished random walk after 4380 steps, including 1 resets, run visited all 28 properties in 108 ms. (steps per millisecond=40 )
[2023-03-15 00:06:13] [INFO ] Flatten gal took : 24 ms
[2023-03-15 00:06:13] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-15 00:06:13] [INFO ] Unfolded HLPN to a Petri net with 870 places and 5034 transitions 34774 arcs in 113 ms.
[2023-03-15 00:06:13] [INFO ] Unfolded 13 HLPN properties in 2 ms.
[2023-03-15 00:06:13] [INFO ] Reduced 60 identical enabling conditions.
[2023-03-15 00:06:13] [INFO ] Reduced 440 identical enabling conditions.
[2023-03-15 00:06:13] [INFO ] Reduced 2210 identical enabling conditions.
[2023-03-15 00:06:13] [INFO ] Reduced 2210 identical enabling conditions.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 401 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Applied a total of 0 rules in 74 ms. Remains 870 /870 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
[2023-03-15 00:06:13] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 870 cols
[2023-03-15 00:06:13] [INFO ] Computed 58 place invariants in 136 ms
[2023-03-15 00:06:15] [INFO ] Dead Transitions using invariants and state equation in 1296 ms found 540 transitions.
Found 540 dead transitions using SMT.
Drop transitions removed 540 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 540 transitions.
[2023-03-15 00:06:15] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
// Phase 1: matrix 1744 rows 870 cols
[2023-03-15 00:06:15] [INFO ] Computed 58 place invariants in 44 ms
[2023-03-15 00:06:15] [INFO ] Implicit Places using invariants in 392 ms returned [672, 673, 674, 675, 676, 677, 678, 679, 680, 681]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 403 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 860/870 places, 1784/2324 transitions.
Applied a total of 0 rules in 23 ms. Remains 860 /860 variables (removed 0) and now considering 1784/1784 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1818 ms. Remains : 860/870 places, 1784/2324 transitions.
Support contains 401 out of 860 places after structural reductions.
[2023-03-15 00:06:15] [INFO ] Flatten gal took : 195 ms
[2023-03-15 00:06:16] [INFO ] Flatten gal took : 140 ms
[2023-03-15 00:06:16] [INFO ] Input system was already deterministic with 1784 transitions.
Finished random walk after 687 steps, including 0 resets, run visited all 28 properties in 92 ms. (steps per millisecond=7 )
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(p0)&&F(p1))))))'
Support contains 21 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 860 transition count 1724
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 800 transition count 1714
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 790 transition count 1714
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 140 place count 790 transition count 1614
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 340 place count 690 transition count 1614
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 380 place count 670 transition count 1594
Applied a total of 380 rules in 192 ms. Remains 670 /860 variables (removed 190) and now considering 1594/1784 (removed 190) transitions.
[2023-03-15 00:06:17] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
// Phase 1: matrix 1554 rows 670 cols
[2023-03-15 00:06:17] [INFO ] Computed 48 place invariants in 30 ms
[2023-03-15 00:06:17] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
[2023-03-15 00:06:17] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:06:17] [INFO ] Invariant cache hit.
[2023-03-15 00:06:18] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-15 00:06:18] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:06:18] [INFO ] Invariant cache hit.
[2023-03-15 00:06:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:06:30] [INFO ] Implicit Places using invariants and state equation in 11690 ms returned []
Implicit Place search using SMT with State Equation took 12221 ms to find 0 implicit places.
[2023-03-15 00:06:30] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-15 00:06:30] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:06:30] [INFO ] Invariant cache hit.
[2023-03-15 00:06:30] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 670/860 places, 1594/1784 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13833 ms. Remains : 670/860 places, 1594/1784 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s575 1) (LT s615 1)) (OR (LT s576 1) (LT s615 1)) (OR (LT s579 1) (LT s615 1)) (OR (LT s580 1) (LT s615 1)) (OR (LT s581 1) (LT s615 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 12766 reset in 634 ms.
Product exploration explored 100000 steps with 12501 reset in 543 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 176 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2023-03-15 00:06:33] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:06:33] [INFO ] Invariant cache hit.
[2023-03-15 00:06:34] [INFO ] [Real]Absence check using 16 positive place invariants in 22 ms returned sat
[2023-03-15 00:06:34] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 229 ms returned sat
[2023-03-15 00:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:06:35] [INFO ] [Real]Absence check using state equation in 1423 ms returned sat
[2023-03-15 00:06:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:06:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 37 ms returned sat
[2023-03-15 00:06:36] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 94 ms returned sat
[2023-03-15 00:06:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:06:39] [INFO ] [Nat]Absence check using state equation in 2376 ms returned sat
[2023-03-15 00:06:39] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:06:40] [INFO ] [Nat]Added 200 Read/Feed constraints in 1616 ms returned sat
[2023-03-15 00:06:41] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 3 ms to minimize.
[2023-03-15 00:06:44] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3274 ms
Could not prove EG (NOT p0)
Support contains 21 out of 670 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 670/670 places, 1594/1594 transitions.
Applied a total of 0 rules in 54 ms. Remains 670 /670 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
[2023-03-15 00:06:44] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:06:44] [INFO ] Invariant cache hit.
[2023-03-15 00:06:44] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
[2023-03-15 00:06:44] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:06:44] [INFO ] Invariant cache hit.
[2023-03-15 00:06:45] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-15 00:06:45] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:06:45] [INFO ] Invariant cache hit.
[2023-03-15 00:06:46] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:06:58] [INFO ] Implicit Places using invariants and state equation in 12581 ms returned []
Implicit Place search using SMT with State Equation took 13099 ms to find 0 implicit places.
[2023-03-15 00:06:58] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-15 00:06:58] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:06:58] [INFO ] Invariant cache hit.
[2023-03-15 00:06:58] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14522 ms. Remains : 670/670 places, 1594/1594 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 p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 541 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=108 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2023-03-15 00:06:59] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:06:59] [INFO ] Invariant cache hit.
[2023-03-15 00:07:00] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned sat
[2023-03-15 00:07:00] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 226 ms returned sat
[2023-03-15 00:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:07:02] [INFO ] [Real]Absence check using state equation in 1396 ms returned sat
[2023-03-15 00:07:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:07:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 34 ms returned sat
[2023-03-15 00:07:03] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 88 ms returned sat
[2023-03-15 00:07:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:07:05] [INFO ] [Nat]Absence check using state equation in 2321 ms returned sat
[2023-03-15 00:07:05] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:07:06] [INFO ] [Nat]Added 200 Read/Feed constraints in 1618 ms returned sat
[2023-03-15 00:07:07] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2023-03-15 00:07:10] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3206 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 12893 reset in 492 ms.
Product exploration explored 100000 steps with 13214 reset in 542 ms.
Support contains 21 out of 670 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 670/670 places, 1594/1594 transitions.
Applied a total of 0 rules in 32 ms. Remains 670 /670 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
[2023-03-15 00:07:11] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:07:11] [INFO ] Invariant cache hit.
[2023-03-15 00:07:12] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
[2023-03-15 00:07:12] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:07:12] [INFO ] Invariant cache hit.
[2023-03-15 00:07:12] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-15 00:07:12] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:07:12] [INFO ] Invariant cache hit.
[2023-03-15 00:07:13] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:07:25] [INFO ] Implicit Places using invariants and state equation in 13312 ms returned []
Implicit Place search using SMT with State Equation took 13826 ms to find 0 implicit places.
[2023-03-15 00:07:25] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 00:07:25] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 00:07:25] [INFO ] Invariant cache hit.
[2023-03-15 00:07:26] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15183 ms. Remains : 670/670 places, 1594/1594 transitions.
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-02 finished in 69740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 856 transition count 1694
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 766 transition count 1694
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 180 place count 766 transition count 1594
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 380 place count 666 transition count 1594
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 390 place count 656 transition count 1584
Iterating global reduction 2 with 10 rules applied. Total rules applied 400 place count 656 transition count 1584
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 600 place count 556 transition count 1484
Applied a total of 600 rules in 162 ms. Remains 556 /860 variables (removed 304) and now considering 1484/1784 (removed 300) transitions.
[2023-03-15 00:07:26] [INFO ] Flow matrix only has 1444 transitions (discarded 40 similar events)
// Phase 1: matrix 1444 rows 556 cols
[2023-03-15 00:07:26] [INFO ] Computed 44 place invariants in 27 ms
[2023-03-15 00:07:27] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
[2023-03-15 00:07:27] [INFO ] Flow matrix only has 1444 transitions (discarded 40 similar events)
[2023-03-15 00:07:27] [INFO ] Invariant cache hit.
[2023-03-15 00:07:27] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-15 00:07:27] [INFO ] Flow matrix only has 1444 transitions (discarded 40 similar events)
[2023-03-15 00:07:27] [INFO ] Invariant cache hit.
[2023-03-15 00:07:28] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:07:40] [INFO ] Implicit Places using invariants and state equation in 12054 ms returned []
Implicit Place search using SMT with State Equation took 12480 ms to find 0 implicit places.
[2023-03-15 00:07:40] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 00:07:40] [INFO ] Flow matrix only has 1444 transitions (discarded 40 similar events)
[2023-03-15 00:07:40] [INFO ] Invariant cache hit.
[2023-03-15 00:07:40] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/860 places, 1484/1784 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13876 ms. Remains : 556/860 places, 1484/1784 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-03 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 (AND (GEQ s180 1) (GEQ s239 1) (GEQ s244 1)) (AND (GEQ s180 1) (GEQ s239 1) (GEQ s246 1)) (AND (GEQ s180 1) (GEQ s239 1) (GEQ s248 1)) (AND (GEQ s1...], 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 6630 steps with 0 reset in 49 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-03 finished in 13974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 22 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 856 transition count 1734
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 806 transition count 1724
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 796 transition count 1724
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 120 place count 796 transition count 1614
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 340 place count 686 transition count 1614
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 350 place count 676 transition count 1604
Iterating global reduction 3 with 10 rules applied. Total rules applied 360 place count 676 transition count 1604
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 540 place count 586 transition count 1514
Applied a total of 540 rules in 89 ms. Remains 586 /860 variables (removed 274) and now considering 1514/1784 (removed 270) transitions.
[2023-03-15 00:07:40] [INFO ] Flow matrix only has 1474 transitions (discarded 40 similar events)
// Phase 1: matrix 1474 rows 586 cols
[2023-03-15 00:07:40] [INFO ] Computed 44 place invariants in 22 ms
[2023-03-15 00:07:41] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
[2023-03-15 00:07:41] [INFO ] Flow matrix only has 1474 transitions (discarded 40 similar events)
[2023-03-15 00:07:41] [INFO ] Invariant cache hit.
[2023-03-15 00:07:42] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-15 00:07:42] [INFO ] Flow matrix only has 1474 transitions (discarded 40 similar events)
[2023-03-15 00:07:42] [INFO ] Invariant cache hit.
[2023-03-15 00:07:42] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:07:56] [INFO ] Implicit Places using invariants and state equation in 14752 ms returned []
Implicit Place search using SMT with State Equation took 15199 ms to find 0 implicit places.
[2023-03-15 00:07:56] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 00:07:56] [INFO ] Flow matrix only has 1474 transitions (discarded 40 similar events)
[2023-03-15 00:07:56] [INFO ] Invariant cache hit.
[2023-03-15 00:07:57] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/860 places, 1514/1784 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16649 ms. Remains : 586/860 places, 1514/1784 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s183 1) (GEQ s280 1)) (AND (GEQ s183 1) (GEQ s279 1)) (AND (GEQ s183 1) (GEQ s278 1)) (AND (GEQ s183 1) (GEQ s277 1)) (AND (GEQ s183 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4 reset in 417 ms.
Stack based approach found an accepted trace after 7681 steps with 0 reset with depth 7682 and stack size 7682 in 40 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-04 finished in 17231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 41 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 856 transition count 1694
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 766 transition count 1694
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 180 place count 766 transition count 1634
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 300 place count 706 transition count 1634
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 310 place count 696 transition count 1624
Iterating global reduction 2 with 10 rules applied. Total rules applied 320 place count 696 transition count 1624
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 520 place count 596 transition count 1524
Applied a total of 520 rules in 96 ms. Remains 596 /860 variables (removed 264) and now considering 1524/1784 (removed 260) transitions.
[2023-03-15 00:07:58] [INFO ] Flow matrix only has 1484 transitions (discarded 40 similar events)
// Phase 1: matrix 1484 rows 596 cols
[2023-03-15 00:07:58] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-15 00:07:58] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
[2023-03-15 00:07:58] [INFO ] Flow matrix only has 1484 transitions (discarded 40 similar events)
[2023-03-15 00:07:58] [INFO ] Invariant cache hit.
[2023-03-15 00:07:59] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-15 00:07:59] [INFO ] Flow matrix only has 1484 transitions (discarded 40 similar events)
[2023-03-15 00:07:59] [INFO ] Invariant cache hit.
[2023-03-15 00:07:59] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:08:10] [INFO ] Implicit Places using invariants and state equation in 11527 ms returned []
Implicit Place search using SMT with State Equation took 11988 ms to find 0 implicit places.
[2023-03-15 00:08:10] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 00:08:10] [INFO ] Flow matrix only has 1484 transitions (discarded 40 similar events)
[2023-03-15 00:08:10] [INFO ] Invariant cache hit.
[2023-03-15 00:08:11] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 596/860 places, 1524/1784 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13444 ms. Remains : 596/860 places, 1524/1784 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s172 10) (GEQ s213 1)) (AND (GEQ s172 10) (GEQ s214 1)) (AND (GEQ s172 10) (GEQ s215 1)) (AND (GEQ s172 10) (GEQ s209 1)) (AND (GEQ s172 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 26828 steps with 400 reset in 135 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-05 finished in 13630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X((!p0||G(p1)))))'
Support contains 21 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Applied a total of 4 rules in 34 ms. Remains 856 /860 variables (removed 4) and now considering 1784/1784 (removed 0) transitions.
[2023-03-15 00:08:11] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
// Phase 1: matrix 1744 rows 856 cols
[2023-03-15 00:08:11] [INFO ] Computed 44 place invariants in 31 ms
[2023-03-15 00:08:12] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
[2023-03-15 00:08:12] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
[2023-03-15 00:08:12] [INFO ] Invariant cache hit.
[2023-03-15 00:08:13] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-15 00:08:13] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
[2023-03-15 00:08:13] [INFO ] Invariant cache hit.
[2023-03-15 00:08:13] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:08:26] [INFO ] Implicit Places using invariants and state equation in 13861 ms returned []
Implicit Place search using SMT with State Equation took 14423 ms to find 0 implicit places.
[2023-03-15 00:08:26] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
[2023-03-15 00:08:26] [INFO ] Invariant cache hit.
[2023-03-15 00:08:27] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 856/860 places, 1784/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15924 ms. Remains : 856/860 places, 1784/1784 transitions.
Stuttering acceptance computed with spot in 128 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s197 1) (GEQ s204 1)) (AND (GEQ s196 1) (GEQ s204 1)) (AND (GEQ s192 1) (GEQ s204 1)) (AND (GEQ s193 1) (GEQ s204 1)) (AND (GEQ s194 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 877 ms.
Product exploration explored 100000 steps with 50000 reset in 882 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 7 factoid took 106 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-06 finished in 17952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U G(!p1))||X(F((G(p2)||(X(p2)&&p3))))))'
Support contains 87 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 846 transition count 1774
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 846 transition count 1774
Applied a total of 24 rules in 26 ms. Remains 846 /860 variables (removed 14) and now considering 1774/1784 (removed 10) transitions.
[2023-03-15 00:08:29] [INFO ] Flow matrix only has 1734 transitions (discarded 40 similar events)
// Phase 1: matrix 1734 rows 846 cols
[2023-03-15 00:08:29] [INFO ] Computed 44 place invariants in 31 ms
[2023-03-15 00:08:30] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
[2023-03-15 00:08:30] [INFO ] Flow matrix only has 1734 transitions (discarded 40 similar events)
[2023-03-15 00:08:30] [INFO ] Invariant cache hit.
[2023-03-15 00:08:30] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-15 00:08:30] [INFO ] Flow matrix only has 1734 transitions (discarded 40 similar events)
[2023-03-15 00:08:30] [INFO ] Invariant cache hit.
[2023-03-15 00:08:31] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:08:35] [INFO ] Implicit Places using invariants and state equation in 5033 ms returned []
Implicit Place search using SMT with State Equation took 5506 ms to find 0 implicit places.
[2023-03-15 00:08:35] [INFO ] Flow matrix only has 1734 transitions (discarded 40 similar events)
[2023-03-15 00:08:35] [INFO ] Invariant cache hit.
[2023-03-15 00:08:36] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 846/860 places, 1774/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6963 ms. Remains : 846/860 places, 1774/1784 transitions.
Stuttering acceptance computed with spot in 558 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=1 dest: 6}, { cond=(AND p1 p0 p3), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 9}, { cond=(AND p1 p2 p3), acceptance={0} source=2 dest: 9}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=2 dest: 9}, { cond=(AND p1 (NOT p2) p3), acceptance={0, 1} source=2 dest: 9}, { cond=(AND p1 p3), acceptance={} source=2 dest: 10}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p3), acceptance={} source=3 dest: 7}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p2 p3), acceptance={0} source=4 dest: 7}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=5 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=8 dest: 6}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={1} source=9 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=9 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=9 dest: 9}, { cond=(AND p1 (NOT p2) p3), acceptance={0, 1} source=9 dest: 9}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=9 dest: 10}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=10 dest: 4}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=10 dest: 7}]], initial=0, aps=[p1:(OR (AND (GEQ s387 1) (GEQ s650 1) (GEQ s666 1)) (AND (GEQ s387 1) (GEQ s650 1) (GEQ s665 1)) (AND (GEQ s387 1) (GEQ s650 1) (GEQ s664 1)) (AND (GEQ s3...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40065 reset in 2080 ms.
Product exploration explored 100000 steps with 39984 reset in 2100 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) p3 p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND p1 p0 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND p1 p2 p3)), (X (NOT (AND p1 (NOT p2) p3))), (X (AND p1 p3)), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND p1 p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 p3))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 (NOT p0) p3))), (X (X (NOT (AND p1 (NOT p0) p3))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0) p3 p2)
Knowledge based reduction with 49 factoid took 2322 ms. Reduced automaton from 11 states, 49 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-09 finished in 14057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Support contains 66 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 846 transition count 1774
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 846 transition count 1774
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 836 transition count 1764
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 836 transition count 1764
Applied a total of 44 rules in 39 ms. Remains 836 /860 variables (removed 24) and now considering 1764/1784 (removed 20) transitions.
[2023-03-15 00:08:43] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
// Phase 1: matrix 1724 rows 836 cols
[2023-03-15 00:08:43] [INFO ] Computed 44 place invariants in 25 ms
[2023-03-15 00:08:44] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
[2023-03-15 00:08:44] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:08:44] [INFO ] Invariant cache hit.
[2023-03-15 00:08:44] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-15 00:08:44] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:08:44] [INFO ] Invariant cache hit.
[2023-03-15 00:08:45] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:09:00] [INFO ] Implicit Places using invariants and state equation in 16029 ms returned []
Implicit Place search using SMT with State Equation took 16550 ms to find 0 implicit places.
[2023-03-15 00:09:00] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:09:00] [INFO ] Invariant cache hit.
[2023-03-15 00:09:01] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 836/860 places, 1764/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17931 ms. Remains : 836/860 places, 1764/1784 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s108 1) (GEQ s287 1)) (AND (GEQ s127 1) (GEQ s287 1)) (AND (GEQ s137 1) (GEQ s287 1)) (AND (GEQ s118 1) (GEQ s287 1)) (AND (GEQ s99 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-10 finished in 18064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&G(F(p2))))'
Support contains 33 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 856 transition count 1734
Reduce places removed 50 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 70 rules applied. Total rules applied 120 place count 806 transition count 1714
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 140 place count 786 transition count 1714
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 140 place count 786 transition count 1604
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 360 place count 676 transition count 1604
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 370 place count 666 transition count 1594
Iterating global reduction 3 with 10 rules applied. Total rules applied 380 place count 666 transition count 1594
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 440 place count 636 transition count 1564
Applied a total of 440 rules in 76 ms. Remains 636 /860 variables (removed 224) and now considering 1564/1784 (removed 220) transitions.
[2023-03-15 00:09:01] [INFO ] Flow matrix only has 1524 transitions (discarded 40 similar events)
// Phase 1: matrix 1524 rows 636 cols
[2023-03-15 00:09:01] [INFO ] Computed 44 place invariants in 23 ms
[2023-03-15 00:09:02] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
[2023-03-15 00:09:02] [INFO ] Flow matrix only has 1524 transitions (discarded 40 similar events)
[2023-03-15 00:09:02] [INFO ] Invariant cache hit.
[2023-03-15 00:09:02] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-15 00:09:02] [INFO ] Flow matrix only has 1524 transitions (discarded 40 similar events)
[2023-03-15 00:09:02] [INFO ] Invariant cache hit.
[2023-03-15 00:09:03] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:09:16] [INFO ] Implicit Places using invariants and state equation in 13809 ms returned []
Implicit Place search using SMT with State Equation took 14280 ms to find 0 implicit places.
[2023-03-15 00:09:16] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-15 00:09:16] [INFO ] Flow matrix only has 1524 transitions (discarded 40 similar events)
[2023-03-15 00:09:16] [INFO ] Invariant cache hit.
[2023-03-15 00:09:17] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 636/860 places, 1564/1784 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15619 ms. Remains : 636/860 places, 1564/1784 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s409 1) (GEQ s414 1)) (AND (GEQ s409 1) (GEQ s413 1)) (AND (GEQ s409 1) (GEQ s422 1)) (AND (GEQ s409 1) (GEQ s421 1)) (AND (GEQ s409 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 58695 steps with 1592 reset in 228 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-11 finished in 16024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&G(p1)&&X(p2)) U p3)))'
Support contains 93 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 846 transition count 1774
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 846 transition count 1774
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 836 transition count 1764
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 836 transition count 1764
Applied a total of 44 rules in 33 ms. Remains 836 /860 variables (removed 24) and now considering 1764/1784 (removed 20) transitions.
[2023-03-15 00:09:17] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
// Phase 1: matrix 1724 rows 836 cols
[2023-03-15 00:09:17] [INFO ] Computed 44 place invariants in 32 ms
[2023-03-15 00:09:18] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
[2023-03-15 00:09:18] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:09:18] [INFO ] Invariant cache hit.
[2023-03-15 00:09:18] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-15 00:09:18] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:09:18] [INFO ] Invariant cache hit.
[2023-03-15 00:09:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:09:35] [INFO ] Implicit Places using invariants and state equation in 16087 ms returned []
Implicit Place search using SMT with State Equation took 16568 ms to find 0 implicit places.
[2023-03-15 00:09:35] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:09:35] [INFO ] Invariant cache hit.
[2023-03-15 00:09:35] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 836/860 places, 1764/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17942 ms. Remains : 836/860 places, 1764/1784 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p3), (OR (NOT p1) (NOT p3) (NOT p2)), true, (NOT p3)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p1 p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p3) p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (AND (GEQ s152 1) (GEQ s172 1)) (AND (GEQ s156 1) (GEQ s176 1)) (AND (GEQ s157 1) (GEQ s177 1)) (AND (GEQ s160 1) (GEQ s180 1)) (AND (GEQ s161 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-12 finished in 18144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 42 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 846 transition count 1774
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 846 transition count 1774
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 836 transition count 1764
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 836 transition count 1764
Applied a total of 44 rules in 37 ms. Remains 836 /860 variables (removed 24) and now considering 1764/1784 (removed 20) transitions.
[2023-03-15 00:09:35] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:09:35] [INFO ] Invariant cache hit.
[2023-03-15 00:09:36] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
[2023-03-15 00:09:36] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:09:36] [INFO ] Invariant cache hit.
[2023-03-15 00:09:37] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-15 00:09:37] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:09:37] [INFO ] Invariant cache hit.
[2023-03-15 00:09:37] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:09:53] [INFO ] Implicit Places using invariants and state equation in 16966 ms returned []
Implicit Place search using SMT with State Equation took 17465 ms to find 0 implicit places.
[2023-03-15 00:09:53] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:09:53] [INFO ] Invariant cache hit.
[2023-03-15 00:09:54] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 836/860 places, 1764/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18811 ms. Remains : 836/860 places, 1764/1784 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s204 1) (GEQ s205 1) (GEQ s257 1)) (AND (GEQ s204 1) (GEQ s205 1) (GEQ s258 1)) (AND (GEQ s204 1) (GEQ s205 1) (GEQ s255 1)) (AND (GEQ s2...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-13 finished in 18907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(F(!p0))||(!p1 U (p2||G(!p1)))))||(X((X(F(!p0))||(!p1 U (p2||G(!p1)))))&&G(p3)))))'
Support contains 55 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 846 transition count 1774
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 846 transition count 1774
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 836 transition count 1764
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 836 transition count 1764
Applied a total of 44 rules in 37 ms. Remains 836 /860 variables (removed 24) and now considering 1764/1784 (removed 20) transitions.
[2023-03-15 00:09:54] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:09:54] [INFO ] Invariant cache hit.
[2023-03-15 00:09:55] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
[2023-03-15 00:09:55] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:09:55] [INFO ] Invariant cache hit.
[2023-03-15 00:09:55] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-15 00:09:55] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:09:55] [INFO ] Invariant cache hit.
[2023-03-15 00:09:56] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:10:10] [INFO ] Implicit Places using invariants and state equation in 14220 ms returned []
Implicit Place search using SMT with State Equation took 14724 ms to find 0 implicit places.
[2023-03-15 00:10:10] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:10:10] [INFO ] Invariant cache hit.
[2023-03-15 00:10:10] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 836/860 places, 1764/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16080 ms. Remains : 836/860 places, 1764/1784 transitions.
Stuttering acceptance computed with spot in 445 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p3) (NOT p2) p1 p0), (AND (NOT p3) (NOT p2) p0 p1), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p2) p1 p0 (NOT p3)), (AND (NOT p2) p1 p0 (NOT p3))]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=0 dest: 3}, { cond=p3, acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={1} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={1} source=3 dest: 3}], [{ cond=(OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=4 dest: 8}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=5 dest: 8}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 6}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0, 1} source=6 dest: 8}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={1} source=6 dest: 10}], [{ cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=7 dest: 6}, { cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=7 dest: 8}, { cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=7 dest: 9}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=7 dest: 10}], [{ cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={0} source=8 dest: 6}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={0, 1} source=8 dest: 6}, { cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0, 1} source=8 dest: 8}, { cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=8 dest: 10}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={1} source=8 dest: 10}], [{ cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=9 dest: 8}, { cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=9 dest: 9}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=9 dest: 10}], [{ cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0, 1} source=10 dest: 8}, { cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=10 dest: 10}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={1} source=10 dest: 10}]], initial=0, aps=[p3:(AND (LT s598 2) (LT s597 2) (LT s600 2) (LT s599 2) (LT s602 2) (LT s601 2) (LT s603 2) (LT s594 2) (LT s596 2) (LT s595 2)), p2:(AND (NOT (OR (AND (G...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 203 reset in 595 ms.
Product exploration explored 100000 steps with 215 reset in 612 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 p3 p2 (NOT p1) (NOT p0)), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)))), (X (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))), (X p3), (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p3 p2 p0) (AND p3 (NOT p1) p0))))), (X (X p3)), (X (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))))]
Knowledge based reduction with 17 factoid took 1089 ms. Reduced automaton from 11 states, 52 edges and 4 AP (stutter sensitive) to 11 states, 52 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 568 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 p0 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2) p0 (NOT p3)), (AND p1 (NOT p2) p0 (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-15 00:10:15] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:10:15] [INFO ] Invariant cache hit.
[2023-03-15 00:10:15] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 00:10:15] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 31 ms returned sat
[2023-03-15 00:10:15] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-15 00:10:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 00:10:16] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 31 ms returned sat
[2023-03-15 00:10:16] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p3 p2 (NOT p1) (NOT p0)), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)))), (X (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))), (X p3), (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p3 p2 p0) (AND p3 (NOT p1) p0))))), (X (X p3)), (X (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (G (NOT (OR (AND (NOT p1) p0 (NOT p3)) (AND p2 p0 (NOT p3))))), (G (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p1 (NOT p2) p0 p3))), (G (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : [(X (X (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (F (OR (AND (NOT p1) p0 p3) (AND p2 p0 p3))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0) p3))), (F (NOT p3)), (F (AND p1 (NOT p2) (NOT p0) p3))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 (NOT p2) p0 (NOT p3))))
Knowledge based reduction with 22 factoid took 1032 ms. Reduced automaton from 11 states, 52 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-14 finished in 22362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(G((p1||(!p0&&F(p2))))))))'
Support contains 85 out of 860 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 846 transition count 1774
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 846 transition count 1774
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 836 transition count 1764
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 836 transition count 1764
Applied a total of 44 rules in 38 ms. Remains 836 /860 variables (removed 24) and now considering 1764/1784 (removed 20) transitions.
[2023-03-15 00:10:17] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:10:17] [INFO ] Invariant cache hit.
[2023-03-15 00:10:17] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
[2023-03-15 00:10:17] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:10:17] [INFO ] Invariant cache hit.
[2023-03-15 00:10:18] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-15 00:10:18] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:10:18] [INFO ] Invariant cache hit.
[2023-03-15 00:10:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 00:10:33] [INFO ] Implicit Places using invariants and state equation in 14860 ms returned []
Implicit Place search using SMT with State Equation took 15335 ms to find 0 implicit places.
[2023-03-15 00:10:33] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 00:10:33] [INFO ] Invariant cache hit.
[2023-03-15 00:10:33] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 836/860 places, 1764/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16757 ms. Remains : 836/860 places, 1764/1784 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s563 6) (LT s573 1) (LT s666 1) (LT s667 3)) (OR (LT s563 6) (LT s565 1) (LT s664 1) (LT s665 1) (LT s667 2)) (OR (LT s563 6) (LT s568 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-15 finished in 17018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(p0)&&F(p1))))))'
[2023-03-15 00:10:34] [INFO ] Flatten gal took : 74 ms
[2023-03-15 00:10:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-15 00:10:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 860 places, 1784 transitions and 8044 arcs took 8 ms.
Total runtime 262058 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBLF-COL-S04J04T10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1678839145908

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBLF-COL-S04J04T10-LTLFireability-02
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3599 2/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 193190 m, 38638 m/sec, 939459 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3599 4/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 380619 m, 37485 m/sec, 1911528 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3599 5/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 569351 m, 37746 m/sec, 2882352 t fired, .

Time elapsed: 15 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3599 7/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 753776 m, 36885 m/sec, 3852950 t fired, .

Time elapsed: 20 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3599 8/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 941054 m, 37455 m/sec, 4810624 t fired, .

Time elapsed: 25 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3599 10/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 1127057 m, 37200 m/sec, 5765490 t fired, .

Time elapsed: 30 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3599 11/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 1315734 m, 37735 m/sec, 6720943 t fired, .

Time elapsed: 35 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/3599 13/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 1499673 m, 36787 m/sec, 7672003 t fired, .

Time elapsed: 40 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/3599 14/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 1683367 m, 36738 m/sec, 8625298 t fired, .

Time elapsed: 45 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/3599 16/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 1860874 m, 35501 m/sec, 9578219 t fired, .

Time elapsed: 50 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/3599 17/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 2043379 m, 36501 m/sec, 10528808 t fired, .

Time elapsed: 55 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/3599 19/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 2227542 m, 36832 m/sec, 11472362 t fired, .

Time elapsed: 60 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/3599 20/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 2406599 m, 35811 m/sec, 12418521 t fired, .

Time elapsed: 65 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 69/3599 22/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 2590316 m, 36743 m/sec, 13356896 t fired, .

Time elapsed: 70 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 74/3599 23/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 2772017 m, 36340 m/sec, 14295246 t fired, .

Time elapsed: 75 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 79/3599 25/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 2954532 m, 36503 m/sec, 15230648 t fired, .

Time elapsed: 80 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 84/3599 26/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 3134102 m, 35914 m/sec, 16163569 t fired, .

Time elapsed: 85 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 89/3599 28/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 3314835 m, 36146 m/sec, 17097079 t fired, .

Time elapsed: 90 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 94/3599 29/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 3490184 m, 35069 m/sec, 18029142 t fired, .

Time elapsed: 95 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 99/3599 30/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 3658872 m, 33737 m/sec, 18973770 t fired, .

Time elapsed: 100 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 104/3599 32/32 PolyORBLF-COL-S04J04T10-LTLFireability-02 3827534 m, 33732 m/sec, 19930827 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for PolyORBLF-COL-S04J04T10-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J04T10-LTLFireability-02: LTL unknown AGGR

Time elapsed: 110 secs. Pages in use: 32

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="PolyORBLF-COL-S04J04T10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is PolyORBLF-COL-S04J04T10, 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 r295-tall-167873947900412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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