Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r517-tall-167987243300036.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Anderson-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243300036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 17K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 667K Mar 31 16:48 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 Anderson-PT-08-LTLFireability-00
FORMULA_NAME Anderson-PT-08-LTLFireability-01
FORMULA_NAME Anderson-PT-08-LTLFireability-02
FORMULA_NAME Anderson-PT-08-LTLFireability-03
FORMULA_NAME Anderson-PT-08-LTLFireability-04
FORMULA_NAME Anderson-PT-08-LTLFireability-05
FORMULA_NAME Anderson-PT-08-LTLFireability-06
FORMULA_NAME Anderson-PT-08-LTLFireability-07
FORMULA_NAME Anderson-PT-08-LTLFireability-08
FORMULA_NAME Anderson-PT-08-LTLFireability-09
FORMULA_NAME Anderson-PT-08-LTLFireability-10
FORMULA_NAME Anderson-PT-08-LTLFireability-11
FORMULA_NAME Anderson-PT-08-LTLFireability-12
FORMULA_NAME Anderson-PT-08-LTLFireability-13
FORMULA_NAME Anderson-PT-08-LTLFireability-14
FORMULA_NAME Anderson-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680843230791

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 04:53:52] [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]
[2023-04-07 04:53:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:53:52] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-04-07 04:53:52] [INFO ] Transformed 401 places.
[2023-04-07 04:53:52] [INFO ] Transformed 1328 transitions.
[2023-04-07 04:53:52] [INFO ] Found NUPN structural information;
[2023-04-07 04:53:52] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 321 transition count 828
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 321 transition count 828
Applied a total of 160 rules in 62 ms. Remains 321 /401 variables (removed 80) and now considering 828/1328 (removed 500) transitions.
// Phase 1: matrix 828 rows 321 cols
[2023-04-07 04:53:52] [INFO ] Computed 19 invariants in 52 ms
[2023-04-07 04:53:53] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-04-07 04:53:53] [INFO ] Invariant cache hit.
[2023-04-07 04:53:53] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:53] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
[2023-04-07 04:53:53] [INFO ] Invariant cache hit.
[2023-04-07 04:53:54] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 321/401 places, 828/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1796 ms. Remains : 321/401 places, 828/1328 transitions.
Support contains 55 out of 321 places after structural reductions.
[2023-04-07 04:53:54] [INFO ] Flatten gal took : 89 ms
[2023-04-07 04:53:54] [INFO ] Flatten gal took : 59 ms
[2023-04-07 04:53:54] [INFO ] Input system was already deterministic with 828 transitions.
Support contains 53 out of 321 places (down from 55) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 37) seen :19
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :1
Running SMT prover for 9 properties.
[2023-04-07 04:53:55] [INFO ] Invariant cache hit.
[2023-04-07 04:53:55] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-07 04:53:55] [INFO ] [Real]Absence check using 9 positive and 10 generalized place invariants in 19 ms returned sat
[2023-04-07 04:53:56] [INFO ] After 849ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-04-07 04:53:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 21 ms returned sat
[2023-04-07 04:53:56] [INFO ] [Nat]Absence check using 9 positive and 10 generalized place invariants in 16 ms returned sat
[2023-04-07 04:53:57] [INFO ] After 771ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-04-07 04:53:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:58] [INFO ] After 684ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-04-07 04:53:58] [INFO ] After 1388ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 605 ms.
[2023-04-07 04:53:59] [INFO ] After 2993ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 89 ms.
Support contains 13 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 828/828 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 321 transition count 772
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 265 transition count 772
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 137 place count 240 transition count 481
Iterating global reduction 0 with 25 rules applied. Total rules applied 162 place count 240 transition count 481
Applied a total of 162 rules in 43 ms. Remains 240 /321 variables (removed 81) and now considering 481/828 (removed 347) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 240/321 places, 481/828 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 481 rows 240 cols
[2023-04-07 04:53:59] [INFO ] Computed 19 invariants in 17 ms
[2023-04-07 04:53:59] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 04:53:59] [INFO ] [Real]Absence check using 10 positive and 9 generalized place invariants in 9 ms returned sat
[2023-04-07 04:54:00] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 04:54:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 04:54:00] [INFO ] [Nat]Absence check using 10 positive and 9 generalized place invariants in 9 ms returned sat
[2023-04-07 04:54:00] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 04:54:00] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:54:00] [INFO ] After 96ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 04:54:00] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-04-07 04:54:00] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 481/481 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 236 transition count 421
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 236 transition count 421
Applied a total of 8 rules in 22 ms. Remains 236 /240 variables (removed 4) and now considering 421/481 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 236/240 places, 421/481 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Finished probabilistic random walk after 113030 steps, run visited all 3 properties in 924 ms. (steps per millisecond=122 )
Probabilistic random walk after 113030 steps, saw 79486 distinct states, run finished after 925 ms. (steps per millisecond=122 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Anderson-PT-08-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 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((F(p1)&&p0))||G(p1))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 321 transition count 772
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 265 transition count 772
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 142 place count 235 transition count 406
Iterating global reduction 0 with 30 rules applied. Total rules applied 172 place count 235 transition count 406
Applied a total of 172 rules in 32 ms. Remains 235 /321 variables (removed 86) and now considering 406/828 (removed 422) transitions.
// Phase 1: matrix 406 rows 235 cols
[2023-04-07 04:54:02] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 04:54:02] [INFO ] Implicit Places using invariants in 216 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 222 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/321 places, 406/828 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 234 transition count 344
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 172 transition count 344
Applied a total of 124 rules in 13 ms. Remains 172 /234 variables (removed 62) and now considering 344/406 (removed 62) transitions.
// Phase 1: matrix 344 rows 172 cols
[2023-04-07 04:54:02] [INFO ] Computed 18 invariants in 4 ms
[2023-04-07 04:54:02] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-04-07 04:54:02] [INFO ] Invariant cache hit.
[2023-04-07 04:54:02] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:54:03] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 172/321 places, 344/828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 803 ms. Remains : 172/321 places, 344/828 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 198 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s20 1) (EQ s24 1)), p1:(OR (EQ s17 0) (EQ s28 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 286 ms.
Stack based approach found an accepted trace after 10166 steps with 0 reset with depth 10167 and stack size 8043 in 25 ms.
FORMULA Anderson-PT-08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-00 finished in 1376 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 U p1))))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 290 transition count 433
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 290 transition count 433
Applied a total of 62 rules in 13 ms. Remains 290 /321 variables (removed 31) and now considering 433/828 (removed 395) transitions.
// Phase 1: matrix 433 rows 290 cols
[2023-04-07 04:54:03] [INFO ] Computed 19 invariants in 5 ms
[2023-04-07 04:54:04] [INFO ] Implicit Places using invariants in 205 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 207 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/321 places, 433/828 transitions.
Applied a total of 0 rules in 5 ms. Remains 289 /289 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 289/321 places, 433/828 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s44 1), p0:(AND (EQ s0 1) (EQ s112 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-01 finished in 381 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||X(p0))))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 321 transition count 772
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 265 transition count 772
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 143 place count 234 transition count 391
Iterating global reduction 0 with 31 rules applied. Total rules applied 174 place count 234 transition count 391
Applied a total of 174 rules in 28 ms. Remains 234 /321 variables (removed 87) and now considering 391/828 (removed 437) transitions.
// Phase 1: matrix 391 rows 234 cols
[2023-04-07 04:54:04] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 04:54:04] [INFO ] Implicit Places using invariants in 197 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 199 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 233/321 places, 391/828 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 233 transition count 328
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 170 transition count 328
Applied a total of 126 rules in 12 ms. Remains 170 /233 variables (removed 63) and now considering 328/391 (removed 63) transitions.
// Phase 1: matrix 328 rows 170 cols
[2023-04-07 04:54:04] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 04:54:04] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-04-07 04:54:04] [INFO ] Invariant cache hit.
[2023-04-07 04:54:04] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:54:04] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 170/321 places, 328/828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 697 ms. Remains : 170/321 places, 328/828 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s17 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 39 reset in 211 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-02 finished in 966 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&&G((p1||X(G(p2)))))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 292 transition count 477
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 292 transition count 477
Applied a total of 58 rules in 13 ms. Remains 292 /321 variables (removed 29) and now considering 477/828 (removed 351) transitions.
// Phase 1: matrix 477 rows 292 cols
[2023-04-07 04:54:05] [INFO ] Computed 19 invariants in 12 ms
[2023-04-07 04:54:05] [INFO ] Implicit Places using invariants in 220 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 222 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/321 places, 477/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 241 ms. Remains : 291/321 places, 477/828 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 1}, { cond=true, acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(NOT p2), acceptance={1} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s26 0) (AND (EQ s8 1) (EQ s25 1))), p1:(AND (EQ s22 1) (EQ s31 1)), p2:(OR (EQ s16 0) (EQ s26 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Stack based approach found an accepted trace after 290 steps with 0 reset with depth 291 and stack size 252 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-03 finished in 657 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)&&(X(X(p1))||G(p2))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 291 transition count 448
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 291 transition count 448
Applied a total of 60 rules in 12 ms. Remains 291 /321 variables (removed 30) and now considering 448/828 (removed 380) transitions.
// Phase 1: matrix 448 rows 291 cols
[2023-04-07 04:54:05] [INFO ] Computed 19 invariants in 6 ms
[2023-04-07 04:54:06] [INFO ] Implicit Places using invariants in 210 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/321 places, 448/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 290 /290 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 227 ms. Remains : 290/321 places, 448/828 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s26 0)), p2:(OR (NEQ s2 1) (NEQ s111 1)), p1:(EQ s49 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, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 119 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-04 finished in 526 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 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 290 transition count 447
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 290 transition count 447
Applied a total of 62 rules in 16 ms. Remains 290 /321 variables (removed 31) and now considering 447/828 (removed 381) transitions.
// Phase 1: matrix 447 rows 290 cols
[2023-04-07 04:54:06] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 04:54:06] [INFO ] Implicit Places using invariants in 209 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/321 places, 447/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 289 /289 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 229 ms. Remains : 289/321 places, 447/828 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-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:(AND (EQ s14 1) (EQ s25 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 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-05 finished in 319 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 U (G(!p0)||(!p0&&G(!p1)&&X(F(!p2))))))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 292 transition count 477
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 292 transition count 477
Applied a total of 58 rules in 14 ms. Remains 292 /321 variables (removed 29) and now considering 477/828 (removed 351) transitions.
// Phase 1: matrix 477 rows 292 cols
[2023-04-07 04:54:06] [INFO ] Computed 19 invariants in 5 ms
[2023-04-07 04:54:06] [INFO ] Implicit Places using invariants in 206 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 207 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/321 places, 477/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 291/321 places, 477/828 transitions.
Stuttering acceptance computed with spot in 152 ms :[p0, p0, (AND p0 p1), (AND p0 p2)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s28 1)), p0:(AND (EQ s12 1) (EQ s25 1)), p2:(AND (EQ s13 1) (EQ s32 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 32 reset in 157 ms.
Product exploration explored 100000 steps with 13 reset in 235 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 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 128 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[p0, p0, (AND p0 p1), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 477 rows 291 cols
[2023-04-07 04:54:07] [INFO ] Computed 18 invariants in 2 ms
[2023-04-07 04:54:08] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-07 04:54:08] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 04:54:08] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (G (NOT (AND p1 p0))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND (NOT p0) p2)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 13 factoid took 372 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, p0, (AND p1 p0)]
Stuttering acceptance computed with spot in 110 ms :[p0, p0, (AND p1 p0)]
Support contains 4 out of 291 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 477/477 transitions.
Applied a total of 0 rules in 3 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2023-04-07 04:54:08] [INFO ] Invariant cache hit.
[2023-04-07 04:54:08] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-04-07 04:54:08] [INFO ] Invariant cache hit.
[2023-04-07 04:54:09] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:54:09] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
[2023-04-07 04:54:09] [INFO ] Invariant cache hit.
[2023-04-07 04:54:09] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1184 ms. Remains : 291/291 places, 477/477 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 (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 90 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[p0, p0, (AND p1 p0)]
Finished random walk after 9074 steps, including 2 resets, run visited all 4 properties in 80 ms. (steps per millisecond=113 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 8 factoid took 229 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[p0, p0, (AND p1 p0)]
Stuttering acceptance computed with spot in 110 ms :[p0, p0, (AND p1 p0)]
Stuttering acceptance computed with spot in 112 ms :[p0, p0, (AND p1 p0)]
Product exploration explored 100000 steps with 0 reset in 140 ms.
Stack based approach found an accepted trace after 24414 steps with 0 reset with depth 24415 and stack size 2443 in 54 ms.
FORMULA Anderson-PT-08-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-06 finished in 4302 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((F(p1)||p0))&&X((!p2 U (p3||G(!p2)))))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 292 transition count 477
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 292 transition count 477
Applied a total of 58 rules in 6 ms. Remains 292 /321 variables (removed 29) and now considering 477/828 (removed 351) transitions.
// Phase 1: matrix 477 rows 292 cols
[2023-04-07 04:54:10] [INFO ] Computed 19 invariants in 5 ms
[2023-04-07 04:54:11] [INFO ] Implicit Places using invariants in 216 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 218 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/321 places, 477/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 228 ms. Remains : 291/321 places, 477/828 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p3) p2), true]
Running random walk in product with property : Anderson-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NEQ s15 1) (NEQ s34 1)), p1:(OR (NEQ s21 1) (NEQ s29 1)), p3:(AND (NOT (AND (EQ s13 1) (EQ s26 1))) (NOT (AND (EQ s15 1) (EQ s34 1)))), p2:(AND (E...], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 119 ms.
Product exploration explored 100000 steps with 0 reset in 169 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 p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 477 rows 291 cols
[2023-04-07 04:54:11] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 04:54:12] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-04-07 04:54:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2023-04-07 04:54:12] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 11 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLFireability-07 finished in 1108 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 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 321 transition count 772
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 265 transition count 772
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 142 place count 235 transition count 406
Iterating global reduction 0 with 30 rules applied. Total rules applied 172 place count 235 transition count 406
Applied a total of 172 rules in 19 ms. Remains 235 /321 variables (removed 86) and now considering 406/828 (removed 422) transitions.
// Phase 1: matrix 406 rows 235 cols
[2023-04-07 04:54:12] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 04:54:12] [INFO ] Implicit Places using invariants in 197 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 200 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/321 places, 406/828 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 234 transition count 344
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 172 transition count 344
Applied a total of 124 rules in 8 ms. Remains 172 /234 variables (removed 62) and now considering 344/406 (removed 62) transitions.
// Phase 1: matrix 344 rows 172 cols
[2023-04-07 04:54:12] [INFO ] Computed 18 invariants in 2 ms
[2023-04-07 04:54:12] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-04-07 04:54:12] [INFO ] Invariant cache hit.
[2023-04-07 04:54:12] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:54:12] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 172/321 places, 344/828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 763 ms. Remains : 172/321 places, 344/828 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-10 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:(OR (EQ s14 0) (EQ s30 0)), p1:(OR (EQ s22 0) (EQ s28 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7 reset in 129 ms.
Product exploration explored 100000 steps with 8 reset in 160 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:54:13] [INFO ] Invariant cache hit.
[2023-04-07 04:54:13] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:54:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-04-07 04:54:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2023-04-07 04:54:13] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:54:13] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:54:13] [INFO ] After 53ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:54:13] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-07 04:54:13] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 344/344 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 172 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 171 transition count 343
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 170 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 170 transition count 328
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 170 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 169 transition count 327
Applied a total of 6 rules in 38 ms. Remains 169 /172 variables (removed 3) and now considering 327/344 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 169/172 places, 327/344 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 50402 steps, run visited all 1 properties in 106 ms. (steps per millisecond=475 )
Probabilistic random walk after 50402 steps, saw 35295 distinct states, run finished after 106 ms. (steps per millisecond=475 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 344/344 transitions.
Applied a total of 0 rules in 4 ms. Remains 172 /172 variables (removed 0) and now considering 344/344 (removed 0) transitions.
[2023-04-07 04:54:14] [INFO ] Invariant cache hit.
[2023-04-07 04:54:14] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-04-07 04:54:14] [INFO ] Invariant cache hit.
[2023-04-07 04:54:14] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:54:14] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2023-04-07 04:54:14] [INFO ] Redundant transitions in 27 ms returned []
[2023-04-07 04:54:14] [INFO ] Invariant cache hit.
[2023-04-07 04:54:15] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 745 ms. Remains : 172/172 places, 344/344 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 65 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:54:15] [INFO ] Invariant cache hit.
[2023-04-07 04:54:15] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:54:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-04-07 04:54:15] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2023-04-07 04:54:15] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:54:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:54:15] [INFO ] After 55ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:54:15] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-07 04:54:15] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 344/344 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 172 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 171 transition count 343
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 170 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 170 transition count 328
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 170 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 169 transition count 327
Applied a total of 6 rules in 14 ms. Remains 169 /172 variables (removed 3) and now considering 327/344 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 169/172 places, 327/344 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 50402 steps, run visited all 1 properties in 114 ms. (steps per millisecond=442 )
Probabilistic random walk after 50402 steps, saw 35295 distinct states, run finished after 115 ms. (steps per millisecond=438 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4 reset in 128 ms.
Product exploration explored 100000 steps with 9 reset in 150 ms.
Built C files in :
/tmp/ltsmin17094586252142839544
[2023-04-07 04:54:16] [INFO ] Computing symmetric may disable matrix : 344 transitions.
[2023-04-07 04:54:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:54:16] [INFO ] Computing symmetric may enable matrix : 344 transitions.
[2023-04-07 04:54:16] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:54:16] [INFO ] Computing Do-Not-Accords matrix : 344 transitions.
[2023-04-07 04:54:16] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:54:16] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17094586252142839544
Running compilation step : cd /tmp/ltsmin17094586252142839544;'/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 756 ms.
Running link step : cd /tmp/ltsmin17094586252142839544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17094586252142839544;'/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/stateBased811043325655365353.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 344/344 transitions.
Applied a total of 0 rules in 12 ms. Remains 172 /172 variables (removed 0) and now considering 344/344 (removed 0) transitions.
[2023-04-07 04:54:31] [INFO ] Invariant cache hit.
[2023-04-07 04:54:31] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-04-07 04:54:31] [INFO ] Invariant cache hit.
[2023-04-07 04:54:31] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:54:32] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-04-07 04:54:32] [INFO ] Redundant transitions in 7 ms returned []
[2023-04-07 04:54:32] [INFO ] Invariant cache hit.
[2023-04-07 04:54:32] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 677 ms. Remains : 172/172 places, 344/344 transitions.
Built C files in :
/tmp/ltsmin6501436586224130672
[2023-04-07 04:54:32] [INFO ] Computing symmetric may disable matrix : 344 transitions.
[2023-04-07 04:54:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:54:32] [INFO ] Computing symmetric may enable matrix : 344 transitions.
[2023-04-07 04:54:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:54:32] [INFO ] Computing Do-Not-Accords matrix : 344 transitions.
[2023-04-07 04:54:32] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:54:32] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6501436586224130672
Running compilation step : cd /tmp/ltsmin6501436586224130672;'/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 639 ms.
Running link step : cd /tmp/ltsmin6501436586224130672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6501436586224130672;'/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/stateBased17942949260214949637.hoa' '--buchi-type=spotba'
LTSmin run took 13547 ms.
FORMULA Anderson-PT-08-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-08-LTLFireability-10 finished in 34529 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((!p1 U p2))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 292 transition count 449
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 292 transition count 449
Applied a total of 58 rules in 15 ms. Remains 292 /321 variables (removed 29) and now considering 449/828 (removed 379) transitions.
// Phase 1: matrix 449 rows 292 cols
[2023-04-07 04:54:46] [INFO ] Computed 19 invariants in 8 ms
[2023-04-07 04:54:46] [INFO ] Implicit Places using invariants in 214 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/321 places, 449/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 291 /291 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 233 ms. Remains : 291/321 places, 449/828 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s96 1), p2:(EQ s74 1), p1:(AND (EQ s16 1) (EQ s31 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3798 steps with 2 reset in 9 ms.
FORMULA Anderson-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-12 finished in 462 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 G(p1))||X(F(p2)))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 290 transition count 447
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 290 transition count 447
Applied a total of 62 rules in 12 ms. Remains 290 /321 variables (removed 31) and now considering 447/828 (removed 381) transitions.
// Phase 1: matrix 447 rows 290 cols
[2023-04-07 04:54:47] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 04:54:47] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-04-07 04:54:47] [INFO ] Invariant cache hit.
[2023-04-07 04:54:47] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:54:48] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
[2023-04-07 04:54:48] [INFO ] Invariant cache hit.
[2023-04-07 04:54:48] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 290/321 places, 447/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1223 ms. Remains : 290/321 places, 447/828 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Anderson-PT-08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s15 1) (EQ s29 1)), p0:(AND (EQ s7 1) (EQ s195 1)), p2:(AND (EQ s0 1) (EQ s252 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 38 reset in 143 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-13 finished in 1602 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)))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 290 transition count 447
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 290 transition count 447
Applied a total of 62 rules in 9 ms. Remains 290 /321 variables (removed 31) and now considering 447/828 (removed 381) transitions.
// Phase 1: matrix 447 rows 290 cols
[2023-04-07 04:54:48] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 04:54:48] [INFO ] Implicit Places using invariants in 199 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 200 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/321 places, 447/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 289 /289 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 214 ms. Remains : 289/321 places, 447/828 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s29 0) (AND (EQ s2 1) (EQ s166 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Product exploration explored 100000 steps with 50000 reset in 240 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-08-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLFireability-14 finished in 815 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||X(X(X(!p0))))))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 291 transition count 462
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 291 transition count 462
Applied a total of 60 rules in 13 ms. Remains 291 /321 variables (removed 30) and now considering 462/828 (removed 366) transitions.
// Phase 1: matrix 462 rows 291 cols
[2023-04-07 04:54:49] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 04:54:49] [INFO ] Implicit Places using invariants in 192 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 196 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/321 places, 462/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 212 ms. Remains : 290/321 places, 462/828 transitions.
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), true, (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0, p0]
Running random walk in product with property : Anderson-PT-08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 2}]], initial=0, aps=[p1:(AND (EQ s15 1) (EQ s25 1)), p0:(AND (EQ s15 1) (EQ s29 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, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 196 ms.
Product exploration explored 100000 steps with 25000 reset in 201 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 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 76 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[p0, p0, p0, p0, true]
Finished random walk after 3791 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=379 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0, p0, true]
Support contains 2 out of 290 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 290 cols
[2023-04-07 04:54:51] [INFO ] Computed 18 invariants in 2 ms
[2023-04-07 04:54:51] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-04-07 04:54:51] [INFO ] Invariant cache hit.
[2023-04-07 04:54:51] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:54:52] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2023-04-07 04:54:52] [INFO ] Invariant cache hit.
[2023-04-07 04:54:52] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1212 ms. Remains : 290/290 places, 462/462 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 : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[p0, p0, p0, p0, true]
Finished random walk after 376 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=188 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 162 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 193 ms.
Product exploration explored 100000 steps with 25000 reset in 194 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 173 ms :[p0, p0, p0, p0, true]
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 290/290 places, 462/462 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 290 transition count 462
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 56 Pre rules applied. Total rules applied 63 place count 290 transition count 462
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 119 place count 290 transition count 462
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 289 transition count 447
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 289 transition count 447
Deduced a syphon composed of 119 places in 0 ms
Applied a total of 121 rules in 29 ms. Remains 289 /290 variables (removed 1) and now considering 447/462 (removed 15) transitions.
[2023-04-07 04:54:53] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 447 rows 289 cols
[2023-04-07 04:54:53] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 04:54:54] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/290 places, 447/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 289/290 places, 447/462 transitions.
Built C files in :
/tmp/ltsmin9589718398029431392
[2023-04-07 04:54:54] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9589718398029431392
Running compilation step : cd /tmp/ltsmin9589718398029431392;'/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 622 ms.
Running link step : cd /tmp/ltsmin9589718398029431392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin9589718398029431392;'/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/stateBased5675835865039884778.hoa' '--buchi-type=spotba'
LTSmin run took 454 ms.
FORMULA Anderson-PT-08-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-08-LTLFireability-15 finished in 5758 ms.
All properties solved by simple procedures.
Total runtime 63045 ms.

BK_STOP 1680843296332

--------------------
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="Anderson-PT-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Anderson-PT-08, 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 r517-tall-167987243300036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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