Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r102-smll-162075331000053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331000053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 94K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-10a-00
FORMULA_NAME FlexibleBarrier-PT-10a-01
FORMULA_NAME FlexibleBarrier-PT-10a-02
FORMULA_NAME FlexibleBarrier-PT-10a-03
FORMULA_NAME FlexibleBarrier-PT-10a-04
FORMULA_NAME FlexibleBarrier-PT-10a-05
FORMULA_NAME FlexibleBarrier-PT-10a-06
FORMULA_NAME FlexibleBarrier-PT-10a-07
FORMULA_NAME FlexibleBarrier-PT-10a-08
FORMULA_NAME FlexibleBarrier-PT-10a-09
FORMULA_NAME FlexibleBarrier-PT-10a-10
FORMULA_NAME FlexibleBarrier-PT-10a-11
FORMULA_NAME FlexibleBarrier-PT-10a-12
FORMULA_NAME FlexibleBarrier-PT-10a-13
FORMULA_NAME FlexibleBarrier-PT-10a-14
FORMULA_NAME FlexibleBarrier-PT-10a-15

=== Now, execution of the tool begins

BK_START 1621127769768

Running Version 0
[2021-05-16 01:16:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 01:16:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 01:16:12] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2021-05-16 01:16:12] [INFO ] Transformed 123 places.
[2021-05-16 01:16:12] [INFO ] Transformed 334 transitions.
[2021-05-16 01:16:12] [INFO ] Found NUPN structural information;
[2021-05-16 01:16:12] [INFO ] Parsed PT model containing 123 places and 334 transitions in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 01:16:12] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 82 transitions
Reduce redundant transitions removed 82 transitions.
FORMULA FlexibleBarrier-PT-10a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 252/252 transitions.
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 242
Applied a total of 10 rules in 31 ms. Remains 123 /123 variables (removed 0) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:13] [INFO ] Computed 12 place invariants in 13 ms
[2021-05-16 01:16:13] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:13] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 01:16:13] [INFO ] State equation strengthened by 141 read => feed constraints.
[2021-05-16 01:16:13] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:13] [INFO ] Computed 12 place invariants in 10 ms
[2021-05-16 01:16:13] [INFO ] Dead Transitions using invariants and state equation in 268 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 242/252 transitions.
[2021-05-16 01:16:14] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 01:16:14] [INFO ] Flatten gal took : 79 ms
FORMULA FlexibleBarrier-PT-10a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 01:16:14] [INFO ] Flatten gal took : 32 ms
[2021-05-16 01:16:14] [INFO ] Input system was already deterministic with 242 transitions.
Finished random walk after 588 steps, including 0 resets, run visited all 30 properties in 17 ms. (steps per millisecond=34 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((X(F(p1))||G(p2)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 22 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:14] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 01:16:14] [INFO ] Implicit Places using invariants in 122 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:14] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 01:16:14] [INFO ] Dead Transitions using invariants and state equation in 230 ms returned []
Starting structural reductions, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:14] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 01:16:15] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 416 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-10a-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (NEQ s71 1) (NEQ s84 1) (NEQ s121 1)), p0:(AND (OR (NEQ s23 1) (NEQ s48 1) (NEQ s121 1)) (OR (NEQ s36 1) (NEQ s83 1) (NEQ s121 1))), p2:(AND (OR (NEQ s23 1) (NEQ s48 1) (NEQ s121 1)) (OR (NEQ s36 1) (NEQ s83 1) (NEQ s121 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23034 reset in 800 ms.
Stack based approach found an accepted trace after 4690 steps with 1082 reset with depth 12 and stack size 12 in 28 ms.
FORMULA FlexibleBarrier-PT-10a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-00 finished in 1899 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X((p0 U (G(p0)||p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:16] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 01:16:16] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:16] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 01:16:16] [INFO ] State equation strengthened by 141 read => feed constraints.
[2021-05-16 01:16:16] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:16] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 01:16:17] [INFO ] Dead Transitions using invariants and state equation in 246 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s4 1) (NEQ s122 1)), p1:(OR (NEQ s83 1) (NEQ s108 1) (NEQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 31659 reset in 810 ms.
Product exploration explored 100000 steps with 31693 reset in 866 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 31770 reset in 529 ms.
Product exploration explored 100000 steps with 31722 reset in 541 ms.
[2021-05-16 01:16:20] [INFO ] Flatten gal took : 20 ms
[2021-05-16 01:16:20] [INFO ] Flatten gal took : 18 ms
[2021-05-16 01:16:20] [INFO ] Time to serialize gal into /tmp/LTL10696965919159539518.gal : 13 ms
[2021-05-16 01:16:20] [INFO ] Time to serialize properties into /tmp/LTL11150512299427287474.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10696965919159539518.gal, -t, CGAL, -LTL, /tmp/LTL11150512299427287474.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10696965919159539518.gal -t CGAL -LTL /tmp/LTL11150512299427287474.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((X(("((p4==0)||(p122==0))")U(("(((p83==0)||(p108==0))||(p121==0))")||(G("((p4==0)||(p122==0))")))))&&("((p4==0)||(p122==0))")))))
Formula 0 simplified : !GF("((p4==0)||(p122==0))" & X("((p4==0)||(p122==0))" U ("(((p83==0)||(p108==0))||(p121==0))" | G"((p4==0)||(p122==0))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
298 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.0383,75768,1,0,35,340697,28,10,3974,195362,81
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-10a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property FlexibleBarrier-PT-10a-01 finished in 7540 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0)) U (p1&&X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:23] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:24] [INFO ] Implicit Places using invariants in 126 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 ms to find 1 implicit places.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:24] [INFO ] Computed 11 place invariants in 7 ms
[2021-05-16 01:16:24] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Starting structural reductions, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:24] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 01:16:24] [INFO ] Dead Transitions using invariants and state equation in 180 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-10a-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s39 1), p0:(AND (EQ s67 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-02 finished in 636 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0) U G((p1 U p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:24] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:24] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:24] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:24] [INFO ] State equation strengthened by 141 read => feed constraints.
[2021-05-16 01:16:24] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:24] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:25] [INFO ] Dead Transitions using invariants and state equation in 235 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 332 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-10a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(OR p2 p1), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(OR (EQ s56 1) (AND (EQ s7 1) (EQ s122 1))), p1:(AND (EQ s12 1) (EQ s59 1) (EQ s121 1)), p0:(AND (EQ s7 1) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], 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 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-03 finished in 853 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1)&&(p2||X(F((p2&&F(p3))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:25] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:25] [INFO ] Implicit Places using invariants in 134 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:25] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-16 01:16:25] [INFO ] Dead Transitions using invariants and state equation in 192 ms returned []
Starting structural reductions, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:25] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:16:26] [INFO ] Dead Transitions using invariants and state equation in 268 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true]
Running random walk in product with property : FlexibleBarrier-PT-10a-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p2 p3), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=(AND p1 p3), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(AND (EQ s35 1) (EQ s60 1) (EQ s121 1)), p0:(EQ s106 0), p2:(EQ s106 1), p3:(AND (NEQ s47 0) (NEQ s108 0) (NEQ s121 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-04 finished in 898 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 92 edges and 123 vertex of which 21 / 123 are part of one of the 7 SCC in 6 ms
Free SCC test removed 14 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 109 transition count 206
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 108 transition count 206
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 63 place count 78 transition count 176
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 0 with 28 rules applied. Total rules applied 91 place count 78 transition count 148
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 78 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 77 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 77 transition count 147
Applied a total of 94 rules in 112 ms. Remains 77 /123 variables (removed 46) and now considering 147/242 (removed 95) transitions.
[2021-05-16 01:16:26] [INFO ] Flow matrix only has 102 transitions (discarded 45 similar events)
// Phase 1: matrix 102 rows 77 cols
[2021-05-16 01:16:26] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 01:16:26] [INFO ] Implicit Places using invariants in 114 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
[2021-05-16 01:16:26] [INFO ] Redundant transitions in 61 ms returned [53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82]
Found 22 redundant transitions using SMT.
Drop transitions removed 22 transitions
Redundant transitions reduction (with SMT) removed 22 transitions :[82, 81, 80, 79, 78, 77, 76, 75, 74, 73, 64, 63, 62, 61, 60, 59, 58, 57, 56, 55, 54, 53]
[2021-05-16 01:16:26] [INFO ] Flow matrix only has 101 transitions (discarded 24 similar events)
// Phase 1: matrix 101 rows 76 cols
[2021-05-16 01:16:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:16:26] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
Starting structural reductions, iteration 1 : 76/123 places, 125/242 transitions.
Graph (trivial) has 96 edges and 76 vertex of which 21 / 76 are part of one of the 7 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 62 transition count 87
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 52 transition count 87
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 21 place count 52 transition count 77
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 42 transition count 77
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 67 place count 29 transition count 64
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 75 place count 29 transition count 56
Applied a total of 75 rules in 17 ms. Remains 29 /76 variables (removed 47) and now considering 56/125 (removed 69) transitions.
[2021-05-16 01:16:26] [INFO ] Flow matrix only has 36 transitions (discarded 20 similar events)
// Phase 1: matrix 36 rows 29 cols
[2021-05-16 01:16:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:16:26] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-16 01:16:26] [INFO ] Flow matrix only has 36 transitions (discarded 20 similar events)
// Phase 1: matrix 36 rows 29 cols
[2021-05-16 01:16:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:16:26] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-16 01:16:26] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 29/123 places, 56/242 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10a-05 automaton TGBA [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=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s26 1), p1:(AND (EQ s15 1) (EQ s20 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-05 finished in 671 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(G(p1))||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:27] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:27] [INFO ] Implicit Places using invariants in 122 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:27] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 01:16:27] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
Starting structural reductions, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:27] [INFO ] Computed 11 place invariants in 8 ms
[2021-05-16 01:16:27] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : FlexibleBarrier-PT-10a-06 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (NEQ s11 0) (NEQ s48 0) (NEQ s121 0)), p0:(OR (EQ s23 0) (EQ s48 0) (EQ s121 0) (EQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-06 finished in 694 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(G((p1||X(p2))))&&p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:27] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 01:16:27] [INFO ] Implicit Places using invariants in 137 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:16:28] [INFO ] Dead Transitions using invariants and state equation in 163 ms returned []
Starting structural reductions, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:28] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:16:28] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-10a-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s107 1) (EQ s121 1)), p1:(AND (EQ s24 1) (EQ s35 1) (EQ s121 1)), p2:(AND (EQ s35 1) (EQ s84 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-07 finished in 628 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U X(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:28] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:28] [INFO ] Implicit Places using invariants in 108 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:28] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:16:28] [INFO ] Dead Transitions using invariants and state equation in 237 ms returned []
Starting structural reductions, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:28] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 01:16:28] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s84 1) (EQ s95 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-08 finished in 682 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||X(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:29] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:29] [INFO ] Implicit Places using invariants in 88 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:29] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:16:29] [INFO ] Dead Transitions using invariants and state equation in 176 ms returned []
Starting structural reductions, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:16:29] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 01:16:29] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10a-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(NEQ s58 1), p1:(OR (NEQ s24 1) (NEQ s59 1) (NEQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 518 ms.
Product exploration explored 100000 steps with 33333 reset in 515 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 450 ms.
Product exploration explored 100000 steps with 33333 reset in 463 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 122 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 122/122 places, 242/242 transitions.
Graph (trivial) has 143 edges and 122 vertex of which 68 / 122 are part of one of the 10 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 64 transition count 147
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 13 place count 64 transition count 147
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 64 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 64 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 63 transition count 146
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 63 transition count 146
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 38 place count 63 transition count 170
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 61 transition count 166
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 61 transition count 166
Deduced a syphon composed of 32 places in 1 ms
Drop transitions removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 1 with 54 rules applied. Total rules applied 96 place count 61 transition count 112
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 53 transition count 104
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 53 transition count 104
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 112 rules in 45 ms. Remains 53 /122 variables (removed 69) and now considering 104/242 (removed 138) transitions.
[2021-05-16 01:16:32] [INFO ] Redundant transitions in 40 ms returned [33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 51, 52, 53, 54, 63, 64]
Found 16 redundant transitions using SMT.
Drop transitions removed 16 transitions
Redundant transitions reduction (with SMT) removed 16 transitions :[64, 63, 54, 53, 52, 51, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33]
[2021-05-16 01:16:32] [INFO ] Flow matrix only has 65 transitions (discarded 23 similar events)
// Phase 1: matrix 65 rows 53 cols
[2021-05-16 01:16:32] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 01:16:32] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Starting structural reductions, iteration 1 : 53/122 places, 88/242 transitions.
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 0 rules in 7 ms. Remains 53 /53 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2021-05-16 01:16:32] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-16 01:16:32] [INFO ] Flow matrix only has 65 transitions (discarded 23 similar events)
// Phase 1: matrix 65 rows 53 cols
[2021-05-16 01:16:32] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:16:32] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 2 iterations. Remains : 53/122 places, 88/242 transitions.
Product exploration explored 100000 steps with 33333 reset in 799 ms.
Product exploration explored 100000 steps with 33333 reset in 506 ms.
[2021-05-16 01:16:33] [INFO ] Flatten gal took : 16 ms
[2021-05-16 01:16:33] [INFO ] Flatten gal took : 16 ms
[2021-05-16 01:16:33] [INFO ] Time to serialize gal into /tmp/LTL1475475209843584343.gal : 4 ms
[2021-05-16 01:16:33] [INFO ] Time to serialize properties into /tmp/LTL5634905088551235704.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1475475209843584343.gal, -t, CGAL, -LTL, /tmp/LTL5634905088551235704.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1475475209843584343.gal -t CGAL -LTL /tmp/LTL5634905088551235704.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(p58==0)")||(X("(((p24==0)||(p59==0))||(p121==0))")))))))
Formula 0 simplified : !XXF("(p58==0)" | X"(((p24==0)||(p59==0))||(p121==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
91 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.934999,34528,1,0,7,115671,14,0,3613,31170,10
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-10a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FlexibleBarrier-PT-10a-09 finished in 5815 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:34] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:34] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:34] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:35] [INFO ] State equation strengthened by 141 read => feed constraints.
[2021-05-16 01:16:35] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:16:35] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:35] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s2 0) (EQ s122 0)), p0:(OR (EQ s48 0) (EQ s71 0) (EQ s121 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1117 ms.
Product exploration explored 100000 steps with 50000 reset in 685 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 652 ms.
Product exploration explored 100000 steps with 50000 reset in 662 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 5 out of 123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 93 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 107 transition count 224
Deduced a syphon composed of 28 places in 0 ms
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 0 with 28 rules applied. Total rules applied 57 place count 107 transition count 196
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 57 rules in 22 ms. Remains 107 /123 variables (removed 16) and now considering 196/242 (removed 46) transitions.
[2021-05-16 01:16:39] [INFO ] Redundant transitions in 122 ms returned [88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 114, 115, 116, 117, 118, 119]
Found 24 redundant transitions using SMT.
Drop transitions removed 24 transitions
Redundant transitions reduction (with SMT) removed 24 transitions :[119, 118, 117, 116, 115, 114, 105, 104, 103, 102, 101, 100, 99, 98, 97, 96, 95, 94, 93, 92, 91, 90, 89, 88]
[2021-05-16 01:16:39] [INFO ] Flow matrix only has 150 transitions (discarded 22 similar events)
// Phase 1: matrix 150 rows 107 cols
[2021-05-16 01:16:39] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:39] [INFO ] Dead Transitions using invariants and state equation in 167 ms returned []
Starting structural reductions, iteration 1 : 107/123 places, 172/242 transitions.
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2021-05-16 01:16:39] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-16 01:16:39] [INFO ] Flow matrix only has 150 transitions (discarded 22 similar events)
// Phase 1: matrix 150 rows 107 cols
[2021-05-16 01:16:39] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:39] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Finished structural reductions, in 2 iterations. Remains : 107/123 places, 172/242 transitions.
Product exploration explored 100000 steps with 50000 reset in 891 ms.
Product exploration explored 100000 steps with 50000 reset in 800 ms.
[2021-05-16 01:16:41] [INFO ] Flatten gal took : 16 ms
[2021-05-16 01:16:41] [INFO ] Flatten gal took : 15 ms
[2021-05-16 01:16:41] [INFO ] Time to serialize gal into /tmp/LTL10685900863153286353.gal : 4 ms
[2021-05-16 01:16:41] [INFO ] Time to serialize properties into /tmp/LTL49624963236638341.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10685900863153286353.gal, -t, CGAL, -LTL, /tmp/LTL49624963236638341.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10685900863153286353.gal -t CGAL -LTL /tmp/LTL49624963236638341.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(((p48==0)||(p71==0))||(p121==0))"))U("((p2==0)||(p122==0))"))))
Formula 0 simplified : !X(F"(((p48==0)||(p71==0))||(p121==0))" U "((p2==0)||(p122==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
141 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.47033,38432,1,0,6,136062,21,0,3786,65272,10
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-10a-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FlexibleBarrier-PT-10a-11 finished in 7861 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 98 edges and 123 vertex of which 27 / 123 are part of one of the 9 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 74 transition count 165
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 0 with 36 rules applied. Total rules applied 99 place count 74 transition count 129
Applied a total of 99 rules in 16 ms. Remains 74 /123 variables (removed 49) and now considering 129/242 (removed 113) transitions.
[2021-05-16 01:16:42] [INFO ] Flow matrix only has 94 transitions (discarded 35 similar events)
// Phase 1: matrix 94 rows 74 cols
[2021-05-16 01:16:42] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 01:16:42] [INFO ] Implicit Places using invariants in 104 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
[2021-05-16 01:16:42] [INFO ] Redundant transitions in 25 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67]
Found 17 redundant transitions using SMT.
Drop transitions removed 17 transitions
Redundant transitions reduction (with SMT) removed 17 transitions :[67, 66, 65, 64, 63, 62, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51]
[2021-05-16 01:16:42] [INFO ] Flow matrix only has 94 transitions (discarded 18 similar events)
// Phase 1: matrix 94 rows 73 cols
[2021-05-16 01:16:42] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:16:43] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Starting structural reductions, iteration 1 : 73/123 places, 112/242 transitions.
Graph (trivial) has 98 edges and 73 vertex of which 27 / 73 are part of one of the 9 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 55 transition count 66
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 45 transition count 66
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 21 place count 45 transition count 56
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 35 transition count 56
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 63 place count 24 transition count 45
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 72 place count 24 transition count 36
Applied a total of 72 rules in 14 ms. Remains 24 /73 variables (removed 49) and now considering 36/112 (removed 76) transitions.
[2021-05-16 01:16:43] [INFO ] Flow matrix only has 26 transitions (discarded 10 similar events)
// Phase 1: matrix 26 rows 24 cols
[2021-05-16 01:16:43] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 01:16:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2021-05-16 01:16:43] [INFO ] Flow matrix only has 26 transitions (discarded 10 similar events)
// Phase 1: matrix 26 rows 24 cols
[2021-05-16 01:16:43] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:16:43] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-16 01:16:43] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 24/123 places, 36/242 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10a-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} 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 p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s7 1) (NEQ s23 1)), p1:(EQ s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-14 finished in 449 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((p1&&F(p2))||p0))))], workingDir=/home/mcc/execution]
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 86 edges and 123 vertex of which 18 / 123 are part of one of the 6 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 191
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 74 place count 82 transition count 176
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 82 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 81 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 81 transition count 175
Applied a total of 78 rules in 35 ms. Remains 81 /123 variables (removed 42) and now considering 175/242 (removed 67) transitions.
[2021-05-16 01:16:43] [INFO ] Flow matrix only has 118 transitions (discarded 57 similar events)
// Phase 1: matrix 118 rows 81 cols
[2021-05-16 01:16:43] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 01:16:43] [INFO ] Implicit Places using invariants in 55 ms returned []
[2021-05-16 01:16:43] [INFO ] Flow matrix only has 118 transitions (discarded 57 similar events)
// Phase 1: matrix 118 rows 81 cols
[2021-05-16 01:16:43] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 01:16:43] [INFO ] State equation strengthened by 91 read => feed constraints.
[2021-05-16 01:16:43] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2021-05-16 01:16:43] [INFO ] Redundant transitions in 63 ms returned [58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97]
Found 40 redundant transitions using SMT.
Drop transitions removed 40 transitions
Redundant transitions reduction (with SMT) removed 40 transitions :[97, 96, 95, 94, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84, 83, 82, 81, 80, 79, 78, 77, 76, 75, 74, 73, 72, 71, 70, 69, 68, 67, 66, 65, 64, 63, 62, 61, 60, 59, 58]
[2021-05-16 01:16:43] [INFO ] Flow matrix only has 112 transitions (discarded 23 similar events)
// Phase 1: matrix 112 rows 81 cols
[2021-05-16 01:16:43] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 01:16:43] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Starting structural reductions, iteration 1 : 81/123 places, 135/242 transitions.
Applied a total of 0 rules in 19 ms. Remains 81 /81 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2021-05-16 01:16:43] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-16 01:16:43] [INFO ] Flow matrix only has 112 transitions (discarded 23 similar events)
// Phase 1: matrix 112 rows 81 cols
[2021-05-16 01:16:43] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 01:16:43] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/123 places, 135/242 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-10a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s17 0), p0:(OR (EQ s9 0) (EQ s49 0) (EQ s79 0) (AND (OR (EQ s19 0) (EQ s41 0) (EQ s79 0)) (OR (EQ s24 0) (EQ s80 0)))), p2:(OR (NEQ s9 1) (NEQ s49 1) (NEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 522 steps with 0 reset in 8 ms.
FORMULA FlexibleBarrier-PT-10a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-15 finished in 708 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621127804852

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-10a, 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 r102-smll-162075331000053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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