Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127600276.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-4A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127600276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 06:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 144K May 5 16:51 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-4A-00
FORMULA_NAME NoC3x3-PT-4A-01
FORMULA_NAME NoC3x3-PT-4A-02
FORMULA_NAME NoC3x3-PT-4A-03
FORMULA_NAME NoC3x3-PT-4A-04
FORMULA_NAME NoC3x3-PT-4A-05
FORMULA_NAME NoC3x3-PT-4A-06
FORMULA_NAME NoC3x3-PT-4A-07
FORMULA_NAME NoC3x3-PT-4A-08
FORMULA_NAME NoC3x3-PT-4A-09
FORMULA_NAME NoC3x3-PT-4A-10
FORMULA_NAME NoC3x3-PT-4A-11
FORMULA_NAME NoC3x3-PT-4A-12
FORMULA_NAME NoC3x3-PT-4A-13
FORMULA_NAME NoC3x3-PT-4A-14
FORMULA_NAME NoC3x3-PT-4A-15

=== Now, execution of the tool begins

BK_START 1620957419156

Running Version 0
[2021-05-14 01:57:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 01:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 01:57:12] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2021-05-14 01:57:12] [INFO ] Transformed 293 places.
[2021-05-14 01:57:12] [INFO ] Transformed 608 transitions.
[2021-05-14 01:57:12] [INFO ] Found NUPN structural information;
[2021-05-14 01:57:12] [INFO ] Parsed PT model containing 293 places and 608 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 01:57:12] [INFO ] Initial state test concluded for 4 properties.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
FORMULA NoC3x3-PT-4A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 293 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 251 transition count 388
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 251 transition count 388
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 0 with 49 rules applied. Total rules applied 133 place count 251 transition count 339
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 141 place count 243 transition count 339
Applied a total of 141 rules in 55 ms. Remains 243 /293 variables (removed 50) and now considering 339/453 (removed 114) transitions.
// Phase 1: matrix 339 rows 243 cols
[2021-05-14 01:57:12] [INFO ] Computed 58 place invariants in 20 ms
[2021-05-14 01:57:12] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 339 rows 243 cols
[2021-05-14 01:57:12] [INFO ] Computed 58 place invariants in 4 ms
[2021-05-14 01:57:12] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
// Phase 1: matrix 339 rows 243 cols
[2021-05-14 01:57:12] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-14 01:57:12] [INFO ] Dead Transitions using invariants and state equation in 167 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/293 places, 339/453 transitions.
[2021-05-14 01:57:13] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-14 01:57:13] [INFO ] Flatten gal took : 61 ms
FORMULA NoC3x3-PT-4A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 01:57:13] [INFO ] Flatten gal took : 33 ms
[2021-05-14 01:57:13] [INFO ] Input system was already deterministic with 339 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 490 ms. (steps per millisecond=204 ) properties (out of 14) seen :13
Running SMT prover for 1 properties.
// Phase 1: matrix 339 rows 243 cols
[2021-05-14 01:57:13] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-14 01:57:13] [INFO ] [Real]Absence check using 58 positive place invariants in 8 ms returned sat
[2021-05-14 01:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:57:13] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-14 01:57:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 01:57:13] [INFO ] [Nat]Absence check using 58 positive place invariants in 7 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 339/339 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 231 transition count 327
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 231 transition count 327
Applied a total of 24 rules in 11 ms. Remains 231 /243 variables (removed 12) and now considering 327/339 (removed 12) transitions.
// Phase 1: matrix 327 rows 231 cols
[2021-05-14 01:57:14] [INFO ] Computed 58 place invariants in 6 ms
[2021-05-14 01:57:14] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 327 rows 231 cols
[2021-05-14 01:57:14] [INFO ] Computed 58 place invariants in 4 ms
[2021-05-14 01:57:14] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
// Phase 1: matrix 327 rows 231 cols
[2021-05-14 01:57:14] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 01:57:14] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Finished structural reductions, in 1 iterations. Remains : 231/243 places, 327/339 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4A-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s118 1), p0:(OR (EQ s171 0) (EQ s219 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 513 ms.
Product exploration explored 100000 steps with 33333 reset in 472 ms.
Graph (complete) has 778 edges and 231 vertex of which 230 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Knowledge obtained : [(NOT p1), p0]
java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, -F, /tmp/curaut11067896093658655226.hoa, --complement], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:138)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:112)
at fr.lip6.move.gal.application.SpotRunner.buildComplement(SpotRunner.java:532)
at fr.lip6.move.gal.application.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:367)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:174)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 368 ms.
Product exploration explored 100000 steps with 33333 reset in 425 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 231 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 231/231 places, 327/327 transitions.
Graph (trivial) has 140 edges and 231 vertex of which 75 / 231 are part of one of the 33 SCC in 3 ms
Free SCC test removed 42 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Applied a total of 1 rules in 17 ms. Remains 189 /231 variables (removed 42) and now considering 244/327 (removed 83) transitions.
[2021-05-14 01:57:31] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-14 01:57:31] [INFO ] Flow matrix only has 212 transitions (discarded 32 similar events)
// Phase 1: matrix 212 rows 189 cols
[2021-05-14 01:57:31] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:57:31] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Finished structural reductions, in 1 iterations. Remains : 189/231 places, 244/327 transitions.
Product exploration explored 100000 steps with 33333 reset in 1155 ms.
Product exploration explored 100000 steps with 33333 reset in 1116 ms.
[2021-05-14 01:57:33] [INFO ] Flatten gal took : 21 ms
[2021-05-14 01:57:33] [INFO ] Flatten gal took : 20 ms
[2021-05-14 01:57:33] [INFO ] Time to serialize gal into /tmp/LTL5633674278432378869.gal : 9 ms
[2021-05-14 01:57:33] [INFO ] Time to serialize properties into /tmp/LTL7674139588144497022.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5633674278432378869.gal, -t, CGAL, -LTL, /tmp/LTL7674139588144497022.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5633674278432378869.gal -t CGAL -LTL /tmp/LTL7674139588144497022.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((p219==0)||(p279==1))"))||(F("(p155==1)"))))))
Formula 0 simplified : !XX(G"((p219==0)||(p279==1))" | F"(p155==1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
52 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.564783,30668,1,0,7,70647,23,0,6286,79923,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NoC3x3-PT-4A-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property NoC3x3-PT-4A-00 finished in 20449 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&(p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 339/339 transitions.
Graph (trivial) has 140 edges and 243 vertex of which 75 / 243 are part of one of the 33 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Graph (complete) has 719 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 190 transition count 225
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 63 place count 168 transition count 225
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 77 place count 154 transition count 211
Iterating global reduction 2 with 14 rules applied. Total rules applied 91 place count 154 transition count 211
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 115 place count 154 transition count 187
Applied a total of 115 rules in 23 ms. Remains 154 /243 variables (removed 89) and now considering 187/339 (removed 152) transitions.
// Phase 1: matrix 187 rows 154 cols
[2021-05-14 01:57:45] [INFO ] Computed 48 place invariants in 1 ms
[2021-05-14 01:57:45] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2021-05-14 01:57:45] [INFO ] Computed 48 place invariants in 1 ms
[2021-05-14 01:57:45] [INFO ] State equation strengthened by 56 read => feed constraints.
[2021-05-14 01:57:46] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2021-05-14 01:57:46] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2021-05-14 01:57:46] [INFO ] Computed 48 place invariants in 1 ms
[2021-05-14 01:57:46] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 154/243 places, 187/339 transitions.
Stuttering acceptance computed with spot in 908 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-4A-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s94 0) (EQ s71 1)), p2:(AND (EQ s71 0) (EQ s94 1)), p1:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, 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-4A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-01 finished in 12698 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 339/339 transitions.
Graph (trivial) has 137 edges and 243 vertex of which 73 / 243 are part of one of the 32 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 721 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 191 transition count 228
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 61 place count 170 transition count 228
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 75 place count 156 transition count 214
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 156 transition count 214
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 112 place count 156 transition count 191
Applied a total of 112 rules in 23 ms. Remains 156 /243 variables (removed 87) and now considering 191/339 (removed 148) transitions.
// Phase 1: matrix 191 rows 156 cols
[2021-05-14 01:57:47] [INFO ] Computed 48 place invariants in 0 ms
[2021-05-14 01:57:47] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 191 rows 156 cols
[2021-05-14 01:57:47] [INFO ] Computed 48 place invariants in 1 ms
[2021-05-14 01:57:47] [INFO ] State equation strengthened by 53 read => feed constraints.
[2021-05-14 01:57:47] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2021-05-14 01:57:47] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 191 rows 156 cols
[2021-05-14 01:57:47] [INFO ] Computed 48 place invariants in 4 ms
[2021-05-14 01:57:47] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/243 places, 191/339 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s55 0) (NEQ s82 1)), p1:(OR (EQ s88 0) (EQ s119 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 16 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-03 finished in 426 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 339/339 transitions.
Graph (trivial) has 140 edges and 243 vertex of which 75 / 243 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Graph (complete) has 719 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 190 transition count 224
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 65 place count 167 transition count 224
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 78 place count 154 transition count 211
Iterating global reduction 2 with 13 rules applied. Total rules applied 91 place count 154 transition count 211
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 115 place count 154 transition count 187
Applied a total of 115 rules in 21 ms. Remains 154 /243 variables (removed 89) and now considering 187/339 (removed 152) transitions.
// Phase 1: matrix 187 rows 154 cols
[2021-05-14 01:57:47] [INFO ] Computed 48 place invariants in 1 ms
[2021-05-14 01:57:47] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2021-05-14 01:57:47] [INFO ] Computed 48 place invariants in 1 ms
[2021-05-14 01:57:47] [INFO ] State equation strengthened by 56 read => feed constraints.
[2021-05-14 01:57:47] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2021-05-14 01:57:47] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2021-05-14 01:57:47] [INFO ] Computed 48 place invariants in 0 ms
[2021-05-14 01:57:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 154/243 places, 187/339 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-05 automaton TGBA [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:(OR (EQ s38 0) (EQ s102 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 71 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-05 finished in 380 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 339/339 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 339
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 230 transition count 327
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 230 transition count 327
Applied a total of 25 rules in 5 ms. Remains 230 /243 variables (removed 13) and now considering 327/339 (removed 12) transitions.
// Phase 1: matrix 327 rows 230 cols
[2021-05-14 01:57:47] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:57:48] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 327 rows 230 cols
[2021-05-14 01:57:48] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:57:48] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 327 rows 230 cols
[2021-05-14 01:57:48] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:57:48] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Finished structural reductions, in 1 iterations. Remains : 230/243 places, 327/339 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-4A-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s33 0) (EQ s32 1)), p0:(OR (EQ s203 0) (EQ s20 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 424 ms.
Product exploration explored 100000 steps with 25000 reset in 420 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 350 ms.
Product exploration explored 100000 steps with 25000 reset in 378 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Support contains 4 out of 230 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 230/230 places, 327/327 transitions.
Graph (trivial) has 137 edges and 230 vertex of which 73 / 230 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Applied a total of 1 rules in 8 ms. Remains 189 /230 variables (removed 41) and now considering 246/327 (removed 81) transitions.
[2021-05-14 01:57:50] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 01:57:50] [INFO ] Flow matrix only has 215 transitions (discarded 31 similar events)
// Phase 1: matrix 215 rows 189 cols
[2021-05-14 01:57:50] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:57:50] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 189/230 places, 246/327 transitions.
Product exploration explored 100000 steps with 25000 reset in 994 ms.
Product exploration explored 100000 steps with 25000 reset in 1017 ms.
[2021-05-14 01:57:52] [INFO ] Flatten gal took : 32 ms
[2021-05-14 01:57:52] [INFO ] Flatten gal took : 18 ms
[2021-05-14 01:58:05] [INFO ] Time to serialize gal into /tmp/LTL8285642568473059841.gal : 1192 ms
[2021-05-14 01:58:05] [INFO ] Time to serialize properties into /tmp/LTL6115623039765813444.ltl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8285642568473059841.gal, -t, CGAL, -LTL, /tmp/LTL6115623039765813444.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8285642568473059841.gal -t CGAL -LTL /tmp/LTL6115623039765813444.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(X("((p261==0)||(p24==1))")))&&(F("((p41==0)||(p40==1))")))))
Formula 0 simplified : !X(XX"((p261==0)||(p24==1))" & F"((p41==0)||(p40==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
58 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.622297,32212,1,0,8,78563,17,0,6299,89286,15
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NoC3x3-PT-4A-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property NoC3x3-PT-4A-09 finished in 17806 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 339/339 transitions.
Graph (trivial) has 140 edges and 243 vertex of which 75 / 243 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Graph (complete) has 719 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 43 place count 190 transition count 223
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 67 place count 166 transition count 223
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 80 place count 153 transition count 210
Iterating global reduction 2 with 13 rules applied. Total rules applied 93 place count 153 transition count 210
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 117 place count 153 transition count 186
Applied a total of 117 rules in 15 ms. Remains 153 /243 variables (removed 90) and now considering 186/339 (removed 153) transitions.
// Phase 1: matrix 186 rows 153 cols
[2021-05-14 01:58:05] [INFO ] Computed 48 place invariants in 1 ms
[2021-05-14 01:58:05] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 186 rows 153 cols
[2021-05-14 01:58:05] [INFO ] Computed 48 place invariants in 10 ms
[2021-05-14 01:58:05] [INFO ] State equation strengthened by 56 read => feed constraints.
[2021-05-14 01:58:05] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2021-05-14 01:58:06] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 186 rows 153 cols
[2021-05-14 01:58:06] [INFO ] Computed 48 place invariants in 1 ms
[2021-05-14 01:58:06] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 153/243 places, 186/339 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s69 0) (NEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-10 finished in 461 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 339/339 transitions.
Graph (trivial) has 137 edges and 243 vertex of which 73 / 243 are part of one of the 32 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 721 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 43 place count 191 transition count 225
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 67 place count 167 transition count 225
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 81 place count 153 transition count 211
Iterating global reduction 2 with 14 rules applied. Total rules applied 95 place count 153 transition count 211
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 118 place count 153 transition count 188
Applied a total of 118 rules in 14 ms. Remains 153 /243 variables (removed 90) and now considering 188/339 (removed 151) transitions.
// Phase 1: matrix 188 rows 153 cols
[2021-05-14 01:58:06] [INFO ] Computed 48 place invariants in 1 ms
[2021-05-14 01:58:06] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 188 rows 153 cols
[2021-05-14 01:58:06] [INFO ] Computed 48 place invariants in 1 ms
[2021-05-14 01:58:06] [INFO ] State equation strengthened by 53 read => feed constraints.
[2021-05-14 01:58:06] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2021-05-14 01:58:06] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 188 rows 153 cols
[2021-05-14 01:58:06] [INFO ] Computed 48 place invariants in 3 ms
[2021-05-14 01:58:06] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 153/243 places, 188/339 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s58 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-13 finished in 443 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 339/339 transitions.
Graph (trivial) has 140 edges and 243 vertex of which 75 / 243 are part of one of the 33 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Graph (complete) has 719 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 190 transition count 224
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 65 place count 167 transition count 224
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 78 place count 154 transition count 211
Iterating global reduction 2 with 13 rules applied. Total rules applied 91 place count 154 transition count 211
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 115 place count 154 transition count 187
Applied a total of 115 rules in 13 ms. Remains 154 /243 variables (removed 89) and now considering 187/339 (removed 152) transitions.
// Phase 1: matrix 187 rows 154 cols
[2021-05-14 01:58:06] [INFO ] Computed 48 place invariants in 0 ms
[2021-05-14 01:58:06] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2021-05-14 01:58:06] [INFO ] Computed 48 place invariants in 1 ms
[2021-05-14 01:58:06] [INFO ] State equation strengthened by 56 read => feed constraints.
[2021-05-14 01:58:06] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2021-05-14 01:58:06] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2021-05-14 01:58:06] [INFO ] Computed 48 place invariants in 2 ms
[2021-05-14 01:58:06] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 154/243 places, 187/339 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s66 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-14 finished in 386 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620957488028

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-4A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127600276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-4A.tgz
mv NoC3x3-PT-4A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;