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.r153-tall-171631151400228.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 DiscoveryGPU-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151400228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 12 01:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 01:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 01:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 22K May 18 16:42 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 DiscoveryGPU-PT-06a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716420824855

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 23:33:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:33:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:33:46] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2024-05-22 23:33:46] [INFO ] Transformed 63 places.
[2024-05-22 23:33:46] [INFO ] Transformed 85 transitions.
[2024-05-22 23:33:46] [INFO ] Found NUPN structural information;
[2024-05-22 23:33:46] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 82
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 82
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 58 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 58 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 57 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 57 transition count 78
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 17 place count 57 transition count 73
Applied a total of 17 rules in 27 ms. Remains 57 /63 variables (removed 6) and now considering 73/85 (removed 12) transitions.
// Phase 1: matrix 73 rows 57 cols
[2024-05-22 23:33:46] [INFO ] Computed 2 invariants in 10 ms
[2024-05-22 23:33:46] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 23:33:46] [INFO ] Invariant cache hit.
[2024-05-22 23:33:46] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 23:33:46] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-22 23:33:46] [INFO ] Invariant cache hit.
[2024-05-22 23:33:46] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/63 places, 73/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 57/63 places, 73/85 transitions.
Support contains 23 out of 57 places after structural reductions.
[2024-05-22 23:33:47] [INFO ] Flatten gal took : 27 ms
[2024-05-22 23:33:47] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:33:47] [INFO ] Input system was already deterministic with 73 transitions.
Finished random walk after 4656 steps, including 69 resets, run visited all 23 properties in 78 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 163 edges and 57 vertex of which 54 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 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&&(X(F(p1)) U G(p2))))))'
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 48 transition count 64
Applied a total of 18 rules in 10 ms. Remains 48 /57 variables (removed 9) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 23:33:47] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:33:47] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 23:33:47] [INFO ] Invariant cache hit.
[2024-05-22 23:33:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 23:33:47] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-22 23:33:47] [INFO ] Invariant cache hit.
[2024-05-22 23:33:47] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/57 places, 64/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 48/57 places, 64/73 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 370 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s47 0)), p2:(NEQ s0 1), p1:(AND (EQ s44 1) (EQ s46 1))], nbAcceptance=1, 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 1526 reset in 215 ms.
Product exploration explored 100000 steps with 1532 reset in 154 ms.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 147 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 7 stable transitions
Detected a total of 9/48 stabilizing places and 7/64 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 235 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false, false, false]
Finished random walk after 1992 steps, including 29 resets, run visited all 7 properties in 11 ms. (steps per millisecond=181 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (F p2), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p0 p2)), (F (AND p1 p0 p2)), (F (AND p1 (NOT p0) p2))]
Knowledge based reduction with 8 factoid took 495 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false, false, false]
[2024-05-22 23:33:50] [INFO ] Invariant cache hit.
[2024-05-22 23:33:50] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:33:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 23:33:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 23:33:50] [INFO ] [Real]Added 43 Read/Feed constraints in 3 ms returned sat
[2024-05-22 23:33:50] [INFO ] Computed and/alt/rep : 63/123/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 23:33:50] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Graph (complete) has 147 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 47 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 62
Applied a total of 3 rules in 8 ms. Remains 46 /48 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 46 cols
[2024-05-22 23:33:50] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:33:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 23:33:50] [INFO ] Invariant cache hit.
[2024-05-22 23:33:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 23:33:50] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-22 23:33:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:33:50] [INFO ] Invariant cache hit.
[2024-05-22 23:33:50] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/48 places, 62/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 46/48 places, 62/64 transitions.
Computed a total of 9 stabilizing places and 7 stable transitions
Computed a total of 9 stabilizing places and 7 stable transitions
Detected a total of 9/46 stabilizing places and 7/62 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X p2), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2))))]
Knowledge based reduction with 11 factoid took 411 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false, false, false]
Finished random walk after 314 steps, including 4 resets, run visited all 7 properties in 3 ms. (steps per millisecond=104 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X p2), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1 p2)), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 11 factoid took 699 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false, false, false]
[2024-05-22 23:33:52] [INFO ] Invariant cache hit.
[2024-05-22 23:33:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:33:52] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-22 23:33:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 23:33:52] [INFO ] [Real]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-22 23:33:52] [INFO ] Computed and/alt/rep : 61/121/61 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 23:33:52] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 2971 reset in 195 ms.
Product exploration explored 100000 steps with 3002 reset in 149 ms.
Built C files in :
/tmp/ltsmin3140698423441751539
[2024-05-22 23:33:53] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2024-05-22 23:33:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:33:53] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2024-05-22 23:33:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:33:53] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2024-05-22 23:33:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:33:53] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3140698423441751539
Running compilation step : cd /tmp/ltsmin3140698423441751539;'/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 356 ms.
Running link step : cd /tmp/ltsmin3140698423441751539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3140698423441751539;'/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/stateBased15302534461817088638.hoa' '--buchi-type=spotba'
LTSmin run took 102 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-00 finished in 6356 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)&&F(G(p1)))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Graph (complete) has 163 edges and 57 vertex of which 54 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 54 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 50 transition count 66
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 46 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 46 transition count 62
Applied a total of 17 rules in 8 ms. Remains 46 /57 variables (removed 11) and now considering 62/73 (removed 11) transitions.
[2024-05-22 23:33:54] [INFO ] Invariant cache hit.
[2024-05-22 23:33:54] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 23:33:54] [INFO ] Invariant cache hit.
[2024-05-22 23:33:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 23:33:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-22 23:33:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:33:54] [INFO ] Invariant cache hit.
[2024-05-22 23:33:54] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/57 places, 62/73 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 46/57 places, 62/73 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s9 1), p1:(AND (EQ s30 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-01 finished in 271 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(G(p0))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 48 transition count 64
Applied a total of 18 rules in 11 ms. Remains 48 /57 variables (removed 9) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 23:33:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:33:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 23:33:54] [INFO ] Invariant cache hit.
[2024-05-22 23:33:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 23:33:54] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-22 23:33:54] [INFO ] Invariant cache hit.
[2024-05-22 23:33:54] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/57 places, 64/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 48/57 places, 64/73 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-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: 2}]], initial=3, aps=[p0:(AND (EQ s14 1) (EQ s46 1) (EQ s32 1) (EQ s47 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 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-02 finished in 315 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(F(p0))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 48 transition count 64
Applied a total of 18 rules in 7 ms. Remains 48 /57 variables (removed 9) and now considering 64/73 (removed 9) transitions.
[2024-05-22 23:33:54] [INFO ] Invariant cache hit.
[2024-05-22 23:33:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 23:33:54] [INFO ] Invariant cache hit.
[2024-05-22 23:33:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 23:33:54] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/57 places, 64/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 47/57 places, 64/73 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s7 0) (EQ s46 0) (EQ s38 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 135 ms.
Product exploration explored 100000 steps with 33333 reset in 142 ms.
Computed a total of 8 stabilizing places and 7 stable transitions
Graph (complete) has 126 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-03 finished in 523 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(F(p0))||(F(p0)&&G(p1)&&F(!p0)))))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Graph (complete) has 163 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 52 vertex of which 46 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Graph (trivial) has 50 edges and 46 vertex of which 24 / 46 are part of one of the 12 SCC in 5 ms
Free SCC test removed 12 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 34 transition count 57
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 31 place count 27 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 34 place count 24 transition count 39
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 24 transition count 39
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 21 transition count 33
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 21 transition count 33
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 18 transition count 27
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 18 transition count 27
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 15 transition count 24
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 15 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 12 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 9 transition count 17
Applied a total of 65 rules in 19 ms. Remains 9 /57 variables (removed 48) and now considering 17/73 (removed 56) transitions.
[2024-05-22 23:33:55] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2024-05-22 23:33:55] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:33:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 23:33:55] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
[2024-05-22 23:33:55] [INFO ] Invariant cache hit.
[2024-05-22 23:33:55] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-22 23:33:55] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:33:55] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
[2024-05-22 23:33:55] [INFO ] Invariant cache hit.
[2024-05-22 23:33:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/57 places, 17/73 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 9/57 places, 17/73 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s2 1), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-04 finished in 217 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(p2) U p3)&&p1)||p0))))'
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 54 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 54 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 52 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 52 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 51 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 51 transition count 67
Applied a total of 12 rules in 10 ms. Remains 51 /57 variables (removed 6) and now considering 67/73 (removed 6) transitions.
// Phase 1: matrix 67 rows 51 cols
[2024-05-22 23:33:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:33:55] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 23:33:55] [INFO ] Invariant cache hit.
[2024-05-22 23:33:55] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 23:33:55] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/57 places, 67/73 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 50/57 places, 67/73 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), true]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s41 0) (EQ s49 0)), p1:(AND (EQ s5 1) (EQ s49 1) (EQ s41 1)), p3:(AND (EQ s26 1) (EQ s49 1)), p2:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-07 finished in 314 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(G(p0))))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 48 transition count 64
Applied a total of 18 rules in 11 ms. Remains 48 /57 variables (removed 9) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 23:33:55] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 23:33:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 23:33:55] [INFO ] Invariant cache hit.
[2024-05-22 23:33:55] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 23:33:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-22 23:33:55] [INFO ] Invariant cache hit.
[2024-05-22 23:33:55] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/57 places, 64/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 48/57 places, 64/73 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-08 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: 2}]], initial=3, aps=[p0:(AND (EQ s11 1) (EQ s47 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 DiscoveryGPU-PT-06a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-08 finished in 280 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 p1)))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 48 transition count 64
Applied a total of 18 rules in 10 ms. Remains 48 /57 variables (removed 9) and now considering 64/73 (removed 9) transitions.
[2024-05-22 23:33:56] [INFO ] Invariant cache hit.
[2024-05-22 23:33:56] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 23:33:56] [INFO ] Invariant cache hit.
[2024-05-22 23:33:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 23:33:56] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/57 places, 64/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 47/57 places, 64/73 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s43 1) (AND (EQ s28 1) (EQ s46 1))), p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-09 finished in 208 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(p0) U X(G(!p1))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 54 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 51 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 49 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 49 transition count 65
Applied a total of 16 rules in 11 ms. Remains 49 /57 variables (removed 8) and now considering 65/73 (removed 8) transitions.
// Phase 1: matrix 65 rows 49 cols
[2024-05-22 23:33:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:33:56] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 23:33:56] [INFO ] Invariant cache hit.
[2024-05-22 23:33:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 23:33:56] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-22 23:33:56] [INFO ] Invariant cache hit.
[2024-05-22 23:33:56] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/57 places, 65/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 49/57 places, 65/73 transitions.
Stuttering acceptance computed with spot in 168 ms :[p1, (AND p1 (NOT p0)), p1, true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s25 1) (EQ s48 1)), p0:(AND (EQ s27 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-11 finished in 331 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 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Graph (complete) has 163 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 55 transition count 68
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 52 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 50 transition count 66
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 50 transition count 66
Applied a total of 11 rules in 9 ms. Remains 50 /57 variables (removed 7) and now considering 66/73 (removed 7) transitions.
// Phase 1: matrix 66 rows 50 cols
[2024-05-22 23:33:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:33:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 23:33:56] [INFO ] Invariant cache hit.
[2024-05-22 23:33:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 23:33:56] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/57 places, 66/73 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 37 transition count 54
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 34 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 34 transition count 48
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 31 transition count 42
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 31 transition count 42
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 28 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 28 transition count 39
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 25 transition count 33
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 25 transition count 33
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 22 transition count 30
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 22 transition count 30
Applied a total of 54 rules in 5 ms. Remains 22 /49 variables (removed 27) and now considering 30/66 (removed 36) transitions.
[2024-05-22 23:33:56] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 22 cols
[2024-05-22 23:33:56] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:33:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 23:33:56] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2024-05-22 23:33:56] [INFO ] Invariant cache hit.
[2024-05-22 23:33:56] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 23:33:56] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/57 places, 30/73 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 22/57 places, 30/73 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-13 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:(AND (EQ s7 1) (EQ s21 1) (EQ s14 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-13 finished in 246 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))||G(p1)))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Graph (complete) has 163 edges and 57 vertex of which 54 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 54 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 50 transition count 66
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 46 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 46 transition count 62
Applied a total of 17 rules in 8 ms. Remains 46 /57 variables (removed 11) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 46 cols
[2024-05-22 23:33:56] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:33:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 23:33:56] [INFO ] Invariant cache hit.
[2024-05-22 23:33:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 23:33:56] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-22 23:33:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:33:56] [INFO ] Invariant cache hit.
[2024-05-22 23:33:56] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/57 places, 62/73 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 46/57 places, 62/73 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s45 1)), p0:(OR (EQ s37 0) (EQ s45 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1697 reset in 108 ms.
Stack based approach found an accepted trace after 955 steps with 16 reset with depth 39 and stack size 38 in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-14 finished in 343 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(p0) U X(X(p1))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 48 transition count 64
Applied a total of 18 rules in 3 ms. Remains 48 /57 variables (removed 9) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 23:33:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:33:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 23:33:57] [INFO ] Invariant cache hit.
[2024-05-22 23:33:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 23:33:57] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/57 places, 64/73 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 47/57 places, 64/73 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s4 1), p1:(AND (EQ s12 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-15 finished in 329 ms.
All properties solved by simple procedures.
Total runtime 11243 ms.

BK_STOP 1716420838437

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="DiscoveryGPU-PT-06a"
export BK_EXAMINATION="LTLFireability"
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 DiscoveryGPU-PT-06a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151400228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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