fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r261-smll-167863536200340
Last Updated
May 14, 2023

About the Execution of ITS-Tools for NoC3x3-PT-8A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
403.312 33382.00 56316.00 477.80 FFFFFFFFFFFFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536200340.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 itstools
Input is NoC3x3-PT-8A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536200340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.5K Feb 26 09:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 09:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 09:51 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:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 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 745K 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-8A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678906261869

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 18:51:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 18:51:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 18:51:05] [INFO ] Load time of PNML (sax parser for PT used): 405 ms
[2023-03-15 18:51:05] [INFO ] Transformed 317 places.
[2023-03-15 18:51:05] [INFO ] Transformed 4293 transitions.
[2023-03-15 18:51:05] [INFO ] Found NUPN structural information;
[2023-03-15 18:51:05] [INFO ] Parsed PT model containing 317 places and 4293 transitions and 9691 arcs in 595 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 3607 transitions
Reduce redundant transitions removed 3607 transitions.
FORMULA NoC3x3-PT-8A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 686/686 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 263 transition count 568
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 263 transition count 568
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 164 place count 263 transition count 512
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 173 place count 254 transition count 512
Applied a total of 173 rules in 120 ms. Remains 254 /317 variables (removed 63) and now considering 512/686 (removed 174) transitions.
// Phase 1: matrix 512 rows 254 cols
[2023-03-15 18:51:06] [INFO ] Computed 57 place invariants in 37 ms
[2023-03-15 18:51:07] [INFO ] Implicit Places using invariants in 689 ms returned []
[2023-03-15 18:51:07] [INFO ] Invariant cache hit.
[2023-03-15 18:51:07] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
[2023-03-15 18:51:07] [INFO ] Invariant cache hit.
[2023-03-15 18:51:08] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 254/317 places, 512/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2070 ms. Remains : 254/317 places, 512/686 transitions.
Support contains 25 out of 254 places after structural reductions.
[2023-03-15 18:51:08] [INFO ] Flatten gal took : 152 ms
[2023-03-15 18:51:08] [INFO ] Flatten gal took : 80 ms
[2023-03-15 18:51:09] [INFO ] Input system was already deterministic with 512 transitions.
Support contains 24 out of 254 places (down from 25) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 18:51:09] [INFO ] Invariant cache hit.
[2023-03-15 18:51:09] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-15 18:51:10] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 18:51:10] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-15 18:51:10] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 18:51:10] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-15 18:51:10] [INFO ] After 499ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 512/512 transitions.
Graph (trivial) has 160 edges and 254 vertex of which 73 / 254 are part of one of the 32 SCC in 5 ms
Free SCC test removed 41 places
Drop transitions removed 91 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 211 transition count 348
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 211 transition count 348
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 49 place count 189 transition count 326
Drop transitions removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 0 with 107 rules applied. Total rules applied 156 place count 189 transition count 219
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 180 place count 189 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 181 place count 188 transition count 218
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 33 rules applied. Total rules applied 214 place count 179 transition count 194
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 238 place count 155 transition count 194
Applied a total of 238 rules in 136 ms. Remains 155 /254 variables (removed 99) and now considering 194/512 (removed 318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 155/254 places, 194/512 transitions.
Finished random walk after 215 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=71 )
FORMULA NoC3x3-PT-8A-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 1 stabilizing places and 1 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 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 252 transition count 510
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 510
Applied a total of 4 rules in 11 ms. Remains 252 /254 variables (removed 2) and now considering 510/512 (removed 2) transitions.
// Phase 1: matrix 510 rows 252 cols
[2023-03-15 18:51:11] [INFO ] Computed 57 place invariants in 8 ms
[2023-03-15 18:51:11] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-15 18:51:11] [INFO ] Invariant cache hit.
[2023-03-15 18:51:12] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
[2023-03-15 18:51:12] [INFO ] Invariant cache hit.
[2023-03-15 18:51:12] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/254 places, 510/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1338 ms. Remains : 252/254 places, 510/512 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-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:(EQ s47 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]]
Product exploration explored 100000 steps with 546 reset in 968 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-00 finished in 2668 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(F((F(p0)&&(G(F(p1)) U G(p2))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 253 transition count 511
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 253 transition count 511
Applied a total of 2 rules in 9 ms. Remains 253 /254 variables (removed 1) and now considering 511/512 (removed 1) transitions.
// Phase 1: matrix 511 rows 253 cols
[2023-03-15 18:51:13] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 18:51:13] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-15 18:51:13] [INFO ] Invariant cache hit.
[2023-03-15 18:51:14] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-15 18:51:14] [INFO ] Invariant cache hit.
[2023-03-15 18:51:14] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/254 places, 511/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 828 ms. Remains : 253/254 places, 511/512 transitions.
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s16 0)), p2:(OR (EQ s92 1) (EQ s170 1)), p1:(EQ s170 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25033 reset in 1212 ms.
Stack based approach found an accepted trace after 37 steps with 9 reset with depth 4 and stack size 4 in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-02 finished in 2463 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 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Graph (trivial) has 164 edges and 254 vertex of which 75 / 254 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 202 transition count 347
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 178 transition count 347
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 176 transition count 345
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 176 transition count 345
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 116 place count 153 transition count 322
Drop transitions removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 252 place count 153 transition count 186
Applied a total of 252 rules in 74 ms. Remains 153 /254 variables (removed 101) and now considering 186/512 (removed 326) transitions.
// Phase 1: matrix 186 rows 153 cols
[2023-03-15 18:51:16] [INFO ] Computed 48 place invariants in 1 ms
[2023-03-15 18:51:16] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-15 18:51:16] [INFO ] Invariant cache hit.
[2023-03-15 18:51:16] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 18:51:16] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2023-03-15 18:51:16] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 18:51:16] [INFO ] Invariant cache hit.
[2023-03-15 18:51:17] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/254 places, 186/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 886 ms. Remains : 153/254 places, 186/512 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-03 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 s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-03 finished in 1010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((p1&&X(p0))))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 252 transition count 510
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 510
Applied a total of 4 rules in 15 ms. Remains 252 /254 variables (removed 2) and now considering 510/512 (removed 2) transitions.
// Phase 1: matrix 510 rows 252 cols
[2023-03-15 18:51:17] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 18:51:17] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-15 18:51:17] [INFO ] Invariant cache hit.
[2023-03-15 18:51:18] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
[2023-03-15 18:51:18] [INFO ] Invariant cache hit.
[2023-03-15 18:51:18] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/254 places, 510/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1412 ms. Remains : 252/254 places, 510/512 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s130 1), p1:(EQ s15 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 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-04 finished in 1567 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(F((((X(p0) U p1) U G(p1))&&X(G(p1))&&p2))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 252 transition count 510
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 510
Applied a total of 4 rules in 12 ms. Remains 252 /254 variables (removed 2) and now considering 510/512 (removed 2) transitions.
[2023-03-15 18:51:18] [INFO ] Invariant cache hit.
[2023-03-15 18:51:19] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-15 18:51:19] [INFO ] Invariant cache hit.
[2023-03-15 18:51:19] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2023-03-15 18:51:19] [INFO ] Invariant cache hit.
[2023-03-15 18:51:20] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/254 places, 510/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1381 ms. Remains : 252/254 places, 510/512 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s68 1), p1:(EQ s134 1), p0:(EQ s194 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 788 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-05 finished in 2456 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 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 252 transition count 510
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 510
Applied a total of 4 rules in 8 ms. Remains 252 /254 variables (removed 2) and now considering 510/512 (removed 2) transitions.
[2023-03-15 18:51:21] [INFO ] Invariant cache hit.
[2023-03-15 18:51:21] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-15 18:51:21] [INFO ] Invariant cache hit.
[2023-03-15 18:51:21] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2023-03-15 18:51:21] [INFO ] Invariant cache hit.
[2023-03-15 18:51:22] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/254 places, 510/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1289 ms. Remains : 252/254 places, 510/512 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-07 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:(EQ s138 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-8A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-07 finished in 1440 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(G(p1)))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Graph (trivial) has 163 edges and 254 vertex of which 75 / 254 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 202 transition count 347
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 178 transition count 347
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 176 transition count 345
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 176 transition count 345
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 114 place count 154 transition count 323
Drop transitions removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 250 place count 154 transition count 187
Applied a total of 250 rules in 50 ms. Remains 154 /254 variables (removed 100) and now considering 187/512 (removed 325) transitions.
// Phase 1: matrix 187 rows 154 cols
[2023-03-15 18:51:22] [INFO ] Computed 48 place invariants in 2 ms
[2023-03-15 18:51:22] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-15 18:51:22] [INFO ] Invariant cache hit.
[2023-03-15 18:51:23] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 18:51:23] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2023-03-15 18:51:23] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-15 18:51:23] [INFO ] Invariant cache hit.
[2023-03-15 18:51:23] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/254 places, 187/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 836 ms. Remains : 154/254 places, 187/512 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-08 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s41 1), p1:(EQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-08 finished in 1007 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 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Graph (trivial) has 163 edges and 254 vertex of which 75 / 254 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 202 transition count 347
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 178 transition count 347
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 176 transition count 345
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 176 transition count 345
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 114 place count 154 transition count 323
Drop transitions removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 250 place count 154 transition count 187
Applied a total of 250 rules in 49 ms. Remains 154 /254 variables (removed 100) and now considering 187/512 (removed 325) transitions.
// Phase 1: matrix 187 rows 154 cols
[2023-03-15 18:51:23] [INFO ] Computed 48 place invariants in 7 ms
[2023-03-15 18:51:23] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-15 18:51:23] [INFO ] Invariant cache hit.
[2023-03-15 18:51:24] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 18:51:24] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2023-03-15 18:51:24] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 18:51:24] [INFO ] Invariant cache hit.
[2023-03-15 18:51:24] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/254 places, 187/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 881 ms. Remains : 154/254 places, 187/512 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-09 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:(EQ s28 1), p1:(OR (NEQ s10 1) (NEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-09 finished in 1057 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)||G((F(p1)&&X(G(p2)))))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Graph (trivial) has 163 edges and 254 vertex of which 75 / 254 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 202 transition count 347
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 178 transition count 347
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 176 transition count 345
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 176 transition count 345
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 114 place count 154 transition count 323
Drop transitions removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 250 place count 154 transition count 187
Applied a total of 250 rules in 38 ms. Remains 154 /254 variables (removed 100) and now considering 187/512 (removed 325) transitions.
// Phase 1: matrix 187 rows 154 cols
[2023-03-15 18:51:24] [INFO ] Computed 48 place invariants in 1 ms
[2023-03-15 18:51:24] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-15 18:51:24] [INFO ] Invariant cache hit.
[2023-03-15 18:51:25] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 18:51:25] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2023-03-15 18:51:25] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 18:51:25] [INFO ] Invariant cache hit.
[2023-03-15 18:51:25] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/254 places, 187/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 879 ms. Remains : 154/254 places, 187/512 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s136 1), p2:(EQ s27 0), p1:(EQ s27 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-10 finished in 1020 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)||G(p1))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Graph (trivial) has 162 edges and 254 vertex of which 75 / 254 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 202 transition count 347
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 178 transition count 347
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 176 transition count 345
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 176 transition count 345
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 112 place count 155 transition count 324
Drop transitions removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 248 place count 155 transition count 188
Applied a total of 248 rules in 38 ms. Remains 155 /254 variables (removed 99) and now considering 188/512 (removed 324) transitions.
// Phase 1: matrix 188 rows 155 cols
[2023-03-15 18:51:25] [INFO ] Computed 48 place invariants in 2 ms
[2023-03-15 18:51:25] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-15 18:51:25] [INFO ] Invariant cache hit.
[2023-03-15 18:51:26] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 18:51:26] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2023-03-15 18:51:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 18:51:26] [INFO ] Invariant cache hit.
[2023-03-15 18:51:26] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/254 places, 188/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 893 ms. Remains : 155/254 places, 188/512 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s107 1), p1:(AND (EQ s104 0) (EQ s86 0))], nbAcceptance=2, 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 10 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-11 finished in 967 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(p2))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 252 transition count 510
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 510
Applied a total of 4 rules in 7 ms. Remains 252 /254 variables (removed 2) and now considering 510/512 (removed 2) transitions.
// Phase 1: matrix 510 rows 252 cols
[2023-03-15 18:51:26] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 18:51:27] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-15 18:51:27] [INFO ] Invariant cache hit.
[2023-03-15 18:51:27] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2023-03-15 18:51:27] [INFO ] Invariant cache hit.
[2023-03-15 18:51:28] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/254 places, 510/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1409 ms. Remains : 252/254 places, 510/512 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s169 1), p0:(EQ s64 1), p2:(EQ s91 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-13 finished in 1668 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(F(p0)))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 252 transition count 510
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 510
Applied a total of 4 rules in 7 ms. Remains 252 /254 variables (removed 2) and now considering 510/512 (removed 2) transitions.
[2023-03-15 18:51:28] [INFO ] Invariant cache hit.
[2023-03-15 18:51:28] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-15 18:51:28] [INFO ] Invariant cache hit.
[2023-03-15 18:51:29] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2023-03-15 18:51:29] [INFO ] Invariant cache hit.
[2023-03-15 18:51:29] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/254 places, 510/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1447 ms. Remains : 252/254 places, 510/512 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s178 1) (EQ s188 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]]
Product exploration explored 100000 steps with 60 reset in 782 ms.
Stack based approach found an accepted trace after 88 steps with 0 reset with depth 89 and stack size 89 in 2 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-14 finished in 2351 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(F((p0&&X(F(!p1))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 512/512 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 252 transition count 510
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 510
Applied a total of 4 rules in 4 ms. Remains 252 /254 variables (removed 2) and now considering 510/512 (removed 2) transitions.
[2023-03-15 18:51:30] [INFO ] Invariant cache hit.
[2023-03-15 18:51:30] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-15 18:51:30] [INFO ] Invariant cache hit.
[2023-03-15 18:51:31] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-15 18:51:31] [INFO ] Invariant cache hit.
[2023-03-15 18:51:31] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/254 places, 510/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 784 ms. Remains : 252/254 places, 510/512 transitions.
Stuttering acceptance computed with spot in 106 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s43 1), p0:(OR (NEQ s214 1) (NEQ s217 1) (NEQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1369 ms.
Product exploration explored 100000 steps with 33333 reset in 1137 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 4 factoid took 98 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-8A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8A-LTLFireability-15 finished in 3521 ms.
All properties solved by simple procedures.
Total runtime 28977 ms.

BK_STOP 1678906295251

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-8A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-8A, 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 r261-smll-167863536200340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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