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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.6K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 07:51 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 525K 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-5B-00
FORMULA_NAME NoC3x3-PT-5B-01
FORMULA_NAME NoC3x3-PT-5B-02
FORMULA_NAME NoC3x3-PT-5B-03
FORMULA_NAME NoC3x3-PT-5B-04
FORMULA_NAME NoC3x3-PT-5B-05
FORMULA_NAME NoC3x3-PT-5B-06
FORMULA_NAME NoC3x3-PT-5B-07
FORMULA_NAME NoC3x3-PT-5B-08
FORMULA_NAME NoC3x3-PT-5B-09
FORMULA_NAME NoC3x3-PT-5B-10
FORMULA_NAME NoC3x3-PT-5B-11
FORMULA_NAME NoC3x3-PT-5B-12
FORMULA_NAME NoC3x3-PT-5B-13
FORMULA_NAME NoC3x3-PT-5B-14
FORMULA_NAME NoC3x3-PT-5B-15

=== Now, execution of the tool begins

BK_START 1620963737030

Running Version 0
[2021-05-14 03:42:18] [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 03:42:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 03:42:18] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2021-05-14 03:42:18] [INFO ] Transformed 1571 places.
[2021-05-14 03:42:18] [INFO ] Transformed 2173 transitions.
[2021-05-14 03:42:18] [INFO ] Found NUPN structural information;
[2021-05-14 03:42:18] [INFO ] Parsed PT model containing 1571 places and 2173 transitions in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 48 out of 1571 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Discarding 437 places :
Symmetric choice reduction at 0 with 437 rule applications. Total rules 437 place count 1134 transition count 1736
Iterating global reduction 0 with 437 rules applied. Total rules applied 874 place count 1134 transition count 1736
Discarding 113 places :
Symmetric choice reduction at 0 with 113 rule applications. Total rules 987 place count 1021 transition count 1615
Iterating global reduction 0 with 113 rules applied. Total rules applied 1100 place count 1021 transition count 1615
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 1188 place count 933 transition count 1470
Iterating global reduction 0 with 88 rules applied. Total rules applied 1276 place count 933 transition count 1470
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 1297 place count 912 transition count 1428
Iterating global reduction 0 with 21 rules applied. Total rules applied 1318 place count 912 transition count 1428
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 1324 place count 906 transition count 1416
Iterating global reduction 0 with 6 rules applied. Total rules applied 1330 place count 906 transition count 1416
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 1336 place count 900 transition count 1410
Iterating global reduction 0 with 6 rules applied. Total rules applied 1342 place count 900 transition count 1410
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1345 place count 897 transition count 1404
Iterating global reduction 0 with 3 rules applied. Total rules applied 1348 place count 897 transition count 1404
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1351 place count 894 transition count 1395
Iterating global reduction 0 with 3 rules applied. Total rules applied 1354 place count 894 transition count 1395
Applied a total of 1354 rules in 424 ms. Remains 894 /1571 variables (removed 677) and now considering 1395/2173 (removed 778) transitions.
// Phase 1: matrix 1395 rows 894 cols
[2021-05-14 03:42:19] [INFO ] Computed 66 place invariants in 31 ms
[2021-05-14 03:42:19] [INFO ] Implicit Places using invariants in 415 ms returned []
// Phase 1: matrix 1395 rows 894 cols
[2021-05-14 03:42:19] [INFO ] Computed 66 place invariants in 8 ms
[2021-05-14 03:42:20] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
// Phase 1: matrix 1395 rows 894 cols
[2021-05-14 03:42:20] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 03:42:21] [INFO ] Dead Transitions using invariants and state equation in 629 ms returned []
Finished structural reductions, in 1 iterations. Remains : 894/1571 places, 1395/2173 transitions.
[2021-05-14 03:42:21] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-14 03:42:21] [INFO ] Flatten gal took : 145 ms
FORMULA NoC3x3-PT-5B-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 03:42:21] [INFO ] Flatten gal took : 79 ms
[2021-05-14 03:42:21] [INFO ] Input system was already deterministic with 1395 transitions.
Incomplete random walk after 100000 steps, including 162 resets, run finished after 552 ms. (steps per millisecond=181 ) properties (out of 28) seen :24
Running SMT prover for 4 properties.
// Phase 1: matrix 1395 rows 894 cols
[2021-05-14 03:42:22] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 03:42:22] [INFO ] [Real]Absence check using 66 positive place invariants in 25 ms returned sat
[2021-05-14 03:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 03:42:22] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2021-05-14 03:42:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 03:42:23] [INFO ] [Nat]Absence check using 66 positive place invariants in 26 ms returned sat
[2021-05-14 03:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 03:42:23] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2021-05-14 03:42:23] [INFO ] Computed and/alt/rep : 1362/3983/1362 causal constraints (skipped 32 transitions) in 62 ms.
[2021-05-14 03:42:43] [INFO ] Added : 965 causal constraints over 193 iterations in 19431 ms. Result :unknown
[2021-05-14 03:42:43] [INFO ] [Real]Absence check using 66 positive place invariants in 27 ms returned sat
[2021-05-14 03:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 03:42:43] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2021-05-14 03:42:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 03:42:43] [INFO ] [Nat]Absence check using 66 positive place invariants in 25 ms returned sat
[2021-05-14 03:42:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 03:42:43] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2021-05-14 03:42:44] [INFO ] Computed and/alt/rep : 1362/3983/1362 causal constraints (skipped 32 transitions) in 55 ms.
[2021-05-14 03:43:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 03:43:03] [INFO ] [Real]Absence check using 66 positive place invariants in 24 ms returned sat
[2021-05-14 03:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 03:43:03] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2021-05-14 03:43:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 03:43:04] [INFO ] [Nat]Absence check using 66 positive place invariants in 25 ms returned sat
[2021-05-14 03:43:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 03:43:04] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2021-05-14 03:43:04] [INFO ] Computed and/alt/rep : 1362/3983/1362 causal constraints (skipped 32 transitions) in 70 ms.
[2021-05-14 03:43:24] [INFO ] Added : 955 causal constraints over 191 iterations in 19419 ms. Result :unknown
[2021-05-14 03:43:24] [INFO ] [Real]Absence check using 66 positive place invariants in 24 ms returned sat
[2021-05-14 03:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 03:43:24] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2021-05-14 03:43:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 03:43:24] [INFO ] [Nat]Absence check using 66 positive place invariants in 28 ms returned sat
[2021-05-14 03:43:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 03:43:25] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2021-05-14 03:43:25] [INFO ] Computed and/alt/rep : 1362/3983/1362 causal constraints (skipped 32 transitions) in 84 ms.
[2021-05-14 03:43:44] [INFO ] Added : 920 causal constraints over 184 iterations in 19383 ms. Result :unknown
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F((p1&&X(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 881 transition count 1375
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 881 transition count 1375
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 876 transition count 1368
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 876 transition count 1368
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 874 transition count 1363
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 874 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 873 transition count 1362
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 873 transition count 1362
Applied a total of 42 rules in 60 ms. Remains 873 /894 variables (removed 21) and now considering 1362/1395 (removed 33) transitions.
// Phase 1: matrix 1362 rows 873 cols
[2021-05-14 03:43:44] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 03:43:44] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 1362 rows 873 cols
[2021-05-14 03:43:44] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 03:43:45] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
// Phase 1: matrix 1362 rows 873 cols
[2021-05-14 03:43:45] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 03:43:46] [INFO ] Dead Transitions using invariants and state equation in 647 ms returned []
Finished structural reductions, in 1 iterations. Remains : 873/894 places, 1362/1395 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-5B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(AND (EQ s99 1) (EQ s291 1)), p1:(EQ s791 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 428 steps with 0 reset in 8 ms.
FORMULA NoC3x3-PT-5B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-01 finished in 2011 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U X((p1||X((G(p2) U (G(p2)&&p3))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 881 transition count 1375
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 881 transition count 1375
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 876 transition count 1368
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 876 transition count 1368
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 873 transition count 1362
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 873 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 872 transition count 1361
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 872 transition count 1361
Applied a total of 44 rules in 60 ms. Remains 872 /894 variables (removed 22) and now considering 1361/1395 (removed 34) transitions.
// Phase 1: matrix 1361 rows 872 cols
[2021-05-14 03:43:46] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 03:43:46] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 1361 rows 872 cols
[2021-05-14 03:43:46] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 03:43:47] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
// Phase 1: matrix 1361 rows 872 cols
[2021-05-14 03:43:47] [INFO ] Computed 66 place invariants in 8 ms
[2021-05-14 03:43:48] [INFO ] Dead Transitions using invariants and state equation in 646 ms returned []
Finished structural reductions, in 1 iterations. Remains : 872/894 places, 1361/1395 transitions.
Stuttering acceptance computed with spot in 466 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=(AND p3 p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), acceptance={0} source=7 dest: 7}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), acceptance={} source=7 dest: 8}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={} source=7 dest: 9}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=7 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=7 dest: 12}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=8 dest: 6}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), acceptance={} source=8 dest: 10}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=8 dest: 13}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=9 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=10 dest: 6}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=10 dest: 10}, { cond=(AND p0 p3 p2), acceptance={} source=10 dest: 13}, { cond=(AND p0 (NOT p2)), acceptance={} source=10 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=11 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=11 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=11 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=11 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=12 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=12 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=13 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=13 dest: 6}, { cond=(AND p0 p2), acceptance={} source=13 dest: 13}, { cond=(AND p0 (NOT p2)), acceptance={} source=13 dest: 14}], [{ cond=(NOT p0), acceptance={} source=14 dest: 5}, { cond=p0, acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(OR (NEQ s564 1) (NEQ s632 1)), p1:(AND (EQ s727 1) (EQ s793 1)), p3:(AND (EQ s727 1) (EQ s793 1)), p2:(NEQ s195 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1351 steps with 1 reset in 14 ms.
FORMULA NoC3x3-PT-5B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-02 finished in 2274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p0)||X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 881 transition count 1376
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 881 transition count 1376
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 877 transition count 1371
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 877 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 874 transition count 1362
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 874 transition count 1362
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 872 transition count 1359
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 872 transition count 1359
Applied a total of 44 rules in 63 ms. Remains 872 /894 variables (removed 22) and now considering 1359/1395 (removed 36) transitions.
// Phase 1: matrix 1359 rows 872 cols
[2021-05-14 03:43:48] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 03:43:49] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 1359 rows 872 cols
[2021-05-14 03:43:49] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 03:43:49] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
// Phase 1: matrix 1359 rows 872 cols
[2021-05-14 03:43:49] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 03:43:50] [INFO ] Dead Transitions using invariants and state equation in 546 ms returned []
Finished structural reductions, in 1 iterations. Remains : 872/894 places, 1359/1395 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s238 1), p1:(OR (NEQ s558 1) (NEQ s617 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24965 reset in 472 ms.
Product exploration explored 100000 steps with 25080 reset in 445 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 24966 reset in 319 ms.
Product exploration explored 100000 steps with 24961 reset in 311 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 872 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 872/872 places, 1359/1359 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 872 transition count 1359
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 38 Pre rules applied. Total rules applied 58 place count 872 transition count 1464
Deduced a syphon composed of 96 places in 3 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 96 place count 872 transition count 1464
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 120 place count 848 transition count 1368
Deduced a syphon composed of 96 places in 3 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 144 place count 848 transition count 1368
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 168 place count 824 transition count 1272
Deduced a syphon composed of 72 places in 3 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 192 place count 824 transition count 1272
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 266 places in 1 ms
Iterating global reduction 1 with 194 rules applied. Total rules applied 386 place count 824 transition count 1293
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 389 place count 824 transition count 1290
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 446 place count 767 transition count 1233
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 503 place count 767 transition count 1233
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -250
Deduced a syphon composed of 310 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 604 place count 767 transition count 1483
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 618 place count 767 transition count 1469
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 346 places in 1 ms
Iterating global reduction 3 with 36 rules applied. Total rules applied 654 place count 767 transition count 1553
Deduced a syphon composed of 346 places in 1 ms
Drop transitions removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 3 with 76 rules applied. Total rules applied 730 place count 767 transition count 1477
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 739 place count 758 transition count 1477
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 756 place count 741 transition count 1460
Deduced a syphon composed of 329 places in 1 ms
Iterating global reduction 4 with 17 rules applied. Total rules applied 773 place count 741 transition count 1460
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 343 places in 1 ms
Iterating global reduction 4 with 14 rules applied. Total rules applied 787 place count 741 transition count 1482
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 792 place count 736 transition count 1477
Deduced a syphon composed of 338 places in 1 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 797 place count 736 transition count 1477
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 348 places in 1 ms
Iterating global reduction 4 with 10 rules applied. Total rules applied 807 place count 736 transition count 1507
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 810 place count 733 transition count 1501
Deduced a syphon composed of 345 places in 1 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 813 place count 733 transition count 1501
Deduced a syphon composed of 345 places in 1 ms
Applied a total of 813 rules in 425 ms. Remains 733 /872 variables (removed 139) and now considering 1501/1359 (removed -142) transitions.
[2021-05-14 03:43:53] [INFO ] Redundant transitions in 108 ms returned []
// Phase 1: matrix 1501 rows 733 cols
[2021-05-14 03:43:53] [INFO ] Computed 57 place invariants in 7 ms
[2021-05-14 03:43:53] [INFO ] Dead Transitions using invariants and state equation in 632 ms returned []
Finished structural reductions, in 1 iterations. Remains : 733/872 places, 1501/1359 transitions.
Product exploration explored 100000 steps with 25018 reset in 2047 ms.
Product exploration explored 100000 steps with 25044 reset in 1872 ms.
[2021-05-14 03:43:57] [INFO ] Flatten gal took : 60 ms
[2021-05-14 03:43:57] [INFO ] Flatten gal took : 55 ms
[2021-05-14 03:43:57] [INFO ] Time to serialize gal into /tmp/LTL11598696074251750246.gal : 26 ms
[2021-05-14 03:43:57] [INFO ] Time to serialize properties into /tmp/LTL8486476762236307526.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/LTL11598696074251750246.gal, -t, CGAL, -LTL, /tmp/LTL8486476762236307526.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/LTL11598696074251750246.gal -t CGAL -LTL /tmp/LTL8486476762236307526.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((G("(p366==1)"))||(X(F("((p1004!=1)||(p1114!=1))")))))))
Formula 0 simplified : !XG(G"(p366==1)" | XF"((p1004!=1)||(p1114!=1))")
Detected timeout of ITS tools.
[2021-05-14 03:44:12] [INFO ] Flatten gal took : 53 ms
[2021-05-14 03:44:12] [INFO ] Applying decomposition
[2021-05-14 03:44:12] [INFO ] Flatten gal took : 48 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/graph11164618678700269542.txt, -o, /tmp/graph11164618678700269542.bin, -w, /tmp/graph11164618678700269542.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/graph11164618678700269542.bin, -l, -1, -v, -w, /tmp/graph11164618678700269542.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 03:44:13] [INFO ] Decomposing Gal with order
[2021-05-14 03:44:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 03:44:13] [INFO ] Removed a total of 1147 redundant transitions.
[2021-05-14 03:44:13] [INFO ] Flatten gal took : 153 ms
[2021-05-14 03:44:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 45 ms.
[2021-05-14 03:44:13] [INFO ] Time to serialize gal into /tmp/LTL1382697104562670346.gal : 16 ms
[2021-05-14 03:44:13] [INFO ] Time to serialize properties into /tmp/LTL15902874660801327090.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/LTL1382697104562670346.gal, -t, CGAL, -LTL, /tmp/LTL15902874660801327090.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/LTL1382697104562670346.gal -t CGAL -LTL /tmp/LTL15902874660801327090.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G((G("(i4.u83.p366==1)"))||(X(F("((i7.u194.p1004!=1)||(i7.u214.p1114!=1))")))))))
Formula 0 simplified : !XG(G"(i4.u83.p366==1)" | XF"((i7.u194.p1004!=1)||(i7.u214.p1114!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2968317591911841220
[2021-05-14 03:44:28] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2968317591911841220
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/ltsmin2968317591911841220]
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/ltsmin2968317591911841220] 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/ltsmin2968317591911841220] 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-5B-03 finished in 40695 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 881 transition count 1376
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 881 transition count 1376
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 875 transition count 1368
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 875 transition count 1368
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 871 transition count 1356
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 871 transition count 1356
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 869 transition count 1353
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 869 transition count 1353
Applied a total of 50 rules in 111 ms. Remains 869 /894 variables (removed 25) and now considering 1353/1395 (removed 42) transitions.
// Phase 1: matrix 1353 rows 869 cols
[2021-05-14 03:44:29] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:44:29] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 1353 rows 869 cols
[2021-05-14 03:44:29] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:44:30] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
// Phase 1: matrix 1353 rows 869 cols
[2021-05-14 03:44:30] [INFO ] Computed 66 place invariants in 22 ms
[2021-05-14 03:44:31] [INFO ] Dead Transitions using invariants and state equation in 603 ms returned []
Finished structural reductions, in 1 iterations. Remains : 869/894 places, 1353/1395 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (NEQ s409 1) (NEQ s549 1)), p1:(EQ s583 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 3643 steps with 5 reset in 33 ms.
FORMULA NoC3x3-PT-5B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-04 finished in 1957 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X(X(G((p1 U p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 879 transition count 1373
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 879 transition count 1373
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 873 transition count 1365
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 873 transition count 1365
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 869 transition count 1353
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 869 transition count 1353
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 867 transition count 1350
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 867 transition count 1350
Applied a total of 54 rules in 55 ms. Remains 867 /894 variables (removed 27) and now considering 1350/1395 (removed 45) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2021-05-14 03:44:31] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 03:44:31] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 1350 rows 867 cols
[2021-05-14 03:44:31] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 03:44:32] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
// Phase 1: matrix 1350 rows 867 cols
[2021-05-14 03:44:32] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 03:44:33] [INFO ] Dead Transitions using invariants and state equation in 646 ms returned []
Finished structural reductions, in 1 iterations. Remains : 867/894 places, 1350/1395 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s46 1) (OR (EQ s72 0) (EQ s102 0))), p2:(EQ s46 1), p1:(AND (EQ s133 1) (EQ s184 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 426 reset in 278 ms.
Stack based approach found an accepted trace after 5859 steps with 26 reset with depth 24 and stack size 24 in 19 ms.
FORMULA NoC3x3-PT-5B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-05 finished in 2413 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((p0&&X(p1)))||F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 880 transition count 1375
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 880 transition count 1375
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 874 transition count 1367
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 874 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 870 transition count 1355
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 870 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 868 transition count 1352
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 868 transition count 1352
Applied a total of 52 rules in 56 ms. Remains 868 /894 variables (removed 26) and now considering 1352/1395 (removed 43) transitions.
// Phase 1: matrix 1352 rows 868 cols
[2021-05-14 03:44:33] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:44:34] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 1352 rows 868 cols
[2021-05-14 03:44:34] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:44:35] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
// Phase 1: matrix 1352 rows 868 cols
[2021-05-14 03:44:35] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:44:35] [INFO ] Dead Transitions using invariants and state equation in 540 ms returned []
Finished structural reductions, in 1 iterations. Remains : 868/894 places, 1352/1395 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-5B-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(EQ s202 1), p1:(AND (EQ s290 1) (EQ s356 1)), p2:(AND (EQ s719 1) (EQ s776 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 859 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-5B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-07 finished in 1762 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 893 transition count 1329
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 828 transition count 1328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 827 transition count 1328
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 132 place count 827 transition count 1291
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 206 place count 790 transition count 1291
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 243 place count 753 transition count 1172
Iterating global reduction 3 with 37 rules applied. Total rules applied 280 place count 753 transition count 1172
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 284 place count 749 transition count 1166
Iterating global reduction 3 with 4 rules applied. Total rules applied 288 place count 749 transition count 1166
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 290 place count 747 transition count 1161
Iterating global reduction 3 with 2 rules applied. Total rules applied 292 place count 747 transition count 1161
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 3 with 388 rules applied. Total rules applied 680 place count 553 transition count 967
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 684 place count 553 transition count 963
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 685 place count 552 transition count 960
Iterating global reduction 4 with 1 rules applied. Total rules applied 686 place count 552 transition count 960
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 687 place count 551 transition count 958
Iterating global reduction 4 with 1 rules applied. Total rules applied 688 place count 551 transition count 958
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 890 place count 450 transition count 986
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 904 place count 450 transition count 972
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 974 place count 415 transition count 980
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 5 with 62 rules applied. Total rules applied 1036 place count 415 transition count 918
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1045 place count 406 transition count 918
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 1045 place count 406 transition count 913
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1055 place count 401 transition count 913
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 1093 place count 382 transition count 894
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1094 place count 381 transition count 893
Applied a total of 1094 rules in 184 ms. Remains 381 /894 variables (removed 513) and now considering 893/1395 (removed 502) transitions.
// Phase 1: matrix 893 rows 381 cols
[2021-05-14 03:44:35] [INFO ] Computed 57 place invariants in 6 ms
[2021-05-14 03:44:36] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 893 rows 381 cols
[2021-05-14 03:44:36] [INFO ] Computed 57 place invariants in 8 ms
[2021-05-14 03:44:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2021-05-14 03:44:36] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2021-05-14 03:44:36] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 893 rows 381 cols
[2021-05-14 03:44:36] [INFO ] Computed 57 place invariants in 5 ms
[2021-05-14 03:44:37] [INFO ] Dead Transitions using invariants and state equation in 348 ms returned []
Finished structural reductions, in 1 iterations. Remains : 381/894 places, 893/1395 transitions.
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s372 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 572 steps with 2 reset in 3 ms.
FORMULA NoC3x3-PT-5B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-08 finished in 1481 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 880 transition count 1375
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 880 transition count 1375
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 875 transition count 1369
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 875 transition count 1369
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 872 transition count 1359
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 872 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 871 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 871 transition count 1357
Applied a total of 46 rules in 58 ms. Remains 871 /894 variables (removed 23) and now considering 1357/1395 (removed 38) transitions.
// Phase 1: matrix 1357 rows 871 cols
[2021-05-14 03:44:37] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 03:44:37] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 1357 rows 871 cols
[2021-05-14 03:44:37] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:44:38] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
// Phase 1: matrix 1357 rows 871 cols
[2021-05-14 03:44:38] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:44:38] [INFO ] Dead Transitions using invariants and state equation in 666 ms returned []
Finished structural reductions, in 1 iterations. Remains : 871/894 places, 1357/1395 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-09 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:(AND (EQ s396 1) (EQ s462 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]]
Stuttering criterion allowed to conclude after 636 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-5B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-09 finished in 1850 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 879 transition count 1373
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 879 transition count 1373
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 873 transition count 1365
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 873 transition count 1365
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 869 transition count 1353
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 869 transition count 1353
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 867 transition count 1350
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 867 transition count 1350
Applied a total of 54 rules in 53 ms. Remains 867 /894 variables (removed 27) and now considering 1350/1395 (removed 45) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2021-05-14 03:44:39] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 03:44:39] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 1350 rows 867 cols
[2021-05-14 03:44:39] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:44:40] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
// Phase 1: matrix 1350 rows 867 cols
[2021-05-14 03:44:40] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 03:44:40] [INFO ] Dead Transitions using invariants and state equation in 620 ms returned []
Finished structural reductions, in 1 iterations. Remains : 867/894 places, 1350/1395 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-5B-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s813 1), p1:(NEQ s171 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 588 ms.
Product exploration explored 100000 steps with 33333 reset in 603 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 564 ms.
Product exploration explored 100000 steps with 33333 reset in 617 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 867 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 867/867 places, 1350/1350 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 867 transition count 1350
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 59 place count 867 transition count 1454
Deduced a syphon composed of 96 places in 2 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 96 place count 867 transition count 1454
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 120 place count 843 transition count 1358
Deduced a syphon composed of 96 places in 3 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 144 place count 843 transition count 1358
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 168 place count 819 transition count 1262
Deduced a syphon composed of 72 places in 2 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 192 place count 819 transition count 1262
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 267 places in 1 ms
Iterating global reduction 1 with 195 rules applied. Total rules applied 387 place count 819 transition count 1282
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 390 place count 819 transition count 1279
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 447 place count 762 transition count 1222
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 504 place count 762 transition count 1222
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -248
Deduced a syphon composed of 311 places in 0 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 605 place count 762 transition count 1470
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 619 place count 762 transition count 1456
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -82
Deduced a syphon composed of 346 places in 0 ms
Iterating global reduction 3 with 35 rules applied. Total rules applied 654 place count 762 transition count 1538
Deduced a syphon composed of 346 places in 1 ms
Drop transitions removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 3 with 76 rules applied. Total rules applied 730 place count 762 transition count 1462
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 739 place count 753 transition count 1462
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 756 place count 736 transition count 1445
Deduced a syphon composed of 329 places in 1 ms
Iterating global reduction 4 with 17 rules applied. Total rules applied 773 place count 736 transition count 1445
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 344 places in 1 ms
Iterating global reduction 4 with 15 rules applied. Total rules applied 788 place count 736 transition count 1467
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 794 place count 730 transition count 1460
Deduced a syphon composed of 338 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 800 place count 730 transition count 1460
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 346 places in 1 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 808 place count 730 transition count 1486
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 809 place count 729 transition count 1484
Deduced a syphon composed of 345 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 810 place count 729 transition count 1484
Deduced a syphon composed of 345 places in 0 ms
Applied a total of 810 rules in 235 ms. Remains 729 /867 variables (removed 138) and now considering 1484/1350 (removed -134) transitions.
[2021-05-14 03:44:43] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1484 rows 729 cols
[2021-05-14 03:44:43] [INFO ] Computed 57 place invariants in 7 ms
[2021-05-14 03:44:44] [INFO ] Dead Transitions using invariants and state equation in 625 ms returned []
Finished structural reductions, in 1 iterations. Remains : 729/867 places, 1484/1350 transitions.
Product exploration explored 100000 steps with 33333 reset in 2502 ms.
Product exploration explored 100000 steps with 33333 reset in 2530 ms.
[2021-05-14 03:44:49] [INFO ] Flatten gal took : 43 ms
[2021-05-14 03:44:49] [INFO ] Flatten gal took : 42 ms
[2021-05-14 03:44:49] [INFO ] Time to serialize gal into /tmp/LTL2816558451680209902.gal : 4 ms
[2021-05-14 03:44:49] [INFO ] Time to serialize properties into /tmp/LTL12322544965181343517.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/LTL2816558451680209902.gal, -t, CGAL, -LTL, /tmp/LTL12322544965181343517.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/LTL2816558451680209902.gal -t CGAL -LTL /tmp/LTL12322544965181343517.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(p1490==1)"))||(X("(p246!=1)"))))))
Formula 0 simplified : !XF(G"(p1490==1)" | X"(p246!=1)")
Detected timeout of ITS tools.
[2021-05-14 03:45:04] [INFO ] Flatten gal took : 43 ms
[2021-05-14 03:45:04] [INFO ] Applying decomposition
[2021-05-14 03:45:04] [INFO ] Flatten gal took : 43 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/graph17023615881129198124.txt, -o, /tmp/graph17023615881129198124.bin, -w, /tmp/graph17023615881129198124.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/graph17023615881129198124.bin, -l, -1, -v, -w, /tmp/graph17023615881129198124.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 03:45:04] [INFO ] Decomposing Gal with order
[2021-05-14 03:45:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 03:45:05] [INFO ] Removed a total of 1080 redundant transitions.
[2021-05-14 03:45:05] [INFO ] Flatten gal took : 93 ms
[2021-05-14 03:45:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 24 ms.
[2021-05-14 03:45:05] [INFO ] Time to serialize gal into /tmp/LTL15547116373903267282.gal : 8 ms
[2021-05-14 03:45:05] [INFO ] Time to serialize properties into /tmp/LTL10879699422061080147.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/LTL15547116373903267282.gal, -t, CGAL, -LTL, /tmp/LTL10879699422061080147.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/LTL15547116373903267282.gal -t CGAL -LTL /tmp/LTL10879699422061080147.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(i9.u260.p1490==1)"))||(X("(i1.i0.i1.u58.p246!=1)"))))))
Formula 0 simplified : !XF(G"(i9.u260.p1490==1)" | X"(i1.i0.i1.u58.p246!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2583274656389010439
[2021-05-14 03:45:20] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2583274656389010439
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/ltsmin2583274656389010439]
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/ltsmin2583274656389010439] 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/ltsmin2583274656389010439] 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-5B-10 finished in 42159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 880 transition count 1375
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 880 transition count 1375
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 874 transition count 1367
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 874 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 870 transition count 1355
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 870 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 868 transition count 1352
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 868 transition count 1352
Applied a total of 52 rules in 54 ms. Remains 868 /894 variables (removed 26) and now considering 1352/1395 (removed 43) transitions.
// Phase 1: matrix 1352 rows 868 cols
[2021-05-14 03:45:21] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:45:21] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 1352 rows 868 cols
[2021-05-14 03:45:21] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:45:22] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
// Phase 1: matrix 1352 rows 868 cols
[2021-05-14 03:45:22] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:45:22] [INFO ] Dead Transitions using invariants and state equation in 622 ms returned []
Finished structural reductions, in 1 iterations. Remains : 868/894 places, 1352/1395 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s135 1) (EQ s212 1)), p1:(AND (EQ s387 1) (EQ s518 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 570 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-5B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-11 finished in 1836 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p1))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 880 transition count 1374
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 880 transition count 1374
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 874 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 874 transition count 1366
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 870 transition count 1354
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 870 transition count 1354
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 868 transition count 1351
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 868 transition count 1351
Applied a total of 52 rules in 76 ms. Remains 868 /894 variables (removed 26) and now considering 1351/1395 (removed 44) transitions.
// Phase 1: matrix 1351 rows 868 cols
[2021-05-14 03:45:23] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:45:23] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 1351 rows 868 cols
[2021-05-14 03:45:23] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:45:24] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
// Phase 1: matrix 1351 rows 868 cols
[2021-05-14 03:45:24] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:45:24] [INFO ] Dead Transitions using invariants and state equation in 627 ms returned []
Finished structural reductions, in 1 iterations. Remains : 868/894 places, 1351/1395 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s329 1) (NEQ s393 1)), p1:(OR (NEQ s820 1) (NEQ s866 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 50000 reset in 800 ms.
Product exploration explored 100000 steps with 50000 reset in 815 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 811 ms.
Product exploration explored 100000 steps with 50000 reset in 822 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 868 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 868/868 places, 1351/1351 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 868 transition count 1351
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 59 place count 868 transition count 1455
Deduced a syphon composed of 96 places in 3 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 96 place count 868 transition count 1455
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 120 place count 844 transition count 1359
Deduced a syphon composed of 96 places in 2 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 144 place count 844 transition count 1359
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 168 place count 820 transition count 1263
Deduced a syphon composed of 72 places in 2 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 192 place count 820 transition count 1263
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 266 places in 1 ms
Iterating global reduction 1 with 194 rules applied. Total rules applied 386 place count 820 transition count 1284
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 390 place count 820 transition count 1280
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 446 place count 764 transition count 1224
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 502 place count 764 transition count 1224
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -248
Deduced a syphon composed of 311 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 603 place count 764 transition count 1472
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 617 place count 764 transition count 1458
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -82
Deduced a syphon composed of 346 places in 0 ms
Iterating global reduction 3 with 35 rules applied. Total rules applied 652 place count 764 transition count 1540
Deduced a syphon composed of 346 places in 0 ms
Drop transitions removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 3 with 76 rules applied. Total rules applied 728 place count 764 transition count 1464
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 737 place count 755 transition count 1464
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 754 place count 738 transition count 1447
Deduced a syphon composed of 329 places in 1 ms
Iterating global reduction 4 with 17 rules applied. Total rules applied 771 place count 738 transition count 1447
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 343 places in 0 ms
Iterating global reduction 4 with 14 rules applied. Total rules applied 785 place count 738 transition count 1467
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 791 place count 732 transition count 1460
Deduced a syphon composed of 337 places in 1 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 797 place count 732 transition count 1460
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 347 places in 0 ms
Iterating global reduction 4 with 10 rules applied. Total rules applied 807 place count 732 transition count 1492
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 809 place count 730 transition count 1488
Deduced a syphon composed of 345 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 811 place count 730 transition count 1488
Deduced a syphon composed of 345 places in 0 ms
Applied a total of 811 rules in 202 ms. Remains 730 /868 variables (removed 138) and now considering 1488/1351 (removed -137) transitions.
[2021-05-14 03:45:28] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1488 rows 730 cols
[2021-05-14 03:45:28] [INFO ] Computed 57 place invariants in 6 ms
[2021-05-14 03:45:29] [INFO ] Dead Transitions using invariants and state equation in 534 ms returned []
Finished structural reductions, in 1 iterations. Remains : 730/868 places, 1488/1351 transitions.
Product exploration explored 100000 steps with 50000 reset in 807 ms.
Product exploration explored 100000 steps with 50000 reset in 804 ms.
[2021-05-14 03:45:30] [INFO ] Flatten gal took : 39 ms
[2021-05-14 03:45:30] [INFO ] Flatten gal took : 41 ms
[2021-05-14 03:45:30] [INFO ] Time to serialize gal into /tmp/LTL11778090652141008710.gal : 4 ms
[2021-05-14 03:45:30] [INFO ] Time to serialize properties into /tmp/LTL4818620891454935211.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/LTL11778090652141008710.gal, -t, CGAL, -LTL, /tmp/LTL4818620891454935211.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/LTL11778090652141008710.gal -t CGAL -LTL /tmp/LTL4818620891454935211.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p518!=1)||(p633!=1))")||(X(F("((p1500!=1)||(p1569!=1))"))))))
Formula 0 simplified : !X("((p518!=1)||(p633!=1))" | XF"((p1500!=1)||(p1569!=1))")
Detected timeout of ITS tools.
[2021-05-14 03:45:45] [INFO ] Flatten gal took : 38 ms
[2021-05-14 03:45:45] [INFO ] Applying decomposition
[2021-05-14 03:45:45] [INFO ] Flatten gal took : 40 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/graph9631480823127667705.txt, -o, /tmp/graph9631480823127667705.bin, -w, /tmp/graph9631480823127667705.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/graph9631480823127667705.bin, -l, -1, -v, -w, /tmp/graph9631480823127667705.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 03:45:46] [INFO ] Decomposing Gal with order
[2021-05-14 03:45:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 03:45:46] [INFO ] Removed a total of 1150 redundant transitions.
[2021-05-14 03:45:46] [INFO ] Flatten gal took : 78 ms
[2021-05-14 03:45:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 14 ms.
[2021-05-14 03:45:46] [INFO ] Time to serialize gal into /tmp/LTL2857716601681646193.gal : 9 ms
[2021-05-14 03:45:46] [INFO ] Time to serialize properties into /tmp/LTL6251148332434039828.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/LTL2857716601681646193.gal, -t, CGAL, -LTL, /tmp/LTL6251148332434039828.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/LTL2857716601681646193.gal -t CGAL -LTL /tmp/LTL6251148332434039828.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i4.u120.p518!=1)||(i7.u172.p633!=1))")||(X(F("((i11.u282.p1500!=1)||(i11.u296.p1569!=1))"))))))
Formula 0 simplified : !X("((i4.u120.p518!=1)||(i7.u172.p633!=1))" | XF"((i11.u282.p1500!=1)||(i11.u296.p1569!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7623804383430982396
[2021-05-14 03:46:01] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7623804383430982396
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/ltsmin7623804383430982396]
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/ltsmin7623804383430982396] 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/ltsmin7623804383430982396] 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-5B-12 finished in 39294 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 880 transition count 1375
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 880 transition count 1375
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 874 transition count 1367
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 874 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 870 transition count 1355
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 870 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 868 transition count 1352
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 868 transition count 1352
Applied a total of 52 rules in 52 ms. Remains 868 /894 variables (removed 26) and now considering 1352/1395 (removed 43) transitions.
// Phase 1: matrix 1352 rows 868 cols
[2021-05-14 03:46:02] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:46:02] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 1352 rows 868 cols
[2021-05-14 03:46:02] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:46:03] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
// Phase 1: matrix 1352 rows 868 cols
[2021-05-14 03:46:03] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 03:46:04] [INFO ] Dead Transitions using invariants and state equation in 657 ms returned []
Finished structural reductions, in 1 iterations. Remains : 868/894 places, 1352/1395 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s431 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-5B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-13 finished in 1809 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||(F(p0)&&F(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 879 transition count 1373
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 879 transition count 1373
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 873 transition count 1365
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 873 transition count 1365
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 870 transition count 1354
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 870 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 869 transition count 1353
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 869 transition count 1353
Applied a total of 50 rules in 54 ms. Remains 869 /894 variables (removed 25) and now considering 1353/1395 (removed 42) transitions.
// Phase 1: matrix 1353 rows 869 cols
[2021-05-14 03:46:04] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 03:46:04] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 1353 rows 869 cols
[2021-05-14 03:46:04] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 03:46:05] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
// Phase 1: matrix 1353 rows 869 cols
[2021-05-14 03:46:05] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 03:46:05] [INFO ] Dead Transitions using invariants and state equation in 563 ms returned []
Finished structural reductions, in 1 iterations. Remains : 869/894 places, 1353/1395 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s413 1) (EQ s479 1)), p1:(EQ s791 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 623 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-5B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-14 finished in 1798 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 894 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 894/894 places, 1395/1395 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 893 transition count 1328
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 827 transition count 1328
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 132 place count 827 transition count 1292
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 204 place count 791 transition count 1292
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 239 place count 756 transition count 1178
Iterating global reduction 2 with 35 rules applied. Total rules applied 274 place count 756 transition count 1178
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 277 place count 753 transition count 1174
Iterating global reduction 2 with 3 rules applied. Total rules applied 280 place count 753 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 281 place count 752 transition count 1172
Iterating global reduction 2 with 1 rules applied. Total rules applied 282 place count 752 transition count 1172
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 191
Deduced a syphon composed of 191 places in 0 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 2 with 382 rules applied. Total rules applied 664 place count 561 transition count 981
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 667 place count 561 transition count 978
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 668 place count 560 transition count 975
Iterating global reduction 3 with 1 rules applied. Total rules applied 669 place count 560 transition count 975
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 670 place count 559 transition count 973
Iterating global reduction 3 with 1 rules applied. Total rules applied 671 place count 559 transition count 973
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 873 place count 458 transition count 1002
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 887 place count 458 transition count 988
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 959 place count 422 transition count 996
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 4 with 60 rules applied. Total rules applied 1019 place count 422 transition count 936
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1028 place count 413 transition count 936
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1028 place count 413 transition count 931
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1038 place count 408 transition count 931
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 1074 place count 390 transition count 913
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1076 place count 389 transition count 913
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1078 place count 389 transition count 913
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1079 place count 388 transition count 912
Applied a total of 1079 rules in 184 ms. Remains 388 /894 variables (removed 506) and now considering 912/1395 (removed 483) transitions.
[2021-05-14 03:46:06] [INFO ] Flow matrix only has 911 transitions (discarded 1 similar events)
// Phase 1: matrix 911 rows 388 cols
[2021-05-14 03:46:06] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 03:46:06] [INFO ] Implicit Places using invariants in 176 ms returned []
[2021-05-14 03:46:06] [INFO ] Flow matrix only has 911 transitions (discarded 1 similar events)
// Phase 1: matrix 911 rows 388 cols
[2021-05-14 03:46:06] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-14 03:46:06] [INFO ] State equation strengthened by 32 read => feed constraints.
[2021-05-14 03:46:06] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2021-05-14 03:46:06] [INFO ] Redundant transitions in 12 ms returned []
[2021-05-14 03:46:06] [INFO ] Flow matrix only has 911 transitions (discarded 1 similar events)
// Phase 1: matrix 911 rows 388 cols
[2021-05-14 03:46:06] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 03:46:07] [INFO ] Dead Transitions using invariants and state equation in 316 ms returned []
Finished structural reductions, in 1 iterations. Remains : 388/894 places, 912/1395 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s170 0) (EQ s195 0)) (OR (EQ s234 0) (EQ s267 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 479 reset in 469 ms.
Product exploration explored 100000 steps with 482 reset in 476 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 490 reset in 435 ms.
Product exploration explored 100000 steps with 491 reset in 465 ms.
[2021-05-14 03:46:09] [INFO ] Flatten gal took : 35 ms
[2021-05-14 03:46:09] [INFO ] Flatten gal took : 31 ms
[2021-05-14 03:46:09] [INFO ] Time to serialize gal into /tmp/LTL3386450474223587159.gal : 4 ms
[2021-05-14 03:46:09] [INFO ] Time to serialize properties into /tmp/LTL4089683651863760402.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/LTL3386450474223587159.gal, -t, CGAL, -LTL, /tmp/LTL4089683651863760402.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/LTL3386450474223587159.gal -t CGAL -LTL /tmp/LTL4089683651863760402.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p680==0)||(p818==0))&&((p1004==0)||(p1128==0)))"))))
Formula 0 simplified : !GF"(((p680==0)||(p818==0))&&((p1004==0)||(p1128==0)))"
Detected timeout of ITS tools.
[2021-05-14 03:46:24] [INFO ] Flatten gal took : 30 ms
[2021-05-14 03:46:24] [INFO ] Applying decomposition
[2021-05-14 03:46:24] [INFO ] Flatten gal took : 29 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/graph10473928098069823900.txt, -o, /tmp/graph10473928098069823900.bin, -w, /tmp/graph10473928098069823900.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/graph10473928098069823900.bin, -l, -1, -v, -w, /tmp/graph10473928098069823900.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 03:46:24] [INFO ] Decomposing Gal with order
[2021-05-14 03:46:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 03:46:24] [INFO ] Removed a total of 577 redundant transitions.
[2021-05-14 03:46:24] [INFO ] Flatten gal took : 58 ms
[2021-05-14 03:46:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 613 labels/synchronizations in 9 ms.
[2021-05-14 03:46:24] [INFO ] Time to serialize gal into /tmp/LTL3921865505485320518.gal : 7 ms
[2021-05-14 03:46:24] [INFO ] Time to serialize properties into /tmp/LTL8941125822516068957.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/LTL3921865505485320518.gal, -t, CGAL, -LTL, /tmp/LTL8941125822516068957.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/LTL3921865505485320518.gal -t CGAL -LTL /tmp/LTL8941125822516068957.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i4.u23.p680==0)||(i4.u21.p818==0))&&((i5.u25.p1004==0)||(i5.u29.p1128==0)))"))))
Formula 0 simplified : !GF"(((i4.u23.p680==0)||(i4.u21.p818==0))&&((i5.u25.p1004==0)||(i5.u29.p1128==0)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15729069901202508959
[2021-05-14 03:46:39] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15729069901202508959
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/ltsmin15729069901202508959]
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/ltsmin15729069901202508959] 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/ltsmin15729069901202508959] 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-5B-15 finished in 34842 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2050180547317119133
[2021-05-14 03:46:40] [INFO ] Computing symmetric may disable matrix : 1395 transitions.
[2021-05-14 03:46:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 03:46:40] [INFO ] Applying decomposition
[2021-05-14 03:46:40] [INFO ] Computing symmetric may enable matrix : 1395 transitions.
[2021-05-14 03:46:40] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 03:46:40] [INFO ] Flatten gal took : 36 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/graph16014528732739607062.txt, -o, /tmp/graph16014528732739607062.bin, -w, /tmp/graph16014528732739607062.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/graph16014528732739607062.bin, -l, -1, -v, -w, /tmp/graph16014528732739607062.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 03:46:40] [INFO ] Decomposing Gal with order
[2021-05-14 03:46:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 03:46:41] [INFO ] Computing Do-Not-Accords matrix : 1395 transitions.
[2021-05-14 03:46:41] [INFO ] Computation of Completed DNA matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 03:46:41] [INFO ] Built C files in 339ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2050180547317119133
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/ltsmin2050180547317119133]
[2021-05-14 03:46:41] [INFO ] Removed a total of 1269 redundant transitions.
[2021-05-14 03:46:41] [INFO ] Flatten gal took : 113 ms
[2021-05-14 03:46:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 15 ms.
[2021-05-14 03:46:41] [INFO ] Time to serialize gal into /tmp/LTLFireability14503396104971002379.gal : 19 ms
[2021-05-14 03:46:41] [INFO ] Time to serialize properties into /tmp/LTLFireability12778091107746478937.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/LTLFireability14503396104971002379.gal, -t, CGAL, -LTL, /tmp/LTLFireability12778091107746478937.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/LTLFireability14503396104971002379.gal -t CGAL -LTL /tmp/LTLFireability12778091107746478937.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(G((G("(i3.u85.p366==1)"))||(X(F(!("((i8.i0.i3.u209.p1004==1)&&(i8.i0.i5.u232.p1114==1))"))))))))
Formula 0 simplified : !XG(G"(i3.u85.p366==1)" | XF!"((i8.i0.i3.u209.p1004==1)&&(i8.i0.i5.u232.p1114==1))")
Compilation finished in 12407 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2050180547317119133]
Link finished in 92 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2050180547317119133]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2050180547317119133]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp2==true))||X((LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2050180547317119133]
LTSmin run took 318 ms.
FORMULA NoC3x3-PT-5B-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X(<>((LTLAPp5==true)))||(LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2050180547317119133]
LTSmin run took 522 ms.
FORMULA NoC3x3-PT-5B-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp6==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2050180547317119133]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp6==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2050180547317119133]
Retrying LTSmin with larger timeout 2056 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2050180547317119133]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.163: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.163: LTL layer: formula: X([](([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))))
pins2lts-mc-linux64( 1/ 8), 0.168: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.170: "X([](([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.174: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.181: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.180: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.189: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.196: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.196: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.210: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.214: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.514: DFS-FIFO for weak LTL, using special progress label 1403
pins2lts-mc-linux64( 0/ 8), 0.514: There are 1404 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.514: State length is 895, there are 1399 groups
pins2lts-mc-linux64( 0/ 8), 0.514: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.514: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.514: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.514: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.759: ~2 levels ~960 states ~2304 transitions
pins2lts-mc-linux64( 7/ 8), 0.814: ~2 levels ~1920 states ~4400 transitions
pins2lts-mc-linux64( 5/ 8), 0.874: ~2 levels ~3840 states ~9464 transitions
pins2lts-mc-linux64( 7/ 8), 1.029: ~2 levels ~7680 states ~23760 transitions
pins2lts-mc-linux64( 4/ 8), 1.330: ~2 levels ~15360 states ~52016 transitions
pins2lts-mc-linux64( 1/ 8), 1.785: ~2 levels ~30720 states ~99816 transitions
pins2lts-mc-linux64( 3/ 8), 2.670: ~2 levels ~61440 states ~224896 transitions
pins2lts-mc-linux64( 2/ 8), 4.203: ~2 levels ~122880 states ~482176 transitions
pins2lts-mc-linux64( 6/ 8), 6.730: ~2 levels ~245760 states ~1027728 transitions
pins2lts-mc-linux64( 0/ 8), 17.988: ~2 levels ~491520 states ~2115016 transitions
pins2lts-mc-linux64( 0/ 8), 39.886: ~2 levels ~983040 states ~4334920 transitions
pins2lts-mc-linux64( 0/ 8), 86.539: ~2 levels ~1966080 states ~9049352 transitions
pins2lts-mc-linux64( 6/ 8), 179.038: ~2 levels ~3932160 states ~19221328 transitions
pins2lts-mc-linux64( 6/ 8), 368.700: ~2 levels ~7864320 states ~41399568 transitions
pins2lts-mc-linux64( 3/ 8), 707.738: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 707.845:
pins2lts-mc-linux64( 0/ 8), 707.845: mean standard work distribution: 1.7% (states) 3.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 707.845:
pins2lts-mc-linux64( 0/ 8), 707.845: Explored 14535056 states 79079520 transitions, fanout: 5.441
pins2lts-mc-linux64( 0/ 8), 707.845: Total exploration time 707.310 sec (707.220 sec minimum, 707.254 sec on average)
pins2lts-mc-linux64( 0/ 8), 707.845: States per second: 20550, Transitions per second: 111803
pins2lts-mc-linux64( 0/ 8), 707.845:
pins2lts-mc-linux64( 0/ 8), 707.845: Progress states detected: 9187302
pins2lts-mc-linux64( 0/ 8), 707.845: Redundant explorations: -20.8960
pins2lts-mc-linux64( 0/ 8), 707.845:
pins2lts-mc-linux64( 0/ 8), 707.845: Queue width: 8B, total height: 6655249, memory: 50.78MB
pins2lts-mc-linux64( 0/ 8), 707.845: Tree memory: 396.2MB, 22.6 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 707.845: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 707.845: Stored 1422 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 707.845: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 707.845: Est. total memory use: 447.0MB (~1074.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2050180547317119133]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2050180547317119133]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-14 04:08:08] [INFO ] Applying decomposition
[2021-05-14 04:08:08] [INFO ] Flatten gal took : 38 ms
[2021-05-14 04:08:08] [INFO ] Decomposing Gal with order
[2021-05-14 04:08:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 04:08:08] [INFO ] Removed a total of 789 redundant transitions.
[2021-05-14 04:08:08] [INFO ] Flatten gal took : 66 ms
[2021-05-14 04:08:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1577 labels/synchronizations in 72 ms.
[2021-05-14 04:08:13] [INFO ] Time to serialize gal into /tmp/LTLFireability2421910976724933433.gal : 167 ms
[2021-05-14 04:08:13] [INFO ] Time to serialize properties into /tmp/LTLFireability8998200936876928156.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/LTLFireability2421910976724933433.gal, -t, CGAL, -LTL, /tmp/LTLFireability8998200936876928156.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/LTLFireability2421910976724933433.gal -t CGAL -LTL /tmp/LTLFireability8998200936876928156.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(G((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.u80.p366==1)"))||(X(F(!("((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.u104.p1004==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u109.p1114==1))"))))))))
Formula 0 simplified : !XG(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.u80.p366==1)" | XF!"((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.u104.p1004==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u109.p1114==1))")
Detected timeout of ITS tools.
[2021-05-14 04:29:52] [INFO ] Flatten gal took : 169 ms
[2021-05-14 04:29:54] [INFO ] Input system was already deterministic with 1395 transitions.
[2021-05-14 04:29:54] [INFO ] Transformed 894 places.
[2021-05-14 04:29:54] [INFO ] Transformed 1395 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 04:29:54] [INFO ] Time to serialize gal into /tmp/LTLFireability17495278043263081285.gal : 25 ms
[2021-05-14 04:29:54] [INFO ] Time to serialize properties into /tmp/LTLFireability13523215040015974113.ltl : 3 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/LTLFireability17495278043263081285.gal, -t, CGAL, -LTL, /tmp/LTLFireability13523215040015974113.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/LTLFireability17495278043263081285.gal -t CGAL -LTL /tmp/LTLFireability13523215040015974113.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 : !((X(G((G("(p366==1)"))||(X(F(!("((p1004==1)&&(p1114==1))"))))))))
Formula 0 simplified : !XG(G"(p366==1)" | XF!"((p1004==1)&&(p1114==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-5B"
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-5B, 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-162089127600301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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