Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260575700060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575700060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.3K Apr 29 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 374K May 10 09:33 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-10b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652622072712

Running Version 202205111006
[2022-05-15 13:41:14] [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]
[2022-05-15 13:41:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 13:41:15] [INFO ] Load time of PNML (sax parser for PT used): 381 ms
[2022-05-15 13:41:15] [INFO ] Transformed 1402 places.
[2022-05-15 13:41:15] [INFO ] Transformed 1613 transitions.
[2022-05-15 13:41:15] [INFO ] Found NUPN structural information;
[2022-05-15 13:41:15] [INFO ] Parsed PT model containing 1402 places and 1613 transitions in 673 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 1402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Discarding 525 places :
Symmetric choice reduction at 0 with 525 rule applications. Total rules 525 place count 877 transition count 1088
Iterating global reduction 0 with 525 rules applied. Total rules applied 1050 place count 877 transition count 1088
Discarding 237 places :
Symmetric choice reduction at 0 with 237 rule applications. Total rules 1287 place count 640 transition count 851
Iterating global reduction 0 with 237 rules applied. Total rules applied 1524 place count 640 transition count 851
Discarding 137 places :
Symmetric choice reduction at 0 with 137 rule applications. Total rules 1661 place count 503 transition count 714
Iterating global reduction 0 with 137 rules applied. Total rules applied 1798 place count 503 transition count 714
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 1857 place count 503 transition count 655
Applied a total of 1857 rules in 554 ms. Remains 503 /1402 variables (removed 899) and now considering 655/1613 (removed 958) transitions.
// Phase 1: matrix 655 rows 503 cols
[2022-05-15 13:41:16] [INFO ] Computed 12 place invariants in 69 ms
[2022-05-15 13:41:17] [INFO ] Implicit Places using invariants in 1017 ms returned []
// Phase 1: matrix 655 rows 503 cols
[2022-05-15 13:41:17] [INFO ] Computed 12 place invariants in 20 ms
[2022-05-15 13:41:19] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 2361 ms to find 0 implicit places.
// Phase 1: matrix 655 rows 503 cols
[2022-05-15 13:41:19] [INFO ] Computed 12 place invariants in 10 ms
[2022-05-15 13:41:19] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 503/1402 places, 655/1613 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/1402 places, 655/1613 transitions.
Support contains 45 out of 503 places after structural reductions.
[2022-05-15 13:41:20] [INFO ] Flatten gal took : 177 ms
[2022-05-15 13:41:20] [INFO ] Flatten gal took : 97 ms
[2022-05-15 13:41:20] [INFO ] Input system was already deterministic with 655 transitions.
Support contains 42 out of 503 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 1021 ms. (steps per millisecond=9 ) properties (out of 30) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) 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 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 655 rows 503 cols
[2022-05-15 13:41:22] [INFO ] Computed 12 place invariants in 7 ms
[2022-05-15 13:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2022-05-15 13:41:23] [INFO ] After 606ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:21
[2022-05-15 13:41:23] [INFO ] After 702ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-15 13:41:23] [INFO ] After 1538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-15 13:41:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2022-05-15 13:41:25] [INFO ] After 1070ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2022-05-15 13:41:26] [INFO ] Deduced a trap composed of 183 places in 447 ms of which 9 ms to minimize.
[2022-05-15 13:41:26] [INFO ] Deduced a trap composed of 129 places in 366 ms of which 6 ms to minimize.
[2022-05-15 13:41:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 950 ms
[2022-05-15 13:41:27] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 3 ms to minimize.
[2022-05-15 13:41:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2022-05-15 13:41:27] [INFO ] Deduced a trap composed of 136 places in 295 ms of which 3 ms to minimize.
[2022-05-15 13:41:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2022-05-15 13:41:28] [INFO ] After 4074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 871 ms.
[2022-05-15 13:41:29] [INFO ] After 5814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 14 properties in 322 ms.
Support contains 12 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 655/655 transitions.
Graph (trivial) has 452 edges and 503 vertex of which 55 / 503 are part of one of the 9 SCC in 9 ms
Free SCC test removed 46 places
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 457 transition count 552
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 410 transition count 552
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 95 place count 410 transition count 524
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 151 place count 382 transition count 524
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 188 place count 345 transition count 487
Iterating global reduction 2 with 37 rules applied. Total rules applied 225 place count 345 transition count 487
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 227 place count 345 transition count 485
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 227 place count 345 transition count 484
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 344 transition count 484
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 242 place count 331 transition count 471
Iterating global reduction 3 with 13 rules applied. Total rules applied 255 place count 331 transition count 471
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 267 place count 331 transition count 459
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 401 place count 264 transition count 392
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 420 place count 264 transition count 373
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 434 place count 250 transition count 359
Iterating global reduction 5 with 14 rules applied. Total rules applied 448 place count 250 transition count 359
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 452 place count 250 transition count 355
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 454 place count 249 transition count 355
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 456 place count 249 transition count 353
Free-agglomeration rule applied 179 times.
Iterating global reduction 6 with 179 rules applied. Total rules applied 635 place count 249 transition count 174
Reduce places removed 179 places and 0 transitions.
Drop transitions removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 6 with 226 rules applied. Total rules applied 861 place count 70 transition count 127
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 868 place count 70 transition count 120
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 869 place count 70 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 870 place count 69 transition count 119
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 50 edges and 68 vertex of which 18 / 68 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 873 place count 59 transition count 118
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 892 place count 58 transition count 100
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 892 place count 58 transition count 90
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 912 place count 48 transition count 90
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 921 place count 48 transition count 81
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 941 place count 38 transition count 71
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 943 place count 38 transition count 69
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 953 place count 38 transition count 59
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 35 rules applied. Total rules applied 988 place count 23 transition count 39
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 996 place count 23 transition count 31
Applied a total of 996 rules in 435 ms. Remains 23 /503 variables (removed 480) and now considering 31/655 (removed 624) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/503 places, 31/655 transitions.
Finished random walk after 168 steps, including 0 resets, run visited all 8 properties in 6 ms. (steps per millisecond=28 )
FORMULA FlexibleBarrier-PT-10b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 12 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(G(p1)&&(p2 U F(p3))))))'
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 481 transition count 633
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 481 transition count 633
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 481 transition count 630
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 66 place count 462 transition count 611
Iterating global reduction 1 with 19 rules applied. Total rules applied 85 place count 462 transition count 611
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 98 place count 462 transition count 598
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 456 transition count 592
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 456 transition count 592
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 456 transition count 588
Applied a total of 114 rules in 70 ms. Remains 456 /503 variables (removed 47) and now considering 588/655 (removed 67) transitions.
// Phase 1: matrix 588 rows 456 cols
[2022-05-15 13:41:30] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-15 13:41:31] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 588 rows 456 cols
[2022-05-15 13:41:31] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-15 13:41:32] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
// Phase 1: matrix 588 rows 456 cols
[2022-05-15 13:41:32] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-15 13:41:32] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 456/503 places, 588/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 456/503 places, 588/655 transitions.
Stuttering acceptance computed with spot in 606 ms :[true, (OR (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 p3 p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(OR (EQ s446 1) (AND (EQ s54 1) (EQ s187 1) (EQ s377 1))), p3:(EQ s45 1), p0:(EQ s158 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-00 finished in 2729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)&&p1)) U (F(p2)&&X(p3))))'
Support contains 8 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 481 transition count 633
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 481 transition count 633
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 481 transition count 631
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 462 transition count 612
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 462 transition count 612
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 97 place count 462 transition count 599
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 456 transition count 593
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 456 transition count 593
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 113 place count 456 transition count 589
Applied a total of 113 rules in 46 ms. Remains 456 /503 variables (removed 47) and now considering 589/655 (removed 66) transitions.
// Phase 1: matrix 589 rows 456 cols
[2022-05-15 13:41:33] [INFO ] Computed 12 place invariants in 11 ms
[2022-05-15 13:41:33] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 589 rows 456 cols
[2022-05-15 13:41:33] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:41:34] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
// Phase 1: matrix 589 rows 456 cols
[2022-05-15 13:41:34] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-15 13:41:35] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 456/503 places, 589/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 456/503 places, 589/655 transitions.
Stuttering acceptance computed with spot in 467 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), true, (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}, { cond=(AND p1 p0), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 6}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s79 1) (EQ s297 1) (EQ s433 1)), p0:(AND (EQ s20 1) (EQ s219 1) (EQ s372 1)), p1:(NEQ s368 1), p3:(EQ s447 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-01 finished in 1970 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(p1))))'
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 478 transition count 630
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 478 transition count 630
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 478 transition count 627
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 74 place count 457 transition count 606
Iterating global reduction 1 with 21 rules applied. Total rules applied 95 place count 457 transition count 606
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 109 place count 457 transition count 592
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 116 place count 450 transition count 585
Iterating global reduction 2 with 7 rules applied. Total rules applied 123 place count 450 transition count 585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 127 place count 450 transition count 581
Applied a total of 127 rules in 63 ms. Remains 450 /503 variables (removed 53) and now considering 581/655 (removed 74) transitions.
// Phase 1: matrix 581 rows 450 cols
[2022-05-15 13:41:35] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-15 13:41:36] [INFO ] Implicit Places using invariants in 469 ms returned []
// Phase 1: matrix 581 rows 450 cols
[2022-05-15 13:41:36] [INFO ] Computed 12 place invariants in 7 ms
[2022-05-15 13:41:36] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
// Phase 1: matrix 581 rows 450 cols
[2022-05-15 13:41:36] [INFO ] Computed 12 place invariants in 11 ms
[2022-05-15 13:41:37] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 450/503 places, 581/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 450/503 places, 581/655 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (EQ s160 1) (EQ s254 1) (EQ s400 1)), p1:(AND (EQ s160 1) (EQ s254 1) (EQ s400 1) (EQ s149 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-02 finished in 2183 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(p0)))||F(X(F(p1)))))'
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 479 transition count 631
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 479 transition count 631
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 479 transition count 627
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 460 transition count 608
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 460 transition count 608
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 103 place count 460 transition count 595
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 109 place count 454 transition count 589
Iterating global reduction 2 with 6 rules applied. Total rules applied 115 place count 454 transition count 589
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 454 transition count 586
Applied a total of 118 rules in 60 ms. Remains 454 /503 variables (removed 49) and now considering 586/655 (removed 69) transitions.
// Phase 1: matrix 586 rows 454 cols
[2022-05-15 13:41:37] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-15 13:41:38] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 586 rows 454 cols
[2022-05-15 13:41:38] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 13:41:38] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
// Phase 1: matrix 586 rows 454 cols
[2022-05-15 13:41:38] [INFO ] Computed 12 place invariants in 13 ms
[2022-05-15 13:41:39] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 454/503 places, 586/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 454/503 places, 586/655 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(EQ s156 1), p1:(EQ s394 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-04 finished in 1668 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(X((F(p0)||p1)))))))'
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Graph (trivial) has 467 edges and 503 vertex of which 61 / 503 are part of one of the 10 SCC in 2 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 451 transition count 551
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 400 transition count 551
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 103 place count 400 transition count 523
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 159 place count 372 transition count 523
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 204 place count 327 transition count 478
Iterating global reduction 2 with 45 rules applied. Total rules applied 249 place count 327 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 253 place count 327 transition count 474
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 253 place count 327 transition count 473
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 255 place count 326 transition count 473
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 268 place count 313 transition count 460
Iterating global reduction 3 with 13 rules applied. Total rules applied 281 place count 313 transition count 460
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 294 place count 313 transition count 447
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 414 place count 253 transition count 387
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 419 place count 248 transition count 382
Iterating global reduction 4 with 5 rules applied. Total rules applied 424 place count 248 transition count 382
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 429 place count 248 transition count 377
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 439 place count 248 transition count 367
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 441 place count 246 transition count 365
Applied a total of 441 rules in 270 ms. Remains 246 /503 variables (removed 257) and now considering 365/655 (removed 290) transitions.
[2022-05-15 13:41:39] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2022-05-15 13:41:39] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-15 13:41:39] [INFO ] Implicit Places using invariants in 281 ms returned []
[2022-05-15 13:41:39] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2022-05-15 13:41:39] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-15 13:41:40] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2022-05-15 13:41:40] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-15 13:41:40] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2022-05-15 13:41:40] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 13:41:40] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 246/503 places, 365/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 246/503 places, 365/655 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s155 0), p0:(EQ s12 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5986 reset in 700 ms.
Product exploration explored 100000 steps with 6005 reset in 592 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 615 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 597234 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 597234 steps, saw 120744 distinct states, run finished after 3002 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 13:41:45] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2022-05-15 13:41:45] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 13:41:46] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 13:41:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-05-15 13:41:46] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 13:41:46] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-15 13:41:46] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 246/246 places, 365/365 transitions.
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 246 transition count 346
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 28 place count 237 transition count 337
Iterating global reduction 1 with 9 rules applied. Total rules applied 37 place count 237 transition count 337
Free-agglomeration rule applied 182 times.
Iterating global reduction 1 with 182 rules applied. Total rules applied 219 place count 237 transition count 155
Discarding 40 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Remove reverse transitions (loop back) rule discarded transition t103.t526.t409 and 40 places that fell out of Prefix Of Interest.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (trivial) has 12 edges and 13 vertex of which 7 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 5 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 247 place count 8 transition count 17
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 256 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 256 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 258 place count 6 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 262 place count 4 transition count 6
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 264 place count 4 transition count 4
Applied a total of 264 rules in 67 ms. Remains 4 /246 variables (removed 242) and now considering 4/365 (removed 361) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/246 places, 4/365 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 523 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 365/365 transitions.
Applied a total of 0 rules in 27 ms. Remains 246 /246 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2022-05-15 13:41:47] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2022-05-15 13:41:47] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:41:47] [INFO ] Implicit Places using invariants in 201 ms returned []
[2022-05-15 13:41:47] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2022-05-15 13:41:47] [INFO ] Computed 12 place invariants in 12 ms
[2022-05-15 13:41:47] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2022-05-15 13:41:47] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-15 13:41:47] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2022-05-15 13:41:47] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 13:41:48] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 365/365 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 (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 614 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 509285 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 509285 steps, saw 105326 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 13:41:52] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2022-05-15 13:41:52] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 13:41:52] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 13:41:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-15 13:41:52] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 13:41:52] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-15 13:41:52] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 246/246 places, 365/365 transitions.
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 246 transition count 346
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 28 place count 237 transition count 337
Iterating global reduction 1 with 9 rules applied. Total rules applied 37 place count 237 transition count 337
Free-agglomeration rule applied 182 times.
Iterating global reduction 1 with 182 rules applied. Total rules applied 219 place count 237 transition count 155
Discarding 40 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Remove reverse transitions (loop back) rule discarded transition t103.t526.t409 and 40 places that fell out of Prefix Of Interest.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (trivial) has 12 edges and 13 vertex of which 7 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 5 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 247 place count 8 transition count 17
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 256 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 256 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 258 place count 6 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 262 place count 4 transition count 6
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 264 place count 4 transition count 4
Applied a total of 264 rules in 50 ms. Remains 4 /246 variables (removed 242) and now considering 4/365 (removed 361) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/246 places, 4/365 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 296 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5984 reset in 776 ms.
Product exploration explored 100000 steps with 6033 reset in 659 ms.
Built C files in :
/tmp/ltsmin14309230774307928051
[2022-05-15 13:41:54] [INFO ] Computing symmetric may disable matrix : 365 transitions.
[2022-05-15 13:41:54] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:41:54] [INFO ] Computing symmetric may enable matrix : 365 transitions.
[2022-05-15 13:41:54] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:41:54] [INFO ] Computing Do-Not-Accords matrix : 365 transitions.
[2022-05-15 13:41:54] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:41:54] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14309230774307928051
Running compilation step : cd /tmp/ltsmin14309230774307928051;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1683 ms.
Running link step : cd /tmp/ltsmin14309230774307928051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin14309230774307928051;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3913639550914039029.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 365/365 transitions.
Applied a total of 0 rules in 21 ms. Remains 246 /246 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2022-05-15 13:42:09] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2022-05-15 13:42:09] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 13:42:09] [INFO ] Implicit Places using invariants in 220 ms returned []
[2022-05-15 13:42:09] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2022-05-15 13:42:09] [INFO ] Computed 12 place invariants in 9 ms
[2022-05-15 13:42:10] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2022-05-15 13:42:10] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-15 13:42:10] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2022-05-15 13:42:10] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:42:10] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 365/365 transitions.
Built C files in :
/tmp/ltsmin10764241893966649935
[2022-05-15 13:42:11] [INFO ] Computing symmetric may disable matrix : 365 transitions.
[2022-05-15 13:42:11] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:42:11] [INFO ] Computing symmetric may enable matrix : 365 transitions.
[2022-05-15 13:42:11] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:42:11] [INFO ] Computing Do-Not-Accords matrix : 365 transitions.
[2022-05-15 13:42:11] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:42:11] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10764241893966649935
Running compilation step : cd /tmp/ltsmin10764241893966649935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1593 ms.
Running link step : cd /tmp/ltsmin10764241893966649935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10764241893966649935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7217361563490824611.hoa' '--buchi-type=spotba'
LTSmin run took 8213 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-05 finished in 41563 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(G(p0)) U ((G(p1)||p2) U p1)))'
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Graph (trivial) has 361 edges and 503 vertex of which 49 / 503 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 461 transition count 564
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 413 transition count 564
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 97 place count 413 transition count 532
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 161 place count 381 transition count 532
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 201 place count 341 transition count 492
Iterating global reduction 2 with 40 rules applied. Total rules applied 241 place count 341 transition count 492
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 245 place count 341 transition count 488
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 245 place count 341 transition count 487
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 340 transition count 487
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 260 place count 327 transition count 474
Iterating global reduction 3 with 13 rules applied. Total rules applied 273 place count 327 transition count 474
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 286 place count 327 transition count 461
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 420 place count 260 transition count 394
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 425 place count 255 transition count 389
Iterating global reduction 4 with 5 rules applied. Total rules applied 430 place count 255 transition count 389
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 435 place count 255 transition count 384
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 443 place count 251 transition count 407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 444 place count 250 transition count 406
Applied a total of 444 rules in 145 ms. Remains 250 /503 variables (removed 253) and now considering 406/655 (removed 249) transitions.
[2022-05-15 13:42:21] [INFO ] Flow matrix only has 382 transitions (discarded 24 similar events)
// Phase 1: matrix 382 rows 250 cols
[2022-05-15 13:42:21] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 13:42:21] [INFO ] Implicit Places using invariants in 215 ms returned []
[2022-05-15 13:42:21] [INFO ] Flow matrix only has 382 transitions (discarded 24 similar events)
// Phase 1: matrix 382 rows 250 cols
[2022-05-15 13:42:21] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:42:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 13:42:21] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
[2022-05-15 13:42:22] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-15 13:42:22] [INFO ] Flow matrix only has 382 transitions (discarded 24 similar events)
// Phase 1: matrix 382 rows 250 cols
[2022-05-15 13:42:22] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:42:22] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/503 places, 406/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/503 places, 406/655 transitions.
Stuttering acceptance computed with spot in 294 ms :[p1, true, p1, (AND p1 p0), p0, p0]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s176 1), p2:(AND (EQ s49 1) (EQ s247 1)), p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 5387 reset in 803 ms.
Product exploration explored 100000 steps with 5381 reset in 549 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 457 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 192 ms :[(AND p1 p0), (AND p1 p0), p0, p0]
Incomplete random walk after 10000 steps, including 558 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 13:42:25] [INFO ] Flow matrix only has 382 transitions (discarded 24 similar events)
// Phase 1: matrix 382 rows 250 cols
[2022-05-15 13:42:25] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-15 13:42:25] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2022-05-15 13:42:25] [INFO ] After 249ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-15 13:42:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 13:42:25] [INFO ] After 55ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 13:42:25] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 13:42:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2022-05-15 13:42:25] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 13:42:25] [INFO ] After 49ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 13:42:26] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-15 13:42:26] [INFO ] After 544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250/250 places, 406/406 transitions.
Graph (trivial) has 183 edges and 250 vertex of which 2 / 250 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 239 transition count 374
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 239 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 238 transition count 373
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 32 place count 238 transition count 364
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 238 transition count 348
Free-agglomeration rule applied 172 times.
Iterating global reduction 1 with 172 rules applied. Total rules applied 220 place count 238 transition count 176
Reduce places removed 173 places and 0 transitions.
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Graph (trivial) has 51 edges and 65 vertex of which 18 / 65 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 1 with 237 rules applied. Total rules applied 457 place count 56 transition count 113
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 475 place count 56 transition count 95
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 475 place count 56 transition count 85
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 495 place count 46 transition count 85
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 505 place count 46 transition count 75
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 4 with 22 rules applied. Total rules applied 527 place count 35 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 529 place count 34 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 531 place count 34 transition count 62
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 539 place count 34 transition count 54
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 548 place count 34 transition count 45
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 566 place count 25 transition count 36
Applied a total of 566 rules in 78 ms. Remains 25 /250 variables (removed 225) and now considering 36/406 (removed 370) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/250 places, 36/406 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 591 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND p1 p0), (AND p1 p0), p0, p0]
Stuttering acceptance computed with spot in 159 ms :[(AND p1 p0), (AND p1 p0), p0, p0]
Support contains 2 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 406/406 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2022-05-15 13:42:27] [INFO ] Flow matrix only has 382 transitions (discarded 24 similar events)
// Phase 1: matrix 382 rows 250 cols
[2022-05-15 13:42:27] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 13:42:27] [INFO ] Implicit Places using invariants in 363 ms returned []
[2022-05-15 13:42:27] [INFO ] Flow matrix only has 382 transitions (discarded 24 similar events)
// Phase 1: matrix 382 rows 250 cols
[2022-05-15 13:42:27] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:42:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 13:42:28] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2022-05-15 13:42:28] [INFO ] Flow matrix only has 382 transitions (discarded 24 similar events)
// Phase 1: matrix 382 rows 250 cols
[2022-05-15 13:42:28] [INFO ] Computed 12 place invariants in 9 ms
[2022-05-15 13:42:28] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 406/406 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 390 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 196 ms :[(AND p1 p0), (AND p1 p0), p0, p0]
Incomplete random walk after 10000 steps, including 554 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 13:42:29] [INFO ] Flow matrix only has 382 transitions (discarded 24 similar events)
// Phase 1: matrix 382 rows 250 cols
[2022-05-15 13:42:29] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:42:29] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2022-05-15 13:42:29] [INFO ] After 279ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-15 13:42:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 13:42:29] [INFO ] After 57ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 13:42:29] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 13:42:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2022-05-15 13:42:30] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 13:42:30] [INFO ] After 53ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 13:42:30] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-05-15 13:42:30] [INFO ] After 573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250/250 places, 406/406 transitions.
Graph (trivial) has 183 edges and 250 vertex of which 2 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 239 transition count 374
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 239 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 238 transition count 373
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 32 place count 238 transition count 364
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 238 transition count 348
Free-agglomeration rule applied 172 times.
Iterating global reduction 1 with 172 rules applied. Total rules applied 220 place count 238 transition count 176
Reduce places removed 173 places and 0 transitions.
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Graph (trivial) has 51 edges and 65 vertex of which 18 / 65 are part of one of the 9 SCC in 1 ms
Free SCC test removed 9 places
Iterating post reduction 1 with 237 rules applied. Total rules applied 457 place count 56 transition count 113
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 475 place count 56 transition count 95
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 475 place count 56 transition count 85
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 495 place count 46 transition count 85
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 505 place count 46 transition count 75
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 4 with 22 rules applied. Total rules applied 527 place count 35 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 529 place count 34 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 531 place count 34 transition count 62
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 539 place count 34 transition count 54
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 548 place count 34 transition count 45
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 566 place count 25 transition count 36
Applied a total of 566 rules in 66 ms. Remains 25 /250 variables (removed 225) and now considering 36/406 (removed 370) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/250 places, 36/406 transitions.
Finished random walk after 130 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 479 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 200 ms :[(AND p1 p0), (AND p1 p0), p0, p0]
Stuttering acceptance computed with spot in 200 ms :[(AND p1 p0), (AND p1 p0), p0, p0]
Stuttering acceptance computed with spot in 166 ms :[(AND p1 p0), (AND p1 p0), p0, p0]
Product exploration explored 100000 steps with 5384 reset in 475 ms.
Product exploration explored 100000 steps with 5366 reset in 575 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 197 ms :[(AND p1 p0), (AND p1 p0), p0, p0]
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 406/406 transitions.
Graph (trivial) has 183 edges and 250 vertex of which 2 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 249 transition count 391
Applied a total of 15 rules in 39 ms. Remains 249 /250 variables (removed 1) and now considering 391/406 (removed 15) transitions.
[2022-05-15 13:42:33] [INFO ] Redundant transitions in 25 ms returned []
[2022-05-15 13:42:33] [INFO ] Flow matrix only has 365 transitions (discarded 26 similar events)
// Phase 1: matrix 365 rows 249 cols
[2022-05-15 13:42:33] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:42:33] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 249/250 places, 391/406 transitions.
Finished structural reductions, in 1 iterations. Remains : 249/250 places, 391/406 transitions.
Product exploration explored 100000 steps with 5644 reset in 1169 ms.
Product exploration explored 100000 steps with 5626 reset in 995 ms.
Built C files in :
/tmp/ltsmin6778523205076994155
[2022-05-15 13:42:35] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6778523205076994155
Running compilation step : cd /tmp/ltsmin6778523205076994155;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1200 ms.
Running link step : cd /tmp/ltsmin6778523205076994155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6778523205076994155;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18223070091061504112.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 406/406 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2022-05-15 13:42:50] [INFO ] Flow matrix only has 382 transitions (discarded 24 similar events)
// Phase 1: matrix 382 rows 250 cols
[2022-05-15 13:42:50] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 13:42:51] [INFO ] Implicit Places using invariants in 223 ms returned []
[2022-05-15 13:42:51] [INFO ] Flow matrix only has 382 transitions (discarded 24 similar events)
// Phase 1: matrix 382 rows 250 cols
[2022-05-15 13:42:51] [INFO ] Computed 12 place invariants in 11 ms
[2022-05-15 13:42:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 13:42:51] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2022-05-15 13:42:51] [INFO ] Flow matrix only has 382 transitions (discarded 24 similar events)
// Phase 1: matrix 382 rows 250 cols
[2022-05-15 13:42:51] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-15 13:42:52] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 406/406 transitions.
Built C files in :
/tmp/ltsmin8268708565733504284
[2022-05-15 13:42:52] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8268708565733504284
Running compilation step : cd /tmp/ltsmin8268708565733504284;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1120 ms.
Running link step : cd /tmp/ltsmin8268708565733504284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8268708565733504284;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased607657842853397906.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 13:43:07] [INFO ] Flatten gal took : 43 ms
[2022-05-15 13:43:07] [INFO ] Flatten gal took : 39 ms
[2022-05-15 13:43:07] [INFO ] Time to serialize gal into /tmp/LTL13645068137992835880.gal : 7 ms
[2022-05-15 13:43:07] [INFO ] Time to serialize properties into /tmp/LTL2458412671205877565.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13645068137992835880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2458412671205877565.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1364506...267
Read 1 LTL properties
Checking formula 0 : !((!((F(G("(p101==1)")))U(((G("(p1035==1)"))||("((p301==1)&&(p1387==1))"))U("(p1035==1)")))))
Formula 0 simplified : FG"(p101==1)" U (("((p301==1)&&(p1387==1))" | G"(p1035==1)") U "(p1035==1)")
Detected timeout of ITS tools.
[2022-05-15 13:43:22] [INFO ] Flatten gal took : 54 ms
[2022-05-15 13:43:22] [INFO ] Applying decomposition
[2022-05-15 13:43:22] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8635278796652851713.txt' '-o' '/tmp/graph8635278796652851713.bin' '-w' '/tmp/graph8635278796652851713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8635278796652851713.bin' '-l' '-1' '-v' '-w' '/tmp/graph8635278796652851713.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:43:22] [INFO ] Decomposing Gal with order
[2022-05-15 13:43:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:43:23] [INFO ] Removed a total of 244 redundant transitions.
[2022-05-15 13:43:23] [INFO ] Flatten gal took : 229 ms
[2022-05-15 13:43:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 19 ms.
[2022-05-15 13:43:23] [INFO ] Time to serialize gal into /tmp/LTL16377602890379993067.gal : 13 ms
[2022-05-15 13:43:23] [INFO ] Time to serialize properties into /tmp/LTL12223168530489632008.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16377602890379993067.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12223168530489632008.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1637760...247
Read 1 LTL properties
Checking formula 0 : !((!((F(G("(u1.p101==1)")))U(((G("(u28.p1035==1)"))||("((u6.p301==1)&&(u29.p1387==1))"))U("(u28.p1035==1)")))))
Formula 0 simplified : FG"(u1.p101==1)" U (("((u6.p301==1)&&(u29.p1387==1))" | G"(u28.p1035==1)") U "(u28.p1035==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4362363924524407543
[2022-05-15 13:43:38] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4362363924524407543
Running compilation step : cd /tmp/ltsmin4362363924524407543;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 960 ms.
Running link step : cd /tmp/ltsmin4362363924524407543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4362363924524407543;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(<>([]((LTLAPp0==true))) U (([]((LTLAPp1==true))||(LTLAPp2==true)) U (LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-06 finished in 92559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(F(p0))) U G((X((p1 U p2))||p1)))))'
Support contains 3 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 479 transition count 631
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 479 transition count 631
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 479 transition count 627
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 460 transition count 608
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 460 transition count 608
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 102 place count 460 transition count 596
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 109 place count 453 transition count 589
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 453 transition count 589
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 120 place count 453 transition count 585
Applied a total of 120 rules in 66 ms. Remains 453 /503 variables (removed 50) and now considering 585/655 (removed 70) transitions.
// Phase 1: matrix 585 rows 453 cols
[2022-05-15 13:43:53] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 13:43:53] [INFO ] Implicit Places using invariants in 318 ms returned []
// Phase 1: matrix 585 rows 453 cols
[2022-05-15 13:43:53] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-15 13:43:54] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
// Phase 1: matrix 585 rows 453 cols
[2022-05-15 13:43:54] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-15 13:43:55] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 453/503 places, 585/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 453/503 places, 585/655 transitions.
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s414 1), p0:(EQ s41 1), p2:(EQ s295 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 263 steps with 3 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-07 finished in 2218 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 478 transition count 630
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 478 transition count 630
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 478 transition count 626
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 74 place count 458 transition count 606
Iterating global reduction 1 with 20 rules applied. Total rules applied 94 place count 458 transition count 606
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 107 place count 458 transition count 593
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 114 place count 451 transition count 586
Iterating global reduction 2 with 7 rules applied. Total rules applied 121 place count 451 transition count 586
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 125 place count 451 transition count 582
Applied a total of 125 rules in 48 ms. Remains 451 /503 variables (removed 52) and now considering 582/655 (removed 73) transitions.
// Phase 1: matrix 582 rows 451 cols
[2022-05-15 13:43:55] [INFO ] Computed 12 place invariants in 14 ms
[2022-05-15 13:43:56] [INFO ] Implicit Places using invariants in 597 ms returned []
// Phase 1: matrix 582 rows 451 cols
[2022-05-15 13:43:56] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 13:43:57] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
// Phase 1: matrix 582 rows 451 cols
[2022-05-15 13:43:57] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 13:43:57] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 451/503 places, 582/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 451/503 places, 582/655 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-09 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 s119 1), p0:(AND (EQ s119 1) (EQ s221 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 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-09 finished in 2261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Graph (trivial) has 467 edges and 503 vertex of which 61 / 503 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 451 transition count 552
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 401 transition count 552
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 101 place count 401 transition count 525
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 155 place count 374 transition count 525
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 197 place count 332 transition count 483
Iterating global reduction 2 with 42 rules applied. Total rules applied 239 place count 332 transition count 483
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 243 place count 332 transition count 479
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 243 place count 332 transition count 478
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 331 transition count 478
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 257 place count 319 transition count 466
Iterating global reduction 3 with 12 rules applied. Total rules applied 269 place count 319 transition count 466
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 280 place count 319 transition count 455
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 404 place count 257 transition count 393
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 408 place count 253 transition count 389
Iterating global reduction 4 with 4 rules applied. Total rules applied 412 place count 253 transition count 389
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 416 place count 253 transition count 385
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 426 place count 253 transition count 375
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 428 place count 251 transition count 373
Applied a total of 428 rules in 117 ms. Remains 251 /503 variables (removed 252) and now considering 373/655 (removed 282) transitions.
[2022-05-15 13:43:58] [INFO ] Flow matrix only has 354 transitions (discarded 19 similar events)
// Phase 1: matrix 354 rows 251 cols
[2022-05-15 13:43:58] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 13:43:58] [INFO ] Implicit Places using invariants in 376 ms returned []
[2022-05-15 13:43:58] [INFO ] Flow matrix only has 354 transitions (discarded 19 similar events)
// Phase 1: matrix 354 rows 251 cols
[2022-05-15 13:43:58] [INFO ] Computed 12 place invariants in 15 ms
[2022-05-15 13:43:58] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
[2022-05-15 13:43:59] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-15 13:43:59] [INFO ] Flow matrix only has 354 transitions (discarded 19 similar events)
// Phase 1: matrix 354 rows 251 cols
[2022-05-15 13:43:59] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:43:59] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/503 places, 373/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 251/503 places, 373/655 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s83 0) (EQ s238 0) (EQ s72 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-10 finished in 1538 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||p1)))'
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 478 transition count 630
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 478 transition count 630
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 478 transition count 626
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 74 place count 458 transition count 606
Iterating global reduction 1 with 20 rules applied. Total rules applied 94 place count 458 transition count 606
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 108 place count 458 transition count 592
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 114 place count 452 transition count 586
Iterating global reduction 2 with 6 rules applied. Total rules applied 120 place count 452 transition count 586
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 123 place count 452 transition count 583
Applied a total of 123 rules in 47 ms. Remains 452 /503 variables (removed 51) and now considering 583/655 (removed 72) transitions.
// Phase 1: matrix 583 rows 452 cols
[2022-05-15 13:43:59] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-15 13:43:59] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 583 rows 452 cols
[2022-05-15 13:43:59] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-15 13:44:00] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
// Phase 1: matrix 583 rows 452 cols
[2022-05-15 13:44:00] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:44:01] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 452/503 places, 583/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 452/503 places, 583/655 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(EQ s189 0), p0:(EQ s446 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 977 ms.
Product exploration explored 100000 steps with 50000 reset in 658 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-11 finished in 3929 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 478 transition count 630
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 478 transition count 630
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 478 transition count 626
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 74 place count 458 transition count 606
Iterating global reduction 1 with 20 rules applied. Total rules applied 94 place count 458 transition count 606
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 108 place count 458 transition count 592
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 114 place count 452 transition count 586
Iterating global reduction 2 with 6 rules applied. Total rules applied 120 place count 452 transition count 586
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 123 place count 452 transition count 583
Applied a total of 123 rules in 28 ms. Remains 452 /503 variables (removed 51) and now considering 583/655 (removed 72) transitions.
// Phase 1: matrix 583 rows 452 cols
[2022-05-15 13:44:03] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:44:03] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 583 rows 452 cols
[2022-05-15 13:44:03] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:44:04] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
// Phase 1: matrix 583 rows 452 cols
[2022-05-15 13:44:04] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:44:05] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 452/503 places, 583/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 452/503 places, 583/655 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s85 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-12 finished in 2020 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))&&G(X(X(F((G(F(p1))||p1))))))))'
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 479 transition count 631
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 479 transition count 631
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 479 transition count 627
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 460 transition count 608
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 460 transition count 608
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 102 place count 460 transition count 596
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 109 place count 453 transition count 589
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 453 transition count 589
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 120 place count 453 transition count 585
Applied a total of 120 rules in 53 ms. Remains 453 /503 variables (removed 50) and now considering 585/655 (removed 70) transitions.
// Phase 1: matrix 585 rows 453 cols
[2022-05-15 13:44:05] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:44:05] [INFO ] Implicit Places using invariants in 435 ms returned []
// Phase 1: matrix 585 rows 453 cols
[2022-05-15 13:44:05] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-15 13:44:06] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
// Phase 1: matrix 585 rows 453 cols
[2022-05-15 13:44:06] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:44:07] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 453/503 places, 585/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 453/503 places, 585/655 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-14 automaton TGBA Formula[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: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s156 1), p1:(EQ s84 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 FlexibleBarrier-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-14 finished in 2279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((X(X(p1))&&p0)))))'
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 655/655 transitions.
Graph (trivial) has 467 edges and 503 vertex of which 61 / 503 are part of one of the 10 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 451 transition count 551
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 400 transition count 551
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 103 place count 400 transition count 523
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 159 place count 372 transition count 523
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 203 place count 328 transition count 479
Iterating global reduction 2 with 44 rules applied. Total rules applied 247 place count 328 transition count 479
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 251 place count 328 transition count 475
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 251 place count 328 transition count 474
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 327 transition count 474
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 264 place count 316 transition count 463
Iterating global reduction 3 with 11 rules applied. Total rules applied 275 place count 316 transition count 463
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 286 place count 316 transition count 452
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 410 place count 254 transition count 390
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 415 place count 249 transition count 385
Iterating global reduction 4 with 5 rules applied. Total rules applied 420 place count 249 transition count 385
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 425 place count 249 transition count 380
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 435 place count 249 transition count 370
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 437 place count 247 transition count 368
Applied a total of 437 rules in 112 ms. Remains 247 /503 variables (removed 256) and now considering 368/655 (removed 287) transitions.
[2022-05-15 13:44:07] [INFO ] Flow matrix only has 349 transitions (discarded 19 similar events)
// Phase 1: matrix 349 rows 247 cols
[2022-05-15 13:44:07] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:44:08] [INFO ] Implicit Places using invariants in 460 ms returned []
[2022-05-15 13:44:08] [INFO ] Flow matrix only has 349 transitions (discarded 19 similar events)
// Phase 1: matrix 349 rows 247 cols
[2022-05-15 13:44:08] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 13:44:08] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2022-05-15 13:44:08] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-15 13:44:08] [INFO ] Flow matrix only has 349 transitions (discarded 19 similar events)
// Phase 1: matrix 349 rows 247 cols
[2022-05-15 13:44:08] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:44:09] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/503 places, 368/655 transitions.
Finished structural reductions, in 1 iterations. Remains : 247/503 places, 368/655 transitions.
Stuttering acceptance computed with spot in 59 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s128 1) (EQ s154 1) (EQ s243 1)), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-15 finished in 1777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(G(p0)) U ((G(p1)||p2) U p1)))'
[2022-05-15 13:44:09] [INFO ] Flatten gal took : 61 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2358672638041761540
[2022-05-15 13:44:09] [INFO ] Computing symmetric may disable matrix : 655 transitions.
[2022-05-15 13:44:09] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:44:09] [INFO ] Computing symmetric may enable matrix : 655 transitions.
[2022-05-15 13:44:09] [INFO ] Applying decomposition
[2022-05-15 13:44:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:44:09] [INFO ] Flatten gal took : 52 ms
[2022-05-15 13:44:09] [INFO ] Computing Do-Not-Accords matrix : 655 transitions.
[2022-05-15 13:44:09] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12057142656118994536.txt' '-o' '/tmp/graph12057142656118994536.bin' '-w' '/tmp/graph12057142656118994536.weights'
[2022-05-15 13:44:09] [INFO ] Built C files in 216ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2358672638041761540
Running compilation step : cd /tmp/ltsmin2358672638041761540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12057142656118994536.bin' '-l' '-1' '-v' '-w' '/tmp/graph12057142656118994536.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:44:10] [INFO ] Decomposing Gal with order
[2022-05-15 13:44:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:44:10] [INFO ] Removed a total of 247 redundant transitions.
[2022-05-15 13:44:10] [INFO ] Flatten gal took : 189 ms
[2022-05-15 13:44:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 34 ms.
[2022-05-15 13:44:10] [INFO ] Time to serialize gal into /tmp/LTLFireability938281674236540628.gal : 18 ms
[2022-05-15 13:44:10] [INFO ] Time to serialize properties into /tmp/LTLFireability4989094051925664952.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability938281674236540628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4989094051925664952.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...266
Read 1 LTL properties
Checking formula 0 : !((!((F(G("(i2.u13.p101==1)")))U(((G("(i8.u117.p1035==1)"))||("((i5.u36.p301==1)&&(i17.u119.p1387==1))"))U("(i8.u117.p1035==1)")))))
Formula 0 simplified : FG"(i2.u13.p101==1)" U (("((i5.u36.p301==1)&&(i17.u119.p1387==1))" | G"(i8.u117.p1035==1)") U "(i8.u117.p1035==1)")
Compilation finished in 2513 ms.
Running link step : cd /tmp/ltsmin2358672638041761540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin2358672638041761540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '!(<>([]((LTLAPp0==true))) U (([]((LTLAPp1==true))||(LTLAPp2==true)) U (LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 6481 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 184079 ms.

BK_STOP 1652622259163

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-10b"
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-10b, 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 r096-smll-165260575700060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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