Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 726K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716496029014

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 20:27:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 20:27:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:27:10] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-05-23 20:27:10] [INFO ] Transformed 2678 places.
[2024-05-23 20:27:10] [INFO ] Transformed 3085 transitions.
[2024-05-23 20:27:10] [INFO ] Found NUPN structural information;
[2024-05-23 20:27:10] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 2678 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Discarding 1074 places :
Symmetric choice reduction at 0 with 1074 rule applications. Total rules 1074 place count 1604 transition count 2011
Iterating global reduction 0 with 1074 rules applied. Total rules applied 2148 place count 1604 transition count 2011
Discarding 500 places :
Symmetric choice reduction at 0 with 500 rule applications. Total rules 2648 place count 1104 transition count 1511
Iterating global reduction 0 with 500 rules applied. Total rules applied 3148 place count 1104 transition count 1511
Discarding 314 places :
Symmetric choice reduction at 0 with 314 rule applications. Total rules 3462 place count 790 transition count 1197
Iterating global reduction 0 with 314 rules applied. Total rules applied 3776 place count 790 transition count 1197
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 0 with 149 rules applied. Total rules applied 3925 place count 790 transition count 1048
Applied a total of 3925 rules in 415 ms. Remains 790 /2678 variables (removed 1888) and now considering 1048/3085 (removed 2037) transitions.
// Phase 1: matrix 1048 rows 790 cols
[2024-05-23 20:27:11] [INFO ] Computed 16 invariants in 36 ms
[2024-05-23 20:27:11] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-23 20:27:11] [INFO ] Invariant cache hit.
[2024-05-23 20:27:12] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2024-05-23 20:27:12] [INFO ] Invariant cache hit.
[2024-05-23 20:27:12] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/2678 places, 1048/3085 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1841 ms. Remains : 790/2678 places, 1048/3085 transitions.
Support contains 44 out of 790 places after structural reductions.
[2024-05-23 20:27:13] [INFO ] Flatten gal took : 88 ms
[2024-05-23 20:27:13] [INFO ] Flatten gal took : 49 ms
[2024-05-23 20:27:13] [INFO ] Input system was already deterministic with 1048 transitions.
Support contains 41 out of 790 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 100 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 29) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2024-05-23 20:27:13] [INFO ] Invariant cache hit.
[2024-05-23 20:27:14] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2024-05-23 20:27:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-23 20:27:15] [INFO ] After 980ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2024-05-23 20:27:16] [INFO ] Deduced a trap composed of 225 places in 213 ms of which 5 ms to minimize.
[2024-05-23 20:27:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2024-05-23 20:27:16] [INFO ] Deduced a trap composed of 220 places in 226 ms of which 1 ms to minimize.
[2024-05-23 20:27:17] [INFO ] Deduced a trap composed of 224 places in 182 ms of which 1 ms to minimize.
[2024-05-23 20:27:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 510 ms
[2024-05-23 20:27:17] [INFO ] Deduced a trap composed of 251 places in 167 ms of which 2 ms to minimize.
[2024-05-23 20:27:18] [INFO ] Deduced a trap composed of 222 places in 161 ms of which 0 ms to minimize.
[2024-05-23 20:27:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2024-05-23 20:27:18] [INFO ] After 3382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 738 ms.
[2024-05-23 20:27:19] [INFO ] After 4780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 20 properties in 142 ms.
Support contains 3 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 740 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 8 ms
Free SCC test removed 71 places
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 719 transition count 889
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 646 transition count 889
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 147 place count 646 transition count 854
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 217 place count 611 transition count 854
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 266 place count 562 transition count 805
Iterating global reduction 2 with 49 rules applied. Total rules applied 315 place count 562 transition count 805
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 320 place count 562 transition count 800
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 330 place count 552 transition count 790
Iterating global reduction 3 with 10 rules applied. Total rules applied 340 place count 552 transition count 790
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 350 place count 552 transition count 780
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 526 place count 464 transition count 692
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 554 place count 464 transition count 664
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 573 place count 445 transition count 645
Iterating global reduction 5 with 19 rules applied. Total rules applied 592 place count 445 transition count 645
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 597 place count 445 transition count 640
Free-agglomeration rule applied 366 times.
Iterating global reduction 6 with 366 rules applied. Total rules applied 963 place count 445 transition count 274
Reduce places removed 366 places and 0 transitions.
Drop transitions removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Graph (complete) has 213 edges and 79 vertex of which 34 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 533 rules applied. Total rules applied 1496 place count 34 transition count 108
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 7 with 63 rules applied. Total rules applied 1559 place count 34 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1560 place count 33 transition count 44
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 25 edges and 32 vertex of which 10 / 32 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 1562 place count 27 transition count 44
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1572 place count 27 transition count 34
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 5 Pre rules applied. Total rules applied 1572 place count 27 transition count 29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1582 place count 22 transition count 29
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1587 place count 22 transition count 24
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1597 place count 17 transition count 19
Free-agglomeration rule applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1602 place count 17 transition count 14
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 1617 place count 7 transition count 9
Free-agglomeration rule applied 3 times.
Iterating global reduction 12 with 3 rules applied. Total rules applied 1620 place count 7 transition count 6
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1623 place count 4 transition count 6
Applied a total of 1623 rules in 263 ms. Remains 4 /790 variables (removed 786) and now considering 6/1048 (removed 1042) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 4/790 places, 6/1048 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 744 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 718 transition count 896
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 639 transition count 896
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 159 place count 639 transition count 864
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 223 place count 607 transition count 864
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 273 place count 557 transition count 814
Iterating global reduction 2 with 50 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 557 transition count 808
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 330 place count 556 transition count 808
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 340 place count 546 transition count 798
Iterating global reduction 3 with 10 rules applied. Total rules applied 350 place count 546 transition count 798
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 360 place count 546 transition count 788
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 530 place count 461 transition count 703
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 534 place count 457 transition count 699
Iterating global reduction 4 with 4 rules applied. Total rules applied 538 place count 457 transition count 699
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 542 place count 457 transition count 695
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 556 place count 457 transition count 681
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 557 place count 456 transition count 680
Applied a total of 557 rules in 268 ms. Remains 456 /790 variables (removed 334) and now considering 680/1048 (removed 368) transitions.
[2024-05-23 20:27:20] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
// Phase 1: matrix 653 rows 456 cols
[2024-05-23 20:27:20] [INFO ] Computed 16 invariants in 13 ms
[2024-05-23 20:27:20] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-23 20:27:20] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-23 20:27:20] [INFO ] Invariant cache hit.
[2024-05-23 20:27:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:27:20] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2024-05-23 20:27:20] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-23 20:27:20] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-23 20:27:20] [INFO ] Invariant cache hit.
[2024-05-23 20:27:21] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 456/790 places, 680/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1213 ms. Remains : 456/790 places, 680/1048 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s263 1), p1:(AND (NEQ s126 1) (EQ s126 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 55943 steps with 2473 reset in 456 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-00 finished in 1894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 744 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 718 transition count 898
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 641 transition count 898
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 155 place count 641 transition count 865
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 221 place count 608 transition count 865
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 272 place count 557 transition count 814
Iterating global reduction 2 with 51 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 338 place count 547 transition count 799
Iterating global reduction 3 with 10 rules applied. Total rules applied 348 place count 547 transition count 799
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 358 place count 547 transition count 789
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 530 place count 461 transition count 703
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 535 place count 456 transition count 698
Iterating global reduction 4 with 5 rules applied. Total rules applied 540 place count 456 transition count 698
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 545 place count 456 transition count 693
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 559 place count 456 transition count 679
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 561 place count 454 transition count 677
Applied a total of 561 rules in 207 ms. Remains 454 /790 variables (removed 336) and now considering 677/1048 (removed 371) transitions.
[2024-05-23 20:27:21] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
// Phase 1: matrix 650 rows 454 cols
[2024-05-23 20:27:21] [INFO ] Computed 16 invariants in 11 ms
[2024-05-23 20:27:22] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-23 20:27:22] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
[2024-05-23 20:27:22] [INFO ] Invariant cache hit.
[2024-05-23 20:27:22] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2024-05-23 20:27:22] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-23 20:27:22] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
[2024-05-23 20:27:22] [INFO ] Invariant cache hit.
[2024-05-23 20:27:22] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 454/790 places, 677/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1002 ms. Remains : 454/790 places, 677/1048 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s378 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-14b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-01 finished in 1162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 738 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 718 transition count 897
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 640 transition count 897
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 157 place count 640 transition count 866
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 219 place count 609 transition count 866
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 270 place count 558 transition count 815
Iterating global reduction 2 with 51 rules applied. Total rules applied 321 place count 558 transition count 815
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 325 place count 558 transition count 811
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 325 place count 558 transition count 810
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 327 place count 557 transition count 810
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 337 place count 547 transition count 800
Iterating global reduction 3 with 10 rules applied. Total rules applied 347 place count 547 transition count 800
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 357 place count 547 transition count 790
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 523 place count 464 transition count 707
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 528 place count 459 transition count 702
Iterating global reduction 4 with 5 rules applied. Total rules applied 533 place count 459 transition count 702
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 538 place count 459 transition count 697
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 552 place count 459 transition count 683
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 554 place count 459 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 556 place count 457 transition count 681
Applied a total of 556 rules in 197 ms. Remains 457 /790 variables (removed 333) and now considering 681/1048 (removed 367) transitions.
[2024-05-23 20:27:23] [INFO ] Flow matrix only has 656 transitions (discarded 25 similar events)
// Phase 1: matrix 656 rows 457 cols
[2024-05-23 20:27:23] [INFO ] Computed 16 invariants in 16 ms
[2024-05-23 20:27:23] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-23 20:27:23] [INFO ] Flow matrix only has 656 transitions (discarded 25 similar events)
[2024-05-23 20:27:23] [INFO ] Invariant cache hit.
[2024-05-23 20:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:27:23] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-05-23 20:27:23] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-23 20:27:23] [INFO ] Flow matrix only has 656 transitions (discarded 25 similar events)
[2024-05-23 20:27:23] [INFO ] Invariant cache hit.
[2024-05-23 20:27:23] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 457/790 places, 681/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1029 ms. Remains : 457/790 places, 681/1048 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s275 1) (AND (EQ s58 1) (EQ s62 1) (EQ s323 1) (EQ s216 1) (EQ s456 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 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-02 finished in 1094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0&&X(p1)) U G(p2)) U !p1))'
Support contains 3 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 741 edges and 790 vertex of which 79 / 790 are part of one of the 13 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 723 transition count 901
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 644 transition count 901
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 159 place count 644 transition count 868
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 225 place count 611 transition count 868
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 273 place count 563 transition count 820
Iterating global reduction 2 with 48 rules applied. Total rules applied 321 place count 563 transition count 820
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 326 place count 563 transition count 815
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 326 place count 563 transition count 814
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 328 place count 562 transition count 814
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 338 place count 552 transition count 804
Iterating global reduction 3 with 10 rules applied. Total rules applied 348 place count 552 transition count 804
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 358 place count 552 transition count 794
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 534 place count 464 transition count 706
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 537 place count 461 transition count 703
Iterating global reduction 4 with 3 rules applied. Total rules applied 540 place count 461 transition count 703
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 543 place count 461 transition count 700
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 5 with 2 rules applied. Total rules applied 545 place count 460 transition count 700
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 560 place count 460 transition count 685
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 562 place count 458 transition count 683
Applied a total of 562 rules in 159 ms. Remains 458 /790 variables (removed 332) and now considering 683/1048 (removed 365) transitions.
[2024-05-23 20:27:24] [INFO ] Flow matrix only has 657 transitions (discarded 26 similar events)
// Phase 1: matrix 657 rows 458 cols
[2024-05-23 20:27:24] [INFO ] Computed 16 invariants in 12 ms
[2024-05-23 20:27:24] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-23 20:27:24] [INFO ] Flow matrix only has 657 transitions (discarded 26 similar events)
[2024-05-23 20:27:24] [INFO ] Invariant cache hit.
[2024-05-23 20:27:24] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-05-23 20:27:24] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:27:24] [INFO ] Flow matrix only has 657 transitions (discarded 26 similar events)
[2024-05-23 20:27:24] [INFO ] Invariant cache hit.
[2024-05-23 20:27:24] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 458/790 places, 683/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 972 ms. Remains : 458/790 places, 683/1048 transitions.
Stuttering acceptance computed with spot in 192 ms :[p1, true, true, (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2 p0), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s111 1), p2:(EQ s225 1), p0:(NEQ s152 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-03 finished in 1189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p0&&X(F((p1||G(p2)))))||G(F((p1||G(p2))))))))'
Support contains 5 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 765 transition count 1023
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 765 transition count 1023
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 765 transition count 1019
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 72 place count 747 transition count 1001
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 747 transition count 1001
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 101 place count 747 transition count 990
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 108 place count 740 transition count 983
Iterating global reduction 2 with 7 rules applied. Total rules applied 115 place count 740 transition count 983
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 740 transition count 980
Applied a total of 118 rules in 86 ms. Remains 740 /790 variables (removed 50) and now considering 980/1048 (removed 68) transitions.
// Phase 1: matrix 980 rows 740 cols
[2024-05-23 20:27:25] [INFO ] Computed 16 invariants in 15 ms
[2024-05-23 20:27:25] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-23 20:27:25] [INFO ] Invariant cache hit.
[2024-05-23 20:27:25] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2024-05-23 20:27:25] [INFO ] Invariant cache hit.
[2024-05-23 20:27:26] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 740/790 places, 980/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1180 ms. Remains : 740/790 places, 980/1048 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s262 1) (EQ s444 1) (EQ s646 1)), p1:(NEQ s382 1), p2:(NEQ s326 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 454 ms.
Product exploration explored 100000 steps with 33333 reset in 465 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-14b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-04 finished in 2395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 744 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 718 transition count 898
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 641 transition count 898
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 155 place count 641 transition count 865
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 221 place count 608 transition count 865
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 272 place count 557 transition count 814
Iterating global reduction 2 with 51 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 338 place count 547 transition count 799
Iterating global reduction 3 with 10 rules applied. Total rules applied 348 place count 547 transition count 799
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 358 place count 547 transition count 789
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 530 place count 461 transition count 703
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 535 place count 456 transition count 698
Iterating global reduction 4 with 5 rules applied. Total rules applied 540 place count 456 transition count 698
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 545 place count 456 transition count 693
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 559 place count 456 transition count 679
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 561 place count 454 transition count 677
Applied a total of 561 rules in 134 ms. Remains 454 /790 variables (removed 336) and now considering 677/1048 (removed 371) transitions.
[2024-05-23 20:27:27] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
// Phase 1: matrix 650 rows 454 cols
[2024-05-23 20:27:27] [INFO ] Computed 16 invariants in 15 ms
[2024-05-23 20:27:27] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-23 20:27:27] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
[2024-05-23 20:27:27] [INFO ] Invariant cache hit.
[2024-05-23 20:27:28] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-05-23 20:27:28] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-23 20:27:28] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
[2024-05-23 20:27:28] [INFO ] Invariant cache hit.
[2024-05-23 20:27:28] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 454/790 places, 677/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 951 ms. Remains : 454/790 places, 677/1048 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s299 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 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-05 finished in 1012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&F(G(p0))))))))'
Support contains 1 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 764 transition count 1022
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 764 transition count 1022
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 764 transition count 1017
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 75 place count 746 transition count 999
Iterating global reduction 1 with 18 rules applied. Total rules applied 93 place count 746 transition count 999
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 105 place count 746 transition count 987
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 740 transition count 981
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 740 transition count 981
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 740 transition count 978
Applied a total of 120 rules in 70 ms. Remains 740 /790 variables (removed 50) and now considering 978/1048 (removed 70) transitions.
// Phase 1: matrix 978 rows 740 cols
[2024-05-23 20:27:28] [INFO ] Computed 16 invariants in 17 ms
[2024-05-23 20:27:28] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-23 20:27:28] [INFO ] Invariant cache hit.
[2024-05-23 20:27:29] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2024-05-23 20:27:29] [INFO ] Invariant cache hit.
[2024-05-23 20:27:29] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 740/790 places, 978/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1174 ms. Remains : 740/790 places, 978/1048 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s591 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-06 finished in 1357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 764 transition count 1022
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 764 transition count 1022
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 764 transition count 1017
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 75 place count 746 transition count 999
Iterating global reduction 1 with 18 rules applied. Total rules applied 93 place count 746 transition count 999
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 105 place count 746 transition count 987
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 740 transition count 981
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 740 transition count 981
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 740 transition count 979
Applied a total of 119 rules in 66 ms. Remains 740 /790 variables (removed 50) and now considering 979/1048 (removed 69) transitions.
// Phase 1: matrix 979 rows 740 cols
[2024-05-23 20:27:29] [INFO ] Computed 16 invariants in 19 ms
[2024-05-23 20:27:30] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-23 20:27:30] [INFO ] Invariant cache hit.
[2024-05-23 20:27:30] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2024-05-23 20:27:30] [INFO ] Invariant cache hit.
[2024-05-23 20:27:31] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 740/790 places, 979/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1150 ms. Remains : 740/790 places, 979/1048 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s286 0) (EQ s97 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 994 reset in 231 ms.
Product exploration explored 100000 steps with 990 reset in 306 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 100 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 759744 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :{}
Probabilistic random walk after 759744 steps, saw 244109 distinct states, run finished after 3001 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 20:27:34] [INFO ] Invariant cache hit.
[2024-05-23 20:27:34] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 20:27:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-23 20:27:35] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 20:27:35] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-23 20:27:35] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 740/740 places, 979/979 transitions.
Graph (trivial) has 680 edges and 740 vertex of which 79 / 740 are part of one of the 13 SCC in 1 ms
Free SCC test removed 66 places
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 674 transition count 832
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 607 transition count 832
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 135 place count 607 transition count 801
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 197 place count 576 transition count 801
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 222 place count 551 transition count 776
Iterating global reduction 2 with 25 rules applied. Total rules applied 247 place count 551 transition count 776
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 248 place count 550 transition count 775
Iterating global reduction 2 with 1 rules applied. Total rules applied 249 place count 550 transition count 775
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 431 place count 459 transition count 684
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 458 place count 459 transition count 657
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 472 place count 445 transition count 643
Iterating global reduction 3 with 14 rules applied. Total rules applied 486 place count 445 transition count 643
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 490 place count 443 transition count 657
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 493 place count 443 transition count 654
Free-agglomeration rule applied 353 times.
Iterating global reduction 3 with 353 rules applied. Total rules applied 846 place count 443 transition count 301
Reduce places removed 353 places and 0 transitions.
Drop transitions removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 497 rules applied. Total rules applied 1343 place count 90 transition count 157
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 1356 place count 90 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1357 place count 89 transition count 143
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 99 edges and 87 vertex of which 67 / 87 are part of one of the 14 SCC in 1 ms
Free SCC test removed 53 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 1361 place count 34 transition count 142
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 93 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 104 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 118 rules applied. Total rules applied 1479 place count 21 transition count 37
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 6 with 14 rules applied. Total rules applied 1493 place count 20 transition count 24
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 1516 place count 8 transition count 13
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 8 with 2 rules applied. Total rules applied 1518 place count 7 transition count 12
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1520 place count 7 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1522 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1522 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1524 place count 6 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1525 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1526 place count 5 transition count 6
Applied a total of 1526 rules in 145 ms. Remains 5 /740 variables (removed 735) and now considering 6/979 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 5/740 places, 6/979 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-14b-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-07 finished in 5746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||((!p0 U (G(!p0)||(!p0&&G(p2))))&&p1))))'
Support contains 7 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 739 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 0 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 718 transition count 896
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 639 transition count 896
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 159 place count 639 transition count 865
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 221 place count 608 transition count 865
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 270 place count 559 transition count 816
Iterating global reduction 2 with 49 rules applied. Total rules applied 319 place count 559 transition count 816
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 322 place count 559 transition count 813
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 322 place count 559 transition count 812
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 324 place count 558 transition count 812
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 334 place count 548 transition count 802
Iterating global reduction 3 with 10 rules applied. Total rules applied 344 place count 548 transition count 802
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 353 place count 548 transition count 793
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 523 place count 463 transition count 708
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 528 place count 458 transition count 703
Iterating global reduction 4 with 5 rules applied. Total rules applied 533 place count 458 transition count 703
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 538 place count 458 transition count 698
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 552 place count 458 transition count 684
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 554 place count 456 transition count 682
Applied a total of 554 rules in 147 ms. Remains 456 /790 variables (removed 334) and now considering 682/1048 (removed 366) transitions.
[2024-05-23 20:27:35] [INFO ] Flow matrix only has 655 transitions (discarded 27 similar events)
// Phase 1: matrix 655 rows 456 cols
[2024-05-23 20:27:35] [INFO ] Computed 16 invariants in 14 ms
[2024-05-23 20:27:35] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-23 20:27:36] [INFO ] Flow matrix only has 655 transitions (discarded 27 similar events)
[2024-05-23 20:27:36] [INFO ] Invariant cache hit.
[2024-05-23 20:27:36] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-05-23 20:27:36] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-23 20:27:36] [INFO ] Flow matrix only has 655 transitions (discarded 27 similar events)
[2024-05-23 20:27:36] [INFO ] Invariant cache hit.
[2024-05-23 20:27:36] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 456/790 places, 682/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 949 ms. Remains : 456/790 places, 682/1048 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (AND p0 (NOT p2)), (NOT p2), p0, p0]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=4, aps=[p2:(NEQ s80 1), p0:(AND (EQ s38 1) (EQ s183 1) (EQ s394 1)), p1:(AND (NOT (AND (EQ s38 1) (EQ s183 1) (EQ s394 1))) (NOT (AND (EQ s99 1) (EQ s105 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 4888 reset in 658 ms.
Product exploration explored 100000 steps with 4883 reset in 657 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 p2 (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 163 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p2), (AND (NOT p2) p0), p0]
Incomplete random walk after 10000 steps, including 504 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-23 20:27:38] [INFO ] Flow matrix only has 655 transitions (discarded 27 similar events)
[2024-05-23 20:27:38] [INFO ] Invariant cache hit.
[2024-05-23 20:27:38] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:27:39] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 20:27:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 20:27:39] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 20:27:39] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-23 20:27:39] [INFO ] After 459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 682/682 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 456 transition count 654
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 43 place count 441 transition count 639
Iterating global reduction 1 with 15 rules applied. Total rules applied 58 place count 441 transition count 639
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 441 transition count 638
Free-agglomeration rule applied 365 times.
Iterating global reduction 2 with 365 rules applied. Total rules applied 424 place count 441 transition count 273
Reduce places removed 366 places and 0 transitions.
Drop transitions removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Graph (trivial) has 70 edges and 75 vertex of which 28 / 75 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Iterating post reduction 2 with 523 rules applied. Total rules applied 947 place count 61 transition count 117
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 975 place count 61 transition count 89
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 975 place count 61 transition count 75
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 1003 place count 47 transition count 75
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1017 place count 47 transition count 61
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 1045 place count 33 transition count 47
Free-agglomeration rule applied 14 times.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1059 place count 33 transition count 33
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 49 rules applied. Total rules applied 1108 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1109 place count 8 transition count 8
Applied a total of 1109 rules in 52 ms. Remains 8 /456 variables (removed 448) and now considering 8/682 (removed 674) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 8/456 places, 8/682 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p2))), (F p0), (F (NOT p2)), (F (AND p0 p2)), (F (AND p0 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (AND p0 (NOT p2)))
Knowledge based reduction with 19 factoid took 429 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-14b-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-09 finished in 4361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(F(p1))))||G(p0)))'
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 765 transition count 1023
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 765 transition count 1023
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 765 transition count 1018
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 72 place count 748 transition count 1001
Iterating global reduction 1 with 17 rules applied. Total rules applied 89 place count 748 transition count 1001
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 99 place count 748 transition count 991
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 106 place count 741 transition count 984
Iterating global reduction 2 with 7 rules applied. Total rules applied 113 place count 741 transition count 984
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 741 transition count 981
Applied a total of 116 rules in 81 ms. Remains 741 /790 variables (removed 49) and now considering 981/1048 (removed 67) transitions.
// Phase 1: matrix 981 rows 741 cols
[2024-05-23 20:27:40] [INFO ] Computed 16 invariants in 15 ms
[2024-05-23 20:27:40] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-23 20:27:40] [INFO ] Invariant cache hit.
[2024-05-23 20:27:40] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2024-05-23 20:27:40] [INFO ] Invariant cache hit.
[2024-05-23 20:27:41] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 741/790 places, 981/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1185 ms. Remains : 741/790 places, 981/1048 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s649 0), p1:(EQ s682 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]]
Product exploration explored 100000 steps with 997 reset in 205 ms.
Product exploration explored 100000 steps with 999 reset in 220 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 85 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 99 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 365946 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 365946 steps, saw 154145 distinct states, run finished after 3002 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-23 20:27:45] [INFO ] Invariant cache hit.
[2024-05-23 20:27:45] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-23 20:27:45] [INFO ] After 288ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-23 20:27:45] [INFO ] After 387ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:3
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-23 20:27:45] [INFO ] After 598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:3
[2024-05-23 20:27:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-23 20:27:46] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-23 20:27:46] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 121 ms.
[2024-05-23 20:27:46] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 7 ms.
Support contains 2 out of 741 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 741/741 places, 981/981 transitions.
Graph (trivial) has 695 edges and 741 vertex of which 85 / 741 are part of one of the 14 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 670 transition count 827
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 602 transition count 827
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 137 place count 602 transition count 797
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 197 place count 572 transition count 797
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 224 place count 545 transition count 770
Iterating global reduction 2 with 27 rules applied. Total rules applied 251 place count 545 transition count 770
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 427 place count 457 transition count 682
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 455 place count 457 transition count 654
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 469 place count 443 transition count 640
Iterating global reduction 3 with 14 rules applied. Total rules applied 483 place count 443 transition count 640
Free-agglomeration rule applied 368 times.
Iterating global reduction 3 with 368 rules applied. Total rules applied 851 place count 443 transition count 272
Reduce places removed 368 places and 0 transitions.
Drop transitions removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Graph (complete) has 206 edges and 75 vertex of which 25 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 538 rules applied. Total rules applied 1389 place count 25 transition count 103
Drop transitions removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 1459 place count 25 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1460 place count 24 transition count 32
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 20 edges and 23 vertex of which 8 / 23 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 1462 place count 19 transition count 32
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1470 place count 19 transition count 24
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 1470 place count 19 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1478 place count 15 transition count 20
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1482 place count 15 transition count 16
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1490 place count 11 transition count 12
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1494 place count 11 transition count 8
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1506 place count 3 transition count 4
Applied a total of 1506 rules in 82 ms. Remains 3 /741 variables (removed 738) and now considering 4/981 (removed 977) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 3/741 places, 4/981 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 232 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 741 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 741/741 places, 981/981 transitions.
Graph (trivial) has 695 edges and 741 vertex of which 85 / 741 are part of one of the 14 SCC in 0 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 669 transition count 840
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 601 transition count 840
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 137 place count 601 transition count 810
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 197 place count 571 transition count 810
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 224 place count 544 transition count 783
Iterating global reduction 2 with 27 rules applied. Total rules applied 251 place count 544 transition count 783
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 423 place count 458 transition count 697
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 437 place count 458 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 439 place count 456 transition count 681
Applied a total of 439 rules in 108 ms. Remains 456 /741 variables (removed 285) and now considering 681/981 (removed 300) transitions.
[2024-05-23 20:27:47] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
// Phase 1: matrix 654 rows 456 cols
[2024-05-23 20:27:47] [INFO ] Computed 16 invariants in 16 ms
[2024-05-23 20:27:47] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-23 20:27:47] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:27:47] [INFO ] Invariant cache hit.
[2024-05-23 20:27:48] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2024-05-23 20:27:48] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:27:48] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:27:48] [INFO ] Invariant cache hit.
[2024-05-23 20:27:48] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 456/741 places, 681/981 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 940 ms. Remains : 456/741 places, 681/981 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 126 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 498 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 493359 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 493359 steps, saw 117714 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-23 20:27:52] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:27:52] [INFO ] Invariant cache hit.
[2024-05-23 20:27:52] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:27:52] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 20:27:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:27:52] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-23 20:27:52] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-23 20:27:52] [INFO ] After 530ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 681/681 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 456 transition count 653
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 42 place count 442 transition count 639
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 442 transition count 639
Free-agglomeration rule applied 368 times.
Iterating global reduction 1 with 368 rules applied. Total rules applied 424 place count 442 transition count 271
Reduce places removed 369 places and 0 transitions.
Drop transitions removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Graph (complete) has 134 edges and 73 vertex of which 23 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 50 output transitions
Drop transitions removed 50 transitions
Graph (trivial) has 40 edges and 23 vertex of which 8 / 23 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 540 rules applied. Total rules applied 964 place count 19 transition count 52
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 992 place count 19 transition count 24
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 992 place count 19 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1000 place count 15 transition count 20
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1004 place count 15 transition count 16
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1012 place count 11 transition count 12
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1016 place count 11 transition count 8
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1028 place count 3 transition count 4
Applied a total of 1028 rules in 36 ms. Remains 3 /456 variables (removed 453) and now considering 4/681 (removed 677) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 3/456 places, 4/681 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 354 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 4845 reset in 631 ms.
Product exploration explored 100000 steps with 4849 reset in 624 ms.
Built C files in :
/tmp/ltsmin5681638909149957174
[2024-05-23 20:27:55] [INFO ] Computing symmetric may disable matrix : 681 transitions.
[2024-05-23 20:27:55] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:27:55] [INFO ] Computing symmetric may enable matrix : 681 transitions.
[2024-05-23 20:27:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:27:55] [INFO ] Computing Do-Not-Accords matrix : 681 transitions.
[2024-05-23 20:27:55] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:27:55] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5681638909149957174
Running compilation step : cd /tmp/ltsmin5681638909149957174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1685 ms.
Running link step : cd /tmp/ltsmin5681638909149957174;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin5681638909149957174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7679873637484384319.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 681/681 transitions.
Applied a total of 0 rules in 37 ms. Remains 456 /456 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-23 20:28:10] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:28:10] [INFO ] Invariant cache hit.
[2024-05-23 20:28:10] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-23 20:28:10] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:28:10] [INFO ] Invariant cache hit.
[2024-05-23 20:28:10] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-23 20:28:10] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-23 20:28:10] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:28:10] [INFO ] Invariant cache hit.
[2024-05-23 20:28:11] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 803 ms. Remains : 456/456 places, 681/681 transitions.
Built C files in :
/tmp/ltsmin3650490313865748847
[2024-05-23 20:28:11] [INFO ] Computing symmetric may disable matrix : 681 transitions.
[2024-05-23 20:28:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:28:11] [INFO ] Computing symmetric may enable matrix : 681 transitions.
[2024-05-23 20:28:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:28:11] [INFO ] Computing Do-Not-Accords matrix : 681 transitions.
[2024-05-23 20:28:11] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:28:11] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3650490313865748847
Running compilation step : cd /tmp/ltsmin3650490313865748847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1577 ms.
Running link step : cd /tmp/ltsmin3650490313865748847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin3650490313865748847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14760231494825223789.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 20:28:26] [INFO ] Flatten gal took : 25 ms
[2024-05-23 20:28:26] [INFO ] Flatten gal took : 24 ms
[2024-05-23 20:28:26] [INFO ] Time to serialize gal into /tmp/LTL7023662561236637890.gal : 5 ms
[2024-05-23 20:28:26] [INFO ] Time to serialize properties into /tmp/LTL2728739933055920839.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7023662561236637890.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15606049900101075009.hoa' '-atoms' '/tmp/LTL2728739933055920839.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2728739933055920839.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15606049900101075009.hoa
Detected timeout of ITS tools.
[2024-05-23 20:28:41] [INFO ] Flatten gal took : 23 ms
[2024-05-23 20:28:41] [INFO ] Flatten gal took : 22 ms
[2024-05-23 20:28:41] [INFO ] Time to serialize gal into /tmp/LTL10013019740791222806.gal : 3 ms
[2024-05-23 20:28:41] [INFO ] Time to serialize properties into /tmp/LTL10806922133658465859.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10013019740791222806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10806922133658465859.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F(("(p2243==0)")&&(X(F("(p2400==1)")))))||(G("(p2243==0)"))))
Formula 0 simplified : G(!"(p2243==0)" | XG!"(p2400==1)") & F!"(p2243==0)"
Detected timeout of ITS tools.
[2024-05-23 20:28:56] [INFO ] Flatten gal took : 26 ms
[2024-05-23 20:28:56] [INFO ] Applying decomposition
[2024-05-23 20:28:56] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12724257345139390433.txt' '-o' '/tmp/graph12724257345139390433.bin' '-w' '/tmp/graph12724257345139390433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12724257345139390433.bin' '-l' '-1' '-v' '-w' '/tmp/graph12724257345139390433.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:28:56] [INFO ] Decomposing Gal with order
[2024-05-23 20:28:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:28:56] [INFO ] Removed a total of 281 redundant transitions.
[2024-05-23 20:28:56] [INFO ] Flatten gal took : 160 ms
[2024-05-23 20:28:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 13 ms.
[2024-05-23 20:28:56] [INFO ] Time to serialize gal into /tmp/LTL2765640411928519752.gal : 7 ms
[2024-05-23 20:28:56] [INFO ] Time to serialize properties into /tmp/LTL8548789422691398971.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2765640411928519752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8548789422691398971.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F(("(u42.p2243==0)")&&(X(F("(u42.p2400==1)")))))||(G("(u42.p2243==0)"))))
Formula 0 simplified : G(!"(u42.p2243==0)" | XG!"(u42.p2400==1)") & F!"(u42.p2243==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7231685020111871014
[2024-05-23 20:29:11] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7231685020111871014
Running compilation step : cd /tmp/ltsmin7231685020111871014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 968 ms.
Running link step : cd /tmp/ltsmin7231685020111871014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7231685020111871014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((LTLAPp0==true)&&X(<>((LTLAPp1==true)))))||[]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-10 finished in 107057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 743 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 718 transition count 896
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 639 transition count 896
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 159 place count 639 transition count 865
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 221 place count 608 transition count 865
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 272 place count 557 transition count 814
Iterating global reduction 2 with 51 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 557 transition count 808
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 330 place count 556 transition count 808
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 339 place count 547 transition count 799
Iterating global reduction 3 with 9 rules applied. Total rules applied 348 place count 547 transition count 799
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 357 place count 547 transition count 790
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 527 place count 462 transition count 705
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 532 place count 457 transition count 700
Iterating global reduction 4 with 5 rules applied. Total rules applied 537 place count 457 transition count 700
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 542 place count 457 transition count 695
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 556 place count 457 transition count 681
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 558 place count 455 transition count 679
Applied a total of 558 rules in 140 ms. Remains 455 /790 variables (removed 335) and now considering 679/1048 (removed 369) transitions.
[2024-05-23 20:29:27] [INFO ] Flow matrix only has 653 transitions (discarded 26 similar events)
// Phase 1: matrix 653 rows 455 cols
[2024-05-23 20:29:27] [INFO ] Computed 16 invariants in 15 ms
[2024-05-23 20:29:27] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-23 20:29:27] [INFO ] Flow matrix only has 653 transitions (discarded 26 similar events)
[2024-05-23 20:29:27] [INFO ] Invariant cache hit.
[2024-05-23 20:29:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:29:27] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-23 20:29:27] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-23 20:29:27] [INFO ] Flow matrix only has 653 transitions (discarded 26 similar events)
[2024-05-23 20:29:27] [INFO ] Invariant cache hit.
[2024-05-23 20:29:28] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 455/790 places, 679/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1015 ms. Remains : 455/790 places, 679/1048 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s94 1) (EQ s454 1)), p0:(NEQ s422 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-12 finished in 1099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p1||G((F(p3)||p2))))))'
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 766 transition count 1024
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 766 transition count 1024
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 766 transition count 1019
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 749 transition count 1002
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 749 transition count 1002
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 98 place count 749 transition count 991
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 743 transition count 985
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 743 transition count 985
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 743 transition count 983
Applied a total of 112 rules in 77 ms. Remains 743 /790 variables (removed 47) and now considering 983/1048 (removed 65) transitions.
// Phase 1: matrix 983 rows 743 cols
[2024-05-23 20:29:28] [INFO ] Computed 16 invariants in 13 ms
[2024-05-23 20:29:28] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-23 20:29:28] [INFO ] Invariant cache hit.
[2024-05-23 20:29:29] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2024-05-23 20:29:29] [INFO ] Invariant cache hit.
[2024-05-23 20:29:29] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 743/790 places, 983/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1158 ms. Remains : 743/790 places, 983/1048 transitions.
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s113 1), p2:(OR (EQ s572 1) (NEQ s167 1)), p3:(NEQ s18 1), p0:(EQ s572 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 994 reset in 207 ms.
Product exploration explored 100000 steps with 994 reset in 212 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 108 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 99 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 484149 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 484149 steps, saw 167014 distinct states, run finished after 3003 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-23 20:29:33] [INFO ] Invariant cache hit.
[2024-05-23 20:29:33] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-23 20:29:33] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 20:29:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-23 20:29:33] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 20:29:34] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-05-23 20:29:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-23 20:29:34] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-23 20:29:34] [INFO ] After 676ms 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 4 ms.
Support contains 3 out of 743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 743/743 places, 983/983 transitions.
Graph (trivial) has 692 edges and 743 vertex of which 79 / 743 are part of one of the 13 SCC in 0 ms
Free SCC test removed 66 places
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 677 transition count 836
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 610 transition count 835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 609 transition count 835
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 137 place count 609 transition count 803
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 201 place count 577 transition count 803
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 226 place count 552 transition count 778
Iterating global reduction 3 with 25 rules applied. Total rules applied 251 place count 552 transition count 778
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 252 place count 551 transition count 777
Iterating global reduction 3 with 1 rules applied. Total rules applied 253 place count 551 transition count 777
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 433 place count 461 transition count 687
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 460 place count 461 transition count 660
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 474 place count 447 transition count 646
Iterating global reduction 4 with 14 rules applied. Total rules applied 488 place count 447 transition count 646
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 490 place count 446 transition count 659
Free-agglomeration rule applied 366 times.
Iterating global reduction 4 with 366 rules applied. Total rules applied 856 place count 446 transition count 293
Reduce places removed 366 places and 0 transitions.
Drop transitions removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 4 with 522 rules applied. Total rules applied 1378 place count 80 transition count 137
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 1391 place count 80 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1392 place count 79 transition count 123
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 71 edges and 78 vertex of which 26 / 78 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 1394 place count 65 transition count 123
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 1420 place count 65 transition count 97
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 1420 place count 65 transition count 83
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1448 place count 51 transition count 83
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1462 place count 51 transition count 69
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 1492 place count 36 transition count 54
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 8 with 2 rules applied. Total rules applied 1494 place count 35 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1496 place count 35 transition count 52
Free-agglomeration rule applied 13 times.
Iterating global reduction 9 with 13 rules applied. Total rules applied 1509 place count 35 transition count 39
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 9 with 49 rules applied. Total rules applied 1558 place count 10 transition count 15
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1560 place count 10 transition count 13
Applied a total of 1560 rules in 95 ms. Remains 10 /743 variables (removed 733) and now considering 13/983 (removed 970) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 10/743 places, 13/983 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3))), (F (NOT p3))]
Knowledge based reduction with 14 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Support contains 3 out of 743 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 743/743 places, 983/983 transitions.
Graph (trivial) has 690 edges and 743 vertex of which 79 / 743 are part of one of the 13 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 676 transition count 849
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 610 transition count 848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 609 transition count 848
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 135 place count 609 transition count 816
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 199 place count 577 transition count 816
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 224 place count 552 transition count 791
Iterating global reduction 3 with 25 rules applied. Total rules applied 249 place count 552 transition count 791
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 250 place count 551 transition count 790
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 551 transition count 790
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 425 place count 464 transition count 703
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 438 place count 464 transition count 690
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 439 place count 464 transition count 690
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 441 place count 462 transition count 688
Applied a total of 441 rules in 152 ms. Remains 462 /743 variables (removed 281) and now considering 688/983 (removed 295) transitions.
[2024-05-23 20:29:34] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
// Phase 1: matrix 663 rows 462 cols
[2024-05-23 20:29:34] [INFO ] Computed 16 invariants in 20 ms
[2024-05-23 20:29:34] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-23 20:29:34] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 20:29:34] [INFO ] Invariant cache hit.
[2024-05-23 20:29:35] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-05-23 20:29:35] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-23 20:29:35] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 20:29:35] [INFO ] Invariant cache hit.
[2024-05-23 20:29:35] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 462/743 places, 688/983 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 976 ms. Remains : 462/743 places, 688/983 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 p2 p3), (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 486 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 566120 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 566120 steps, saw 132771 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-23 20:29:39] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 20:29:39] [INFO ] Invariant cache hit.
[2024-05-23 20:29:39] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 20:29:39] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 20:29:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 20:29:39] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 20:29:39] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-23 20:29:39] [INFO ] After 385ms 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 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 688/688 transitions.
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 462 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 461 transition count 661
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 41 place count 448 transition count 648
Iterating global reduction 2 with 13 rules applied. Total rules applied 54 place count 448 transition count 648
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 2 with 2 rules applied. Total rules applied 56 place count 447 transition count 647
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 447 transition count 646
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 446 transition count 645
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 446 transition count 645
Free-agglomeration rule applied 367 times.
Iterating global reduction 3 with 367 rules applied. Total rules applied 426 place count 446 transition count 278
Reduce places removed 368 places and 0 transitions.
Drop transitions removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (trivial) has 71 edges and 78 vertex of which 26 / 78 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 3 with 513 rules applied. Total rules applied 939 place count 65 transition count 134
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 965 place count 65 transition count 108
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 965 place count 65 transition count 94
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 993 place count 51 transition count 94
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1007 place count 51 transition count 80
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1039 place count 35 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1040 place count 35 transition count 63
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 1065 place count 35 transition count 38
Graph (complete) has 57 edges and 35 vertex of which 15 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 1066 place count 15 transition count 28
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1076 place count 15 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1076 place count 15 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1078 place count 14 transition count 17
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1081 place count 14 transition count 14
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1089 place count 9 transition count 11
Applied a total of 1089 rules in 57 ms. Remains 9 /462 variables (removed 453) and now considering 11/688 (removed 677) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 9/462 places, 11/688 transitions.
Finished random walk after 27 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p3), (X p3), (X (X p3))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3))), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 4768 reset in 593 ms.
Product exploration explored 100000 steps with 4782 reset in 603 ms.
Built C files in :
/tmp/ltsmin16651657184958140419
[2024-05-23 20:29:41] [INFO ] Computing symmetric may disable matrix : 688 transitions.
[2024-05-23 20:29:41] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:29:41] [INFO ] Computing symmetric may enable matrix : 688 transitions.
[2024-05-23 20:29:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:29:41] [INFO ] Computing Do-Not-Accords matrix : 688 transitions.
[2024-05-23 20:29:41] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:29:41] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16651657184958140419
Running compilation step : cd /tmp/ltsmin16651657184958140419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1668 ms.
Running link step : cd /tmp/ltsmin16651657184958140419;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16651657184958140419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8653836724856845225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 688/688 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 461 transition count 687
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 2 with 2 rules applied. Total rules applied 4 place count 460 transition count 686
Applied a total of 4 rules in 30 ms. Remains 460 /462 variables (removed 2) and now considering 686/688 (removed 2) transitions.
[2024-05-23 20:29:56] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
// Phase 1: matrix 660 rows 460 cols
[2024-05-23 20:29:56] [INFO ] Computed 16 invariants in 7 ms
[2024-05-23 20:29:56] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-23 20:29:56] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
[2024-05-23 20:29:56] [INFO ] Invariant cache hit.
[2024-05-23 20:29:56] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-05-23 20:29:56] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:29:56] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
[2024-05-23 20:29:56] [INFO ] Invariant cache hit.
[2024-05-23 20:29:57] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 460/462 places, 686/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 830 ms. Remains : 460/462 places, 686/688 transitions.
Built C files in :
/tmp/ltsmin10707721213598066619
[2024-05-23 20:29:57] [INFO ] Computing symmetric may disable matrix : 686 transitions.
[2024-05-23 20:29:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:29:57] [INFO ] Computing symmetric may enable matrix : 686 transitions.
[2024-05-23 20:29:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:29:57] [INFO ] Computing Do-Not-Accords matrix : 686 transitions.
[2024-05-23 20:29:57] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:29:57] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10707721213598066619
Running compilation step : cd /tmp/ltsmin10707721213598066619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1628 ms.
Running link step : cd /tmp/ltsmin10707721213598066619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10707721213598066619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased838804722556718340.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 20:30:12] [INFO ] Flatten gal took : 20 ms
[2024-05-23 20:30:12] [INFO ] Flatten gal took : 18 ms
[2024-05-23 20:30:12] [INFO ] Time to serialize gal into /tmp/LTL15036262490001638166.gal : 4 ms
[2024-05-23 20:30:12] [INFO ] Time to serialize properties into /tmp/LTL6439256457171216819.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15036262490001638166.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6308583258804337756.hoa' '-atoms' '/tmp/LTL6439256457171216819.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6439256457171216819.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6308583258804337756.hoa
Detected timeout of ITS tools.
[2024-05-23 20:30:27] [INFO ] Flatten gal took : 16 ms
[2024-05-23 20:30:27] [INFO ] Flatten gal took : 15 ms
[2024-05-23 20:30:27] [INFO ] Time to serialize gal into /tmp/LTL1876100786804594512.gal : 3 ms
[2024-05-23 20:30:27] [INFO ] Time to serialize properties into /tmp/LTL14876824854479168216.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1876100786804594512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14876824854479168216.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X("(p1843==1)"))U(("(p379==1)")||(G(("((p1843==1)||(p530!=1))")||(F("(p28!=1)"))))))))
Formula 0 simplified : F(X!"(p1843==1)" R (!"(p379==1)" & F(!"((p1843==1)||(p530!=1))" & G!"(p28!=1)")))
Detected timeout of ITS tools.
[2024-05-23 20:30:42] [INFO ] Flatten gal took : 20 ms
[2024-05-23 20:30:42] [INFO ] Applying decomposition
[2024-05-23 20:30:42] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5730298378574716697.txt' '-o' '/tmp/graph5730298378574716697.bin' '-w' '/tmp/graph5730298378574716697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5730298378574716697.bin' '-l' '-1' '-v' '-w' '/tmp/graph5730298378574716697.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:30:42] [INFO ] Decomposing Gal with order
[2024-05-23 20:30:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:30:42] [INFO ] Removed a total of 288 redundant transitions.
[2024-05-23 20:30:42] [INFO ] Flatten gal took : 85 ms
[2024-05-23 20:30:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 9 ms.
[2024-05-23 20:30:42] [INFO ] Time to serialize gal into /tmp/LTL9653502056057990372.gal : 6 ms
[2024-05-23 20:30:42] [INFO ] Time to serialize properties into /tmp/LTL15331494135034179992.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9653502056057990372.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15331494135034179992.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X("(u45.p1843==1)"))U(("(i2.u7.p379==1)")||(G(("((u45.p1843==1)||(i3.u14.p530!=1))")||(F("(i0.u0.p28!=1)"))))))))
Formula 0 simplified : F(X!"(u45.p1843==1)" R (!"(i2.u7.p379==1)" & F(!"((u45.p1843==1)||(i3.u14.p530!=1))" & G!"(i0.u0.p28!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4768220356336954503
[2024-05-23 20:30:57] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4768220356336954503
Running compilation step : cd /tmp/ltsmin4768220356336954503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 985 ms.
Running link step : cd /tmp/ltsmin4768220356336954503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4768220356336954503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true)) U ((LTLAPp1==true)||[]((<>((LTLAPp3==true))||(LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-13 finished in 104582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(X(G(p1)))))))'
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 765 transition count 1023
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 765 transition count 1023
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 765 transition count 1018
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 72 place count 748 transition count 1001
Iterating global reduction 1 with 17 rules applied. Total rules applied 89 place count 748 transition count 1001
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 100 place count 748 transition count 990
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 106 place count 742 transition count 984
Iterating global reduction 2 with 6 rules applied. Total rules applied 112 place count 742 transition count 984
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 742 transition count 982
Applied a total of 114 rules in 68 ms. Remains 742 /790 variables (removed 48) and now considering 982/1048 (removed 66) transitions.
// Phase 1: matrix 982 rows 742 cols
[2024-05-23 20:31:12] [INFO ] Computed 16 invariants in 11 ms
[2024-05-23 20:31:13] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-23 20:31:13] [INFO ] Invariant cache hit.
[2024-05-23 20:31:13] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2024-05-23 20:31:13] [INFO ] Invariant cache hit.
[2024-05-23 20:31:13] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 742/790 places, 982/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1171 ms. Remains : 742/790 places, 982/1048 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s488 0), p1:(EQ s489 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-14 finished in 1358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(p1)||p0))||G(p2))))'
Support contains 3 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 766 transition count 1024
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 766 transition count 1024
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 766 transition count 1019
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 69 place count 750 transition count 1003
Iterating global reduction 1 with 16 rules applied. Total rules applied 85 place count 750 transition count 1003
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 95 place count 750 transition count 993
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 101 place count 744 transition count 987
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 744 transition count 987
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 744 transition count 984
Applied a total of 110 rules in 74 ms. Remains 744 /790 variables (removed 46) and now considering 984/1048 (removed 64) transitions.
// Phase 1: matrix 984 rows 744 cols
[2024-05-23 20:31:14] [INFO ] Computed 16 invariants in 16 ms
[2024-05-23 20:31:14] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-23 20:31:14] [INFO ] Invariant cache hit.
[2024-05-23 20:31:14] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2024-05-23 20:31:14] [INFO ] Invariant cache hit.
[2024-05-23 20:31:15] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 744/790 places, 984/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1145 ms. Remains : 744/790 places, 984/1048 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s176 1), p0:(OR (EQ s624 1) (EQ s140 1)), p1:(EQ s140 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25023 reset in 334 ms.
Product exploration explored 100000 steps with 24946 reset in 337 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 99 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 330047 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 330047 steps, saw 145478 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-23 20:31:19] [INFO ] Invariant cache hit.
[2024-05-23 20:31:19] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-23 20:31:20] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-23 20:31:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-23 20:31:20] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-23 20:31:20] [INFO ] After 744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 192 ms.
[2024-05-23 20:31:21] [INFO ] After 1162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
Parikh walk visited 7 properties in 4 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p2)), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0)]
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 984/984 transitions.
Applied a total of 0 rules in 18 ms. Remains 744 /744 variables (removed 0) and now considering 984/984 (removed 0) transitions.
[2024-05-23 20:31:21] [INFO ] Invariant cache hit.
[2024-05-23 20:31:22] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-23 20:31:22] [INFO ] Invariant cache hit.
[2024-05-23 20:31:22] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2024-05-23 20:31:22] [INFO ] Invariant cache hit.
[2024-05-23 20:31:23] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1093 ms. Remains : 744/744 places, 984/984 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 148 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 100 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :2
Running SMT prover for 5 properties.
[2024-05-23 20:31:23] [INFO ] Invariant cache hit.
[2024-05-23 20:31:23] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-23 20:31:23] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 20:31:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-23 20:31:24] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 20:31:24] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-05-23 20:31:24] [INFO ] After 936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 142 steps, including 1 resets, run visited all 5 properties in 3 ms. (steps per millisecond=47 )
Parikh walk visited 5 properties in 2 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p2)), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0)]
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 25096 reset in 336 ms.
Product exploration explored 100000 steps with 24935 reset in 340 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 984/984 transitions.
Graph (trivial) has 696 edges and 744 vertex of which 85 / 744 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 673 transition count 912
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 56 place count 673 transition count 912
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 97 place count 673 transition count 912
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 163 place count 607 transition count 846
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 229 place count 607 transition count 846
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 230 place count 606 transition count 845
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 231 place count 606 transition count 845
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 307 place count 606 transition count 873
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 339 place count 574 transition count 841
Deduced a syphon composed of 101 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 371 place count 574 transition count 841
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 115 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 385 place count 574 transition count 869
Deduced a syphon composed of 115 places in 0 ms
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 1 with 28 rules applied. Total rules applied 413 place count 574 transition count 841
Deduced a syphon composed of 115 places in 0 ms
Applied a total of 413 rules in 199 ms. Remains 574 /744 variables (removed 170) and now considering 841/984 (removed 143) transitions.
[2024-05-23 20:31:27] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-23 20:31:27] [INFO ] Flow matrix only has 814 transitions (discarded 27 similar events)
// Phase 1: matrix 814 rows 574 cols
[2024-05-23 20:31:27] [INFO ] Computed 16 invariants in 16 ms
[2024-05-23 20:31:27] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 574/744 places, 841/984 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 528 ms. Remains : 574/744 places, 841/984 transitions.
Built C files in :
/tmp/ltsmin16078651862707497795
[2024-05-23 20:31:27] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16078651862707497795
Running compilation step : cd /tmp/ltsmin16078651862707497795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1507 ms.
Running link step : cd /tmp/ltsmin16078651862707497795;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16078651862707497795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13226043445987801295.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 984/984 transitions.
Applied a total of 0 rules in 22 ms. Remains 744 /744 variables (removed 0) and now considering 984/984 (removed 0) transitions.
// Phase 1: matrix 984 rows 744 cols
[2024-05-23 20:31:42] [INFO ] Computed 16 invariants in 14 ms
[2024-05-23 20:31:42] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-23 20:31:42] [INFO ] Invariant cache hit.
[2024-05-23 20:31:43] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2024-05-23 20:31:43] [INFO ] Invariant cache hit.
[2024-05-23 20:31:43] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1151 ms. Remains : 744/744 places, 984/984 transitions.
Built C files in :
/tmp/ltsmin6248203503581275099
[2024-05-23 20:31:43] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6248203503581275099
Running compilation step : cd /tmp/ltsmin6248203503581275099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1484 ms.
Running link step : cd /tmp/ltsmin6248203503581275099;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6248203503581275099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12410941814519882656.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 20:31:58] [INFO ] Flatten gal took : 22 ms
[2024-05-23 20:31:58] [INFO ] Flatten gal took : 20 ms
[2024-05-23 20:31:58] [INFO ] Time to serialize gal into /tmp/LTL8553820371398706488.gal : 5 ms
[2024-05-23 20:31:58] [INFO ] Time to serialize properties into /tmp/LTL12891172799929007135.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8553820371398706488.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14290814777288238449.hoa' '-atoms' '/tmp/LTL12891172799929007135.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12891172799929007135.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14290814777288238449.hoa
Detected timeout of ITS tools.
[2024-05-23 20:32:13] [INFO ] Flatten gal took : 20 ms
[2024-05-23 20:32:13] [INFO ] Flatten gal took : 20 ms
[2024-05-23 20:32:13] [INFO ] Time to serialize gal into /tmp/LTL10813939602264545023.gal : 5 ms
[2024-05-23 20:32:13] [INFO ] Time to serialize properties into /tmp/LTL13091927474627047685.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10813939602264545023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13091927474627047685.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((X(("((p2101==1)||(p476==1))")||(X("(p476==0)"))))||(G("(p571==1)")))))
Formula 0 simplified : F(X(!"((p2101==1)||(p476==1))" & X!"(p476==0)") & F!"(p571==1)")
Detected timeout of ITS tools.
[2024-05-23 20:32:28] [INFO ] Flatten gal took : 19 ms
[2024-05-23 20:32:28] [INFO ] Applying decomposition
[2024-05-23 20:32:28] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9748728746880971050.txt' '-o' '/tmp/graph9748728746880971050.bin' '-w' '/tmp/graph9748728746880971050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9748728746880971050.bin' '-l' '-1' '-v' '-w' '/tmp/graph9748728746880971050.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:32:29] [INFO ] Decomposing Gal with order
[2024-05-23 20:32:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:32:29] [INFO ] Removed a total of 268 redundant transitions.
[2024-05-23 20:32:29] [INFO ] Flatten gal took : 59 ms
[2024-05-23 20:32:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2024-05-23 20:32:29] [INFO ] Time to serialize gal into /tmp/LTL16785367175282925383.gal : 8 ms
[2024-05-23 20:32:29] [INFO ] Time to serialize properties into /tmp/LTL5271192169594071259.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16785367175282925383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5271192169594071259.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(("((u150.p2101==1)||(i5.u48.p476==1))")||(X("(i5.u48.p476==0)"))))||(G("(i6.u50.p571==1)")))))
Formula 0 simplified : F(X(!"((u150.p2101==1)||(i5.u48.p476==1))" & X!"(i5.u48.p476==0)") & F!"(i6.u50.p571==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3687614390328025085
[2024-05-23 20:32:44] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3687614390328025085
Running compilation step : cd /tmp/ltsmin3687614390328025085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1488 ms.
Running link step : cd /tmp/ltsmin3687614390328025085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3687614390328025085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((X((LTLAPp1==true))||(LTLAPp0==true)))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-15 finished in 105184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(F(p1))))||G(p0)))'
Found a Shortening insensitive property : FlexibleBarrier-PT-14b-LTLFireability-10
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 744 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 718 transition count 896
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 639 transition count 896
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 159 place count 639 transition count 864
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 223 place count 607 transition count 864
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 273 place count 557 transition count 814
Iterating global reduction 2 with 50 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 557 transition count 808
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 330 place count 556 transition count 808
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 338 place count 548 transition count 800
Iterating global reduction 3 with 8 rules applied. Total rules applied 346 place count 548 transition count 800
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 354 place count 548 transition count 792
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 524 place count 463 transition count 707
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 529 place count 458 transition count 702
Iterating global reduction 4 with 5 rules applied. Total rules applied 534 place count 458 transition count 702
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 539 place count 458 transition count 697
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 553 place count 458 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 555 place count 456 transition count 681
Applied a total of 555 rules in 104 ms. Remains 456 /790 variables (removed 334) and now considering 681/1048 (removed 367) transitions.
[2024-05-23 20:32:59] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
// Phase 1: matrix 654 rows 456 cols
[2024-05-23 20:32:59] [INFO ] Computed 16 invariants in 13 ms
[2024-05-23 20:32:59] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-23 20:32:59] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:32:59] [INFO ] Invariant cache hit.
[2024-05-23 20:33:00] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2024-05-23 20:33:00] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:33:00] [INFO ] Invariant cache hit.
[2024-05-23 20:33:00] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 456/790 places, 681/1048 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 911 ms. Remains : 456/790 places, 681/1048 transitions.
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s368 0), p1:(EQ s401 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4862 reset in 619 ms.
Product exploration explored 100000 steps with 4856 reset in 618 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 118 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 497 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 514827 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 514827 steps, saw 121550 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-23 20:33:05] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:33:05] [INFO ] Invariant cache hit.
[2024-05-23 20:33:05] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-23 20:33:05] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 20:33:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:33:05] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-23 20:33:06] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-23 20:33:06] [INFO ] After 530ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 681/681 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 456 transition count 653
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 42 place count 442 transition count 639
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 442 transition count 639
Free-agglomeration rule applied 368 times.
Iterating global reduction 1 with 368 rules applied. Total rules applied 424 place count 442 transition count 271
Reduce places removed 369 places and 0 transitions.
Drop transitions removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Graph (complete) has 134 edges and 73 vertex of which 23 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 50 output transitions
Drop transitions removed 50 transitions
Graph (trivial) has 40 edges and 23 vertex of which 8 / 23 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 540 rules applied. Total rules applied 964 place count 19 transition count 52
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 992 place count 19 transition count 24
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 992 place count 19 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1000 place count 15 transition count 20
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1004 place count 15 transition count 16
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1012 place count 11 transition count 12
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1016 place count 11 transition count 8
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1028 place count 3 transition count 4
Applied a total of 1028 rules in 49 ms. Remains 3 /456 variables (removed 453) and now considering 4/681 (removed 677) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 3/456 places, 4/681 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 182 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 681/681 transitions.
Applied a total of 0 rules in 27 ms. Remains 456 /456 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-23 20:33:06] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:33:06] [INFO ] Invariant cache hit.
[2024-05-23 20:33:07] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-23 20:33:07] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:33:07] [INFO ] Invariant cache hit.
[2024-05-23 20:33:07] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2024-05-23 20:33:07] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-23 20:33:07] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:33:07] [INFO ] Invariant cache hit.
[2024-05-23 20:33:07] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 829 ms. Remains : 456/456 places, 681/681 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 112 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 499 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 499463 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 499463 steps, saw 119278 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-23 20:33:11] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:33:11] [INFO ] Invariant cache hit.
[2024-05-23 20:33:11] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:33:11] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 20:33:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:33:11] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-23 20:33:12] [INFO ] After 336ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-23 20:33:12] [INFO ] After 512ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 681/681 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 456 transition count 653
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 42 place count 442 transition count 639
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 442 transition count 639
Free-agglomeration rule applied 368 times.
Iterating global reduction 1 with 368 rules applied. Total rules applied 424 place count 442 transition count 271
Reduce places removed 369 places and 0 transitions.
Drop transitions removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Graph (complete) has 134 edges and 73 vertex of which 23 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 50 output transitions
Drop transitions removed 50 transitions
Graph (trivial) has 40 edges and 23 vertex of which 8 / 23 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 540 rules applied. Total rules applied 964 place count 19 transition count 52
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 992 place count 19 transition count 24
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 992 place count 19 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1000 place count 15 transition count 20
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1004 place count 15 transition count 16
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1012 place count 11 transition count 12
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1016 place count 11 transition count 8
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1028 place count 3 transition count 4
Applied a total of 1028 rules in 40 ms. Remains 3 /456 variables (removed 453) and now considering 4/681 (removed 677) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 3/456 places, 4/681 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X p0)), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 244 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 4880 reset in 627 ms.
Stuttering criterion allowed to conclude after 69272 steps with 3397 reset in 443 ms.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-10 finished in 14902 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p1||G((F(p3)||p2))))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-14b-LTLFireability-13
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 737 edges and 790 vertex of which 79 / 790 are part of one of the 13 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 723 transition count 905
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 648 transition count 904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 647 transition count 904
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 153 place count 647 transition count 871
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 219 place count 614 transition count 871
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 267 place count 566 transition count 823
Iterating global reduction 3 with 48 rules applied. Total rules applied 315 place count 566 transition count 823
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 320 place count 566 transition count 818
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 320 place count 566 transition count 816
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 324 place count 564 transition count 816
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 334 place count 554 transition count 806
Iterating global reduction 4 with 10 rules applied. Total rules applied 344 place count 554 transition count 806
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 353 place count 554 transition count 797
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 5 with 172 rules applied. Total rules applied 525 place count 468 transition count 711
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 529 place count 464 transition count 707
Iterating global reduction 5 with 4 rules applied. Total rules applied 533 place count 464 transition count 707
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 537 place count 464 transition count 703
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 550 place count 464 transition count 690
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 464 transition count 690
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 553 place count 462 transition count 688
Applied a total of 553 rules in 101 ms. Remains 462 /790 variables (removed 328) and now considering 688/1048 (removed 360) transitions.
[2024-05-23 20:33:14] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
// Phase 1: matrix 663 rows 462 cols
[2024-05-23 20:33:14] [INFO ] Computed 16 invariants in 14 ms
[2024-05-23 20:33:14] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-23 20:33:14] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 20:33:14] [INFO ] Invariant cache hit.
[2024-05-23 20:33:15] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-05-23 20:33:15] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 20:33:15] [INFO ] Invariant cache hit.
[2024-05-23 20:33:15] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 462/790 places, 688/1048 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 924 ms. Remains : 462/790 places, 688/1048 transitions.
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s55 1), p2:(OR (EQ s295 1) (NEQ s85 1)), p3:(NEQ s0 1), p0:(EQ s295 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4781 reset in 584 ms.
Product exploration explored 100000 steps with 4772 reset in 598 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 112 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 487 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 573045 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 573045 steps, saw 135452 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-23 20:33:20] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 20:33:20] [INFO ] Invariant cache hit.
[2024-05-23 20:33:20] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-23 20:33:20] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 20:33:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 20:33:20] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 20:33:20] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-23 20:33:20] [INFO ] After 363ms 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 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 688/688 transitions.
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 462 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 461 transition count 661
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 41 place count 448 transition count 648
Iterating global reduction 2 with 13 rules applied. Total rules applied 54 place count 448 transition count 648
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 2 with 2 rules applied. Total rules applied 56 place count 447 transition count 647
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 447 transition count 646
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 446 transition count 645
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 446 transition count 645
Free-agglomeration rule applied 367 times.
Iterating global reduction 3 with 367 rules applied. Total rules applied 426 place count 446 transition count 278
Reduce places removed 368 places and 0 transitions.
Drop transitions removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (trivial) has 71 edges and 78 vertex of which 26 / 78 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 3 with 513 rules applied. Total rules applied 939 place count 65 transition count 134
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 965 place count 65 transition count 108
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 965 place count 65 transition count 94
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 993 place count 51 transition count 94
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1007 place count 51 transition count 80
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1039 place count 35 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1040 place count 35 transition count 63
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 1065 place count 35 transition count 38
Graph (complete) has 57 edges and 35 vertex of which 15 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 1066 place count 15 transition count 28
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1076 place count 15 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1076 place count 15 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1078 place count 14 transition count 17
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1081 place count 14 transition count 14
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1089 place count 9 transition count 11
Applied a total of 1089 rules in 57 ms. Remains 9 /462 variables (removed 453) and now considering 11/688 (removed 677) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 9/462 places, 11/688 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3))), (F (NOT p3))]
Knowledge based reduction with 14 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Support contains 3 out of 462 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 688/688 transitions.
Applied a total of 0 rules in 28 ms. Remains 462 /462 variables (removed 0) and now considering 688/688 (removed 0) transitions.
[2024-05-23 20:33:20] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 20:33:20] [INFO ] Invariant cache hit.
[2024-05-23 20:33:21] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-23 20:33:21] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 20:33:21] [INFO ] Invariant cache hit.
[2024-05-23 20:33:21] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-05-23 20:33:21] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:33:21] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 20:33:21] [INFO ] Invariant cache hit.
[2024-05-23 20:33:21] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 850 ms. Remains : 462/462 places, 688/688 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 p2 p3), (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 493 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 609438 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 609438 steps, saw 143954 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-23 20:33:25] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 20:33:25] [INFO ] Invariant cache hit.
[2024-05-23 20:33:25] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:33:25] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 20:33:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:33:25] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 20:33:25] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-23 20:33:25] [INFO ] After 370ms 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 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 688/688 transitions.
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 462 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 461 transition count 661
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 41 place count 448 transition count 648
Iterating global reduction 2 with 13 rules applied. Total rules applied 54 place count 448 transition count 648
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 2 with 2 rules applied. Total rules applied 56 place count 447 transition count 647
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 447 transition count 646
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 446 transition count 645
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 446 transition count 645
Free-agglomeration rule applied 367 times.
Iterating global reduction 3 with 367 rules applied. Total rules applied 426 place count 446 transition count 278
Reduce places removed 368 places and 0 transitions.
Drop transitions removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (trivial) has 71 edges and 78 vertex of which 26 / 78 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 3 with 513 rules applied. Total rules applied 939 place count 65 transition count 134
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 965 place count 65 transition count 108
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 965 place count 65 transition count 94
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 993 place count 51 transition count 94
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1007 place count 51 transition count 80
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1039 place count 35 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1040 place count 35 transition count 63
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 1065 place count 35 transition count 38
Graph (complete) has 57 edges and 35 vertex of which 15 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 1066 place count 15 transition count 28
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1076 place count 15 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1076 place count 15 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1078 place count 14 transition count 17
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1081 place count 14 transition count 14
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1089 place count 9 transition count 11
Applied a total of 1089 rules in 59 ms. Remains 9 /462 variables (removed 453) and now considering 11/688 (removed 677) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 9/462 places, 11/688 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p3), (X p3), (X (X p3))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3))), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 4792 reset in 601 ms.
Product exploration explored 100000 steps with 4779 reset in 606 ms.
Built C files in :
/tmp/ltsmin17345771874854017743
[2024-05-23 20:33:27] [INFO ] Computing symmetric may disable matrix : 688 transitions.
[2024-05-23 20:33:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:33:27] [INFO ] Computing symmetric may enable matrix : 688 transitions.
[2024-05-23 20:33:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:33:27] [INFO ] Computing Do-Not-Accords matrix : 688 transitions.
[2024-05-23 20:33:27] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:33:27] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17345771874854017743
Running compilation step : cd /tmp/ltsmin17345771874854017743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1681 ms.
Running link step : cd /tmp/ltsmin17345771874854017743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17345771874854017743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17070051306626937257.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 688/688 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 461 transition count 687
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 2 with 2 rules applied. Total rules applied 4 place count 460 transition count 686
Applied a total of 4 rules in 39 ms. Remains 460 /462 variables (removed 2) and now considering 686/688 (removed 2) transitions.
[2024-05-23 20:33:42] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
// Phase 1: matrix 660 rows 460 cols
[2024-05-23 20:33:42] [INFO ] Computed 16 invariants in 16 ms
[2024-05-23 20:33:42] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-23 20:33:42] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
[2024-05-23 20:33:42] [INFO ] Invariant cache hit.
[2024-05-23 20:33:42] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2024-05-23 20:33:42] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-23 20:33:42] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
[2024-05-23 20:33:42] [INFO ] Invariant cache hit.
[2024-05-23 20:33:43] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 460/462 places, 686/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 870 ms. Remains : 460/462 places, 686/688 transitions.
Built C files in :
/tmp/ltsmin3365985350934256685
[2024-05-23 20:33:43] [INFO ] Computing symmetric may disable matrix : 686 transitions.
[2024-05-23 20:33:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:33:43] [INFO ] Computing symmetric may enable matrix : 686 transitions.
[2024-05-23 20:33:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:33:43] [INFO ] Computing Do-Not-Accords matrix : 686 transitions.
[2024-05-23 20:33:43] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:33:43] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3365985350934256685
Running compilation step : cd /tmp/ltsmin3365985350934256685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1660 ms.
Running link step : cd /tmp/ltsmin3365985350934256685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3365985350934256685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13303887781851406856.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 20:33:58] [INFO ] Flatten gal took : 16 ms
[2024-05-23 20:33:58] [INFO ] Flatten gal took : 15 ms
[2024-05-23 20:33:58] [INFO ] Time to serialize gal into /tmp/LTL9974938831416647318.gal : 3 ms
[2024-05-23 20:33:58] [INFO ] Time to serialize properties into /tmp/LTL18167997027979629007.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9974938831416647318.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2325216310613142222.hoa' '-atoms' '/tmp/LTL18167997027979629007.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18167997027979629007.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2325216310613142222.hoa
Detected timeout of ITS tools.
[2024-05-23 20:34:13] [INFO ] Flatten gal took : 12 ms
[2024-05-23 20:34:13] [INFO ] Flatten gal took : 13 ms
[2024-05-23 20:34:13] [INFO ] Time to serialize gal into /tmp/LTL15733609889423414726.gal : 3 ms
[2024-05-23 20:34:13] [INFO ] Time to serialize properties into /tmp/LTL12129419642070985978.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15733609889423414726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12129419642070985978.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((X("(p1843==1)"))U(("(p379==1)")||(G(("((p1843==1)||(p530!=1))")||(F("(p28!=1)"))))))))
Formula 0 simplified : F(X!"(p1843==1)" R (!"(p379==1)" & F(!"((p1843==1)||(p530!=1))" & G!"(p28!=1)")))
Detected timeout of ITS tools.
[2024-05-23 20:34:28] [INFO ] Flatten gal took : 15 ms
[2024-05-23 20:34:28] [INFO ] Applying decomposition
[2024-05-23 20:34:28] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8906891524615031626.txt' '-o' '/tmp/graph8906891524615031626.bin' '-w' '/tmp/graph8906891524615031626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8906891524615031626.bin' '-l' '-1' '-v' '-w' '/tmp/graph8906891524615031626.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:34:28] [INFO ] Decomposing Gal with order
[2024-05-23 20:34:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:34:28] [INFO ] Removed a total of 285 redundant transitions.
[2024-05-23 20:34:28] [INFO ] Flatten gal took : 52 ms
[2024-05-23 20:34:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 7 ms.
[2024-05-23 20:34:28] [INFO ] Time to serialize gal into /tmp/LTL4532177526957492904.gal : 4 ms
[2024-05-23 20:34:28] [INFO ] Time to serialize properties into /tmp/LTL2746189018548972688.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4532177526957492904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2746189018548972688.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((X("(u44.p1843==1)"))U(("(i2.u7.p379==1)")||(G(("((u44.p1843==1)||(i4.u11.p530!=1))")||(F("(i0.u0.p28!=1)"))))))))
Formula 0 simplified : F(X!"(u44.p1843==1)" R (!"(i2.u7.p379==1)" & F(!"((u44.p1843==1)||(i4.u11.p530!=1))" & G!"(i0.u0.p28!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3736724384660438287
[2024-05-23 20:34:43] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3736724384660438287
Running compilation step : cd /tmp/ltsmin3736724384660438287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1001 ms.
Running link step : cd /tmp/ltsmin3736724384660438287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3736724384660438287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true)) U ((LTLAPp1==true)||[]((<>((LTLAPp3==true))||(LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-13 finished in 104532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(p1)||p0))||G(p2))))'
[2024-05-23 20:34:58] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2364002513779213840
[2024-05-23 20:34:58] [INFO ] Computing symmetric may disable matrix : 1048 transitions.
[2024-05-23 20:34:58] [INFO ] Applying decomposition
[2024-05-23 20:34:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:34:58] [INFO ] Computing symmetric may enable matrix : 1048 transitions.
[2024-05-23 20:34:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:34:58] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3704160132777763327.txt' '-o' '/tmp/graph3704160132777763327.bin' '-w' '/tmp/graph3704160132777763327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3704160132777763327.bin' '-l' '-1' '-v' '-w' '/tmp/graph3704160132777763327.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:34:58] [INFO ] Decomposing Gal with order
[2024-05-23 20:34:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:34:59] [INFO ] Removed a total of 332 redundant transitions.
[2024-05-23 20:34:59] [INFO ] Flatten gal took : 61 ms
[2024-05-23 20:34:59] [INFO ] Computing Do-Not-Accords matrix : 1048 transitions.
[2024-05-23 20:34:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 10 ms.
[2024-05-23 20:34:59] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:34:59] [INFO ] Time to serialize gal into /tmp/LTLFireability7083065124366754924.gal : 8 ms
[2024-05-23 20:34:59] [INFO ] Time to serialize properties into /tmp/LTLFireability2236233237152381265.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7083065124366754924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2236233237152381265.ltl' '-c' '-stutter-deadlock'
[2024-05-23 20:34:59] [INFO ] Built C files in 219ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2364002513779213840
Running compilation step : cd /tmp/ltsmin2364002513779213840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !(((F(("(i18.u152.p2243==0)")&&(X(F("(i18.u152.p2400==1)")))))||(G("(i18.u152.p2243==0)"))))
Formula 0 simplified : G(!"(i18.u152.p2243==0)" | XG!"(i18.u152.p2400==1)") & F!"(i18.u152.p2243==0)"
Compilation finished in 2889 ms.
Running link step : cd /tmp/ltsmin2364002513779213840;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin2364002513779213840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((LTLAPp0==true)&&X(<>((LTLAPp1==true)))))||[]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin2364002513779213840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((LTLAPp0==true)&&X(<>((LTLAPp1==true)))))||[]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2364002513779213840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp2==true)) U ((LTLAPp3==true)||[]((<>((LTLAPp5==true))||(LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 20:57:36] [INFO ] Applying decomposition
[2024-05-23 20:57:36] [INFO ] Flatten gal took : 64 ms
[2024-05-23 20:57:36] [INFO ] Decomposing Gal with order
[2024-05-23 20:57:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:57:36] [INFO ] Removed a total of 279 redundant transitions.
[2024-05-23 20:57:36] [INFO ] Flatten gal took : 141 ms
[2024-05-23 20:57:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 958 labels/synchronizations in 219 ms.
[2024-05-23 20:57:36] [INFO ] Time to serialize gal into /tmp/LTLFireability15613758137755865304.gal : 31 ms
[2024-05-23 20:57:36] [INFO ] Time to serialize properties into /tmp/LTLFireability13297423777797196506.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15613758137755865304.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13297423777797196506.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !(((F(("(i1.u29.p2243==0)")&&(X(F("(i1.u29.p2400==1)")))))||(G("(i1.u29.p2243==0)"))))
Formula 0 simplified : G(!"(i1.u29.p2243==0)" | XG!"(i1.u29.p2400==1)") & F!"(i1.u29.p2243==0)"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin2364002513779213840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp2==true)) U ((LTLAPp3==true)||[]((<>((LTLAPp5==true))||(LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2364002513779213840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((X((LTLAPp7==true))||(LTLAPp6==true)))||[]((LTLAPp8==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 21:20:32] [INFO ] Flatten gal took : 381 ms
[2024-05-23 21:20:36] [INFO ] Input system was already deterministic with 1048 transitions.
[2024-05-23 21:20:37] [INFO ] Transformed 790 places.
[2024-05-23 21:20:37] [INFO ] Transformed 1048 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 21:20:37] [INFO ] Time to serialize gal into /tmp/LTLFireability17212876373340195717.gal : 20 ms
[2024-05-23 21:20:37] [INFO ] Time to serialize properties into /tmp/LTLFireability17177981101300112881.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17212876373340195717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17177981101300112881.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(("(p2243==0)")&&(X(F("(p2400==1)")))))||(G("(p2243==0)"))))
Formula 0 simplified : G(!"(p2243==0)" | XG!"(p2400==1)") & F!"(p2243==0)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10821852 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15982572 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FlexibleBarrier-PT-14b, 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 r197-tall-171640624800058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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