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-162089127700341.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-8A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127700341
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.2K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 07:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 07:54 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 745K 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-8A-00
FORMULA_NAME NoC3x3-PT-8A-01
FORMULA_NAME NoC3x3-PT-8A-02
FORMULA_NAME NoC3x3-PT-8A-03
FORMULA_NAME NoC3x3-PT-8A-04
FORMULA_NAME NoC3x3-PT-8A-05
FORMULA_NAME NoC3x3-PT-8A-06
FORMULA_NAME NoC3x3-PT-8A-07
FORMULA_NAME NoC3x3-PT-8A-08
FORMULA_NAME NoC3x3-PT-8A-09
FORMULA_NAME NoC3x3-PT-8A-10
FORMULA_NAME NoC3x3-PT-8A-11
FORMULA_NAME NoC3x3-PT-8A-12
FORMULA_NAME NoC3x3-PT-8A-13
FORMULA_NAME NoC3x3-PT-8A-14
FORMULA_NAME NoC3x3-PT-8A-15

=== Now, execution of the tool begins

BK_START 1620974831222

Running Version 0
[2021-05-14 06:47:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 06:47:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 06:47:19] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2021-05-14 06:47:19] [INFO ] Transformed 317 places.
[2021-05-14 06:47:19] [INFO ] Transformed 4293 transitions.
[2021-05-14 06:47:19] [INFO ] Found NUPN structural information;
[2021-05-14 06:47:19] [INFO ] Parsed PT model containing 317 places and 4293 transitions in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 06:47:19] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 3607 transitions
Reduce redundant transitions removed 3607 transitions.
FORMULA NoC3x3-PT-8A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 686/686 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 261 transition count 562
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 261 transition count 562
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 164 place count 261 transition count 510
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 173 place count 252 transition count 510
Applied a total of 173 rules in 53 ms. Remains 252 /317 variables (removed 65) and now considering 510/686 (removed 176) transitions.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:47:19] [INFO ] Computed 57 place invariants in 14 ms
[2021-05-14 06:47:19] [INFO ] Implicit Places using invariants in 234 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:47:19] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-14 06:47:20] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:47:20] [INFO ] Computed 57 place invariants in 5 ms
[2021-05-14 06:47:20] [INFO ] Dead Transitions using invariants and state equation in 288 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/317 places, 510/686 transitions.
[2021-05-14 06:47:20] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-14 06:47:20] [INFO ] Flatten gal took : 75 ms
FORMULA NoC3x3-PT-8A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 06:47:20] [INFO ] Flatten gal took : 37 ms
[2021-05-14 06:47:20] [INFO ] Input system was already deterministic with 510 transitions.
Finished random walk after 7546 steps, including 0 resets, run visited all 23 properties in 71 ms. (steps per millisecond=106 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G((X(X(p0)) U (p1 U p0))) U p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:47:21] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 06:47:21] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:47:21] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 06:47:21] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:47:21] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 06:47:21] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 424 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={1} source=0 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 6}, { cond=(NOT p1), acceptance={1} source=3 dest: 7}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=8 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=9 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=9 dest: 2}]], initial=0, aps=[p1:(EQ s68 0), p0:(EQ s165 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 385 reset in 595 ms.
Stack based approach found an accepted trace after 5645 steps with 25 reset with depth 214 and stack size 210 in 32 ms.
FORMULA NoC3x3-PT-8A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-01 finished in 1645 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1)&&X((F(!p0) U p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:47:22] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 06:47:22] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:47:22] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 06:47:22] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:47:23] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:47:23] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), p0]
Running random walk in product with property : NoC3x3-PT-8A-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s99 1), p1:(EQ s222 1), p2:(EQ s194 1)], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-02 finished in 743 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:47:23] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 06:47:23] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:47:23] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:47:23] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:47:23] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 06:47:23] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s243 1), p1:(NEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 780 ms.
Product exploration explored 100000 steps with 50000 reset in 810 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 776 ms.
Product exploration explored 100000 steps with 50000 reset in 783 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 252 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Graph (trivial) has 163 edges and 252 vertex of which 75 / 252 are part of one of the 33 SCC in 3 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 210 transition count 378
Deduced a syphon composed of 22 places in 1 ms
Drop transitions removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 0 with 112 rules applied. Total rules applied 135 place count 210 transition count 266
Deduced a syphon composed of 22 places in 1 ms
Applied a total of 135 rules in 40 ms. Remains 210 /252 variables (removed 42) and now considering 266/510 (removed 244) transitions.
[2021-05-14 06:47:33] [INFO ] Redundant transitions in 11 ms returned []
[2021-05-14 06:47:33] [INFO ] Flow matrix only has 234 transitions (discarded 32 similar events)
// Phase 1: matrix 234 rows 210 cols
[2021-05-14 06:47:33] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 06:47:33] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Finished structural reductions, in 1 iterations. Remains : 210/252 places, 266/510 transitions.
Product exploration explored 100000 steps with 50000 reset in 1188 ms.
Product exploration explored 100000 steps with 50000 reset in 1171 ms.
[2021-05-14 06:47:36] [INFO ] Flatten gal took : 32 ms
[2021-05-14 06:47:36] [INFO ] Flatten gal took : 28 ms
[2021-05-14 06:47:36] [INFO ] Time to serialize gal into /tmp/LTL8263309167956985906.gal : 13 ms
[2021-05-14 06:47:36] [INFO ] Time to serialize properties into /tmp/LTL8153360300761771189.ltl : 0 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/LTL8263309167956985906.gal, -t, CGAL, -LTL, /tmp/LTL8153360300761771189.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/LTL8263309167956985906.gal -t CGAL -LTL /tmp/LTL8153360300761771189.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p308!=1)")||(G(F("(p20!=1)")))))))
Formula 0 simplified : !XF("(p308!=1)" | GF"(p20!=1)")
Detected timeout of ITS tools.
[2021-05-14 06:47:51] [INFO ] Flatten gal took : 27 ms
[2021-05-14 06:47:51] [INFO ] Applying decomposition
[2021-05-14 06:47:51] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14003880185298670665.txt, -o, /tmp/graph14003880185298670665.bin, -w, /tmp/graph14003880185298670665.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14003880185298670665.bin, -l, -1, -v, -w, /tmp/graph14003880185298670665.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 06:47:51] [INFO ] Decomposing Gal with order
[2021-05-14 06:47:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 06:47:51] [INFO ] Removed a total of 270 redundant transitions.
[2021-05-14 06:47:51] [INFO ] Flatten gal took : 70 ms
[2021-05-14 06:47:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 9 ms.
[2021-05-14 06:47:51] [INFO ] Time to serialize gal into /tmp/LTL13848510811898565060.gal : 12 ms
[2021-05-14 06:47:51] [INFO ] Time to serialize properties into /tmp/LTL6168361800315456003.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/LTL13848510811898565060.gal, -t, CGAL, -LTL, /tmp/LTL6168361800315456003.ltl, -c, -stutter-deadlock], 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/LTL13848510811898565060.gal -t CGAL -LTL /tmp/LTL6168361800315456003.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i8.u41.p308!=1)")||(G(F("(i0.u2.p20!=1)")))))))
Formula 0 simplified : !XF("(i8.u41.p308!=1)" | GF"(i0.u2.p20!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16780649912659823325
[2021-05-14 06:48:06] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16780649912659823325
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16780649912659823325]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16780649912659823325] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16780649912659823325] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NoC3x3-PT-8A-03 finished in 44539 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((G(F(!p1)) U G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:07] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:48:08] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:08] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:48:08] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:08] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 06:48:08] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 6302 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), p1, (AND p1 p2)]
Running random walk in product with property : NoC3x3-PT-8A-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s12 1), p2:(EQ s130 1), p1:(NEQ s243 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 888 reset in 435 ms.
Stack based approach found an accepted trace after 76 steps with 0 reset with depth 77 and stack size 77 in 0 ms.
FORMULA NoC3x3-PT-8A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-05 finished in 7297 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(X(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:15] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 06:48:15] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:15] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:48:15] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:15] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:48:15] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : NoC3x3-PT-8A-06 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s43 0), p1:(NEQ s217 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 117 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-06 finished in 622 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 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Graph (trivial) has 163 edges and 252 vertex of which 75 / 252 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 200 transition count 345
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 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 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 110 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 246 place count 154 transition count 187
Applied a total of 246 rules in 26 ms. Remains 154 /252 variables (removed 98) and now considering 187/510 (removed 323) transitions.
// Phase 1: matrix 187 rows 154 cols
[2021-05-14 06:48:15] [INFO ] Computed 48 place invariants in 0 ms
[2021-05-14 06:48:15] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2021-05-14 06:48:15] [INFO ] Computed 48 place invariants in 1 ms
[2021-05-14 06:48:16] [INFO ] State equation strengthened by 112 read => feed constraints.
[2021-05-14 06:48:16] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2021-05-14 06:48:16] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2021-05-14 06:48:16] [INFO ] Computed 48 place invariants in 0 ms
[2021-05-14 06:48:16] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 154/252 places, 187/510 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s83 1) (EQ s39 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-8A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-07 finished in 375 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:16] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 06:48:16] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:16] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:48:16] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:16] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:48:16] [INFO ] Dead Transitions using invariants and state equation in 209 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : NoC3x3-PT-8A-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s68 1) (EQ s138 1) (EQ s243 1)), p0:(EQ s226 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-08 finished in 593 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (X(p1)&&(p2 U !p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:16] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:48:16] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:16] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 06:48:17] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:17] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:48:17] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p1) p0), p0, (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : NoC3x3-PT-8A-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s12 1), p0:(OR (NEQ s107 1) (NEQ s137 1)), p2:(EQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4099 steps with 0 reset in 21 ms.
FORMULA NoC3x3-PT-8A-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-09 finished in 625 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:17] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 06:48:17] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:17] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:48:17] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:48:17] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:48:17] [INFO ] Dead Transitions using invariants and state equation in 195 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(NEQ s43 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 25000 reset in 529 ms.
Product exploration explored 100000 steps with 25000 reset in 555 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 509 ms.
Product exploration explored 100000 steps with 25000 reset in 547 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 252 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Graph (trivial) has 164 edges and 252 vertex of which 75 / 252 are part of one of the 33 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 0 with 23 rules applied. Total rules applied 24 place count 210 transition count 378
Deduced a syphon composed of 23 places in 0 ms
Drop transitions removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 0 with 112 rules applied. Total rules applied 136 place count 210 transition count 266
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 136 rules in 21 ms. Remains 210 /252 variables (removed 42) and now considering 266/510 (removed 244) transitions.
[2021-05-14 06:48:20] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 06:48:20] [INFO ] Flow matrix only has 234 transitions (discarded 32 similar events)
// Phase 1: matrix 234 rows 210 cols
[2021-05-14 06:48:20] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 06:48:20] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 1 iterations. Remains : 210/252 places, 266/510 transitions.
Product exploration explored 100000 steps with 25000 reset in 1214 ms.
Product exploration explored 100000 steps with 25000 reset in 1192 ms.
[2021-05-14 06:48:23] [INFO ] Flatten gal took : 25 ms
[2021-05-14 06:48:23] [INFO ] Flatten gal took : 22 ms
[2021-05-14 06:48:32] [INFO ] Time to serialize gal into /tmp/LTL14764191301792995395.gal : 9014 ms
[2021-05-14 06:48:32] [INFO ] Time to serialize properties into /tmp/LTL4841941113142686993.ltl : 0 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/LTL14764191301792995395.gal, -t, CGAL, -LTL, /tmp/LTL4841941113142686993.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/LTL14764191301792995395.gal -t CGAL -LTL /tmp/LTL4841941113142686993.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p55!=1)"))))))
Formula 0 simplified : !XXXF"(p55!=1)"
Detected timeout of ITS tools.
[2021-05-14 06:48:47] [INFO ] Flatten gal took : 25 ms
[2021-05-14 06:48:47] [INFO ] Applying decomposition
[2021-05-14 06:48:47] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9403985266784508752.txt, -o, /tmp/graph9403985266784508752.bin, -w, /tmp/graph9403985266784508752.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9403985266784508752.bin, -l, -1, -v, -w, /tmp/graph9403985266784508752.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 06:48:47] [INFO ] Decomposing Gal with order
[2021-05-14 06:48:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 06:48:47] [INFO ] Removed a total of 206 redundant transitions.
[2021-05-14 06:48:47] [INFO ] Flatten gal took : 38 ms
[2021-05-14 06:48:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 258 labels/synchronizations in 7 ms.
[2021-05-14 06:48:47] [INFO ] Time to serialize gal into /tmp/LTL5095468331098447522.gal : 3 ms
[2021-05-14 06:48:47] [INFO ] Time to serialize properties into /tmp/LTL1155327348344534553.ltl : 0 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/LTL5095468331098447522.gal, -t, CGAL, -LTL, /tmp/LTL1155327348344534553.ltl, -c, -stutter-deadlock], 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/LTL5095468331098447522.gal -t CGAL -LTL /tmp/LTL1155327348344534553.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i1.u4.p55!=1)"))))))
Formula 0 simplified : !XXXF"(i1.u4.p55!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13694144318577909200
[2021-05-14 06:49:02] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13694144318577909200
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13694144318577909200]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13694144318577909200] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13694144318577909200] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NoC3x3-PT-8A-11 finished in 46067 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:49:03] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:49:03] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:49:03] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:49:03] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:49:03] [INFO ] Computed 57 place invariants in 10 ms
[2021-05-14 06:49:04] [INFO ] Dead Transitions using invariants and state equation in 220 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s80 1) (NEQ s90 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 743 ms.
Product exploration explored 100000 steps with 50000 reset in 759 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 739 ms.
Product exploration explored 100000 steps with 50000 reset in 757 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 252 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Graph (trivial) has 161 edges and 252 vertex of which 73 / 252 are part of one of the 32 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 0 with 23 rules applied. Total rules applied 24 place count 211 transition count 380
Deduced a syphon composed of 23 places in 0 ms
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 0 with 108 rules applied. Total rules applied 132 place count 211 transition count 272
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 132 rules in 41 ms. Remains 211 /252 variables (removed 41) and now considering 272/510 (removed 238) transitions.
[2021-05-14 06:49:07] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 06:49:07] [INFO ] Flow matrix only has 241 transitions (discarded 31 similar events)
// Phase 1: matrix 241 rows 211 cols
[2021-05-14 06:49:07] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:49:07] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 211/252 places, 272/510 transitions.
Product exploration explored 100000 steps with 50000 reset in 1146 ms.
Product exploration explored 100000 steps with 50000 reset in 1117 ms.
[2021-05-14 06:49:09] [INFO ] Flatten gal took : 20 ms
[2021-05-14 06:49:09] [INFO ] Flatten gal took : 20 ms
[2021-05-14 06:49:09] [INFO ] Time to serialize gal into /tmp/LTL8133464487031657089.gal : 7 ms
[2021-05-14 06:49:09] [INFO ] Time to serialize properties into /tmp/LTL3147393339415463914.ltl : 0 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/LTL8133464487031657089.gal, -t, CGAL, -LTL, /tmp/LTL3147393339415463914.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/LTL8133464487031657089.gal -t CGAL -LTL /tmp/LTL3147393339415463914.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p99!=1)||(p115!=1))"))))
Formula 0 simplified : !XF"((p99!=1)||(p115!=1))"
Detected timeout of ITS tools.
[2021-05-14 06:49:24] [INFO ] Flatten gal took : 19 ms
[2021-05-14 06:49:24] [INFO ] Applying decomposition
[2021-05-14 06:49:24] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17929143752280625560.txt, -o, /tmp/graph17929143752280625560.bin, -w, /tmp/graph17929143752280625560.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17929143752280625560.bin, -l, -1, -v, -w, /tmp/graph17929143752280625560.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 06:49:24] [INFO ] Decomposing Gal with order
[2021-05-14 06:49:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 06:49:25] [INFO ] Removed a total of 276 redundant transitions.
[2021-05-14 06:49:25] [INFO ] Flatten gal took : 62 ms
[2021-05-14 06:49:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 10 ms.
[2021-05-14 06:49:25] [INFO ] Time to serialize gal into /tmp/LTL9917884999354344951.gal : 12 ms
[2021-05-14 06:49:25] [INFO ] Time to serialize properties into /tmp/LTL12429510977134454837.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/LTL9917884999354344951.gal, -t, CGAL, -LTL, /tmp/LTL12429510977134454837.ltl, -c, -stutter-deadlock], 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/LTL9917884999354344951.gal -t CGAL -LTL /tmp/LTL12429510977134454837.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i3.u15.p99!=1)||(i3.u15.p115!=1))"))))
Formula 0 simplified : !XF"((i3.u15.p99!=1)||(i3.u15.p115!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6690222505531604425
[2021-05-14 06:49:40] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6690222505531604425
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6690222505531604425]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6690222505531604425] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6690222505531604425] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NoC3x3-PT-8A-12 finished in 37605 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:49:41] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:49:41] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:49:41] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:49:41] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:49:41] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:49:41] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s226 1) (AND (EQ s113 1) (EQ s136 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-13 finished in 596 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0&&(!p1 U (p2||G(!p1)))) U G(p3))||X(F((p1&&F(p3))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:49:41] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:49:41] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:49:41] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:49:42] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2021-05-14 06:49:42] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 06:49:42] [INFO ] Dead Transitions using invariants and state equation in 204 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p3), (OR (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : NoC3x3-PT-8A-14 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p2) p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s218 1), p0:(EQ s164 1), p2:(AND (NEQ s68 1) (NEQ s164 1)), p1:(EQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 51 reset in 400 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 1 ms.
FORMULA NoC3x3-PT-8A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-14 finished in 1080 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 252/252 places, 510/510 transitions.
Graph (trivial) has 161 edges and 252 vertex of which 72 / 252 are part of one of the 32 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 36 rules applied. Total rules applied 37 place count 203 transition count 359
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 58 place count 182 transition count 359
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 106 place count 158 transition count 335
Drop transitions removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 242 place count 158 transition count 199
Applied a total of 242 rules in 16 ms. Remains 158 /252 variables (removed 94) and now considering 199/510 (removed 311) transitions.
// Phase 1: matrix 199 rows 158 cols
[2021-05-14 06:49:42] [INFO ] Computed 49 place invariants in 0 ms
[2021-05-14 06:49:42] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 199 rows 158 cols
[2021-05-14 06:49:42] [INFO ] Computed 49 place invariants in 1 ms
[2021-05-14 06:49:42] [INFO ] State equation strengthened by 112 read => feed constraints.
[2021-05-14 06:49:43] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2021-05-14 06:49:43] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 199 rows 158 cols
[2021-05-14 06:49:43] [INFO ] Computed 49 place invariants in 0 ms
[2021-05-14 06:49:43] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/252 places, 199/510 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-15 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:(NEQ s144 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 40 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-15 finished in 416 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6169061309562362225
[2021-05-14 06:49:43] [INFO ] Computing symmetric may disable matrix : 510 transitions.
[2021-05-14 06:49:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 06:49:43] [INFO ] Applying decomposition
[2021-05-14 06:49:43] [INFO ] Computing symmetric may enable matrix : 510 transitions.
[2021-05-14 06:49:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 06:49:43] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6220674790026859256.txt, -o, /tmp/graph6220674790026859256.bin, -w, /tmp/graph6220674790026859256.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6220674790026859256.bin, -l, -1, -v, -w, /tmp/graph6220674790026859256.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 06:49:43] [INFO ] Computing Do-Not-Accords matrix : 510 transitions.
[2021-05-14 06:49:43] [INFO ] Decomposing Gal with order
[2021-05-14 06:49:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 06:49:43] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 06:49:43] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6169061309562362225
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6169061309562362225]
[2021-05-14 06:49:43] [INFO ] Removed a total of 270 redundant transitions.
[2021-05-14 06:49:43] [INFO ] Flatten gal took : 29 ms
[2021-05-14 06:49:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 5 ms.
[2021-05-14 06:49:43] [INFO ] Time to serialize gal into /tmp/LTLFireability14846934262450428031.gal : 3 ms
[2021-05-14 06:49:43] [INFO ] Time to serialize properties into /tmp/LTLFireability17373338783791906351.ltl : 0 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/LTLFireability14846934262450428031.gal, -t, CGAL, -LTL, /tmp/LTLFireability17373338783791906351.ltl, -c, -stutter-deadlock], 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/LTLFireability14846934262450428031.gal -t CGAL -LTL /tmp/LTLFireability17373338783791906351.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X(F(("(i8.u41.p308!=1)")||(G(F("(i0.u1.p20!=1)")))))))
Formula 0 simplified : !XF("(i8.u41.p308!=1)" | GF"(i0.u1.p20!=1)")
Compilation finished in 2781 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6169061309562362225]
Link finished in 60 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6169061309562362225]
LTSmin run took 382 ms.
FORMULA NoC3x3-PT-8A-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(<>((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6169061309562362225]
LTSmin run took 495 ms.
FORMULA NoC3x3-PT-8A-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6169061309562362225]
LTSmin run took 257 ms.
FORMULA NoC3x3-PT-8A-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620974990063

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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-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-4028"
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 r140-tall-162089127700341"
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 ;