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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K 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 92K 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.0K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 2.0M 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-7B-00
FORMULA_NAME NoC3x3-PT-7B-01
FORMULA_NAME NoC3x3-PT-7B-02
FORMULA_NAME NoC3x3-PT-7B-03
FORMULA_NAME NoC3x3-PT-7B-04
FORMULA_NAME NoC3x3-PT-7B-05
FORMULA_NAME NoC3x3-PT-7B-06
FORMULA_NAME NoC3x3-PT-7B-07
FORMULA_NAME NoC3x3-PT-7B-08
FORMULA_NAME NoC3x3-PT-7B-09
FORMULA_NAME NoC3x3-PT-7B-10
FORMULA_NAME NoC3x3-PT-7B-11
FORMULA_NAME NoC3x3-PT-7B-12
FORMULA_NAME NoC3x3-PT-7B-13
FORMULA_NAME NoC3x3-PT-7B-14
FORMULA_NAME NoC3x3-PT-7B-15

=== Now, execution of the tool begins

BK_START 1620972766539

Running Version 0
[2021-05-14 06:12:55] [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:12:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 06:12:56] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2021-05-14 06:12:56] [INFO ] Transformed 7014 places.
[2021-05-14 06:12:56] [INFO ] Transformed 8833 transitions.
[2021-05-14 06:12:56] [INFO ] Found NUPN structural information;
[2021-05-14 06:12:56] [INFO ] Parsed PT model containing 7014 places and 8833 transitions in 393 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 06:12:56] [INFO ] Initial state test concluded for 3 properties.
FORMULA NoC3x3-PT-7B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 7014 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Discarding 1855 places :
Symmetric choice reduction at 0 with 1855 rule applications. Total rules 1855 place count 5159 transition count 6978
Iterating global reduction 0 with 1855 rules applied. Total rules applied 3710 place count 5159 transition count 6978
Discarding 487 places :
Symmetric choice reduction at 0 with 487 rule applications. Total rules 4197 place count 4672 transition count 6491
Iterating global reduction 0 with 487 rules applied. Total rules applied 4684 place count 4672 transition count 6491
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 4764 place count 4592 transition count 6331
Iterating global reduction 0 with 80 rules applied. Total rules applied 4844 place count 4592 transition count 6331
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 4924 place count 4512 transition count 6251
Iterating global reduction 0 with 80 rules applied. Total rules applied 5004 place count 4512 transition count 6251
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 5084 place count 4432 transition count 6171
Iterating global reduction 0 with 80 rules applied. Total rules applied 5164 place count 4432 transition count 6171
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 5241 place count 4355 transition count 6064
Iterating global reduction 0 with 77 rules applied. Total rules applied 5318 place count 4355 transition count 6064
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 5393 place count 4280 transition count 5914
Iterating global reduction 0 with 75 rules applied. Total rules applied 5468 place count 4280 transition count 5914
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 5484 place count 4280 transition count 5898
Applied a total of 5484 rules in 5348 ms. Remains 4280 /7014 variables (removed 2734) and now considering 5898/8833 (removed 2935) transitions.
// Phase 1: matrix 5898 rows 4280 cols
[2021-05-14 06:13:02] [INFO ] Computed 66 place invariants in 44 ms
[2021-05-14 06:13:03] [INFO ] Implicit Places using invariants in 961 ms returned []
// Phase 1: matrix 5898 rows 4280 cols
[2021-05-14 06:13:03] [INFO ] Computed 66 place invariants in 30 ms
[2021-05-14 06:13:03] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
// Phase 1: matrix 5898 rows 4280 cols
[2021-05-14 06:13:03] [INFO ] Computed 66 place invariants in 20 ms
[2021-05-14 06:13:10] [INFO ] Dead Transitions using invariants and state equation in 6710 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4280/7014 places, 5898/8833 transitions.
[2021-05-14 06:13:11] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 06:13:11] [INFO ] Flatten gal took : 305 ms
FORMULA NoC3x3-PT-7B-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 06:13:11] [INFO ] Flatten gal took : 186 ms
[2021-05-14 06:13:11] [INFO ] Input system was already deterministic with 5898 transitions.
Incomplete random walk after 100000 steps, including 37 resets, run finished after 836 ms. (steps per millisecond=119 ) properties (out of 36) seen :19
Running SMT prover for 17 properties.
// Phase 1: matrix 5898 rows 4280 cols
[2021-05-14 06:13:12] [INFO ] Computed 66 place invariants in 50 ms
[2021-05-14 06:13:14] [INFO ] [Real]Absence check using 66 positive place invariants in 51 ms returned sat
[2021-05-14 06:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 06:13:19] [INFO ] [Real]Absence check using state equation in 4147 ms returned unsat :0 sat :11 real:6
Attempting to minimize the solution found.
Minimization took 1912 ms.
[2021-05-14 06:13:21] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :11 real:6
[2021-05-14 06:13:24] [INFO ] [Nat]Absence check using 66 positive place invariants in 52 ms returned sat
[2021-05-14 06:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 06:13:30] [INFO ] [Nat]Absence check using state equation in 5082 ms returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 2685 ms.
[2021-05-14 06:13:33] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :17
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0||G(p1)) U p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 4280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4257 transition count 5865
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4257 transition count 5865
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4257 transition count 5864
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 4247 transition count 5848
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 4247 transition count 5848
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 73 place count 4241 transition count 5841
Iterating global reduction 1 with 6 rules applied. Total rules applied 79 place count 4241 transition count 5841
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 85 place count 4235 transition count 5831
Iterating global reduction 1 with 6 rules applied. Total rules applied 91 place count 4235 transition count 5831
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 97 place count 4229 transition count 5821
Iterating global reduction 1 with 6 rules applied. Total rules applied 103 place count 4229 transition count 5821
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 108 place count 4224 transition count 5812
Iterating global reduction 1 with 5 rules applied. Total rules applied 113 place count 4224 transition count 5812
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 115 place count 4224 transition count 5810
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 4223 transition count 5808
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 4223 transition count 5808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 4223 transition count 5807
Applied a total of 118 rules in 2171 ms. Remains 4223 /4280 variables (removed 57) and now considering 5807/5898 (removed 91) transitions.
// Phase 1: matrix 5807 rows 4223 cols
[2021-05-14 06:13:41] [INFO ] Computed 66 place invariants in 16 ms
[2021-05-14 06:13:42] [INFO ] Implicit Places using invariants in 1009 ms returned []
// Phase 1: matrix 5807 rows 4223 cols
[2021-05-14 06:13:42] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:13:43] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1859 ms to find 0 implicit places.
// Phase 1: matrix 5807 rows 4223 cols
[2021-05-14 06:13:43] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:13:46] [INFO ] Dead Transitions using invariants and state equation in 3116 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4223/4280 places, 5807/5898 transitions.
Stuttering acceptance computed with spot in 8564 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7B-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s1325 1) (EQ s1495 1)), p0:(EQ s56 1), p1:(EQ s1357 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA NoC3x3-PT-7B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-00 finished in 21462 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 4280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 4256 transition count 5861
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 4256 transition count 5861
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 4245 transition count 5843
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 4245 transition count 5843
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 4239 transition count 5836
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 4239 transition count 5836
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 4233 transition count 5826
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 4233 transition count 5826
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 4227 transition count 5816
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 4227 transition count 5816
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 4222 transition count 5807
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 4222 transition count 5807
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 4222 transition count 5805
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 4221 transition count 5803
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 4221 transition count 5803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 121 place count 4221 transition count 5802
Applied a total of 121 rules in 1954 ms. Remains 4221 /4280 variables (removed 59) and now considering 5802/5898 (removed 96) transitions.
// Phase 1: matrix 5802 rows 4221 cols
[2021-05-14 06:13:56] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:13:57] [INFO ] Implicit Places using invariants in 864 ms returned []
// Phase 1: matrix 5802 rows 4221 cols
[2021-05-14 06:13:57] [INFO ] Computed 66 place invariants in 20 ms
[2021-05-14 06:13:58] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
// Phase 1: matrix 5802 rows 4221 cols
[2021-05-14 06:13:58] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:14:01] [INFO ] Dead Transitions using invariants and state equation in 3232 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4221/4280 places, 5802/5898 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s764 1), p1:(OR (NEQ s2287 1) (NEQ s764 1) (NEQ s1633 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 33260 reset in 2105 ms.
Product exploration explored 100000 steps with 33287 reset in 1957 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33278 reset in 2236 ms.
Product exploration explored 100000 steps with 33292 reset in 2195 ms.
[2021-05-14 06:14:16] [INFO ] Flatten gal took : 158 ms
[2021-05-14 06:14:16] [INFO ] Flatten gal took : 162 ms
[2021-05-14 06:14:16] [INFO ] Time to serialize gal into /tmp/LTL4315692055147073765.gal : 96 ms
[2021-05-14 06:14:16] [INFO ] Time to serialize properties into /tmp/LTL16986204934557262084.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/LTL4315692055147073765.gal, -t, CGAL, -LTL, /tmp/LTL16986204934557262084.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/LTL4315692055147073765.gal -t CGAL -LTL /tmp/LTL16986204934557262084.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p1249==1)")U(X("(((p3769!=1)||(p1249!=1))||(p2705!=1))"))))))
Formula 0 simplified : !FG("(p1249==1)" U X"(((p3769!=1)||(p1249!=1))||(p2705!=1))")
Detected timeout of ITS tools.
[2021-05-14 06:14:31] [INFO ] Flatten gal took : 161 ms
[2021-05-14 06:14:31] [INFO ] Applying decomposition
[2021-05-14 06:14:32] [INFO ] Flatten gal took : 142 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/graph13525471426324497567.txt, -o, /tmp/graph13525471426324497567.bin, -w, /tmp/graph13525471426324497567.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/graph13525471426324497567.bin, -l, -1, -v, -w, /tmp/graph13525471426324497567.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 06:14:32] [INFO ] Decomposing Gal with order
[2021-05-14 06:14:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 06:14:33] [INFO ] Removed a total of 1864 redundant transitions.
[2021-05-14 06:14:34] [INFO ] Flatten gal took : 385 ms
[2021-05-14 06:14:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 63 ms.
[2021-05-14 06:14:34] [INFO ] Time to serialize gal into /tmp/LTL16916163552376246503.gal : 39 ms
[2021-05-14 06:14:34] [INFO ] Time to serialize properties into /tmp/LTL247583686813576356.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/LTL16916163552376246503.gal, -t, CGAL, -LTL, /tmp/LTL247583686813576356.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/LTL16916163552376246503.gal -t CGAL -LTL /tmp/LTL247583686813576356.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i5.u306.p1249==1)")U(X("(((i17.u923.p3769!=1)||(i5.u306.p1249!=1))||(i12.u661.p2705!=1))"))))))
Formula 0 simplified : !FG("(i5.u306.p1249==1)" U X"(((i17.u923.p3769!=1)||(i5.u306.p1249!=1))||(i12.u661.p2705!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3672207981916857635
[2021-05-14 06:14:49] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3672207981916857635
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/ltsmin3672207981916857635]
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/ltsmin3672207981916857635] 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/ltsmin3672207981916857635] 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-7B-01 finished in 55512 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((p1 U ((X((p3&&X(!p0)))&&p2)||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 4280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 4258 transition count 5862
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 4258 transition count 5862
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4258 transition count 5861
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 4248 transition count 5844
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 4248 transition count 5844
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 71 place count 4242 transition count 5837
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 4242 transition count 5837
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 4236 transition count 5827
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 4236 transition count 5827
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 95 place count 4230 transition count 5817
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 4230 transition count 5817
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 106 place count 4225 transition count 5808
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 4225 transition count 5808
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 113 place count 4225 transition count 5806
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 4224 transition count 5804
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 4224 transition count 5804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 4224 transition count 5803
Applied a total of 116 rules in 1955 ms. Remains 4224 /4280 variables (removed 56) and now considering 5803/5898 (removed 95) transitions.
// Phase 1: matrix 5803 rows 4224 cols
[2021-05-14 06:14:52] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:14:53] [INFO ] Implicit Places using invariants in 747 ms returned []
// Phase 1: matrix 5803 rows 4224 cols
[2021-05-14 06:14:53] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:14:54] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
// Phase 1: matrix 5803 rows 4224 cols
[2021-05-14 06:14:54] [INFO ] Computed 66 place invariants in 15 ms
[2021-05-14 06:14:57] [INFO ] Dead Transitions using invariants and state equation in 3090 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4224/4280 places, 5803/5898 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1))), true, (OR (NOT p3) p0), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1))), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : NoC3x3-PT-7B-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=5 dest: 6}, { cond=(AND p2 p1 p3), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=5 dest: 8}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=5 dest: 9}], [{ cond=p0, acceptance={} source=6 dest: 3}], [{ cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2 p1 p3), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={} source=7 dest: 8}, { cond=(AND p0 p2 (NOT p1) p3), acceptance={} source=7 dest: 9}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=8 dest: 5}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND p0 p3), acceptance={} source=9 dest: 6}]], initial=0, aps=[p0:(EQ s1386 1), p2:(AND (NEQ s1386 1) (NEQ s2904 1)), p1:(NEQ s2904 1), p3:(NEQ s1090 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2620 steps with 0 reset in 13 ms.
FORMULA NoC3x3-PT-7B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-02 finished in 7108 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G((X(p1)&&F(((p2&&X(F(p3)))||G(F(p3))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 4280 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4257 transition count 5861
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4257 transition count 5861
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4257 transition count 5860
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 4247 transition count 5843
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 4247 transition count 5843
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 73 place count 4241 transition count 5836
Iterating global reduction 1 with 6 rules applied. Total rules applied 79 place count 4241 transition count 5836
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 85 place count 4235 transition count 5826
Iterating global reduction 1 with 6 rules applied. Total rules applied 91 place count 4235 transition count 5826
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 97 place count 4229 transition count 5816
Iterating global reduction 1 with 6 rules applied. Total rules applied 103 place count 4229 transition count 5816
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 108 place count 4224 transition count 5807
Iterating global reduction 1 with 5 rules applied. Total rules applied 113 place count 4224 transition count 5807
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 115 place count 4224 transition count 5805
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 4223 transition count 5803
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 4223 transition count 5803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 4223 transition count 5802
Applied a total of 118 rules in 1994 ms. Remains 4223 /4280 variables (removed 57) and now considering 5802/5898 (removed 96) transitions.
// Phase 1: matrix 5802 rows 4223 cols
[2021-05-14 06:14:59] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:15:00] [INFO ] Implicit Places using invariants in 871 ms returned []
// Phase 1: matrix 5802 rows 4223 cols
[2021-05-14 06:15:00] [INFO ] Computed 66 place invariants in 22 ms
[2021-05-14 06:15:02] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned []
Implicit Place search using SMT with State Equation took 2576 ms to find 0 implicit places.
// Phase 1: matrix 5802 rows 4223 cols
[2021-05-14 06:15:02] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:15:05] [INFO ] Dead Transitions using invariants and state equation in 3335 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4223/4280 places, 5802/5898 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p3) (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p3)), (NOT p3), true]
Running random walk in product with property : NoC3x3-PT-7B-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2979 1), p3:(NEQ s653 1), p1:(NEQ s1017 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9926 steps with 2 reset in 56 ms.
FORMULA NoC3x3-PT-7B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-03 finished in 8133 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1||((F(p2) U p3)&&G(p4)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 4280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Graph (trivial) has 5170 edges and 4280 vertex of which 3264 / 4280 are part of one of the 33 SCC in 13 ms
Free SCC test removed 3231 places
Ensure Unique test removed 4354 transitions
Reduce isomorphic transitions removed 4354 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 1048 transition count 1535
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 1040 transition count 1533
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 25 place count 1038 transition count 1529
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 27 place count 1036 transition count 1529
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 27 place count 1036 transition count 1494
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 97 place count 1001 transition count 1494
Discarding 281 places :
Symmetric choice reduction at 4 with 281 rule applications. Total rules 378 place count 720 transition count 1075
Iterating global reduction 4 with 281 rules applied. Total rules applied 659 place count 720 transition count 1075
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 663 place count 720 transition count 1071
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 663 place count 720 transition count 1070
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 665 place count 719 transition count 1070
Discarding 203 places :
Symmetric choice reduction at 5 with 203 rule applications. Total rules 868 place count 516 transition count 813
Iterating global reduction 5 with 203 rules applied. Total rules applied 1071 place count 516 transition count 813
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Iterating post reduction 5 with 202 rules applied. Total rules applied 1273 place count 516 transition count 611
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 6 with 258 rules applied. Total rules applied 1531 place count 387 transition count 482
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1533 place count 385 transition count 480
Iterating global reduction 6 with 2 rules applied. Total rules applied 1535 place count 385 transition count 480
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1537 place count 385 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1538 place count 384 transition count 477
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 375 vertex of which 48 / 375 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 7 with 10 rules applied. Total rules applied 1548 place count 351 transition count 477
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 1596 place count 351 transition count 429
Applied a total of 1596 rules in 434 ms. Remains 351 /4280 variables (removed 3929) and now considering 429/5898 (removed 5469) transitions.
[2021-05-14 06:15:06] [INFO ] Flow matrix only has 397 transitions (discarded 32 similar events)
// Phase 1: matrix 397 rows 351 cols
[2021-05-14 06:15:06] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:15:06] [INFO ] Implicit Places using invariants in 140 ms returned []
[2021-05-14 06:15:06] [INFO ] Flow matrix only has 397 transitions (discarded 32 similar events)
// Phase 1: matrix 397 rows 351 cols
[2021-05-14 06:15:06] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:15:06] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-14 06:15:06] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2021-05-14 06:15:06] [INFO ] Redundant transitions in 27 ms returned []
[2021-05-14 06:15:06] [INFO ] Flow matrix only has 397 transitions (discarded 32 similar events)
// Phase 1: matrix 397 rows 351 cols
[2021-05-14 06:15:06] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:15:06] [INFO ] Dead Transitions using invariants and state equation in 190 ms returned []
Finished structural reductions, in 1 iterations. Remains : 351/4280 places, 429/5898 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), true, (NOT p2), (NOT p3), (NOT p4), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : NoC3x3-PT-7B-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p4) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p4) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p4 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p4 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p4 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p4 p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) (NOT p3) p4 p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p4 p0), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p4), acceptance={} source=4 dest: 1}, { cond=p4, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p4) p0), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p4) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p4 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p4 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={} source=6 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0))), acceptance={} source=7 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p2) p0) (AND (NOT p1) (NOT p2) (NOT p4) p0)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) p3 (NOT p2) p4 p0), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) p3 (NOT p2) p4 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p4) (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p4) p0), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p2) p4 p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p0)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p2) p4), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(EQ s273 1), p4:(NEQ s333 1), p0:(AND (EQ s273 1) (EQ s9 1) (EQ s13 1)), p3:(AND (EQ s160 1) (EQ s170 1)), p2:(EQ s273 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-04 finished in 1452 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U G((F(p1) U p2)))||X(G(p3))))], workingDir=/home/mcc/execution]
Support contains 4 out of 4280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 4258 transition count 5863
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 4258 transition count 5863
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4258 transition count 5862
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 4248 transition count 5846
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 4248 transition count 5846
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 4243 transition count 5840
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 4243 transition count 5840
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 80 place count 4238 transition count 5831
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 4238 transition count 5831
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 4233 transition count 5822
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 4233 transition count 5822
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 99 place count 4229 transition count 5815
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 4229 transition count 5815
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 4229 transition count 5813
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 4228 transition count 5811
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 4228 transition count 5811
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 4228 transition count 5810
Applied a total of 108 rules in 3472 ms. Remains 4228 /4280 variables (removed 52) and now considering 5810/5898 (removed 88) transitions.
// Phase 1: matrix 5810 rows 4228 cols
[2021-05-14 06:15:10] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:15:11] [INFO ] Implicit Places using invariants in 728 ms returned []
// Phase 1: matrix 5810 rows 4228 cols
[2021-05-14 06:15:11] [INFO ] Computed 66 place invariants in 22 ms
[2021-05-14 06:15:12] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
// Phase 1: matrix 5810 rows 4228 cols
[2021-05-14 06:15:12] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:15:15] [INFO ] Dead Transitions using invariants and state equation in 3014 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4228/4280 places, 5810/5898 transitions.
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7B-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=1 dest: 8}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=1 dest: 9}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(NOT p3), acceptance={} source=2 dest: 6}], [{ cond=(AND p2 (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=9 dest: 9}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=9 dest: 9}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(EQ s628 1), p2:(EQ s3528 1), p1:(EQ s1154 1), p3:(OR (NEQ s628 1) (NEQ s1151 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33501 reset in 2264 ms.
Product exploration explored 100000 steps with 33279 reset in 2202 ms.
Knowledge obtained : [(NOT p0), (NOT p2), (NOT p1), p3]
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33236 reset in 2223 ms.
Product exploration explored 100000 steps with 33362 reset in 2270 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 442 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 4228 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 4228/4228 places, 5810/5810 transitions.
Graph (trivial) has 5110 edges and 4228 vertex of which 3237 / 4228 are part of one of the 33 SCC in 5 ms
Free SCC test removed 3204 places
Ensure Unique test removed 4319 transitions
Reduce isomorphic transitions removed 4319 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1024 transition count 1491
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 2 place count 1024 transition count 1683
Deduced a syphon composed of 38 places in 3 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 1024 transition count 1683
Discarding 273 places :
Symmetric choice reduction at 1 with 273 rule applications. Total rules 312 place count 751 transition count 1274
Deduced a syphon composed of 38 places in 2 ms
Iterating global reduction 1 with 273 rules applied. Total rules applied 585 place count 751 transition count 1274
Discarding 226 places :
Symmetric choice reduction at 1 with 226 rule applications. Total rules 811 place count 525 transition count 828
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 226 rules applied. Total rules applied 1037 place count 525 transition count 828
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 1237 place count 525 transition count 628
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 2 with 130 rules applied. Total rules applied 1367 place count 525 transition count 628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1368 place count 524 transition count 627
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1369 place count 524 transition count 627
Deduced a syphon composed of 141 places in 0 ms
Applied a total of 1369 rules in 225 ms. Remains 524 /4228 variables (removed 3704) and now considering 627/5810 (removed 5183) transitions.
[2021-05-14 06:15:25] [INFO ] Redundant transitions in 13 ms returned []
[2021-05-14 06:15:25] [INFO ] Flow matrix only has 595 transitions (discarded 32 similar events)
// Phase 1: matrix 595 rows 524 cols
[2021-05-14 06:15:25] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 06:15:26] [INFO ] Dead Transitions using invariants and state equation in 248 ms returned []
Finished structural reductions, in 1 iterations. Remains : 524/4228 places, 627/5810 transitions.
Stuttering criterion allowed to conclude after 12071 steps with 3802 reset in 551 ms.
FORMULA NoC3x3-PT-7B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-05 finished in 19516 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&(p1||X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 4280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4257 transition count 5862
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4257 transition count 5862
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4257 transition count 5861
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 4247 transition count 5844
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 4247 transition count 5844
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 72 place count 4242 transition count 5838
Iterating global reduction 1 with 5 rules applied. Total rules applied 77 place count 4242 transition count 5838
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 4237 transition count 5833
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 4237 transition count 5833
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 4232 transition count 5825
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 4232 transition count 5825
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 4227 transition count 5816
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 4227 transition count 5816
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 109 place count 4227 transition count 5814
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 4226 transition count 5812
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 4226 transition count 5812
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 4226 transition count 5811
Applied a total of 112 rules in 3269 ms. Remains 4226 /4280 variables (removed 54) and now considering 5811/5898 (removed 87) transitions.
// Phase 1: matrix 5811 rows 4226 cols
[2021-05-14 06:15:29] [INFO ] Computed 66 place invariants in 15 ms
[2021-05-14 06:15:30] [INFO ] Implicit Places using invariants in 870 ms returned []
// Phase 1: matrix 5811 rows 4226 cols
[2021-05-14 06:15:30] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:15:31] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1762 ms to find 0 implicit places.
// Phase 1: matrix 5811 rows 4226 cols
[2021-05-14 06:15:31] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:15:35] [INFO ] Dead Transitions using invariants and state equation in 3352 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4226/4280 places, 5811/5898 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-7B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2202 1), p1:(EQ s1944 1), p2:(EQ s1398 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2514 steps with 0 reset in 16 ms.
FORMULA NoC3x3-PT-7B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-07 finished in 8517 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 4280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Graph (trivial) has 5177 edges and 4280 vertex of which 3272 / 4280 are part of one of the 33 SCC in 4 ms
Free SCC test removed 3239 places
Ensure Unique test removed 4365 transitions
Reduce isomorphic transitions removed 4365 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 1040 transition count 1528
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 1036 transition count 1528
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 9 place count 1036 transition count 1492
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 81 place count 1000 transition count 1492
Discarding 284 places :
Symmetric choice reduction at 2 with 284 rule applications. Total rules 365 place count 716 transition count 1060
Iterating global reduction 2 with 284 rules applied. Total rules applied 649 place count 716 transition count 1060
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 655 place count 716 transition count 1054
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 655 place count 716 transition count 1053
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 657 place count 715 transition count 1053
Discarding 203 places :
Symmetric choice reduction at 3 with 203 rule applications. Total rules 860 place count 512 transition count 802
Iterating global reduction 3 with 203 rules applied. Total rules applied 1063 place count 512 transition count 802
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Iterating post reduction 3 with 202 rules applied. Total rules applied 1265 place count 512 transition count 600
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 1523 place count 383 transition count 471
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1525 place count 381 transition count 469
Iterating global reduction 4 with 2 rules applied. Total rules applied 1527 place count 381 transition count 469
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1529 place count 381 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1530 place count 380 transition count 466
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 371 vertex of which 48 / 371 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 5 with 10 rules applied. Total rules applied 1540 place count 347 transition count 466
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 1588 place count 347 transition count 418
Applied a total of 1588 rules in 135 ms. Remains 347 /4280 variables (removed 3933) and now considering 418/5898 (removed 5480) transitions.
[2021-05-14 06:15:35] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2021-05-14 06:15:35] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:15:35] [INFO ] Implicit Places using invariants in 144 ms returned []
[2021-05-14 06:15:35] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2021-05-14 06:15:35] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:15:35] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-14 06:15:35] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2021-05-14 06:15:35] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 06:15:35] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2021-05-14 06:15:35] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:15:35] [INFO ] Dead Transitions using invariants and state equation in 173 ms returned []
Finished structural reductions, in 1 iterations. Remains : 347/4280 places, 418/5898 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-09 finished in 842 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 4280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4257 transition count 5861
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4257 transition count 5861
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4257 transition count 5860
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 58 place count 4246 transition count 5842
Iterating global reduction 1 with 11 rules applied. Total rules applied 69 place count 4246 transition count 5842
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 75 place count 4240 transition count 5835
Iterating global reduction 1 with 6 rules applied. Total rules applied 81 place count 4240 transition count 5835
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 4234 transition count 5825
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 4234 transition count 5825
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 99 place count 4228 transition count 5815
Iterating global reduction 1 with 6 rules applied. Total rules applied 105 place count 4228 transition count 5815
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 110 place count 4223 transition count 5806
Iterating global reduction 1 with 5 rules applied. Total rules applied 115 place count 4223 transition count 5806
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 117 place count 4223 transition count 5804
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 4222 transition count 5802
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 4222 transition count 5802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 4222 transition count 5801
Applied a total of 120 rules in 3341 ms. Remains 4222 /4280 variables (removed 58) and now considering 5801/5898 (removed 97) transitions.
// Phase 1: matrix 5801 rows 4222 cols
[2021-05-14 06:15:39] [INFO ] Computed 66 place invariants in 26 ms
[2021-05-14 06:15:40] [INFO ] Implicit Places using invariants in 923 ms returned []
// Phase 1: matrix 5801 rows 4222 cols
[2021-05-14 06:15:40] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:15:41] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
// Phase 1: matrix 5801 rows 4222 cols
[2021-05-14 06:15:41] [INFO ] Computed 66 place invariants in 12 ms
[2021-05-14 06:15:44] [INFO ] Dead Transitions using invariants and state equation in 3235 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4222/4280 places, 5801/5898 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s991 1), p1:(NEQ s1907 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 34 reset in 565 ms.
Product exploration explored 100000 steps with 34 reset in 699 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 37 reset in 521 ms.
Product exploration explored 100000 steps with 37 reset in 624 ms.
Applying partial POR strategy [true, true]
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 4222 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 4222/4222 places, 5801/5801 transitions.
Graph (trivial) has 5106 edges and 4222 vertex of which 3231 / 4222 are part of one of the 33 SCC in 2 ms
Free SCC test removed 3198 places
Ensure Unique test removed 4311 transitions
Reduce isomorphic transitions removed 4311 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1024 transition count 1490
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 2 place count 1024 transition count 1682
Deduced a syphon composed of 38 places in 3 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 1024 transition count 1682
Discarding 272 places :
Symmetric choice reduction at 1 with 272 rule applications. Total rules 311 place count 752 transition count 1274
Deduced a syphon composed of 38 places in 2 ms
Iterating global reduction 1 with 272 rules applied. Total rules applied 583 place count 752 transition count 1274
Discarding 225 places :
Symmetric choice reduction at 1 with 225 rule applications. Total rules 808 place count 527 transition count 829
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 225 rules applied. Total rules applied 1033 place count 527 transition count 829
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 1232 place count 527 transition count 630
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 2 with 131 rules applied. Total rules applied 1363 place count 527 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1364 place count 526 transition count 629
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1365 place count 526 transition count 629
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1366 place count 526 transition count 632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1367 place count 525 transition count 630
Deduced a syphon composed of 142 places in 28 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1368 place count 525 transition count 630
Deduced a syphon composed of 142 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 1370 place count 525 transition count 628
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1372 place count 523 transition count 626
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1374 place count 523 transition count 626
Deduced a syphon composed of 141 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1375 place count 523 transition count 625
Deduced a syphon composed of 141 places in 0 ms
Applied a total of 1375 rules in 370 ms. Remains 523 /4222 variables (removed 3699) and now considering 625/5801 (removed 5176) transitions.
[2021-05-14 06:15:47] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 06:15:47] [INFO ] Flow matrix only has 593 transitions (discarded 32 similar events)
// Phase 1: matrix 593 rows 523 cols
[2021-05-14 06:15:47] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 06:15:47] [INFO ] Dead Transitions using invariants and state equation in 243 ms returned []
Finished structural reductions, in 1 iterations. Remains : 523/4222 places, 625/5801 transitions.
Stuttering criterion allowed to conclude after 1851 steps with 20 reset in 11 ms.
FORMULA NoC3x3-PT-7B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-10 finished in 11912 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)||(p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 4280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4257 transition count 5865
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4257 transition count 5865
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4257 transition count 5864
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 4248 transition count 5850
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 4248 transition count 5850
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 4243 transition count 5844
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 4243 transition count 5844
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 80 place count 4238 transition count 5835
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 4238 transition count 5835
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 4233 transition count 5829
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 4233 transition count 5829
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 99 place count 4229 transition count 5822
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 4229 transition count 5822
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 4229 transition count 5820
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 4228 transition count 5818
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 4228 transition count 5818
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 4228 transition count 5817
Applied a total of 108 rules in 3393 ms. Remains 4228 /4280 variables (removed 52) and now considering 5817/5898 (removed 81) transitions.
// Phase 1: matrix 5817 rows 4228 cols
[2021-05-14 06:15:51] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:15:52] [INFO ] Implicit Places using invariants in 877 ms returned []
// Phase 1: matrix 5817 rows 4228 cols
[2021-05-14 06:15:52] [INFO ] Computed 66 place invariants in 12 ms
[2021-05-14 06:15:52] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1656 ms to find 0 implicit places.
// Phase 1: matrix 5817 rows 4228 cols
[2021-05-14 06:15:52] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:15:56] [INFO ] Dead Transitions using invariants and state equation in 3385 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4228/4280 places, 5817/5898 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-7B-11 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p2:(AND (EQ s1328 1) (EQ s1420 1)), p1:(EQ s2309 1), p0:(AND (EQ s447 1) (EQ s495 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-11 finished in 8612 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 4280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4257 transition count 5861
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4257 transition count 5861
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4257 transition count 5860
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 4247 transition count 5844
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 4247 transition count 5844
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 72 place count 4242 transition count 5838
Iterating global reduction 1 with 5 rules applied. Total rules applied 77 place count 4242 transition count 5838
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 4237 transition count 5829
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 4237 transition count 5829
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 4232 transition count 5820
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 4232 transition count 5820
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 101 place count 4228 transition count 5813
Iterating global reduction 1 with 4 rules applied. Total rules applied 105 place count 4228 transition count 5813
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 4228 transition count 5812
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 4227 transition count 5810
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 4227 transition count 5810
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 4227 transition count 5809
Applied a total of 109 rules in 3329 ms. Remains 4227 /4280 variables (removed 53) and now considering 5809/5898 (removed 89) transitions.
// Phase 1: matrix 5809 rows 4227 cols
[2021-05-14 06:15:59] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:16:00] [INFO ] Implicit Places using invariants in 787 ms returned []
// Phase 1: matrix 5809 rows 4227 cols
[2021-05-14 06:16:00] [INFO ] Computed 66 place invariants in 12 ms
[2021-05-14 06:16:01] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1654 ms to find 0 implicit places.
// Phase 1: matrix 5809 rows 4227 cols
[2021-05-14 06:16:01] [INFO ] Computed 66 place invariants in 17 ms
[2021-05-14 06:16:04] [INFO ] Dead Transitions using invariants and state equation in 3073 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4227/4280 places, 5809/5898 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-12 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: 1}]], initial=2, aps=[p0:(OR (NEQ s1012 0) (NEQ s1321 1) (NEQ s1645 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2246 ms.
Product exploration explored 100000 steps with 33333 reset in 2241 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 2204 ms.
Product exploration explored 100000 steps with 33333 reset in 2248 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 4227 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 4227/4227 places, 5809/5809 transitions.
Graph (trivial) has 5114 edges and 4227 vertex of which 3239 / 4227 are part of one of the 33 SCC in 2 ms
Free SCC test removed 3206 places
Ensure Unique test removed 4323 transitions
Reduce isomorphic transitions removed 4323 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 1 place count 1021 transition count 1678
Deduced a syphon composed of 37 places in 3 ms
Iterating global reduction 0 with 37 rules applied. Total rules applied 38 place count 1021 transition count 1678
Discarding 273 places :
Symmetric choice reduction at 0 with 273 rule applications. Total rules 311 place count 748 transition count 1269
Deduced a syphon composed of 37 places in 2 ms
Iterating global reduction 0 with 273 rules applied. Total rules applied 584 place count 748 transition count 1269
Discarding 226 places :
Symmetric choice reduction at 0 with 226 rule applications. Total rules 810 place count 522 transition count 823
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 0 with 226 rules applied. Total rules applied 1036 place count 522 transition count 823
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 1236 place count 522 transition count 623
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 130 rules applied. Total rules applied 1366 place count 522 transition count 623
Deduced a syphon composed of 141 places in 0 ms
Applied a total of 1366 rules in 143 ms. Remains 522 /4227 variables (removed 3705) and now considering 623/5809 (removed 5186) transitions.
[2021-05-14 06:16:14] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 06:16:14] [INFO ] Flow matrix only has 591 transitions (discarded 32 similar events)
// Phase 1: matrix 591 rows 522 cols
[2021-05-14 06:16:14] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 06:16:14] [INFO ] Dead Transitions using invariants and state equation in 272 ms returned []
Finished structural reductions, in 1 iterations. Remains : 522/4227 places, 623/5809 transitions.
Product exploration explored 100000 steps with 33333 reset in 3788 ms.
Product exploration explored 100000 steps with 33333 reset in 3778 ms.
[2021-05-14 06:16:22] [INFO ] Flatten gal took : 133 ms
[2021-05-14 06:16:22] [INFO ] Flatten gal took : 137 ms
[2021-05-14 06:16:22] [INFO ] Time to serialize gal into /tmp/LTL10794936259065009415.gal : 18 ms
[2021-05-14 06:16:22] [INFO ] Time to serialize properties into /tmp/LTL10252401086670534440.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/LTL10794936259065009415.gal, -t, CGAL, -LTL, /tmp/LTL10252401086670534440.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/LTL10794936259065009415.gal -t CGAL -LTL /tmp/LTL10252401086670534440.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((p1648!=0)||(p2182!=1))||(p2720!=1))")))))
Formula 0 simplified : !XXF"(((p1648!=0)||(p2182!=1))||(p2720!=1))"
Detected timeout of ITS tools.
[2021-05-14 06:16:37] [INFO ] Flatten gal took : 132 ms
[2021-05-14 06:16:37] [INFO ] Applying decomposition
[2021-05-14 06:16:37] [INFO ] Flatten gal took : 193 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/graph6748761115155716945.txt, -o, /tmp/graph6748761115155716945.bin, -w, /tmp/graph6748761115155716945.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/graph6748761115155716945.bin, -l, -1, -v, -w, /tmp/graph6748761115155716945.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 06:16:38] [INFO ] Decomposing Gal with order
[2021-05-14 06:16:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 06:16:39] [INFO ] Removed a total of 1834 redundant transitions.
[2021-05-14 06:16:39] [INFO ] Flatten gal took : 248 ms
[2021-05-14 06:16:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 83 ms.
[2021-05-14 06:16:39] [INFO ] Time to serialize gal into /tmp/LTL5186716876826376262.gal : 51 ms
[2021-05-14 06:16:39] [INFO ] Time to serialize properties into /tmp/LTL8152239891417217065.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/LTL5186716876826376262.gal, -t, CGAL, -LTL, /tmp/LTL8152239891417217065.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/LTL5186716876826376262.gal -t CGAL -LTL /tmp/LTL8152239891417217065.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((i7.u403.p1648!=0)||(i11.i0.i0.i4.u525.p2182!=1))||(i12.u661.p2720!=1))")))))
Formula 0 simplified : !XXF"(((i7.u403.p1648!=0)||(i11.i0.i0.i4.u525.p2182!=1))||(i12.u661.p2720!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16910882964149342031
[2021-05-14 06:16:54] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16910882964149342031
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/ltsmin16910882964149342031]
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/ltsmin16910882964149342031] 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/ltsmin16910882964149342031] 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-7B-12 finished in 59077 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 4280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4257 transition count 5861
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4257 transition count 5861
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4257 transition count 5860
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 4248 transition count 5845
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 4248 transition count 5845
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 4244 transition count 5841
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 4244 transition count 5841
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 4240 transition count 5833
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 4240 transition count 5833
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 4236 transition count 5825
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 4236 transition count 5825
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 4233 transition count 5819
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 4233 transition count 5819
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 4233 transition count 5818
Applied a total of 96 rules in 2931 ms. Remains 4233 /4280 variables (removed 47) and now considering 5818/5898 (removed 80) transitions.
// Phase 1: matrix 5818 rows 4233 cols
[2021-05-14 06:16:58] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:16:59] [INFO ] Implicit Places using invariants in 764 ms returned []
// Phase 1: matrix 5818 rows 4233 cols
[2021-05-14 06:16:59] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:17:00] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
// Phase 1: matrix 5818 rows 4233 cols
[2021-05-14 06:17:00] [INFO ] Computed 66 place invariants in 12 ms
[2021-05-14 06:17:03] [INFO ] Dead Transitions using invariants and state equation in 2944 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4233/4280 places, 5818/5898 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : NoC3x3-PT-7B-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ 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 (NEQ s645 1) (EQ s367 1)), p0:(EQ s645 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 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-13 finished in 7598 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 4280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4280/4280 places, 5898/5898 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 4255 transition count 5859
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 4255 transition count 5859
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 4255 transition count 5858
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 4244 transition count 5840
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 4244 transition count 5840
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 4238 transition count 5833
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 4238 transition count 5833
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 91 place count 4232 transition count 5823
Iterating global reduction 1 with 6 rules applied. Total rules applied 97 place count 4232 transition count 5823
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 103 place count 4226 transition count 5813
Iterating global reduction 1 with 6 rules applied. Total rules applied 109 place count 4226 transition count 5813
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 114 place count 4221 transition count 5804
Iterating global reduction 1 with 5 rules applied. Total rules applied 119 place count 4221 transition count 5804
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 121 place count 4221 transition count 5802
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 4220 transition count 5800
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 4220 transition count 5800
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 4220 transition count 5799
Applied a total of 124 rules in 3352 ms. Remains 4220 /4280 variables (removed 60) and now considering 5799/5898 (removed 99) transitions.
// Phase 1: matrix 5799 rows 4220 cols
[2021-05-14 06:17:06] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:17:07] [INFO ] Implicit Places using invariants in 764 ms returned []
// Phase 1: matrix 5799 rows 4220 cols
[2021-05-14 06:17:07] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:17:08] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
// Phase 1: matrix 5799 rows 4220 cols
[2021-05-14 06:17:08] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:17:11] [INFO ] Dead Transitions using invariants and state equation in 3005 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4220/4280 places, 5799/5898 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7B-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s454 1) (EQ s675 1)), p1:(EQ s2319 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3440 steps with 0 reset in 23 ms.
FORMULA NoC3x3-PT-7B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-14 finished in 8066 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15551533799908471034
[2021-05-14 06:17:11] [INFO ] Too many transitions (5898) to apply POR reductions. Disabling POR matrices.
[2021-05-14 06:17:11] [INFO ] Applying decomposition
[2021-05-14 06:17:11] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15551533799908471034
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/ltsmin15551533799908471034]
[2021-05-14 06:17:11] [INFO ] Flatten gal took : 131 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/graph4101057390506062996.txt, -o, /tmp/graph4101057390506062996.bin, -w, /tmp/graph4101057390506062996.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/graph4101057390506062996.bin, -l, -1, -v, -w, /tmp/graph4101057390506062996.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 06:17:11] [INFO ] Decomposing Gal with order
[2021-05-14 06:17:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 06:17:12] [INFO ] Removed a total of 1865 redundant transitions.
[2021-05-14 06:17:13] [INFO ] Flatten gal took : 393 ms
[2021-05-14 06:17:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 159 labels/synchronizations in 69 ms.
[2021-05-14 06:17:13] [INFO ] Time to serialize gal into /tmp/LTLFireability5460643108954404437.gal : 120 ms
[2021-05-14 06:17:13] [INFO ] Time to serialize properties into /tmp/LTLFireability15642029355584628398.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/LTLFireability5460643108954404437.gal, -t, CGAL, -LTL, /tmp/LTLFireability15642029355584628398.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/LTLFireability5460643108954404437.gal -t CGAL -LTL /tmp/LTLFireability15642029355584628398.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((F(G(("(i5.i0.i1.u320.p1249==1)")U(X(!("(((i16.i2.i2.u937.p3769==1)&&(i5.i0.i1.u320.p1249==1))&&(i12.i0.i2.u673.p2705==1))")))))))
Formula 0 simplified : !FG("(i5.i0.i1.u320.p1249==1)" U X!"(((i16.i2.i2.u937.p3769==1)&&(i5.i0.i1.u320.p1249==1))&&(i12.i0.i2.u673.p2705==1))")
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/ltsmin15551533799908471034] killed by timeout after 27 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/ltsmin15551533799908471034] killed by timeout after 27 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-14 06:38:43] [INFO ] Applying decomposition
[2021-05-14 06:38:44] [INFO ] Flatten gal took : 1019 ms
[2021-05-14 06:38:44] [INFO ] Decomposing Gal with order
[2021-05-14 06:38:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 06:38:45] [INFO ] Removed a total of 634 redundant transitions.
[2021-05-14 06:38:45] [INFO ] Flatten gal took : 263 ms
[2021-05-14 06:38:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 1285 labels/synchronizations in 176 ms.
[2021-05-14 06:38:46] [INFO ] Time to serialize gal into /tmp/LTLFireability17111372307353489199.gal : 26 ms
[2021-05-14 06:38:46] [INFO ] Time to serialize properties into /tmp/LTLFireability15621419501608083379.ltl : 18 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/LTLFireability17111372307353489199.gal, -t, CGAL, -LTL, /tmp/LTLFireability15621419501608083379.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/LTLFireability17111372307353489199.gal -t CGAL -LTL /tmp/LTLFireability15621419501608083379.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((F(G(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u77.p1249==1)")U(X(!("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u101.p3769==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u77.p1249==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u91.p2705==1))")))))))
Formula 0 simplified : !FG("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u77.p1249==1)" U X!"(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u101.p3769==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u77.p1249==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u91.p2705==1))")
Detected timeout of ITS tools.
[2021-05-14 07:00:24] [INFO ] Flatten gal took : 1046 ms
[2021-05-14 07:00:25] [INFO ] Input system was already deterministic with 5898 transitions.
[2021-05-14 07:00:25] [INFO ] Transformed 4280 places.
[2021-05-14 07:00:25] [INFO ] Transformed 5898 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 07:00:26] [INFO ] Time to serialize gal into /tmp/LTLFireability7874435295669234388.gal : 12 ms
[2021-05-14 07:00:26] [INFO ] Time to serialize properties into /tmp/LTLFireability13625814341957889003.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/LTLFireability7874435295669234388.gal, -t, CGAL, -LTL, /tmp/LTLFireability13625814341957889003.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability7874435295669234388.gal -t CGAL -LTL /tmp/LTLFireability13625814341957889003.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("(p1249==1)")U(X(!("(((p3769==1)&&(p1249==1))&&(p2705==1))")))))))
Formula 0 simplified : !FG("(p1249==1)" U X!"(((p3769==1)&&(p1249==1))&&(p2705==1))")

BK_TIME_CONFINEMENT_REACHED

--------------------
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-7B"
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-7B, 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-162089127700333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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