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.r263-smll-167863538000284.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 NoC3x3-PT-4B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538000284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 608K 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 NoC3x3-PT-4B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678757151361

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=NoC3x3-PT-4B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 01:25:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 01:25:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 01:25:54] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2023-03-14 01:25:54] [INFO ] Transformed 2328 places.
[2023-03-14 01:25:54] [INFO ] Transformed 2701 transitions.
[2023-03-14 01:25:54] [INFO ] Found NUPN structural information;
[2023-03-14 01:25:54] [INFO ] Parsed PT model containing 2328 places and 2701 transitions and 6091 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-4B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 2328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Discarding 607 places :
Symmetric choice reduction at 0 with 607 rule applications. Total rules 607 place count 1721 transition count 2094
Iterating global reduction 0 with 607 rules applied. Total rules applied 1214 place count 1721 transition count 2094
Discarding 307 places :
Symmetric choice reduction at 0 with 307 rule applications. Total rules 1521 place count 1414 transition count 1787
Iterating global reduction 0 with 307 rules applied. Total rules applied 1828 place count 1414 transition count 1787
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 0 with 107 rules applied. Total rules applied 1935 place count 1414 transition count 1680
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 1967 place count 1382 transition count 1648
Iterating global reduction 1 with 32 rules applied. Total rules applied 1999 place count 1382 transition count 1648
Applied a total of 1999 rules in 848 ms. Remains 1382 /2328 variables (removed 946) and now considering 1648/2701 (removed 1053) transitions.
// Phase 1: matrix 1648 rows 1382 cols
[2023-03-14 01:25:56] [INFO ] Computed 66 place invariants in 61 ms
[2023-03-14 01:25:57] [INFO ] Implicit Places using invariants in 1021 ms returned []
[2023-03-14 01:25:57] [INFO ] Invariant cache hit.
[2023-03-14 01:25:59] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 3208 ms to find 0 implicit places.
[2023-03-14 01:25:59] [INFO ] Invariant cache hit.
[2023-03-14 01:26:00] [INFO ] Dead Transitions using invariants and state equation in 1656 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1382/2328 places, 1648/2701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5723 ms. Remains : 1382/2328 places, 1648/2701 transitions.
Support contains 31 out of 1382 places after structural reductions.
[2023-03-14 01:26:01] [INFO ] Flatten gal took : 193 ms
[2023-03-14 01:26:01] [INFO ] Flatten gal took : 99 ms
[2023-03-14 01:26:01] [INFO ] Input system was already deterministic with 1648 transitions.
Support contains 30 out of 1382 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 968 ms. (steps per millisecond=10 ) properties (out of 25) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-14 01:26:03] [INFO ] Invariant cache hit.
[2023-03-14 01:26:03] [INFO ] [Real]Absence check using 66 positive place invariants in 49 ms returned sat
[2023-03-14 01:26:03] [INFO ] After 691ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-14 01:26:04] [INFO ] [Nat]Absence check using 66 positive place invariants in 47 ms returned sat
[2023-03-14 01:26:05] [INFO ] After 1248ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-14 01:26:06] [INFO ] After 2291ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 570 ms.
[2023-03-14 01:26:07] [INFO ] After 3572ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 4 different solutions.
Finished Parikh walk after 651 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=130 )
Parikh walk visited 8 properties in 124 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 65 stabilizing places and 65 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' '!(X(F(p0)))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1368 transition count 1634
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1368 transition count 1634
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 1368 transition count 1629
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1366 transition count 1627
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1366 transition count 1627
Applied a total of 37 rules in 1004 ms. Remains 1366 /1382 variables (removed 16) and now considering 1627/1648 (removed 21) transitions.
// Phase 1: matrix 1627 rows 1366 cols
[2023-03-14 01:26:09] [INFO ] Computed 66 place invariants in 12 ms
[2023-03-14 01:26:09] [INFO ] Implicit Places using invariants in 733 ms returned []
[2023-03-14 01:26:09] [INFO ] Invariant cache hit.
[2023-03-14 01:26:11] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 2270 ms to find 0 implicit places.
[2023-03-14 01:26:11] [INFO ] Invariant cache hit.
[2023-03-14 01:26:12] [INFO ] Dead Transitions using invariants and state equation in 1626 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1366/1382 places, 1627/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4902 ms. Remains : 1366/1382 places, 1627/1648 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1315 1) (EQ s1320 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1228 steps with 0 reset in 34 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-00 finished in 5335 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 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1366 transition count 1632
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1366 transition count 1632
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 1366 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 1364 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 1364 transition count 1624
Applied a total of 42 rules in 294 ms. Remains 1364 /1382 variables (removed 18) and now considering 1624/1648 (removed 24) transitions.
// Phase 1: matrix 1624 rows 1364 cols
[2023-03-14 01:26:13] [INFO ] Computed 66 place invariants in 14 ms
[2023-03-14 01:26:14] [INFO ] Implicit Places using invariants in 660 ms returned []
[2023-03-14 01:26:14] [INFO ] Invariant cache hit.
[2023-03-14 01:26:15] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 2383 ms to find 0 implicit places.
[2023-03-14 01:26:16] [INFO ] Invariant cache hit.
[2023-03-14 01:26:17] [INFO ] Dead Transitions using invariants and state equation in 1775 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1364/1382 places, 1624/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4459 ms. Remains : 1364/1382 places, 1624/1648 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-01 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:(AND (EQ s1115 1) (EQ s1139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-01 finished in 4574 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(p0)&&F(p1))))'
Support contains 3 out of 1382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1292 edges and 1382 vertex of which 849 / 1382 are part of one of the 33 SCC in 7 ms
Free SCC test removed 816 places
Ensure Unique test removed 956 transitions
Reduce isomorphic transitions removed 956 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 565 transition count 685
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 559 transition count 682
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 557 transition count 681
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 22 place count 556 transition count 679
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 23 place count 555 transition count 679
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 23 place count 555 transition count 642
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 97 place count 518 transition count 642
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 126 place count 489 transition count 581
Iterating global reduction 5 with 29 rules applied. Total rules applied 155 place count 489 transition count 581
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 155 place count 489 transition count 580
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 488 transition count 580
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 161 place count 484 transition count 574
Iterating global reduction 5 with 4 rules applied. Total rules applied 165 place count 484 transition count 574
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 367 place count 383 transition count 473
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 369 place count 383 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 370 place count 382 transition count 470
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 373 vertex of which 48 / 373 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 6 with 10 rules applied. Total rules applied 380 place count 349 transition count 470
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 428 place count 349 transition count 422
Applied a total of 428 rules in 199 ms. Remains 349 /1382 variables (removed 1033) and now considering 422/1648 (removed 1226) transitions.
[2023-03-14 01:26:18] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
// Phase 1: matrix 390 rows 349 cols
[2023-03-14 01:26:18] [INFO ] Computed 57 place invariants in 10 ms
[2023-03-14 01:26:18] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-14 01:26:18] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
[2023-03-14 01:26:18] [INFO ] Invariant cache hit.
[2023-03-14 01:26:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 01:26:18] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2023-03-14 01:26:19] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-14 01:26:19] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
[2023-03-14 01:26:19] [INFO ] Invariant cache hit.
[2023-03-14 01:26:19] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 349/1382 places, 422/1648 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1571 ms. Remains : 349/1382 places, 422/1648 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s189 1) (EQ s118 1)), p1:(EQ s248 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-02 finished in 1777 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 3 out of 1382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1292 edges and 1382 vertex of which 848 / 1382 are part of one of the 33 SCC in 3 ms
Free SCC test removed 815 places
Ensure Unique test removed 957 transitions
Reduce isomorphic transitions removed 957 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 566 transition count 682
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 20 place count 558 transition count 679
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 556 transition count 679
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 22 place count 556 transition count 642
Deduced a syphon composed of 37 places in 5 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 96 place count 519 transition count 642
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 124 place count 491 transition count 582
Iterating global reduction 3 with 28 rules applied. Total rules applied 152 place count 491 transition count 582
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 152 place count 491 transition count 581
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 490 transition count 581
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 158 place count 486 transition count 575
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 486 transition count 575
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 364 place count 385 transition count 474
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 366 place count 385 transition count 472
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 368 place count 384 transition count 475
Applied a total of 368 rules in 221 ms. Remains 384 /1382 variables (removed 998) and now considering 475/1648 (removed 1173) transitions.
[2023-03-14 01:26:19] [INFO ] Flow matrix only has 443 transitions (discarded 32 similar events)
// Phase 1: matrix 443 rows 384 cols
[2023-03-14 01:26:19] [INFO ] Computed 66 place invariants in 13 ms
[2023-03-14 01:26:20] [INFO ] Implicit Places using invariants in 505 ms returned [10, 46, 87, 123, 178, 282, 321, 364]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 509 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 376/1382 places, 475/1648 transitions.
Graph (trivial) has 263 edges and 376 vertex of which 40 / 376 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 355 transition count 434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 355 transition count 432
Applied a total of 5 rules in 64 ms. Remains 355 /376 variables (removed 21) and now considering 432/475 (removed 43) transitions.
[2023-03-14 01:26:20] [INFO ] Flow matrix only has 400 transitions (discarded 32 similar events)
// Phase 1: matrix 400 rows 355 cols
[2023-03-14 01:26:20] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-14 01:26:20] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-14 01:26:20] [INFO ] Flow matrix only has 400 transitions (discarded 32 similar events)
[2023-03-14 01:26:20] [INFO ] Invariant cache hit.
[2023-03-14 01:26:21] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-14 01:26:21] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 355/1382 places, 432/1648 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1845 ms. Remains : 355/1382 places, 432/1648 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s279 0) (EQ s20 0) (EQ s222 0))], 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 20 steps with 0 reset in 5 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-04 finished in 1913 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)&&X(G(p1))))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1367 transition count 1633
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1367 transition count 1633
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 1367 transition count 1627
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 1365 transition count 1625
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 1365 transition count 1625
Applied a total of 40 rules in 248 ms. Remains 1365 /1382 variables (removed 17) and now considering 1625/1648 (removed 23) transitions.
// Phase 1: matrix 1625 rows 1365 cols
[2023-03-14 01:26:21] [INFO ] Computed 66 place invariants in 8 ms
[2023-03-14 01:26:22] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-14 01:26:22] [INFO ] Invariant cache hit.
[2023-03-14 01:26:24] [INFO ] Implicit Places using invariants and state equation in 2079 ms returned []
Implicit Place search using SMT with State Equation took 2757 ms to find 0 implicit places.
[2023-03-14 01:26:24] [INFO ] Invariant cache hit.
[2023-03-14 01:26:26] [INFO ] Dead Transitions using invariants and state equation in 2065 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1365/1382 places, 1625/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5074 ms. Remains : 1365/1382 places, 1625/1648 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s773 1), p0:(EQ s925 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 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-05 finished in 5255 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 (p1||G(p0)))))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1368 transition count 1634
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1368 transition count 1634
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 1368 transition count 1629
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1366 transition count 1627
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1366 transition count 1627
Applied a total of 37 rules in 219 ms. Remains 1366 /1382 variables (removed 16) and now considering 1627/1648 (removed 21) transitions.
// Phase 1: matrix 1627 rows 1366 cols
[2023-03-14 01:26:27] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-14 01:26:27] [INFO ] Implicit Places using invariants in 674 ms returned []
[2023-03-14 01:26:27] [INFO ] Invariant cache hit.
[2023-03-14 01:26:29] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2331 ms to find 0 implicit places.
[2023-03-14 01:26:29] [INFO ] Invariant cache hit.
[2023-03-14 01:26:30] [INFO ] Dead Transitions using invariants and state equation in 1597 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1366/1382 places, 1627/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4149 ms. Remains : 1366/1382 places, 1627/1648 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(NEQ s934 1), p0:(NEQ s914 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1933 ms.
Product exploration explored 100000 steps with 50000 reset in 1509 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 6 factoid took 187 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-4B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-4B-LTLFireability-07 finished in 7959 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(X(X((p0||G(F(p1)))))))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1368 transition count 1634
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1368 transition count 1634
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 1368 transition count 1629
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1366 transition count 1627
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1366 transition count 1627
Applied a total of 37 rules in 158 ms. Remains 1366 /1382 variables (removed 16) and now considering 1627/1648 (removed 21) transitions.
// Phase 1: matrix 1627 rows 1366 cols
[2023-03-14 01:26:34] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-14 01:26:35] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-14 01:26:35] [INFO ] Invariant cache hit.
[2023-03-14 01:26:37] [INFO ] Implicit Places using invariants and state equation in 2172 ms returned []
Implicit Place search using SMT with State Equation took 2810 ms to find 0 implicit places.
[2023-03-14 01:26:37] [INFO ] Invariant cache hit.
[2023-03-14 01:26:39] [INFO ] Dead Transitions using invariants and state equation in 1822 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1366/1382 places, 1627/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4793 ms. Remains : 1366/1382 places, 1627/1648 transitions.
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1175 1), p1:(EQ s1223 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 72 reset in 627 ms.
Product exploration explored 100000 steps with 73 reset in 764 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 01:26:42] [INFO ] Invariant cache hit.
[2023-03-14 01:26:42] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 01:26:42] [INFO ] [Nat]Absence check using 66 positive place invariants in 50 ms returned sat
[2023-03-14 01:26:43] [INFO ] After 1052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 01:26:44] [INFO ] After 1331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 321 ms.
[2023-03-14 01:26:44] [INFO ] After 2038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 975 steps, including 1 resets, run visited all 2 properties in 26 ms. (steps per millisecond=37 )
Parikh walk visited 2 properties in 27 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 1366 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1627/1627 transitions.
Applied a total of 0 rules in 64 ms. Remains 1366 /1366 variables (removed 0) and now considering 1627/1627 (removed 0) transitions.
[2023-03-14 01:26:45] [INFO ] Invariant cache hit.
[2023-03-14 01:26:45] [INFO ] Implicit Places using invariants in 589 ms returned []
[2023-03-14 01:26:45] [INFO ] Invariant cache hit.
[2023-03-14 01:26:47] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 2174 ms to find 0 implicit places.
[2023-03-14 01:26:47] [INFO ] Invariant cache hit.
[2023-03-14 01:26:49] [INFO ] Dead Transitions using invariants and state equation in 1955 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4203 ms. Remains : 1366/1366 places, 1627/1627 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 01:26:50] [INFO ] Invariant cache hit.
[2023-03-14 01:26:50] [INFO ] [Real]Absence check using 66 positive place invariants in 73 ms returned sat
[2023-03-14 01:26:51] [INFO ] After 998ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 01:26:51] [INFO ] After 1155ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-14 01:26:51] [INFO ] After 1664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 184 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 69 reset in 332 ms.
Product exploration explored 100000 steps with 70 reset in 384 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 1366 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1366/1366 places, 1627/1627 transitions.
Graph (trivial) has 1277 edges and 1366 vertex of which 858 / 1366 are part of one of the 33 SCC in 2 ms
Free SCC test removed 825 places
Ensure Unique test removed 966 transitions
Reduce isomorphic transitions removed 966 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 1 place count 541 transition count 709
Deduced a syphon composed of 37 places in 3 ms
Iterating global reduction 0 with 37 rules applied. Total rules applied 38 place count 541 transition count 709
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 64 place count 515 transition count 649
Deduced a syphon composed of 37 places in 3 ms
Iterating global reduction 0 with 26 rules applied. Total rules applied 90 place count 515 transition count 649
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 116 place count 489 transition count 589
Deduced a syphon composed of 11 places in 2 ms
Iterating global reduction 0 with 26 rules applied. Total rules applied 142 place count 489 transition count 589
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 108 places in 0 ms
Iterating global reduction 0 with 97 rules applied. Total rules applied 239 place count 489 transition count 589
Deduced a syphon composed of 108 places in 0 ms
Applied a total of 239 rules in 306 ms. Remains 489 /1366 variables (removed 877) and now considering 589/1627 (removed 1038) transitions.
[2023-03-14 01:26:54] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-14 01:26:54] [INFO ] Flow matrix only has 557 transitions (discarded 32 similar events)
// Phase 1: matrix 557 rows 489 cols
[2023-03-14 01:26:54] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-14 01:26:54] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 489/1366 places, 589/1627 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 812 ms. Remains : 489/1366 places, 589/1627 transitions.
Support contains 2 out of 1366 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1627/1627 transitions.
Applied a total of 0 rules in 52 ms. Remains 1366 /1366 variables (removed 0) and now considering 1627/1627 (removed 0) transitions.
// Phase 1: matrix 1627 rows 1366 cols
[2023-03-14 01:26:54] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-14 01:26:55] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-03-14 01:26:55] [INFO ] Invariant cache hit.
[2023-03-14 01:26:57] [INFO ] Implicit Places using invariants and state equation in 1802 ms returned []
Implicit Place search using SMT with State Equation took 2408 ms to find 0 implicit places.
[2023-03-14 01:26:57] [INFO ] Invariant cache hit.
[2023-03-14 01:26:58] [INFO ] Dead Transitions using invariants and state equation in 1555 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4019 ms. Remains : 1366/1366 places, 1627/1627 transitions.
Treatment of property NoC3x3-PT-4B-LTLFireability-08 finished in 24332 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))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1295 edges and 1382 vertex of which 848 / 1382 are part of one of the 33 SCC in 2 ms
Free SCC test removed 815 places
Ensure Unique test removed 956 transitions
Reduce isomorphic transitions removed 956 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 566 transition count 681
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 25 place count 556 transition count 677
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 555 transition count 676
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 554 transition count 676
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 28 place count 554 transition count 639
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 102 place count 517 transition count 639
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 131 place count 488 transition count 578
Iterating global reduction 4 with 29 rules applied. Total rules applied 160 place count 488 transition count 578
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 160 place count 488 transition count 577
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 487 transition count 577
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 166 place count 483 transition count 571
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 483 transition count 571
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 372 place count 382 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 382 transition count 469
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 374 place count 381 transition count 468
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 372 vertex of which 46 / 372 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 11 rules applied. Total rules applied 385 place count 349 transition count 467
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 433 place count 348 transition count 420
Applied a total of 433 rules in 146 ms. Remains 348 /1382 variables (removed 1034) and now considering 420/1648 (removed 1228) transitions.
[2023-03-14 01:26:59] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
// Phase 1: matrix 388 rows 348 cols
[2023-03-14 01:26:59] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-14 01:26:59] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-14 01:26:59] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2023-03-14 01:26:59] [INFO ] Invariant cache hit.
[2023-03-14 01:26:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 01:27:00] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2023-03-14 01:27:00] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-14 01:27:00] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2023-03-14 01:27:00] [INFO ] Invariant cache hit.
[2023-03-14 01:27:00] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 348/1382 places, 420/1648 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1399 ms. Remains : 348/1382 places, 420/1648 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s187 1), p0:(EQ s118 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-09 finished in 1488 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(p1)&&p0))||X(p2)))'
Support contains 3 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1366 transition count 1632
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1366 transition count 1632
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 1366 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 1364 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 1364 transition count 1624
Applied a total of 42 rules in 201 ms. Remains 1364 /1382 variables (removed 18) and now considering 1624/1648 (removed 24) transitions.
// Phase 1: matrix 1624 rows 1364 cols
[2023-03-14 01:27:00] [INFO ] Computed 66 place invariants in 8 ms
[2023-03-14 01:27:01] [INFO ] Implicit Places using invariants in 741 ms returned []
[2023-03-14 01:27:01] [INFO ] Invariant cache hit.
[2023-03-14 01:27:03] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 2408 ms to find 0 implicit places.
[2023-03-14 01:27:03] [INFO ] Invariant cache hit.
[2023-03-14 01:27:05] [INFO ] Dead Transitions using invariants and state equation in 1832 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1364/1382 places, 1624/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4446 ms. Remains : 1364/1382 places, 1624/1648 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s617 1) (EQ s775 1)), p1:(AND (EQ s617 1) (EQ s775 1)), p2:(AND (OR (EQ s617 0) (EQ s775 0) (EQ s1088 0)) (EQ s617 1) (EQ s775 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1711 steps with 0 reset in 18 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-11 finished in 4713 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)||(p1&&F(p2)&&X(p3)))))'
Support contains 4 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1369 transition count 1635
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1369 transition count 1635
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 1369 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1368 transition count 1629
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1368 transition count 1629
Applied a total of 33 rules in 164 ms. Remains 1368 /1382 variables (removed 14) and now considering 1629/1648 (removed 19) transitions.
// Phase 1: matrix 1629 rows 1368 cols
[2023-03-14 01:27:05] [INFO ] Computed 66 place invariants in 8 ms
[2023-03-14 01:27:06] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-14 01:27:06] [INFO ] Invariant cache hit.
[2023-03-14 01:27:07] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 2150 ms to find 0 implicit places.
[2023-03-14 01:27:07] [INFO ] Invariant cache hit.
[2023-03-14 01:27:09] [INFO ] Dead Transitions using invariants and state equation in 1555 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1368/1382 places, 1629/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3871 ms. Remains : 1368/1382 places, 1629/1648 transitions.
Stuttering acceptance computed with spot in 351 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p0), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND p0 p1), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 3}]], initial=0, aps=[p0:(EQ s483 1), p1:(EQ s623 0), p2:(EQ s879 0), p3:(EQ s238 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1309 ms.
Product exploration explored 100000 steps with 33333 reset in 1069 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p3))))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p2)), (X (X p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p3)))))
Knowledge based reduction with 15 factoid took 353 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-4B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-4B-LTLFireability-12 finished in 7007 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 1 out of 1382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1298 edges and 1382 vertex of which 867 / 1382 are part of one of the 33 SCC in 2 ms
Free SCC test removed 834 places
Ensure Unique test removed 981 transitions
Reduce isomorphic transitions removed 981 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 1 place count 547 transition count 630
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 511 transition count 630
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 101 place count 483 transition count 570
Iterating global reduction 0 with 28 rules applied. Total rules applied 129 place count 483 transition count 570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 129 place count 483 transition count 569
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 131 place count 482 transition count 569
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 134 place count 479 transition count 565
Iterating global reduction 0 with 3 rules applied. Total rules applied 137 place count 479 transition count 565
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 333 place count 381 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 334 place count 380 transition count 466
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 371 vertex of which 48 / 371 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 344 place count 347 transition count 466
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 392 place count 347 transition count 418
Applied a total of 392 rules in 122 ms. Remains 347 /1382 variables (removed 1035) and now considering 418/1648 (removed 1230) transitions.
[2023-03-14 01:27:12] [INFO ] Flow matrix only has 385 transitions (discarded 33 similar events)
// Phase 1: matrix 385 rows 347 cols
[2023-03-14 01:27:12] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-14 01:27:12] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-14 01:27:12] [INFO ] Flow matrix only has 385 transitions (discarded 33 similar events)
[2023-03-14 01:27:12] [INFO ] Invariant cache hit.
[2023-03-14 01:27:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 01:27:13] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2023-03-14 01:27:13] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 01:27:13] [INFO ] Flow matrix only has 385 transitions (discarded 33 similar events)
[2023-03-14 01:27:13] [INFO ] Invariant cache hit.
[2023-03-14 01:27:14] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 347/1382 places, 418/1648 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1707 ms. Remains : 347/1382 places, 418/1648 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s141 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-13 finished in 1761 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(p0)))'
Support contains 1 out of 1382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1297 edges and 1382 vertex of which 866 / 1382 are part of one of the 33 SCC in 2 ms
Free SCC test removed 833 places
Ensure Unique test removed 979 transitions
Reduce isomorphic transitions removed 979 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 1 place count 548 transition count 632
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 512 transition count 632
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 102 place count 483 transition count 571
Iterating global reduction 0 with 29 rules applied. Total rules applied 131 place count 483 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 131 place count 483 transition count 570
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 133 place count 482 transition count 570
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 137 place count 478 transition count 564
Iterating global reduction 0 with 4 rules applied. Total rules applied 141 place count 478 transition count 564
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 337 place count 380 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 338 place count 379 transition count 465
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 370 vertex of which 48 / 370 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 348 place count 346 transition count 465
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 396 place count 346 transition count 417
Applied a total of 396 rules in 112 ms. Remains 346 /1382 variables (removed 1036) and now considering 417/1648 (removed 1231) transitions.
[2023-03-14 01:27:14] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
// Phase 1: matrix 385 rows 346 cols
[2023-03-14 01:27:14] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-14 01:27:14] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-14 01:27:14] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2023-03-14 01:27:14] [INFO ] Invariant cache hit.
[2023-03-14 01:27:14] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 01:27:15] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2023-03-14 01:27:15] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 01:27:15] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2023-03-14 01:27:15] [INFO ] Invariant cache hit.
[2023-03-14 01:27:15] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 346/1382 places, 417/1648 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1575 ms. Remains : 346/1382 places, 417/1648 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s63 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 86 steps with 1 reset in 4 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-14 finished in 1684 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(X(F((G(p0)||X(p1))))))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1367 transition count 1633
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1367 transition count 1633
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 1367 transition count 1627
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 1366 transition count 1626
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 1366 transition count 1626
Applied a total of 38 rules in 280 ms. Remains 1366 /1382 variables (removed 16) and now considering 1626/1648 (removed 22) transitions.
// Phase 1: matrix 1626 rows 1366 cols
[2023-03-14 01:27:16] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-14 01:27:16] [INFO ] Implicit Places using invariants in 832 ms returned []
[2023-03-14 01:27:16] [INFO ] Invariant cache hit.
[2023-03-14 01:27:18] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2395 ms to find 0 implicit places.
[2023-03-14 01:27:18] [INFO ] Invariant cache hit.
[2023-03-14 01:27:20] [INFO ] Dead Transitions using invariants and state equation in 1757 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1366/1382 places, 1626/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4434 ms. Remains : 1366/1382 places, 1626/1648 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s366 1), p1:(AND (EQ s366 0) (EQ s1260 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 911 ms.
Product exploration explored 100000 steps with 25000 reset in 829 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 01:27:22] [INFO ] Invariant cache hit.
[2023-03-14 01:27:22] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:27:23] [INFO ] [Nat]Absence check using 66 positive place invariants in 76 ms returned sat
[2023-03-14 01:27:24] [INFO ] After 1092ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:27:24] [INFO ] After 1197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-14 01:27:24] [INFO ] After 1711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 327 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=109 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1366 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1626/1626 transitions.
Applied a total of 0 rules in 67 ms. Remains 1366 /1366 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
[2023-03-14 01:27:25] [INFO ] Invariant cache hit.
[2023-03-14 01:27:25] [INFO ] Implicit Places using invariants in 756 ms returned []
[2023-03-14 01:27:25] [INFO ] Invariant cache hit.
[2023-03-14 01:27:27] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 2301 ms to find 0 implicit places.
[2023-03-14 01:27:27] [INFO ] Invariant cache hit.
[2023-03-14 01:27:29] [INFO ] Dead Transitions using invariants and state equation in 1658 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4028 ms. Remains : 1366/1366 places, 1626/1626 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8509 steps, including 6 resets, run visited all 2 properties in 155 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 796 ms.
Product exploration explored 100000 steps with 25000 reset in 812 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1366 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1366/1366 places, 1626/1626 transitions.
Graph (trivial) has 1274 edges and 1366 vertex of which 842 / 1366 are part of one of the 33 SCC in 1 ms
Free SCC test removed 809 places
Ensure Unique test removed 946 transitions
Reduce isomorphic transitions removed 946 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 557 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 557 transition count 679
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 8 place count 557 transition count 727
Deduced a syphon composed of 44 places in 2 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 46 place count 557 transition count 727
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 74 place count 529 transition count 665
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 102 place count 529 transition count 665
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 128 place count 503 transition count 605
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 154 place count 503 transition count 605
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 256 place count 503 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 257 place count 503 transition count 604
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 264 place count 496 transition count 597
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 271 place count 496 transition count 597
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 112 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 496 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 273 place count 496 transition count 602
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 274 place count 495 transition count 598
Deduced a syphon composed of 111 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 275 place count 495 transition count 598
Deduced a syphon composed of 111 places in 0 ms
Applied a total of 275 rules in 123 ms. Remains 495 /1366 variables (removed 871) and now considering 598/1626 (removed 1028) transitions.
[2023-03-14 01:27:32] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-14 01:27:32] [INFO ] Flow matrix only has 566 transitions (discarded 32 similar events)
// Phase 1: matrix 566 rows 495 cols
[2023-03-14 01:27:32] [INFO ] Computed 66 place invariants in 12 ms
[2023-03-14 01:27:32] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 495/1366 places, 598/1626 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 688 ms. Remains : 495/1366 places, 598/1626 transitions.
Support contains 2 out of 1366 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1626/1626 transitions.
Applied a total of 0 rules in 53 ms. Remains 1366 /1366 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
// Phase 1: matrix 1626 rows 1366 cols
[2023-03-14 01:27:32] [INFO ] Computed 66 place invariants in 19 ms
[2023-03-14 01:27:33] [INFO ] Implicit Places using invariants in 673 ms returned []
[2023-03-14 01:27:33] [INFO ] Invariant cache hit.
[2023-03-14 01:27:35] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2405 ms to find 0 implicit places.
[2023-03-14 01:27:35] [INFO ] Invariant cache hit.
[2023-03-14 01:27:36] [INFO ] Dead Transitions using invariants and state equation in 1608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4070 ms. Remains : 1366/1366 places, 1626/1626 transitions.
Treatment of property NoC3x3-PT-4B-LTLFireability-15 finished in 21381 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(X(X((p0||G(F(p1)))))))'
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(X(F((G(p0)||X(p1))))))'
Found a Shortening insensitive property : NoC3x3-PT-4B-LTLFireability-15
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1295 edges and 1382 vertex of which 851 / 1382 are part of one of the 33 SCC in 1 ms
Free SCC test removed 818 places
Ensure Unique test removed 961 transitions
Reduce isomorphic transitions removed 961 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 563 transition count 680
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 557 transition count 679
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 556 transition count 677
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 555 transition count 677
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 18 place count 555 transition count 640
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 92 place count 518 transition count 640
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 120 place count 490 transition count 580
Iterating global reduction 4 with 28 rules applied. Total rules applied 148 place count 490 transition count 580
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 148 place count 490 transition count 579
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 489 transition count 579
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 153 place count 486 transition count 574
Iterating global reduction 4 with 3 rules applied. Total rules applied 156 place count 486 transition count 574
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 204 rules applied. Total rules applied 360 place count 384 transition count 472
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 362 place count 384 transition count 470
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 364 place count 383 transition count 473
Applied a total of 364 rules in 76 ms. Remains 383 /1382 variables (removed 999) and now considering 473/1648 (removed 1175) transitions.
[2023-03-14 01:27:37] [INFO ] Flow matrix only has 441 transitions (discarded 32 similar events)
// Phase 1: matrix 441 rows 383 cols
[2023-03-14 01:27:37] [INFO ] Computed 66 place invariants in 1 ms
[2023-03-14 01:27:38] [INFO ] Implicit Places using invariants in 321 ms returned [10, 44, 85, 123, 178, 240, 281, 318, 363]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 322 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 374/1382 places, 473/1648 transitions.
Graph (trivial) has 267 edges and 374 vertex of which 46 / 374 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 350 transition count 426
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 350 transition count 424
Applied a total of 5 rules in 14 ms. Remains 350 /374 variables (removed 24) and now considering 424/473 (removed 49) transitions.
[2023-03-14 01:27:38] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
// Phase 1: matrix 392 rows 350 cols
[2023-03-14 01:27:38] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-14 01:27:38] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-14 01:27:38] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-14 01:27:38] [INFO ] Invariant cache hit.
[2023-03-14 01:27:38] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 01:27:38] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 350/1382 places, 424/1648 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1212 ms. Remains : 350/1382 places, 424/1648 transitions.
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s78 1), p1:(AND (EQ s78 0) (EQ s324 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24215 reset in 1629 ms.
Product exploration explored 100000 steps with 24131 reset in 1218 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 354 steps, including 4 resets, run visited all 2 properties in 9 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 424/424 transitions.
Applied a total of 0 rules in 5 ms. Remains 350 /350 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2023-03-14 01:27:42] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-14 01:27:42] [INFO ] Invariant cache hit.
[2023-03-14 01:27:42] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-14 01:27:42] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-14 01:27:42] [INFO ] Invariant cache hit.
[2023-03-14 01:27:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 01:27:43] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
[2023-03-14 01:27:43] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-14 01:27:43] [INFO ] Invariant cache hit.
[2023-03-14 01:27:44] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1581 ms. Remains : 350/350 places, 424/424 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 135 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 01:27:44] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-14 01:27:44] [INFO ] Invariant cache hit.
[2023-03-14 01:27:44] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:27:44] [INFO ] [Nat]Absence check using 57 positive place invariants in 22 ms returned sat
[2023-03-14 01:27:44] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:27:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 01:27:44] [INFO ] After 22ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 01:27:44] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-14 01:27:44] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 424/424 transitions.
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 350 transition count 391
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 348 transition count 419
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 348 transition count 417
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 348 transition count 415
Free-agglomeration rule applied 176 times.
Iterating global reduction 2 with 176 rules applied. Total rules applied 217 place count 348 transition count 239
Reduce places removed 177 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 488 edges and 171 vertex of which 40 are kept as prefixes of interest. Removing 131 places using SCC suffix rule.2 ms
Discarding 131 places :
Also discarding 129 output transitions
Drop transitions removed 129 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 191 rules applied. Total rules applied 408 place count 40 transition count 97
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 33 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 446 place count 39 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 447 place count 39 transition count 60
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 448 place count 39 transition count 59
Applied a total of 448 rules in 125 ms. Remains 39 /350 variables (removed 311) and now considering 59/424 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 39/350 places, 59/424 transitions.
Finished random walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 284 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24119 reset in 1275 ms.
Product exploration explored 100000 steps with 24262 reset in 1203 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 424/424 transitions.
Applied a total of 0 rules in 9 ms. Remains 350 /350 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2023-03-14 01:27:48] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 01:27:48] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-14 01:27:48] [INFO ] Invariant cache hit.
[2023-03-14 01:27:49] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 426 ms. Remains : 350/350 places, 424/424 transitions.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 424/424 transitions.
Applied a total of 0 rules in 6 ms. Remains 350 /350 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2023-03-14 01:27:49] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-14 01:27:49] [INFO ] Invariant cache hit.
[2023-03-14 01:27:49] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-14 01:27:49] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-14 01:27:49] [INFO ] Invariant cache hit.
[2023-03-14 01:27:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 01:27:49] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2023-03-14 01:27:49] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-14 01:27:49] [INFO ] Invariant cache hit.
[2023-03-14 01:27:50] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1200 ms. Remains : 350/350 places, 424/424 transitions.
Treatment of property NoC3x3-PT-4B-LTLFireability-15 finished in 12977 ms.
[2023-03-14 01:27:50] [INFO ] Flatten gal took : 70 ms
[2023-03-14 01:27:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-14 01:27:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1382 places, 1648 transitions and 3929 arcs took 14 ms.
Total runtime 116096 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-4B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA NoC3x3-PT-4B-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678757311692

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 NoC3x3-PT-4B-LTLFireability-15
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for NoC3x3-PT-4B-LTLFireability-15
lola: result : true
lola: markings : 8
lola: fired transitions : 8
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 NoC3x3-PT-4B-LTLFireability-08
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-4B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-4B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3599 4/32 NoC3x3-PT-4B-LTLFireability-08 141579 m, 28315 m/sec, 451015 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-4B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-4B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3599 9/32 NoC3x3-PT-4B-LTLFireability-08 295924 m, 30869 m/sec, 997695 t fired, .

Time elapsed: 10 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-4B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-4B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3599 13/32 NoC3x3-PT-4B-LTLFireability-08 438778 m, 28570 m/sec, 1537977 t fired, .

Time elapsed: 15 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-4B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-4B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3599 18/32 NoC3x3-PT-4B-LTLFireability-08 602440 m, 32732 m/sec, 2077299 t fired, .

Time elapsed: 20 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-4B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-4B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3599 21/32 NoC3x3-PT-4B-LTLFireability-08 737174 m, 26946 m/sec, 2625587 t fired, .

Time elapsed: 25 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-4B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-4B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3599 26/32 NoC3x3-PT-4B-LTLFireability-08 888540 m, 30273 m/sec, 3168384 t fired, .

Time elapsed: 30 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-4B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-4B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3599 31/32 NoC3x3-PT-4B-LTLFireability-08 1072610 m, 36814 m/sec, 3697052 t fired, .

Time elapsed: 35 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for NoC3x3-PT-4B-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-4B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-4B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-4B-LTLFireability-08: LTL unknown AGGR
NoC3x3-PT-4B-LTLFireability-15: LTL true LTL model checker


Time elapsed: 40 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="NoC3x3-PT-4B"
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 NoC3x3-PT-4B, 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 r263-smll-167863538000284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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