Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372700397.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is NoC3x3-PT-6A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372700397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 07:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 07:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 297K May 18 16:43 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-6A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716692270769

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-26 02:57:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 02:57:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:57:52] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-26 02:57:52] [INFO ] Transformed 512 places.
[2024-05-26 02:57:52] [INFO ] Transformed 1117 transitions.
[2024-05-26 02:57:52] [INFO ] Found NUPN structural information;
[2024-05-26 02:57:52] [INFO ] Parsed PT model containing 512 places and 1117 transitions and 4279 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-6A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 1117/1117 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 441 transition count 829
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 441 transition count 829
Applied a total of 142 rules in 1129 ms. Remains 441 /512 variables (removed 71) and now considering 829/1117 (removed 288) transitions.
[2024-05-26 02:58:00] [INFO ] Flow matrix only has 824 transitions (discarded 5 similar events)
// Phase 1: matrix 824 rows 441 cols
[2024-05-26 02:58:00] [INFO ] Computed 66 invariants in 17 ms
[2024-05-26 02:58:01] [INFO ] Implicit Places using invariants in 413 ms returned [10, 45, 94, 133, 192, 283, 335, 373, 423]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 7611 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 432/512 places, 829/1117 transitions.
Applied a total of 0 rules in 8 ms. Remains 432 /432 variables (removed 0) and now considering 829/829 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8748 ms. Remains : 432/512 places, 829/1117 transitions.
Support contains 30 out of 432 places after structural reductions.
[2024-05-26 02:58:01] [INFO ] Flatten gal took : 85 ms
[2024-05-26 02:58:01] [INFO ] Flatten gal took : 55 ms
[2024-05-26 02:58:01] [INFO ] Input system was already deterministic with 829 transitions.
Support contains 29 out of 432 places (down from 30) after GAL structural reductions.
Finished random walk after 6571 steps, including 18 resets, run visited all 18 properties in 183 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||((X(p1) U ((p2&&X(p1))||X(G(p1)))) U (G((X(p1) U ((p2&&X(p1))||X(G(p1)))))||(X(!p3)&&(X(p1) U ((p2&&X(p1))||X(G(p1)))))))))'
Support contains 7 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 424 transition count 800
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 424 transition count 800
Applied a total of 16 rules in 16 ms. Remains 424 /432 variables (removed 8) and now considering 800/829 (removed 29) transitions.
[2024-05-26 02:58:02] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
// Phase 1: matrix 798 rows 424 cols
[2024-05-26 02:58:02] [INFO ] Computed 57 invariants in 12 ms
[2024-05-26 02:58:03] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-26 02:58:03] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
[2024-05-26 02:58:03] [INFO ] Invariant cache hit.
[2024-05-26 02:58:03] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:03] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2024-05-26 02:58:03] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
[2024-05-26 02:58:03] [INFO ] Invariant cache hit.
[2024-05-26 02:58:03] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 424/432 places, 800/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 974 ms. Remains : 424/432 places, 800/829 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 1553 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=p3, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s280 1), p3:(OR (EQ s165 0) (EQ s31 1)), p1:(OR (EQ s204 0) (EQ s405 1)), p0:(AND (EQ s37 0) (EQ s344 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 28600 reset in 877 ms.
Product exploration explored 100000 steps with 28636 reset in 741 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 p1 (NOT p0)), (X p3), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (AND (NOT p2) p3)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X p3)), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 116 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 27 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:58:07] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
[2024-05-26 02:58:07] [INFO ] Invariant cache hit.
[2024-05-26 02:58:07] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:58:07] [INFO ] [Nat]Absence check using 57 positive place invariants in 16 ms returned sat
[2024-05-26 02:58:07] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:58:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:07] [INFO ] After 35ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:58:07] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-26 02:58:08] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 800/800 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 423 transition count 793
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 423 transition count 793
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 50 place count 399 transition count 769
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 396 transition count 794
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 81 place count 396 transition count 769
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 106 place count 371 transition count 769
Applied a total of 106 rules in 92 ms. Remains 371 /424 variables (removed 53) and now considering 769/800 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 371/424 places, 769/800 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 543639 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 543639 steps, saw 340021 distinct states, run finished after 3002 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 769 rows 371 cols
[2024-05-26 02:58:11] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 02:58:11] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:58:11] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:58:11] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:58:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-26 02:58:11] [INFO ] After 89ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:58:11] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-26 02:58:11] [INFO ] After 606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 769/769 transitions.
Applied a total of 0 rules in 50 ms. Remains 371 /371 variables (removed 0) and now considering 769/769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 371/371 places, 769/769 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 769/769 transitions.
Applied a total of 0 rules in 33 ms. Remains 371 /371 variables (removed 0) and now considering 769/769 (removed 0) transitions.
[2024-05-26 02:58:12] [INFO ] Invariant cache hit.
[2024-05-26 02:58:12] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-26 02:58:12] [INFO ] Invariant cache hit.
[2024-05-26 02:58:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-26 02:58:12] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
[2024-05-26 02:58:13] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-26 02:58:13] [INFO ] Invariant cache hit.
[2024-05-26 02:58:13] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1438 ms. Remains : 371/371 places, 769/769 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 371 transition count 769
Applied a total of 5 rules in 27 ms. Remains 371 /371 variables (removed 0) and now considering 769/769 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 769 rows 371 cols
[2024-05-26 02:58:13] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 02:58:13] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:58:13] [INFO ] [Nat]Absence check using 57 positive place invariants in 11 ms returned sat
[2024-05-26 02:58:14] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:58:14] [INFO ] After 347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-26 02:58:14] [INFO ] After 540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p3 p1 (NOT p0)), (X p3), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (AND (NOT p2) p3)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X p3)), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT p3)), (F (NOT p1)), (F (NOT (AND (NOT p2) p3))), (F p0)]
Knowledge based reduction with 17 factoid took 389 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 7 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 800/800 transitions.
Applied a total of 0 rules in 5 ms. Remains 424 /424 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2024-05-26 02:58:15] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
// Phase 1: matrix 798 rows 424 cols
[2024-05-26 02:58:15] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 02:58:15] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-05-26 02:58:15] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
[2024-05-26 02:58:15] [INFO ] Invariant cache hit.
[2024-05-26 02:58:16] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:16] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
[2024-05-26 02:58:16] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
[2024-05-26 02:58:16] [INFO ] Invariant cache hit.
[2024-05-26 02:58:16] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1424 ms. Remains : 424/424 places, 800/800 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p1 (NOT p0)), (X (AND (NOT p0) p1 (NOT p2))), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p2) p3)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X p3)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p2) p3)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 251 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :7
Finished Best-First random walk after 9155 steps, including 2 resets, run visited all 1 properties in 16 ms. (steps per millisecond=572 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 (NOT p2) p1 (NOT p0)), (X (AND (NOT p0) p1 (NOT p2))), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p2) p3)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X p3)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p2) p3)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT p3)), (F (NOT p1)), (F (NOT (AND (NOT p2) p3))), (F p0)]
Knowledge based reduction with 15 factoid took 323 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 23466 reset in 696 ms.
Product exploration explored 100000 steps with 23520 reset in 694 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 7 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 800/800 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 424 transition count 800
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 27 places in 1 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 424 transition count 831
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 27 rules in 99 ms. Remains 424 /424 variables (removed 0) and now considering 831/800 (removed -31) transitions.
[2024-05-26 02:58:19] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-26 02:58:19] [INFO ] Flow matrix only has 829 transitions (discarded 2 similar events)
// Phase 1: matrix 829 rows 424 cols
[2024-05-26 02:58:19] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 02:58:20] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/424 places, 831/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 434 ms. Remains : 424/424 places, 831/800 transitions.
Built C files in :
/tmp/ltsmin17748858764496837118
[2024-05-26 02:58:20] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17748858764496837118
Running compilation step : cd /tmp/ltsmin17748858764496837118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1278 ms.
Running link step : cd /tmp/ltsmin17748858764496837118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17748858764496837118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4512685803871071336.hoa' '--buchi-type=spotba'
LTSmin run took 1167 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-6A-LTLCardinality-00 finished in 21316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 422 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 422 transition count 787
Applied a total of 20 rules in 12 ms. Remains 422 /432 variables (removed 10) and now considering 787/829 (removed 42) transitions.
// Phase 1: matrix 787 rows 422 cols
[2024-05-26 02:58:23] [INFO ] Computed 57 invariants in 8 ms
[2024-05-26 02:58:23] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-26 02:58:23] [INFO ] Invariant cache hit.
[2024-05-26 02:58:23] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:24] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2024-05-26 02:58:24] [INFO ] Invariant cache hit.
[2024-05-26 02:58:24] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 422/432 places, 787/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1096 ms. Remains : 422/432 places, 787/829 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s312 1) (EQ s365 0) (EQ s419 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 679 steps with 2 reset in 5 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLCardinality-02 finished in 1267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (F(p1)&&G((p2||F(!p1))))))'
Support contains 3 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 422 transition count 791
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 422 transition count 791
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 66 place count 398 transition count 767
Applied a total of 66 rules in 31 ms. Remains 398 /432 variables (removed 34) and now considering 767/829 (removed 62) transitions.
[2024-05-26 02:58:24] [INFO ] Flow matrix only has 766 transitions (discarded 1 similar events)
// Phase 1: matrix 766 rows 398 cols
[2024-05-26 02:58:24] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 02:58:25] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-26 02:58:25] [INFO ] Flow matrix only has 766 transitions (discarded 1 similar events)
[2024-05-26 02:58:25] [INFO ] Invariant cache hit.
[2024-05-26 02:58:25] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:25] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2024-05-26 02:58:25] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-26 02:58:25] [INFO ] Flow matrix only has 766 transitions (discarded 1 similar events)
[2024-05-26 02:58:25] [INFO ] Invariant cache hit.
[2024-05-26 02:58:25] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/432 places, 767/829 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1034 ms. Remains : 398/432 places, 767/829 transitions.
Stuttering acceptance computed with spot in 1119 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s121 1), p2:(NEQ s163 1), p0:(OR (EQ s163 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 263 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLCardinality-03 finished in 2182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 422 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 422 transition count 787
Applied a total of 20 rules in 11 ms. Remains 422 /432 variables (removed 10) and now considering 787/829 (removed 42) transitions.
// Phase 1: matrix 787 rows 422 cols
[2024-05-26 02:58:26] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 02:58:27] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-26 02:58:27] [INFO ] Invariant cache hit.
[2024-05-26 02:58:27] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:27] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2024-05-26 02:58:27] [INFO ] Invariant cache hit.
[2024-05-26 02:58:27] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 422/432 places, 787/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 878 ms. Remains : 422/432 places, 787/829 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s238 0) (EQ s317 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 543 steps with 1 reset in 3 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLCardinality-05 finished in 995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 422 transition count 793
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 422 transition count 793
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 66 place count 398 transition count 769
Applied a total of 66 rules in 25 ms. Remains 398 /432 variables (removed 34) and now considering 769/829 (removed 60) transitions.
[2024-05-26 02:58:27] [INFO ] Flow matrix only has 767 transitions (discarded 2 similar events)
// Phase 1: matrix 767 rows 398 cols
[2024-05-26 02:58:27] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 02:58:28] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-26 02:58:28] [INFO ] Flow matrix only has 767 transitions (discarded 2 similar events)
[2024-05-26 02:58:28] [INFO ] Invariant cache hit.
[2024-05-26 02:58:28] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:28] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2024-05-26 02:58:28] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-26 02:58:28] [INFO ] Flow matrix only has 767 transitions (discarded 2 similar events)
[2024-05-26 02:58:28] [INFO ] Invariant cache hit.
[2024-05-26 02:58:28] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/432 places, 769/829 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 957 ms. Remains : 398/432 places, 769/829 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 66647 steps with 203 reset in 239 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLCardinality-08 finished in 1286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 422 transition count 789
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 422 transition count 789
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 66 place count 398 transition count 765
Applied a total of 66 rules in 28 ms. Remains 398 /432 variables (removed 34) and now considering 765/829 (removed 64) transitions.
// Phase 1: matrix 765 rows 398 cols
[2024-05-26 02:58:29] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 02:58:29] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-26 02:58:29] [INFO ] Invariant cache hit.
[2024-05-26 02:58:29] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:29] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-26 02:58:29] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-26 02:58:29] [INFO ] Invariant cache hit.
[2024-05-26 02:58:30] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/432 places, 765/829 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 969 ms. Remains : 398/432 places, 765/829 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s328 0) (EQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11311 steps with 33 reset in 48 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLCardinality-09 finished in 1132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (F(p1) U p2))) U G(p1)))'
Support contains 6 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 425 transition count 797
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 425 transition count 797
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 60 place count 401 transition count 773
Applied a total of 60 rules in 21 ms. Remains 401 /432 variables (removed 31) and now considering 773/829 (removed 56) transitions.
// Phase 1: matrix 773 rows 401 cols
[2024-05-26 02:58:30] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:58:30] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-26 02:58:30] [INFO ] Invariant cache hit.
[2024-05-26 02:58:30] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:31] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2024-05-26 02:58:31] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-26 02:58:31] [INFO ] Invariant cache hit.
[2024-05-26 02:58:31] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/432 places, 773/829 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1009 ms. Remains : 401/432 places, 773/829 transitions.
Stuttering acceptance computed with spot in 1504 ms :[(NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s187 0) (EQ s117 1)), p2:(OR (EQ s276 0) (EQ s201 1)), p0:(OR (EQ s308 0) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 33251 reset in 399 ms.
Product exploration explored 100000 steps with 33271 reset in 411 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 145 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 02:58:34] [INFO ] Invariant cache hit.
[2024-05-26 02:58:34] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 02:58:34] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 02:58:34] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 02:58:34] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:34] [INFO ] After 114ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-26 02:58:34] [INFO ] After 253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-26 02:58:34] [INFO ] After 697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 773/773 transitions.
Free-agglomeration rule applied 31 times.
Iterating global reduction 0 with 31 rules applied. Total rules applied 31 place count 401 transition count 742
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 62 place count 370 transition count 742
Applied a total of 62 rules in 22 ms. Remains 370 /401 variables (removed 31) and now considering 742/773 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 370/401 places, 742/773 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 416490 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 416490 steps, saw 349860 distinct states, run finished after 3005 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 742 rows 370 cols
[2024-05-26 02:58:38] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 02:58:38] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 02:58:38] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:58:38] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 02:58:38] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:38] [INFO ] After 96ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-26 02:58:38] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-26 02:58:38] [INFO ] After 622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 742/742 transitions.
Applied a total of 0 rules in 13 ms. Remains 370 /370 variables (removed 0) and now considering 742/742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 370/370 places, 742/742 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 742/742 transitions.
Applied a total of 0 rules in 8 ms. Remains 370 /370 variables (removed 0) and now considering 742/742 (removed 0) transitions.
[2024-05-26 02:58:38] [INFO ] Invariant cache hit.
[2024-05-26 02:58:39] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-26 02:58:39] [INFO ] Invariant cache hit.
[2024-05-26 02:58:39] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:39] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2024-05-26 02:58:39] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-26 02:58:39] [INFO ] Invariant cache hit.
[2024-05-26 02:58:39] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1034 ms. Remains : 370/370 places, 742/742 transitions.
Applied a total of 0 rules in 8 ms. Remains 370 /370 variables (removed 0) and now considering 742/742 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-26 02:58:40] [INFO ] Invariant cache hit.
[2024-05-26 02:58:40] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 02:58:40] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:58:40] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 02:58:40] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-26 02:58:40] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))), (F (NOT p2)), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 15 factoid took 948 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 550 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 773/773 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 773/773 (removed 0) transitions.
// Phase 1: matrix 773 rows 401 cols
[2024-05-26 02:58:42] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:58:42] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-26 02:58:42] [INFO ] Invariant cache hit.
[2024-05-26 02:58:42] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:42] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2024-05-26 02:58:42] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-26 02:58:42] [INFO ] Invariant cache hit.
[2024-05-26 02:58:43] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 992 ms. Remains : 401/401 places, 773/773 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 217 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 29 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 02:58:43] [INFO ] Invariant cache hit.
[2024-05-26 02:58:44] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 02:58:44] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:58:44] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 02:58:44] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:44] [INFO ] After 104ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-26 02:58:44] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-26 02:58:44] [INFO ] After 662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 773/773 transitions.
Free-agglomeration rule applied 31 times.
Iterating global reduction 0 with 31 rules applied. Total rules applied 31 place count 401 transition count 742
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 62 place count 370 transition count 742
Applied a total of 62 rules in 29 ms. Remains 370 /401 variables (removed 31) and now considering 742/773 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 370/401 places, 742/773 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 452549 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 452549 steps, saw 356719 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 742 rows 370 cols
[2024-05-26 02:58:47] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:58:48] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 02:58:48] [INFO ] [Nat]Absence check using 57 positive place invariants in 22 ms returned sat
[2024-05-26 02:58:48] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 02:58:48] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:48] [INFO ] After 73ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-26 02:58:48] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-26 02:58:48] [INFO ] After 675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 13 ms.
Support contains 6 out of 370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 742/742 transitions.
Applied a total of 0 rules in 7 ms. Remains 370 /370 variables (removed 0) and now considering 742/742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 370/370 places, 742/742 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 703509 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{}
Probabilistic random walk after 703509 steps, saw 403489 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:58:51] [INFO ] Invariant cache hit.
[2024-05-26 02:58:51] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:58:51] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:58:52] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:58:52] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:52] [INFO ] After 36ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:58:52] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-26 02:58:52] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 742/742 transitions.
Applied a total of 0 rules in 12 ms. Remains 370 /370 variables (removed 0) and now considering 742/742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 370/370 places, 742/742 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 742/742 transitions.
Applied a total of 0 rules in 7 ms. Remains 370 /370 variables (removed 0) and now considering 742/742 (removed 0) transitions.
[2024-05-26 02:58:52] [INFO ] Invariant cache hit.
[2024-05-26 02:58:52] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-26 02:58:52] [INFO ] Invariant cache hit.
[2024-05-26 02:58:52] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:58:52] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2024-05-26 02:58:52] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-26 02:58:52] [INFO ] Invariant cache hit.
[2024-05-26 02:58:53] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 949 ms. Remains : 370/370 places, 742/742 transitions.
Applied a total of 0 rules in 7 ms. Remains 370 /370 variables (removed 0) and now considering 742/742 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-26 02:58:53] [INFO ] Invariant cache hit.
[2024-05-26 02:58:53] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:58:53] [INFO ] [Nat]Absence check using 57 positive place invariants in 7 ms returned sat
[2024-05-26 02:58:53] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:58:53] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-26 02:58:53] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 21 factoid took 733 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 309 reset in 379 ms.
Product exploration explored 100000 steps with 318 reset in 498 ms.
Built C files in :
/tmp/ltsmin4500899338679868514
[2024-05-26 02:58:55] [INFO ] Computing symmetric may disable matrix : 773 transitions.
[2024-05-26 02:58:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:58:55] [INFO ] Computing symmetric may enable matrix : 773 transitions.
[2024-05-26 02:58:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:58:55] [INFO ] Computing Do-Not-Accords matrix : 773 transitions.
[2024-05-26 02:58:56] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:58:56] [INFO ] Built C files in 150ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4500899338679868514
Running compilation step : cd /tmp/ltsmin4500899338679868514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4500899338679868514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4500899338679868514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 773/773 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 773/773 (removed 0) transitions.
// Phase 1: matrix 773 rows 401 cols
[2024-05-26 02:59:01] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 02:59:01] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-26 02:59:01] [INFO ] Invariant cache hit.
[2024-05-26 02:59:01] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 02:59:02] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2024-05-26 02:59:02] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-26 02:59:02] [INFO ] Invariant cache hit.
[2024-05-26 02:59:02] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 861 ms. Remains : 401/401 places, 773/773 transitions.
Built C files in :
/tmp/ltsmin13116314527206737916
[2024-05-26 02:59:04] [INFO ] Computing symmetric may disable matrix : 773 transitions.
[2024-05-26 02:59:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:59:04] [INFO ] Computing symmetric may enable matrix : 773 transitions.
[2024-05-26 02:59:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:59:04] [INFO ] Computing Do-Not-Accords matrix : 773 transitions.
[2024-05-26 02:59:04] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:59:04] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13116314527206737916
Running compilation step : cd /tmp/ltsmin13116314527206737916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1939 ms.
Running link step : cd /tmp/ltsmin13116314527206737916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 138 ms.
Running LTSmin : cd /tmp/ltsmin13116314527206737916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13089266648633277170.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 02:59:19] [INFO ] Flatten gal took : 37 ms
[2024-05-26 02:59:19] [INFO ] Flatten gal took : 37 ms
[2024-05-26 02:59:19] [INFO ] Time to serialize gal into /tmp/LTL12266052395251204921.gal : 6 ms
[2024-05-26 02:59:20] [INFO ] Time to serialize properties into /tmp/LTL17442481062392420624.prop : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12266052395251204921.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17833792729816372174.hoa' '-atoms' '/tmp/LTL17442481062392420624.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17442481062392420624.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17833792729816372174.hoa
Detected timeout of ITS tools.
[2024-05-26 02:59:35] [INFO ] Flatten gal took : 47 ms
[2024-05-26 02:59:35] [INFO ] Flatten gal took : 58 ms
[2024-05-26 02:59:35] [INFO ] Time to serialize gal into /tmp/LTL6994643801169689798.gal : 4 ms
[2024-05-26 02:59:35] [INFO ] Time to serialize properties into /tmp/LTL1291957433320012454.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6994643801169689798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1291957433320012454.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(("((p394==0)||(p112==1))")U((F("((p243==0)||(p150==1))"))U("((p354==0)||(p259==1))"))))U(G("((p243==0)||(p150==1))"))))
Formula 0 simplified : X(!"((p394==0)||(p112==1))" R (G!"((p243==0)||(p150==1))" R !"((p354==0)||(p259==1))")) R F!"((p243==0)||(p150==1))"
Detected timeout of ITS tools.
[2024-05-26 02:59:50] [INFO ] Flatten gal took : 27 ms
[2024-05-26 02:59:50] [INFO ] Applying decomposition
[2024-05-26 02:59:50] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15042175395314816589.txt' '-o' '/tmp/graph15042175395314816589.bin' '-w' '/tmp/graph15042175395314816589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15042175395314816589.bin' '-l' '-1' '-v' '-w' '/tmp/graph15042175395314816589.weights' '-q' '0' '-e' '0.001'
[2024-05-26 02:59:50] [INFO ] Decomposing Gal with order
[2024-05-26 02:59:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:59:50] [INFO ] Removed a total of 612 redundant transitions.
[2024-05-26 02:59:50] [INFO ] Flatten gal took : 96 ms
[2024-05-26 02:59:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 626 labels/synchronizations in 16 ms.
[2024-05-26 02:59:50] [INFO ] Time to serialize gal into /tmp/LTL14872847540246825919.gal : 7 ms
[2024-05-26 02:59:50] [INFO ] Time to serialize properties into /tmp/LTL12777483222413853414.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14872847540246825919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12777483222413853414.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(("((i7.u38.p394==0)||(i2.u13.p112==1))")U((F("((i5.u27.p243==0)||(i3.u21.p150==1))"))U("((i6.i0.u36.p354==0)||(i4.i0.u28.p259==1...208
Formula 0 simplified : X(!"((i7.u38.p394==0)||(i2.u13.p112==1))" R (G!"((i5.u27.p243==0)||(i3.u21.p150==1))" R !"((i6.i0.u36.p354==0)||(i4.i0.u28.p259==1))...201
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin289540869754987976
[2024-05-26 03:00:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin289540869754987976
Running compilation step : cd /tmp/ltsmin289540869754987976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1110 ms.
Running link step : cd /tmp/ltsmin289540869754987976;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin289540869754987976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((LTLAPp0==true) U (<>((LTLAPp1==true)) U (LTLAPp2==true)))) U []((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-6A-LTLCardinality-11 finished in 110443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F((!p1&&X(X(!p1))))))'
Support contains 3 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 422 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 422 transition count 787
Applied a total of 20 rules in 13 ms. Remains 422 /432 variables (removed 10) and now considering 787/829 (removed 42) transitions.
// Phase 1: matrix 787 rows 422 cols
[2024-05-26 03:00:20] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:00:20] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-26 03:00:20] [INFO ] Invariant cache hit.
[2024-05-26 03:00:21] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:00:21] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-05-26 03:00:21] [INFO ] Invariant cache hit.
[2024-05-26 03:00:21] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 422/432 places, 787/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 926 ms. Remains : 422/432 places, 787/829 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p1:(OR (EQ s54 0) (EQ s400 1)), p0:(EQ s357 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1043 ms.
Product exploration explored 100000 steps with 50000 reset in 1047 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6A-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6A-LTLCardinality-14 finished in 3310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(p1))))))'
Support contains 2 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 423 transition count 790
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 423 transition count 790
Applied a total of 18 rules in 11 ms. Remains 423 /432 variables (removed 9) and now considering 790/829 (removed 39) transitions.
// Phase 1: matrix 790 rows 423 cols
[2024-05-26 03:00:24] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:00:24] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-26 03:00:24] [INFO ] Invariant cache hit.
[2024-05-26 03:00:24] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:00:24] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2024-05-26 03:00:24] [INFO ] Invariant cache hit.
[2024-05-26 03:00:25] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 423/432 places, 790/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 939 ms. Remains : 423/432 places, 790/829 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (NEQ s181 0) (NEQ s85 1)), p0:(AND (EQ s85 0) (EQ s181 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLCardinality-15 finished in 1091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (F(p1) U p2))) U G(p1)))'
[2024-05-26 03:00:25] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14815750763855208760
[2024-05-26 03:00:25] [INFO ] Computing symmetric may disable matrix : 829 transitions.
[2024-05-26 03:00:25] [INFO ] Applying decomposition
[2024-05-26 03:00:25] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:00:25] [INFO ] Computing symmetric may enable matrix : 829 transitions.
[2024-05-26 03:00:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:00:25] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2331347790580858530.txt' '-o' '/tmp/graph2331347790580858530.bin' '-w' '/tmp/graph2331347790580858530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2331347790580858530.bin' '-l' '-1' '-v' '-w' '/tmp/graph2331347790580858530.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:00:25] [INFO ] Decomposing Gal with order
[2024-05-26 03:00:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:00:25] [INFO ] Removed a total of 621 redundant transitions.
[2024-05-26 03:00:25] [INFO ] Computing Do-Not-Accords matrix : 829 transitions.
[2024-05-26 03:00:25] [INFO ] Flatten gal took : 57 ms
[2024-05-26 03:00:25] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:00:25] [INFO ] Built C files in 238ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14815750763855208760
Running compilation step : cd /tmp/ltsmin14815750763855208760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-26 03:00:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 570 labels/synchronizations in 14 ms.
[2024-05-26 03:00:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality4970430581926195412.gal : 5 ms
[2024-05-26 03:00:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality3545391320822998271.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4970430581926195412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3545391320822998271.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(("((i7.u36.p394==0)||(i1.u13.p112==1))")U((F("((i4.u26.p243==0)||(i3.u16.p150==1))"))U("((i6.u33.p354==0)||(i5.u27.p259==1))")))...202
Formula 0 simplified : X(!"((i7.u36.p394==0)||(i1.u13.p112==1))" R (G!"((i4.u26.p243==0)||(i3.u16.p150==1))" R !"((i6.u33.p354==0)||(i5.u27.p259==1))")) R ...195
Compilation finished in 2165 ms.
Running link step : cd /tmp/ltsmin14815750763855208760;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14815750763855208760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((LTLAPp0==true) U (<>((LTLAPp1==true)) U (LTLAPp2==true)))) U []((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-26 03:21:17] [INFO ] Applying decomposition
[2024-05-26 03:21:17] [INFO ] Flatten gal took : 75 ms
[2024-05-26 03:21:17] [INFO ] Decomposing Gal with order
[2024-05-26 03:21:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:21:17] [INFO ] Removed a total of 796 redundant transitions.
[2024-05-26 03:21:17] [INFO ] Flatten gal took : 143 ms
[2024-05-26 03:21:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 398 labels/synchronizations in 48 ms.
[2024-05-26 03:21:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality9410548021105686131.gal : 14 ms
[2024-05-26 03:21:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality14784319719043940282.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9410548021105686131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14784319719043940282.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(("((u50.p394==0)||(u18.p112==1))")U((F("((u35.p243==0)||(u23.p150==1))"))U("((u45.p354==0)||(u36.p259==1))"))))U(G("((u35.p243==...178
Formula 0 simplified : X(!"((u50.p394==0)||(u18.p112==1))" R (G!"((u35.p243==0)||(u23.p150==1))" R !"((u45.p354==0)||(u36.p259==1))")) R F!"((u35.p243==0)|...171
Detected timeout of ITS tools.
[2024-05-26 03:42:10] [INFO ] Flatten gal took : 65 ms
[2024-05-26 03:42:10] [INFO ] Input system was already deterministic with 829 transitions.
[2024-05-26 03:42:10] [INFO ] Transformed 432 places.
[2024-05-26 03:42:10] [INFO ] Transformed 829 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 03:42:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality2581607610145715644.gal : 38 ms
[2024-05-26 03:42:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality11350571695157145961.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2581607610145715644.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11350571695157145961.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(("((p394==0)||(p112==1))")U((F("((p243==0)||(p150==1))"))U("((p354==0)||(p259==1))"))))U(G("((p243==0)||(p150==1))"))))
Formula 0 simplified : X(!"((p394==0)||(p112==1))" R (G!"((p243==0)||(p150==1))" R !"((p354==0)||(p259==1))")) R F!"((p243==0)||(p150==1))"
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( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.039: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.153: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.153: LTL layer: formula: (X(((LTLAPp0==true) U (<>((LTLAPp1==true)) U (LTLAPp2==true)))) U []((LTLAPp1==true)))
pins2lts-mc-linux64( 2/ 8), 0.153: "(X(((LTLAPp0==true) U (<>((LTLAPp1==true)) U (LTLAPp2==true)))) U []((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.154: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.191: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.196: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.227: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.227: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.252: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.258: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.405: There are 833 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.405: State length is 433, there are 847 groups
pins2lts-mc-linux64( 0/ 8), 0.405: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.405: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.405: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.405: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.518: [Blue] ~120 levels ~960 states ~13456 transitions
pins2lts-mc-linux64( 5/ 8), 0.620: [Blue] ~240 levels ~1920 states ~31776 transitions
pins2lts-mc-linux64( 0/ 8), 0.866: [Blue] ~480 levels ~3840 states ~41904 transitions
pins2lts-mc-linux64( 4/ 8), 1.636: [Blue] ~960 levels ~7680 states ~72736 transitions
pins2lts-mc-linux64( 4/ 8), 2.576: [Blue] ~1920 levels ~15360 states ~126168 transitions
pins2lts-mc-linux64( 4/ 8), 4.502: [Blue] ~3840 levels ~30720 states ~243816 transitions
pins2lts-mc-linux64( 7/ 8), 7.691: [Blue] ~4357 levels ~61440 states ~479416 transitions
pins2lts-mc-linux64( 7/ 8), 9.368: [Blue] ~4858 levels ~122880 states ~685192 transitions
pins2lts-mc-linux64( 7/ 8), 12.610: [Blue] ~4858 levels ~245760 states ~1053360 transitions
pins2lts-mc-linux64( 7/ 8), 18.173: [Blue] ~4860 levels ~491520 states ~1875280 transitions
pins2lts-mc-linux64( 7/ 8), 29.080: [Blue] ~5070 levels ~983040 states ~3572680 transitions
pins2lts-mc-linux64( 5/ 8), 49.182: [Blue] ~47574 levels ~1966080 states ~9397560 transitions
pins2lts-mc-linux64( 5/ 8), 93.263: [Blue] ~82715 levels ~3932160 states ~18196536 transitions
pins2lts-mc-linux64( 7/ 8), 188.327: [Blue] ~47704 levels ~7864320 states ~31367096 transitions
pins2lts-mc-linux64( 7/ 8), 377.239: [Blue] ~47704 levels ~15728640 states ~66198720 transitions
pins2lts-mc-linux64( 7/ 8), 729.262: [Blue] ~93786 levels ~31457280 states ~140527920 transitions
pins2lts-mc-linux64( 7/ 8), 1351.453: [Blue] ~453867 levels ~62914560 states ~295552296 transitions
pins2lts-mc-linux64( 7/ 8), 2557.726: [Blue] ~453867 levels ~125829120 states ~605888440 transitions
pins2lts-mc-linux64( 5/ 8), 2743.771: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2743.799:
pins2lts-mc-linux64( 0/ 8), 2743.799: Explored 128801404 states 686265684 transitions, fanout: 5.328
pins2lts-mc-linux64( 0/ 8), 2743.799: Total exploration time 2743.380 sec (2743.340 sec minimum, 2743.367 sec on average)
pins2lts-mc-linux64( 0/ 8), 2743.799: States per second: 46950, Transitions per second: 250153
pins2lts-mc-linux64( 0/ 8), 2743.799:
pins2lts-mc-linux64( 0/ 8), 2743.799: State space has 134217230 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 2743.799: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2743.799: blue states: 128801404 (95.96%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2743.799: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2743.799: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 2743.799:
pins2lts-mc-linux64( 0/ 8), 2743.799: Total memory used for local state coloring: 86.6MB
pins2lts-mc-linux64( 0/ 8), 2743.799:
pins2lts-mc-linux64( 0/ 8), 2743.799: Queue width: 8B, total height: 5675525, memory: 43.30MB
pins2lts-mc-linux64( 0/ 8), 2743.799: Tree memory: 1041.5MB, 8.1 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 2743.799: Tree fill ratio (roots/leafs): 99.0%/6.0%
pins2lts-mc-linux64( 0/ 8), 2743.799: Stored 839 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2743.799: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2743.799: Est. total memory use: 1084.8MB (~1067.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14815750763855208760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((LTLAPp0==true) U (<>((LTLAPp1==true)) U (LTLAPp2==true)))) U []((LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14815750763855208760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((LTLAPp0==true) U (<>((LTLAPp1==true)) U (LTLAPp2==true)))) U []((LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 163912 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16142688 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-6A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is NoC3x3-PT-6A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372700397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6A.tgz
mv NoC3x3-PT-6A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;