About the Execution of ITS-Tools for FlexibleBarrier-PT-22b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13933.668 | 3600000.00 | 13230940.00 | 2040.20 | FFFFFFFFFF??FT?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r096-smll-165260575800156.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-22b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575800156
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 13:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.8M May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652671857762
Running Version 202205111006
[2022-05-16 03:31:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 03:31:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 03:31:01] [INFO ] Load time of PNML (sax parser for PT used): 717 ms
[2022-05-16 03:31:01] [INFO ] Transformed 6478 places.
[2022-05-16 03:31:01] [INFO ] Transformed 7469 transitions.
[2022-05-16 03:31:01] [INFO ] Found NUPN structural information;
[2022-05-16 03:31:01] [INFO ] Parsed PT model containing 6478 places and 7469 transitions in 1026 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 6478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Discarding 2751 places :
Symmetric choice reduction at 0 with 2751 rule applications. Total rules 2751 place count 3727 transition count 4718
Iterating global reduction 0 with 2751 rules applied. Total rules applied 5502 place count 3727 transition count 4718
Discarding 1315 places :
Symmetric choice reduction at 0 with 1315 rule applications. Total rules 6817 place count 2412 transition count 3403
Iterating global reduction 0 with 1315 rules applied. Total rules applied 8132 place count 2412 transition count 3403
Discarding 862 places :
Symmetric choice reduction at 0 with 862 rule applications. Total rules 8994 place count 1550 transition count 2541
Iterating global reduction 0 with 862 rules applied. Total rules applied 9856 place count 1550 transition count 2541
Ensure Unique test removed 423 transitions
Reduce isomorphic transitions removed 423 transitions.
Iterating post reduction 0 with 423 rules applied. Total rules applied 10279 place count 1550 transition count 2118
Applied a total of 10279 rules in 2472 ms. Remains 1550 /6478 variables (removed 4928) and now considering 2118/7469 (removed 5351) transitions.
// Phase 1: matrix 2118 rows 1550 cols
[2022-05-16 03:31:04] [INFO ] Computed 24 place invariants in 108 ms
[2022-05-16 03:31:05] [INFO ] Implicit Places using invariants in 1636 ms returned []
// Phase 1: matrix 2118 rows 1550 cols
[2022-05-16 03:31:05] [INFO ] Computed 24 place invariants in 77 ms
[2022-05-16 03:31:08] [INFO ] Implicit Places using invariants and state equation in 3025 ms returned []
Implicit Place search using SMT with State Equation took 4719 ms to find 0 implicit places.
// Phase 1: matrix 2118 rows 1550 cols
[2022-05-16 03:31:08] [INFO ] Computed 24 place invariants in 66 ms
[2022-05-16 03:31:10] [INFO ] Dead Transitions using invariants and state equation in 1786 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1550/6478 places, 2118/7469 transitions.
Finished structural reductions, in 1 iterations. Remains : 1550/6478 places, 2118/7469 transitions.
Support contains 29 out of 1550 places after structural reductions.
[2022-05-16 03:31:11] [INFO ] Flatten gal took : 290 ms
[2022-05-16 03:31:11] [INFO ] Flatten gal took : 197 ms
[2022-05-16 03:31:11] [INFO ] Input system was already deterministic with 2118 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 981 ms. (steps per millisecond=10 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 2118 rows 1550 cols
[2022-05-16 03:31:12] [INFO ] Computed 24 place invariants in 70 ms
[2022-05-16 03:31:14] [INFO ] [Real]Absence check using 24 positive place invariants in 19 ms returned sat
[2022-05-16 03:31:14] [INFO ] After 1479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-16 03:31:15] [INFO ] [Nat]Absence check using 24 positive place invariants in 23 ms returned sat
[2022-05-16 03:31:18] [INFO ] After 2696ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :17
[2022-05-16 03:31:20] [INFO ] Deduced a trap composed of 492 places in 1004 ms of which 8 ms to minimize.
[2022-05-16 03:31:22] [INFO ] Deduced a trap composed of 653 places in 1364 ms of which 3 ms to minimize.
[2022-05-16 03:31:23] [INFO ] Deduced a trap composed of 494 places in 1118 ms of which 3 ms to minimize.
[2022-05-16 03:31:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3858 ms
[2022-05-16 03:31:25] [INFO ] Deduced a trap composed of 655 places in 1079 ms of which 4 ms to minimize.
[2022-05-16 03:31:26] [INFO ] Deduced a trap composed of 496 places in 1032 ms of which 2 ms to minimize.
[2022-05-16 03:31:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2441 ms
[2022-05-16 03:31:27] [INFO ] After 11349ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :17
Attempting to minimize the solution found.
Minimization took 1642 ms.
[2022-05-16 03:31:28] [INFO ] After 14331ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :17
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 8 properties in 609 ms.
Support contains 13 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1550/1550 places, 2118/2118 transitions.
Graph (trivial) has 1464 edges and 1550 vertex of which 133 / 1550 are part of one of the 22 SCC in 14 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 1439 transition count 1880
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 209 place count 1335 transition count 1880
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 209 place count 1335 transition count 1830
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 309 place count 1285 transition count 1830
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 362 place count 1232 transition count 1777
Iterating global reduction 2 with 53 rules applied. Total rules applied 415 place count 1232 transition count 1777
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 417 place count 1232 transition count 1775
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 426 place count 1223 transition count 1766
Iterating global reduction 3 with 9 rules applied. Total rules applied 435 place count 1223 transition count 1766
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 441 place count 1223 transition count 1760
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 2 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 4 with 274 rules applied. Total rules applied 715 place count 1086 transition count 1623
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 4 with 44 rules applied. Total rules applied 759 place count 1086 transition count 1579
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 782 place count 1063 transition count 1556
Iterating global reduction 5 with 23 rules applied. Total rules applied 805 place count 1063 transition count 1556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 806 place count 1063 transition count 1555
Free-agglomeration rule applied 932 times.
Iterating global reduction 6 with 932 rules applied. Total rules applied 1738 place count 1063 transition count 623
Reduce places removed 932 places and 0 transitions.
Drop transitions removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 6 with 1350 rules applied. Total rules applied 3088 place count 131 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3089 place count 130 transition count 204
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 110 edges and 129 vertex of which 44 / 129 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 3091 place count 107 transition count 204
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 8 with 44 rules applied. Total rules applied 3135 place count 107 transition count 160
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 22 Pre rules applied. Total rules applied 3135 place count 107 transition count 138
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 9 with 44 rules applied. Total rules applied 3179 place count 85 transition count 138
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 3201 place count 85 transition count 116
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 10 with 44 rules applied. Total rules applied 3245 place count 63 transition count 94
Free-agglomeration rule applied 22 times.
Iterating global reduction 10 with 22 rules applied. Total rules applied 3267 place count 63 transition count 72
Reduce places removed 36 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 10 with 71 rules applied. Total rules applied 3338 place count 27 transition count 37
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 3344 place count 27 transition count 31
Applied a total of 3344 rules in 1989 ms. Remains 27 /1550 variables (removed 1523) and now considering 31/2118 (removed 2087) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/1550 places, 31/2118 transitions.
Finished random walk after 463 steps, including 0 resets, run visited all 9 properties in 11 ms. (steps per millisecond=42 )
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 25 stabilizing places and 25 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 2118/2118 transitions.
Graph (trivial) has 1481 edges and 1550 vertex of which 133 / 1550 are part of one of the 22 SCC in 3 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 1438 transition count 1895
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 221 place count 1328 transition count 1895
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 221 place count 1328 transition count 1842
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 327 place count 1275 transition count 1842
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 390 place count 1212 transition count 1779
Iterating global reduction 2 with 63 rules applied. Total rules applied 453 place count 1212 transition count 1779
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 456 place count 1212 transition count 1776
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 456 place count 1212 transition count 1775
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 458 place count 1211 transition count 1775
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 469 place count 1200 transition count 1764
Iterating global reduction 3 with 11 rules applied. Total rules applied 480 place count 1200 transition count 1764
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 491 place count 1200 transition count 1753
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 1 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 757 place count 1067 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 760 place count 1064 transition count 1617
Iterating global reduction 4 with 3 rules applied. Total rules applied 763 place count 1064 transition count 1617
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 766 place count 1064 transition count 1614
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 788 place count 1064 transition count 1592
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 790 place count 1062 transition count 1590
Applied a total of 790 rules in 1834 ms. Remains 1062 /1550 variables (removed 488) and now considering 1590/2118 (removed 528) transitions.
[2022-05-16 03:31:33] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:31:33] [INFO ] Computed 24 place invariants in 48 ms
[2022-05-16 03:31:34] [INFO ] Implicit Places using invariants in 1125 ms returned []
[2022-05-16 03:31:34] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:31:34] [INFO ] Computed 24 place invariants in 45 ms
[2022-05-16 03:31:37] [INFO ] Implicit Places using invariants and state equation in 2840 ms returned []
Implicit Place search using SMT with State Equation took 3968 ms to find 0 implicit places.
[2022-05-16 03:31:37] [INFO ] Redundant transitions in 129 ms returned []
[2022-05-16 03:31:37] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:31:37] [INFO ] Computed 24 place invariants in 44 ms
[2022-05-16 03:31:39] [INFO ] Dead Transitions using invariants and state equation in 1479 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1062/1550 places, 1590/2118 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1550 places, 1590/2118 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1011 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-22b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-02 finished in 7692 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((G(X(G(p0))) U p1)||p2)))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2118/2118 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1532 transition count 2100
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1532 transition count 2100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 1532 transition count 2097
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 53 place count 1518 transition count 2083
Iterating global reduction 1 with 14 rules applied. Total rules applied 67 place count 1518 transition count 2083
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 74 place count 1518 transition count 2076
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 1512 transition count 2070
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 1512 transition count 2070
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 91 place count 1512 transition count 2065
Applied a total of 91 rules in 468 ms. Remains 1512 /1550 variables (removed 38) and now considering 2065/2118 (removed 53) transitions.
// Phase 1: matrix 2065 rows 1512 cols
[2022-05-16 03:31:39] [INFO ] Computed 24 place invariants in 72 ms
[2022-05-16 03:31:41] [INFO ] Implicit Places using invariants in 1721 ms returned []
// Phase 1: matrix 2065 rows 1512 cols
[2022-05-16 03:31:41] [INFO ] Computed 24 place invariants in 74 ms
[2022-05-16 03:31:43] [INFO ] Implicit Places using invariants and state equation in 2237 ms returned []
Implicit Place search using SMT with State Equation took 3962 ms to find 0 implicit places.
// Phase 1: matrix 2065 rows 1512 cols
[2022-05-16 03:31:43] [INFO ] Computed 24 place invariants in 63 ms
[2022-05-16 03:31:45] [INFO ] Dead Transitions using invariants and state equation in 2019 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1512/1550 places, 2065/2118 transitions.
Finished structural reductions, in 1 iterations. Remains : 1512/1550 places, 2065/2118 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=6 dest: 0}, { cond=(NOT p0), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(OR (EQ s971 1) (EQ s688 1)), p1:(AND (EQ s230 1) (EQ s688 1)), p2:(EQ s971 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-03 finished in 6836 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 2118/2118 transitions.
Graph (trivial) has 1480 edges and 1550 vertex of which 133 / 1550 are part of one of the 22 SCC in 3 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 1438 transition count 1896
Reduce places removed 109 places and 0 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 219 place count 1329 transition count 1896
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 219 place count 1329 transition count 1844
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 323 place count 1277 transition count 1844
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 386 place count 1214 transition count 1781
Iterating global reduction 2 with 63 rules applied. Total rules applied 449 place count 1214 transition count 1781
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 452 place count 1214 transition count 1778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 452 place count 1214 transition count 1777
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 454 place count 1213 transition count 1777
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 466 place count 1201 transition count 1765
Iterating global reduction 3 with 12 rules applied. Total rules applied 478 place count 1201 transition count 1765
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 489 place count 1201 transition count 1754
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 755 place count 1068 transition count 1621
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 758 place count 1065 transition count 1618
Iterating global reduction 4 with 3 rules applied. Total rules applied 761 place count 1065 transition count 1618
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 764 place count 1065 transition count 1615
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 786 place count 1065 transition count 1593
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 788 place count 1063 transition count 1591
Applied a total of 788 rules in 885 ms. Remains 1063 /1550 variables (removed 487) and now considering 1591/2118 (removed 527) transitions.
[2022-05-16 03:31:47] [INFO ] Flow matrix only has 1548 transitions (discarded 43 similar events)
// Phase 1: matrix 1548 rows 1063 cols
[2022-05-16 03:31:47] [INFO ] Computed 24 place invariants in 49 ms
[2022-05-16 03:31:48] [INFO ] Implicit Places using invariants in 1379 ms returned []
[2022-05-16 03:31:48] [INFO ] Flow matrix only has 1548 transitions (discarded 43 similar events)
// Phase 1: matrix 1548 rows 1063 cols
[2022-05-16 03:31:48] [INFO ] Computed 24 place invariants in 50 ms
[2022-05-16 03:31:51] [INFO ] Implicit Places using invariants and state equation in 2651 ms returned []
Implicit Place search using SMT with State Equation took 4034 ms to find 0 implicit places.
[2022-05-16 03:31:51] [INFO ] Redundant transitions in 172 ms returned []
[2022-05-16 03:31:51] [INFO ] Flow matrix only has 1548 transitions (discarded 43 similar events)
// Phase 1: matrix 1548 rows 1063 cols
[2022-05-16 03:31:51] [INFO ] Computed 24 place invariants in 72 ms
[2022-05-16 03:31:53] [INFO ] Dead Transitions using invariants and state equation in 1945 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1063/1550 places, 1591/2118 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1550 places, 1591/2118 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s477 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-04 finished in 7176 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(G(p2)||p1))))'
Support contains 4 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 2118/2118 transitions.
Graph (trivial) has 1475 edges and 1550 vertex of which 133 / 1550 are part of one of the 22 SCC in 3 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 1438 transition count 1898
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 1331 transition count 1898
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 215 place count 1331 transition count 1848
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 315 place count 1281 transition count 1848
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 375 place count 1221 transition count 1788
Iterating global reduction 2 with 60 rules applied. Total rules applied 435 place count 1221 transition count 1788
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 438 place count 1221 transition count 1785
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 438 place count 1221 transition count 1784
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 440 place count 1220 transition count 1784
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 451 place count 1209 transition count 1773
Iterating global reduction 3 with 11 rules applied. Total rules applied 462 place count 1209 transition count 1773
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 470 place count 1209 transition count 1765
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 736 place count 1076 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 739 place count 1073 transition count 1629
Iterating global reduction 4 with 3 rules applied. Total rules applied 742 place count 1073 transition count 1629
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 745 place count 1073 transition count 1626
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 767 place count 1073 transition count 1604
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 769 place count 1071 transition count 1602
Applied a total of 769 rules in 1005 ms. Remains 1071 /1550 variables (removed 479) and now considering 1602/2118 (removed 516) transitions.
[2022-05-16 03:31:54] [INFO ] Flow matrix only has 1559 transitions (discarded 43 similar events)
// Phase 1: matrix 1559 rows 1071 cols
[2022-05-16 03:31:54] [INFO ] Computed 24 place invariants in 46 ms
[2022-05-16 03:31:55] [INFO ] Implicit Places using invariants in 1349 ms returned []
[2022-05-16 03:31:55] [INFO ] Flow matrix only has 1559 transitions (discarded 43 similar events)
// Phase 1: matrix 1559 rows 1071 cols
[2022-05-16 03:31:55] [INFO ] Computed 24 place invariants in 61 ms
[2022-05-16 03:31:57] [INFO ] Implicit Places using invariants and state equation in 2195 ms returned []
Implicit Place search using SMT with State Equation took 3546 ms to find 0 implicit places.
[2022-05-16 03:31:58] [INFO ] Redundant transitions in 37 ms returned []
[2022-05-16 03:31:58] [INFO ] Flow matrix only has 1559 transitions (discarded 43 similar events)
// Phase 1: matrix 1559 rows 1071 cols
[2022-05-16 03:31:58] [INFO ] Computed 24 place invariants in 45 ms
[2022-05-16 03:31:59] [INFO ] Dead Transitions using invariants and state equation in 1489 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1071/1550 places, 1602/2118 transitions.
Finished structural reductions, in 1 iterations. Remains : 1071/1550 places, 1602/2118 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s484 0) (EQ s957 0)), p2:(EQ s86 0), p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-07 finished in 6303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((false U p1)&&p0)))'
Support contains 5 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 2118/2118 transitions.
Graph (trivial) has 1477 edges and 1550 vertex of which 133 / 1550 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 1438 transition count 1895
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 221 place count 1328 transition count 1895
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 221 place count 1328 transition count 1844
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 323 place count 1277 transition count 1844
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 384 place count 1216 transition count 1783
Iterating global reduction 2 with 61 rules applied. Total rules applied 445 place count 1216 transition count 1783
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 447 place count 1216 transition count 1781
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 447 place count 1216 transition count 1780
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 449 place count 1215 transition count 1780
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 461 place count 1203 transition count 1768
Iterating global reduction 3 with 12 rules applied. Total rules applied 473 place count 1203 transition count 1768
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 483 place count 1203 transition count 1758
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 749 place count 1070 transition count 1625
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 752 place count 1067 transition count 1622
Iterating global reduction 4 with 3 rules applied. Total rules applied 755 place count 1067 transition count 1622
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 758 place count 1067 transition count 1619
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 780 place count 1067 transition count 1597
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 782 place count 1065 transition count 1595
Applied a total of 782 rules in 944 ms. Remains 1065 /1550 variables (removed 485) and now considering 1595/2118 (removed 523) transitions.
[2022-05-16 03:32:00] [INFO ] Flow matrix only has 1552 transitions (discarded 43 similar events)
// Phase 1: matrix 1552 rows 1065 cols
[2022-05-16 03:32:00] [INFO ] Computed 24 place invariants in 71 ms
[2022-05-16 03:32:02] [INFO ] Implicit Places using invariants in 1703 ms returned []
[2022-05-16 03:32:02] [INFO ] Flow matrix only has 1552 transitions (discarded 43 similar events)
// Phase 1: matrix 1552 rows 1065 cols
[2022-05-16 03:32:02] [INFO ] Computed 24 place invariants in 65 ms
[2022-05-16 03:32:05] [INFO ] Implicit Places using invariants and state equation in 2636 ms returned []
Implicit Place search using SMT with State Equation took 4374 ms to find 0 implicit places.
[2022-05-16 03:32:05] [INFO ] Redundant transitions in 28 ms returned []
[2022-05-16 03:32:05] [INFO ] Flow matrix only has 1552 transitions (discarded 43 similar events)
// Phase 1: matrix 1552 rows 1065 cols
[2022-05-16 03:32:05] [INFO ] Computed 24 place invariants in 42 ms
[2022-05-16 03:32:06] [INFO ] Dead Transitions using invariants and state equation in 1222 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1065/1550 places, 1595/2118 transitions.
Finished structural reductions, in 1 iterations. Remains : 1065/1550 places, 1595/2118 transitions.
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s508 1) (OR (EQ s195 0) (EQ s457 0) (EQ s948 0) (EQ s422 1))), p1:(AND (EQ s195 1) (EQ s457 1) (EQ s948 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-22b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-08 finished in 6678 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X(X(G(p0)))))'
Support contains 2 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2118/2118 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1531 transition count 2099
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1531 transition count 2099
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 1531 transition count 2096
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 56 place count 1516 transition count 2081
Iterating global reduction 1 with 15 rules applied. Total rules applied 71 place count 1516 transition count 2081
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 79 place count 1516 transition count 2073
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 85 place count 1510 transition count 2067
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 1510 transition count 2067
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 97 place count 1510 transition count 2061
Applied a total of 97 rules in 436 ms. Remains 1510 /1550 variables (removed 40) and now considering 2061/2118 (removed 57) transitions.
// Phase 1: matrix 2061 rows 1510 cols
[2022-05-16 03:32:06] [INFO ] Computed 24 place invariants in 56 ms
[2022-05-16 03:32:08] [INFO ] Implicit Places using invariants in 1579 ms returned []
// Phase 1: matrix 2061 rows 1510 cols
[2022-05-16 03:32:08] [INFO ] Computed 24 place invariants in 65 ms
[2022-05-16 03:32:11] [INFO ] Implicit Places using invariants and state equation in 2612 ms returned []
Implicit Place search using SMT with State Equation took 4195 ms to find 0 implicit places.
// Phase 1: matrix 2061 rows 1510 cols
[2022-05-16 03:32:11] [INFO ] Computed 24 place invariants in 64 ms
[2022-05-16 03:32:13] [INFO ] Dead Transitions using invariants and state equation in 2378 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1550 places, 2061/2118 transitions.
Finished structural reductions, in 1 iterations. Remains : 1510/1550 places, 2061/2118 transitions.
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s969 1), p0:(EQ s1337 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-09 finished in 7375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 2118/2118 transitions.
Graph (trivial) has 1481 edges and 1550 vertex of which 133 / 1550 are part of one of the 22 SCC in 2 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 1438 transition count 1895
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 221 place count 1328 transition count 1895
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 221 place count 1328 transition count 1842
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 327 place count 1275 transition count 1842
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 390 place count 1212 transition count 1779
Iterating global reduction 2 with 63 rules applied. Total rules applied 453 place count 1212 transition count 1779
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 456 place count 1212 transition count 1776
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 456 place count 1212 transition count 1775
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 458 place count 1211 transition count 1775
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 470 place count 1199 transition count 1763
Iterating global reduction 3 with 12 rules applied. Total rules applied 482 place count 1199 transition count 1763
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 494 place count 1199 transition count 1751
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 1 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 760 place count 1066 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 762 place count 1064 transition count 1616
Iterating global reduction 4 with 2 rules applied. Total rules applied 764 place count 1064 transition count 1616
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 766 place count 1064 transition count 1614
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 788 place count 1064 transition count 1592
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 790 place count 1062 transition count 1590
Applied a total of 790 rules in 974 ms. Remains 1062 /1550 variables (removed 488) and now considering 1590/2118 (removed 528) transitions.
[2022-05-16 03:32:14] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:32:14] [INFO ] Computed 24 place invariants in 42 ms
[2022-05-16 03:32:16] [INFO ] Implicit Places using invariants in 1488 ms returned []
[2022-05-16 03:32:16] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:32:16] [INFO ] Computed 24 place invariants in 70 ms
[2022-05-16 03:32:18] [INFO ] Implicit Places using invariants and state equation in 2304 ms returned []
Implicit Place search using SMT with State Equation took 3794 ms to find 0 implicit places.
[2022-05-16 03:32:18] [INFO ] Redundant transitions in 46 ms returned []
[2022-05-16 03:32:18] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:32:18] [INFO ] Computed 24 place invariants in 72 ms
[2022-05-16 03:32:20] [INFO ] Dead Transitions using invariants and state equation in 1675 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1062/1550 places, 1590/2118 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1550 places, 1590/2118 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3518 reset in 2529 ms.
Product exploration explored 100000 steps with 3512 reset in 1842 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 356 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 207975 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207975 steps, saw 69613 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-16 03:32:28] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:32:28] [INFO ] Computed 24 place invariants in 43 ms
[2022-05-16 03:32:28] [INFO ] [Real]Absence check using 24 positive place invariants in 15 ms returned sat
[2022-05-16 03:32:29] [INFO ] After 954ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 03:32:30] [INFO ] After 1106ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-05-16 03:32:30] [INFO ] After 1405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1062/1062 places, 1590/1590 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1062 transition count 1546
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1040 transition count 1524
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1040 transition count 1524
Free-agglomeration rule applied 927 times.
Iterating global reduction 1 with 927 rules applied. Total rules applied 1015 place count 1040 transition count 597
Discarding 100 places :
Also discarding 501 output transitions
Drop transitions removed 501 transitions
Remove reverse transitions (loop back) rule discarded transition t457.t1603.t1445 and 100 places that fell out of Prefix Of Interest.
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (trivial) has 14 edges and 11 vertex of which 10 / 11 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 82 rules applied. Total rules applied 1097 place count 3 transition count 16
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1112 place count 2 transition count 2
Applied a total of 1112 rules in 510 ms. Remains 2 /1062 variables (removed 1060) and now considering 2/1590 (removed 1588) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1062 places, 2/1590 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1590/1590 transitions.
Applied a total of 0 rules in 232 ms. Remains 1062 /1062 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
[2022-05-16 03:32:31] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:32:31] [INFO ] Computed 24 place invariants in 70 ms
[2022-05-16 03:32:32] [INFO ] Implicit Places using invariants in 1701 ms returned []
[2022-05-16 03:32:32] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:32:32] [INFO ] Computed 24 place invariants in 61 ms
[2022-05-16 03:32:35] [INFO ] Implicit Places using invariants and state equation in 2343 ms returned []
Implicit Place search using SMT with State Equation took 4046 ms to find 0 implicit places.
[2022-05-16 03:32:35] [INFO ] Redundant transitions in 46 ms returned []
[2022-05-16 03:32:35] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:32:35] [INFO ] Computed 24 place invariants in 70 ms
[2022-05-16 03:32:37] [INFO ] Dead Transitions using invariants and state equation in 1973 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1062 places, 1590/1590 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 357 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 240366 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 240366 steps, saw 74724 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-16 03:32:41] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:32:41] [INFO ] Computed 24 place invariants in 41 ms
[2022-05-16 03:32:41] [INFO ] [Real]Absence check using 24 positive place invariants in 16 ms returned sat
[2022-05-16 03:32:42] [INFO ] After 856ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 03:32:42] [INFO ] After 1021ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-16 03:32:42] [INFO ] After 1331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1062/1062 places, 1590/1590 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1062 transition count 1546
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1040 transition count 1524
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1040 transition count 1524
Free-agglomeration rule applied 927 times.
Iterating global reduction 1 with 927 rules applied. Total rules applied 1015 place count 1040 transition count 597
Discarding 100 places :
Also discarding 501 output transitions
Drop transitions removed 501 transitions
Remove reverse transitions (loop back) rule discarded transition t457.t1603.t1445 and 100 places that fell out of Prefix Of Interest.
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (trivial) has 14 edges and 11 vertex of which 10 / 11 are part of one of the 2 SCC in 1 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 82 rules applied. Total rules applied 1097 place count 3 transition count 16
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1112 place count 2 transition count 2
Applied a total of 1112 rules in 443 ms. Remains 2 /1062 variables (removed 1060) and now considering 2/1590 (removed 1588) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1062 places, 2/1590 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3527 reset in 1720 ms.
Product exploration explored 100000 steps with 3519 reset in 1725 ms.
Built C files in :
/tmp/ltsmin5915795122865501849
[2022-05-16 03:32:46] [INFO ] Too many transitions (1590) to apply POR reductions. Disabling POR matrices.
[2022-05-16 03:32:47] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5915795122865501849
Running compilation step : cd /tmp/ltsmin5915795122865501849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5915795122865501849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5915795122865501849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1590/1590 transitions.
Applied a total of 0 rules in 154 ms. Remains 1062 /1062 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
[2022-05-16 03:32:50] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:32:50] [INFO ] Computed 24 place invariants in 41 ms
[2022-05-16 03:32:51] [INFO ] Implicit Places using invariants in 895 ms returned []
[2022-05-16 03:32:51] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:32:51] [INFO ] Computed 24 place invariants in 43 ms
[2022-05-16 03:32:53] [INFO ] Implicit Places using invariants and state equation in 2318 ms returned []
Implicit Place search using SMT with State Equation took 3223 ms to find 0 implicit places.
[2022-05-16 03:32:53] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-16 03:32:53] [INFO ] Flow matrix only has 1547 transitions (discarded 43 similar events)
// Phase 1: matrix 1547 rows 1062 cols
[2022-05-16 03:32:53] [INFO ] Computed 24 place invariants in 50 ms
[2022-05-16 03:32:55] [INFO ] Dead Transitions using invariants and state equation in 1618 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1062 places, 1590/1590 transitions.
Built C files in :
/tmp/ltsmin9834392105294445727
[2022-05-16 03:32:55] [INFO ] Too many transitions (1590) to apply POR reductions. Disabling POR matrices.
[2022-05-16 03:32:55] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9834392105294445727
Running compilation step : cd /tmp/ltsmin9834392105294445727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9834392105294445727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9834392105294445727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 03:32:58] [INFO ] Flatten gal took : 150 ms
[2022-05-16 03:32:58] [INFO ] Flatten gal took : 130 ms
[2022-05-16 03:32:58] [INFO ] Time to serialize gal into /tmp/LTL1764465308189217150.gal : 25 ms
[2022-05-16 03:32:58] [INFO ] Time to serialize properties into /tmp/LTL16675830691370390931.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1764465308189217150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16675830691370390931.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1764465...267
Read 1 LTL properties
Checking formula 0 : !((F(G("(p376!=1)"))))
Formula 0 simplified : !FG"(p376!=1)"
Detected timeout of ITS tools.
[2022-05-16 03:33:13] [INFO ] Flatten gal took : 121 ms
[2022-05-16 03:33:13] [INFO ] Applying decomposition
[2022-05-16 03:33:14] [INFO ] Flatten gal took : 111 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1607397431881492665.txt' '-o' '/tmp/graph1607397431881492665.bin' '-w' '/tmp/graph1607397431881492665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1607397431881492665.bin' '-l' '-1' '-v' '-w' '/tmp/graph1607397431881492665.weights' '-q' '0' '-e' '0.001'
[2022-05-16 03:33:14] [INFO ] Decomposing Gal with order
[2022-05-16 03:33:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 03:33:15] [INFO ] Removed a total of 617 redundant transitions.
[2022-05-16 03:33:15] [INFO ] Flatten gal took : 978 ms
[2022-05-16 03:33:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 36 ms.
[2022-05-16 03:33:15] [INFO ] Time to serialize gal into /tmp/LTL12385034104087024905.gal : 43 ms
[2022-05-16 03:33:15] [INFO ] Time to serialize properties into /tmp/LTL11061576796685877588.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12385034104087024905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11061576796685877588.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1238503...247
Read 1 LTL properties
Checking formula 0 : !((F(G("(u5.p376!=1)"))))
Formula 0 simplified : !FG"(u5.p376!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14515682712132826580
[2022-05-16 03:33:30] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14515682712132826580
Running compilation step : cd /tmp/ltsmin14515682712132826580;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14515682712132826580;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14515682712132826580;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-10 finished in 80036 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 2118/2118 transitions.
Graph (trivial) has 1480 edges and 1550 vertex of which 133 / 1550 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 1438 transition count 1896
Reduce places removed 109 places and 0 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 219 place count 1329 transition count 1896
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 219 place count 1329 transition count 1843
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 325 place count 1276 transition count 1843
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 388 place count 1213 transition count 1780
Iterating global reduction 2 with 63 rules applied. Total rules applied 451 place count 1213 transition count 1780
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 454 place count 1213 transition count 1777
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 454 place count 1213 transition count 1776
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 456 place count 1212 transition count 1776
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 468 place count 1200 transition count 1764
Iterating global reduction 3 with 12 rules applied. Total rules applied 480 place count 1200 transition count 1764
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 492 place count 1200 transition count 1752
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 758 place count 1067 transition count 1619
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 761 place count 1064 transition count 1616
Iterating global reduction 4 with 3 rules applied. Total rules applied 764 place count 1064 transition count 1616
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 767 place count 1064 transition count 1613
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 789 place count 1064 transition count 1591
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 791 place count 1062 transition count 1589
Applied a total of 791 rules in 983 ms. Remains 1062 /1550 variables (removed 488) and now considering 1589/2118 (removed 529) transitions.
[2022-05-16 03:33:34] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2022-05-16 03:33:34] [INFO ] Computed 24 place invariants in 42 ms
[2022-05-16 03:33:35] [INFO ] Implicit Places using invariants in 1079 ms returned []
[2022-05-16 03:33:35] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2022-05-16 03:33:35] [INFO ] Computed 24 place invariants in 42 ms
[2022-05-16 03:33:38] [INFO ] Implicit Places using invariants and state equation in 2749 ms returned []
Implicit Place search using SMT with State Equation took 3831 ms to find 0 implicit places.
[2022-05-16 03:33:38] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-16 03:33:38] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2022-05-16 03:33:38] [INFO ] Computed 24 place invariants in 70 ms
[2022-05-16 03:33:40] [INFO ] Dead Transitions using invariants and state equation in 2087 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1062/1550 places, 1589/2118 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1550 places, 1589/2118 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s942 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3512 reset in 1902 ms.
Product exploration explored 100000 steps with 3528 reset in 1690 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 362 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 206325 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206325 steps, saw 69331 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-16 03:33:48] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2022-05-16 03:33:48] [INFO ] Computed 24 place invariants in 44 ms
[2022-05-16 03:33:48] [INFO ] [Real]Absence check using 24 positive place invariants in 17 ms returned sat
[2022-05-16 03:33:49] [INFO ] After 1120ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 03:33:49] [INFO ] After 1221ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-05-16 03:33:49] [INFO ] After 1518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1062/1062 places, 1589/1589 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1062 transition count 1545
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1040 transition count 1523
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1040 transition count 1523
Free-agglomeration rule applied 926 times.
Iterating global reduction 1 with 926 rules applied. Total rules applied 1014 place count 1040 transition count 597
Reduce places removed 927 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 203 edges and 113 vertex of which 13 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.2 ms
Discarding 100 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Graph (trivial) has 50 edges and 13 vertex of which 4 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 1369 rules applied. Total rules applied 2383 place count 11 transition count 57
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2427 place count 11 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2427 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2431 place count 9 transition count 11
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2433 place count 9 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2437 place count 7 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2439 place count 7 transition count 5
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2445 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2445 place count 3 transition count 2
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 2447 place count 2 transition count 2
Applied a total of 2447 rules in 291 ms. Remains 2 /1062 variables (removed 1060) and now considering 2/1589 (removed 1587) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1062 places, 2/1589 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 290 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1589/1589 transitions.
Applied a total of 0 rules in 149 ms. Remains 1062 /1062 variables (removed 0) and now considering 1589/1589 (removed 0) transitions.
[2022-05-16 03:33:50] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2022-05-16 03:33:50] [INFO ] Computed 24 place invariants in 71 ms
[2022-05-16 03:33:51] [INFO ] Implicit Places using invariants in 1353 ms returned []
[2022-05-16 03:33:51] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2022-05-16 03:33:52] [INFO ] Computed 24 place invariants in 48 ms
[2022-05-16 03:33:54] [INFO ] Implicit Places using invariants and state equation in 2625 ms returned []
Implicit Place search using SMT with State Equation took 3990 ms to find 0 implicit places.
[2022-05-16 03:33:54] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-16 03:33:54] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2022-05-16 03:33:54] [INFO ] Computed 24 place invariants in 46 ms
[2022-05-16 03:33:55] [INFO ] Dead Transitions using invariants and state equation in 1227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1062 places, 1589/1589 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 357 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 268385 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268385 steps, saw 78143 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-16 03:33:59] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2022-05-16 03:33:59] [INFO ] Computed 24 place invariants in 70 ms
[2022-05-16 03:34:00] [INFO ] [Real]Absence check using 24 positive place invariants in 18 ms returned sat
[2022-05-16 03:34:00] [INFO ] After 878ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 03:34:01] [INFO ] After 1023ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-16 03:34:01] [INFO ] After 1332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1062/1062 places, 1589/1589 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1062 transition count 1545
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1040 transition count 1523
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1040 transition count 1523
Free-agglomeration rule applied 926 times.
Iterating global reduction 1 with 926 rules applied. Total rules applied 1014 place count 1040 transition count 597
Reduce places removed 927 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 203 edges and 113 vertex of which 13 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.0 ms
Discarding 100 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Graph (trivial) has 50 edges and 13 vertex of which 4 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 1369 rules applied. Total rules applied 2383 place count 11 transition count 57
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2427 place count 11 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2427 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2431 place count 9 transition count 11
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2433 place count 9 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2437 place count 7 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2439 place count 7 transition count 5
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2445 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2445 place count 3 transition count 2
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 2447 place count 2 transition count 2
Applied a total of 2447 rules in 460 ms. Remains 2 /1062 variables (removed 1060) and now considering 2/1589 (removed 1587) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1062 places, 2/1589 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3523 reset in 1822 ms.
Product exploration explored 100000 steps with 3514 reset in 1622 ms.
Built C files in :
/tmp/ltsmin2835458942347440351
[2022-05-16 03:34:05] [INFO ] Too many transitions (1589) to apply POR reductions. Disabling POR matrices.
[2022-05-16 03:34:05] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2835458942347440351
Running compilation step : cd /tmp/ltsmin2835458942347440351;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2835458942347440351;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2835458942347440351;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1589/1589 transitions.
Applied a total of 0 rules in 138 ms. Remains 1062 /1062 variables (removed 0) and now considering 1589/1589 (removed 0) transitions.
[2022-05-16 03:34:08] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2022-05-16 03:34:08] [INFO ] Computed 24 place invariants in 44 ms
[2022-05-16 03:34:10] [INFO ] Implicit Places using invariants in 1631 ms returned []
[2022-05-16 03:34:10] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2022-05-16 03:34:10] [INFO ] Computed 24 place invariants in 50 ms
[2022-05-16 03:34:12] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 3535 ms to find 0 implicit places.
[2022-05-16 03:34:12] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-16 03:34:12] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2022-05-16 03:34:12] [INFO ] Computed 24 place invariants in 45 ms
[2022-05-16 03:34:13] [INFO ] Dead Transitions using invariants and state equation in 1520 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1062 places, 1589/1589 transitions.
Built C files in :
/tmp/ltsmin17174131259294314383
[2022-05-16 03:34:13] [INFO ] Too many transitions (1589) to apply POR reductions. Disabling POR matrices.
[2022-05-16 03:34:13] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17174131259294314383
Running compilation step : cd /tmp/ltsmin17174131259294314383;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17174131259294314383;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17174131259294314383;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 03:34:16] [INFO ] Flatten gal took : 56 ms
[2022-05-16 03:34:16] [INFO ] Flatten gal took : 76 ms
[2022-05-16 03:34:16] [INFO ] Time to serialize gal into /tmp/LTL17634192031325236768.gal : 15 ms
[2022-05-16 03:34:16] [INFO ] Time to serialize properties into /tmp/LTL18268295546317340103.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17634192031325236768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18268295546317340103.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1763419...268
Read 1 LTL properties
Checking formula 0 : !((F(G("(p5877!=1)"))))
Formula 0 simplified : !FG"(p5877!=1)"
Detected timeout of ITS tools.
[2022-05-16 03:34:32] [INFO ] Flatten gal took : 52 ms
[2022-05-16 03:34:32] [INFO ] Applying decomposition
[2022-05-16 03:34:32] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13767174771499262293.txt' '-o' '/tmp/graph13767174771499262293.bin' '-w' '/tmp/graph13767174771499262293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13767174771499262293.bin' '-l' '-1' '-v' '-w' '/tmp/graph13767174771499262293.weights' '-q' '0' '-e' '0.001'
[2022-05-16 03:34:32] [INFO ] Decomposing Gal with order
[2022-05-16 03:34:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 03:34:32] [INFO ] Removed a total of 615 redundant transitions.
[2022-05-16 03:34:32] [INFO ] Flatten gal took : 403 ms
[2022-05-16 03:34:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 33 ms.
[2022-05-16 03:34:32] [INFO ] Time to serialize gal into /tmp/LTL5522164786905194738.gal : 13 ms
[2022-05-16 03:34:32] [INFO ] Time to serialize properties into /tmp/LTL13793529632574451791.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5522164786905194738.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13793529632574451791.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5522164...246
Read 1 LTL properties
Checking formula 0 : !((F(G("(i4.u67.p5877!=1)"))))
Formula 0 simplified : !FG"(i4.u67.p5877!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4634885878219902938
[2022-05-16 03:34:48] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4634885878219902938
Running compilation step : cd /tmp/ltsmin4634885878219902938;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4634885878219902938;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4634885878219902938;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-11 finished in 77256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(F((G(p0)||p1))))||p2))))'
Support contains 5 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2118/2118 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1531 transition count 2099
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1531 transition count 2099
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 1531 transition count 2097
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 56 place count 1515 transition count 2081
Iterating global reduction 1 with 16 rules applied. Total rules applied 72 place count 1515 transition count 2081
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 80 place count 1515 transition count 2073
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 87 place count 1508 transition count 2066
Iterating global reduction 2 with 7 rules applied. Total rules applied 94 place count 1508 transition count 2066
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 1508 transition count 2060
Applied a total of 100 rules in 307 ms. Remains 1508 /1550 variables (removed 42) and now considering 2060/2118 (removed 58) transitions.
// Phase 1: matrix 2060 rows 1508 cols
[2022-05-16 03:34:51] [INFO ] Computed 24 place invariants in 39 ms
[2022-05-16 03:34:52] [INFO ] Implicit Places using invariants in 1633 ms returned []
// Phase 1: matrix 2060 rows 1508 cols
[2022-05-16 03:34:53] [INFO ] Computed 24 place invariants in 60 ms
[2022-05-16 03:34:55] [INFO ] Implicit Places using invariants and state equation in 2684 ms returned []
Implicit Place search using SMT with State Equation took 4325 ms to find 0 implicit places.
// Phase 1: matrix 2060 rows 1508 cols
[2022-05-16 03:34:55] [INFO ] Computed 24 place invariants in 85 ms
[2022-05-16 03:34:58] [INFO ] Dead Transitions using invariants and state equation in 2393 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1550 places, 2060/2118 transitions.
Finished structural reductions, in 1 iterations. Remains : 1508/1550 places, 2060/2118 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(EQ s1004 0), p0:(EQ s1315 1), p1:(AND (EQ s512 1) (EQ s821 1) (EQ s1275 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1314 ms.
Product exploration explored 100000 steps with 33333 reset in 1204 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-13 finished in 9899 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(p0)) U (X(F(!F(p1)))||p2)))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2118/2118 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1531 transition count 2099
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1531 transition count 2099
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 1531 transition count 2096
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 1515 transition count 2080
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 1515 transition count 2080
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 82 place count 1515 transition count 2071
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 1509 transition count 2065
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 1509 transition count 2065
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 99 place count 1509 transition count 2060
Applied a total of 99 rules in 329 ms. Remains 1509 /1550 variables (removed 41) and now considering 2060/2118 (removed 58) transitions.
// Phase 1: matrix 2060 rows 1509 cols
[2022-05-16 03:35:01] [INFO ] Computed 24 place invariants in 43 ms
[2022-05-16 03:35:02] [INFO ] Implicit Places using invariants in 1577 ms returned []
// Phase 1: matrix 2060 rows 1509 cols
[2022-05-16 03:35:02] [INFO ] Computed 24 place invariants in 42 ms
[2022-05-16 03:35:05] [INFO ] Implicit Places using invariants and state equation in 2772 ms returned []
Implicit Place search using SMT with State Equation took 4352 ms to find 0 implicit places.
// Phase 1: matrix 2060 rows 1509 cols
[2022-05-16 03:35:05] [INFO ] Computed 24 place invariants in 42 ms
[2022-05-16 03:35:07] [INFO ] Dead Transitions using invariants and state equation in 2299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1509/1550 places, 2060/2118 transitions.
Finished structural reductions, in 1 iterations. Remains : 1509/1550 places, 2060/2118 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s726 1), p1:(EQ s637 1), p0:(EQ s633 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 2103 reset in 617 ms.
Product exploration explored 100000 steps with 2088 reset in 653 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Detected a total of 25/1509 stabilizing places and 25/2060 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 652 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2060 rows 1509 cols
[2022-05-16 03:35:10] [INFO ] Computed 24 place invariants in 43 ms
[2022-05-16 03:35:11] [INFO ] [Real]Absence check using 24 positive place invariants in 24 ms returned sat
[2022-05-16 03:35:11] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 03:35:11] [INFO ] [Nat]Absence check using 24 positive place invariants in 33 ms returned sat
[2022-05-16 03:35:13] [INFO ] After 1323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 03:35:13] [INFO ] After 1667ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 182 ms.
[2022-05-16 03:35:13] [INFO ] After 2391ms 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 10 ms.
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1509/1509 places, 2060/2060 transitions.
Graph (trivial) has 1416 edges and 1509 vertex of which 127 / 1509 are part of one of the 21 SCC in 1 ms
Free SCC test removed 106 places
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 1403 transition count 1824
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 217 place count 1295 transition count 1824
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 217 place count 1295 transition count 1777
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 311 place count 1248 transition count 1777
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 352 place count 1207 transition count 1736
Iterating global reduction 2 with 41 rules applied. Total rules applied 393 place count 1207 transition count 1736
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 669 place count 1069 transition count 1598
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 712 place count 1069 transition count 1555
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 734 place count 1047 transition count 1533
Iterating global reduction 3 with 22 rules applied. Total rules applied 756 place count 1047 transition count 1533
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 758 place count 1046 transition count 1533
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 760 place count 1046 transition count 1531
Free-agglomeration rule applied 906 times.
Iterating global reduction 3 with 906 rules applied. Total rules applied 1666 place count 1046 transition count 625
Reduce places removed 906 places and 0 transitions.
Drop transitions removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 3 with 1306 rules applied. Total rules applied 2972 place count 140 transition count 225
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 2993 place count 140 transition count 204
Graph (complete) has 382 edges and 140 vertex of which 135 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 2994 place count 135 transition count 204
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 3001 place count 135 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3001 place count 135 transition count 196
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3003 place count 134 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3004 place count 133 transition count 195
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 147 edges and 131 vertex of which 102 / 131 are part of one of the 21 SCC in 0 ms
Free SCC test removed 81 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 6 with 4 rules applied. Total rules applied 3008 place count 50 transition count 194
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 142 transitions
Reduce isomorphic transitions removed 142 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 7 with 150 rules applied. Total rules applied 3158 place count 43 transition count 51
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 3 rules applied. Total rules applied 3161 place count 42 transition count 49
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 9 with 8 rules applied. Total rules applied 3169 place count 41 transition count 42
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 3183 place count 34 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3184 place count 34 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 3185 place count 33 transition count 34
Applied a total of 3185 rules in 699 ms. Remains 33 /1509 variables (removed 1476) and now considering 34/2060 (removed 2026) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/1509 places, 34/2060 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 11 factoid took 838 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 2060/2060 transitions.
Applied a total of 0 rules in 110 ms. Remains 1509 /1509 variables (removed 0) and now considering 2060/2060 (removed 0) transitions.
// Phase 1: matrix 2060 rows 1509 cols
[2022-05-16 03:35:15] [INFO ] Computed 24 place invariants in 41 ms
[2022-05-16 03:35:17] [INFO ] Implicit Places using invariants in 1669 ms returned []
// Phase 1: matrix 2060 rows 1509 cols
[2022-05-16 03:35:17] [INFO ] Computed 24 place invariants in 41 ms
[2022-05-16 03:35:20] [INFO ] Implicit Places using invariants and state equation in 2678 ms returned []
Implicit Place search using SMT with State Equation took 4354 ms to find 0 implicit places.
// Phase 1: matrix 2060 rows 1509 cols
[2022-05-16 03:35:20] [INFO ] Computed 24 place invariants in 44 ms
[2022-05-16 03:35:22] [INFO ] Dead Transitions using invariants and state equation in 2134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1509/1509 places, 2060/2060 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Detected a total of 25/1509 stabilizing places and 25/2060 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 529 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2060 rows 1509 cols
[2022-05-16 03:35:23] [INFO ] Computed 24 place invariants in 67 ms
[2022-05-16 03:35:23] [INFO ] [Real]Absence check using 24 positive place invariants in 23 ms returned sat
[2022-05-16 03:35:23] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 03:35:23] [INFO ] [Nat]Absence check using 24 positive place invariants in 20 ms returned sat
[2022-05-16 03:35:25] [INFO ] After 1090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 03:35:25] [INFO ] After 1346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 145 ms.
[2022-05-16 03:35:25] [INFO ] After 1815ms 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 7 ms.
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1509/1509 places, 2060/2060 transitions.
Graph (trivial) has 1416 edges and 1509 vertex of which 127 / 1509 are part of one of the 21 SCC in 0 ms
Free SCC test removed 106 places
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 1403 transition count 1824
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 217 place count 1295 transition count 1824
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 217 place count 1295 transition count 1777
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 311 place count 1248 transition count 1777
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 352 place count 1207 transition count 1736
Iterating global reduction 2 with 41 rules applied. Total rules applied 393 place count 1207 transition count 1736
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 1 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 669 place count 1069 transition count 1598
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 712 place count 1069 transition count 1555
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 734 place count 1047 transition count 1533
Iterating global reduction 3 with 22 rules applied. Total rules applied 756 place count 1047 transition count 1533
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 3 with 2 rules applied. Total rules applied 758 place count 1046 transition count 1533
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 760 place count 1046 transition count 1531
Free-agglomeration rule applied 906 times.
Iterating global reduction 3 with 906 rules applied. Total rules applied 1666 place count 1046 transition count 625
Reduce places removed 906 places and 0 transitions.
Drop transitions removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 3 with 1306 rules applied. Total rules applied 2972 place count 140 transition count 225
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 2993 place count 140 transition count 204
Graph (complete) has 382 edges and 140 vertex of which 135 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 2994 place count 135 transition count 204
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 3001 place count 135 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3001 place count 135 transition count 196
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3003 place count 134 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3004 place count 133 transition count 195
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 147 edges and 131 vertex of which 102 / 131 are part of one of the 21 SCC in 0 ms
Free SCC test removed 81 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 6 with 4 rules applied. Total rules applied 3008 place count 50 transition count 194
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 142 transitions
Reduce isomorphic transitions removed 142 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 7 with 150 rules applied. Total rules applied 3158 place count 43 transition count 51
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 3 rules applied. Total rules applied 3161 place count 42 transition count 49
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 9 with 8 rules applied. Total rules applied 3169 place count 41 transition count 42
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 3183 place count 34 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3184 place count 34 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 3185 place count 33 transition count 34
Applied a total of 3185 rules in 666 ms. Remains 33 /1509 variables (removed 1476) and now considering 34/2060 (removed 2026) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/1509 places, 34/2060 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 13 factoid took 665 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 2088 reset in 677 ms.
Product exploration explored 100000 steps with 2099 reset in 589 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1509/1509 places, 2060/2060 transitions.
Graph (trivial) has 1416 edges and 1509 vertex of which 127 / 1509 are part of one of the 21 SCC in 1 ms
Free SCC test removed 106 places
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 1403 transition count 1953
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 65 Pre rules applied. Total rules applied 89 place count 1403 transition count 1954
Deduced a syphon composed of 153 places in 3 ms
Iterating global reduction 1 with 65 rules applied. Total rules applied 154 place count 1403 transition count 1954
Discarding 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 257 place count 1300 transition count 1851
Deduced a syphon composed of 91 places in 2 ms
Iterating global reduction 1 with 103 rules applied. Total rules applied 360 place count 1300 transition count 1851
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 478 place count 1300 transition count 1895
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 529 place count 1249 transition count 1844
Deduced a syphon composed of 158 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 580 place count 1249 transition count 1844
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 181 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 603 place count 1249 transition count 1891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 604 place count 1248 transition count 1889
Deduced a syphon composed of 180 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 605 place count 1248 transition count 1889
Deduced a syphon composed of 180 places in 1 ms
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 1 with 45 rules applied. Total rules applied 650 place count 1248 transition count 1844
Deduced a syphon composed of 180 places in 1 ms
Applied a total of 650 rules in 1285 ms. Remains 1248 /1509 variables (removed 261) and now considering 1844/2060 (removed 216) transitions.
[2022-05-16 03:35:30] [INFO ] Redundant transitions in 38 ms returned []
[2022-05-16 03:35:30] [INFO ] Flow matrix only has 1802 transitions (discarded 42 similar events)
// Phase 1: matrix 1802 rows 1248 cols
[2022-05-16 03:35:30] [INFO ] Computed 24 place invariants in 50 ms
[2022-05-16 03:35:32] [INFO ] Dead Transitions using invariants and state equation in 1827 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1248/1509 places, 1844/2060 transitions.
Finished structural reductions, in 1 iterations. Remains : 1248/1509 places, 1844/2060 transitions.
Product exploration explored 100000 steps with 7115 reset in 2691 ms.
Product exploration explored 100000 steps with 7118 reset in 2551 ms.
Built C files in :
/tmp/ltsmin16850265104663683812
[2022-05-16 03:35:37] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16850265104663683812
Running compilation step : cd /tmp/ltsmin16850265104663683812;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16850265104663683812;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16850265104663683812;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 2060/2060 transitions.
Applied a total of 0 rules in 65 ms. Remains 1509 /1509 variables (removed 0) and now considering 2060/2060 (removed 0) transitions.
// Phase 1: matrix 2060 rows 1509 cols
[2022-05-16 03:35:40] [INFO ] Computed 24 place invariants in 39 ms
[2022-05-16 03:35:42] [INFO ] Implicit Places using invariants in 1619 ms returned []
// Phase 1: matrix 2060 rows 1509 cols
[2022-05-16 03:35:42] [INFO ] Computed 24 place invariants in 97 ms
[2022-05-16 03:35:45] [INFO ] Implicit Places using invariants and state equation in 3458 ms returned []
Implicit Place search using SMT with State Equation took 5101 ms to find 0 implicit places.
// Phase 1: matrix 2060 rows 1509 cols
[2022-05-16 03:35:45] [INFO ] Computed 24 place invariants in 43 ms
[2022-05-16 03:35:47] [INFO ] Dead Transitions using invariants and state equation in 1413 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1509/1509 places, 2060/2060 transitions.
Built C files in :
/tmp/ltsmin18013161764639714855
[2022-05-16 03:35:47] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18013161764639714855
Running compilation step : cd /tmp/ltsmin18013161764639714855;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18013161764639714855;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18013161764639714855;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 03:35:50] [INFO ] Flatten gal took : 115 ms
[2022-05-16 03:35:50] [INFO ] Flatten gal took : 81 ms
[2022-05-16 03:35:50] [INFO ] Time to serialize gal into /tmp/LTL3687945315397285540.gal : 11 ms
[2022-05-16 03:35:50] [INFO ] Time to serialize properties into /tmp/LTL17603483397913311947.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3687945315397285540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17603483397913311947.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3687945...267
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(p2570==1)")))U((X(F(!(F("(p2634==1)")))))||("(p2953==1)"))))))
Formula 0 simplified : !XG(XF"(p2570==1)" U ("(p2953==1)" | XF!F"(p2634==1)"))
Detected timeout of ITS tools.
[2022-05-16 03:36:05] [INFO ] Flatten gal took : 84 ms
[2022-05-16 03:36:05] [INFO ] Applying decomposition
[2022-05-16 03:36:05] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4229380855178557594.txt' '-o' '/tmp/graph4229380855178557594.bin' '-w' '/tmp/graph4229380855178557594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4229380855178557594.bin' '-l' '-1' '-v' '-w' '/tmp/graph4229380855178557594.weights' '-q' '0' '-e' '0.001'
[2022-05-16 03:36:06] [INFO ] Decomposing Gal with order
[2022-05-16 03:36:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 03:36:06] [INFO ] Removed a total of 615 redundant transitions.
[2022-05-16 03:36:06] [INFO ] Flatten gal took : 429 ms
[2022-05-16 03:36:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 38 ms.
[2022-05-16 03:36:06] [INFO ] Time to serialize gal into /tmp/LTL16125923674955265022.gal : 17 ms
[2022-05-16 03:36:06] [INFO ] Time to serialize properties into /tmp/LTL17575459109851873546.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16125923674955265022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17575459109851873546.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1612592...247
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(i13.i1.i0.u148.p2570==1)")))U((X(F(!(F("(i13.i1.i1.u147.p2634==1)")))))||("(i14.u167.p2953==1)"))))))
Formula 0 simplified : !XG(XF"(i13.i1.i0.u148.p2570==1)" U ("(i14.u167.p2953==1)" | XF!F"(i13.i1.i1.u147.p2634==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6686231937823148548
[2022-05-16 03:36:21] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6686231937823148548
Running compilation step : cd /tmp/ltsmin6686231937823148548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6686231937823148548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6686231937823148548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-14 finished in 83957 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(p0)) U (X(F(!F(p1)))||p2)))))'
Found a SL insensitive property : FlexibleBarrier-PT-22b-LTLFireability-14
Stuttering acceptance computed with spot in 160 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1550/1550 places, 2118/2118 transitions.
Graph (trivial) has 1457 edges and 1550 vertex of which 127 / 1550 are part of one of the 21 SCC in 0 ms
Free SCC test removed 106 places
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 1443 transition count 1901
Reduce places removed 109 places and 0 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 219 place count 1334 transition count 1901
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 219 place count 1334 transition count 1848
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 325 place count 1281 transition count 1848
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 385 place count 1221 transition count 1788
Iterating global reduction 2 with 60 rules applied. Total rules applied 445 place count 1221 transition count 1788
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 448 place count 1221 transition count 1785
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 448 place count 1221 transition count 1784
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 450 place count 1220 transition count 1784
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 461 place count 1209 transition count 1773
Iterating global reduction 3 with 11 rules applied. Total rules applied 472 place count 1209 transition count 1773
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 483 place count 1209 transition count 1762
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 4 with 272 rules applied. Total rules applied 755 place count 1073 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 758 place count 1070 transition count 1623
Iterating global reduction 4 with 3 rules applied. Total rules applied 761 place count 1070 transition count 1623
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 764 place count 1070 transition count 1620
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 766 place count 1069 transition count 1620
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 789 place count 1069 transition count 1597
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 791 place count 1067 transition count 1595
Applied a total of 791 rules in 775 ms. Remains 1067 /1550 variables (removed 483) and now considering 1595/2118 (removed 523) transitions.
[2022-05-16 03:36:26] [INFO ] Flow matrix only has 1553 transitions (discarded 42 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2022-05-16 03:36:26] [INFO ] Computed 24 place invariants in 70 ms
[2022-05-16 03:36:27] [INFO ] Implicit Places using invariants in 1189 ms returned []
[2022-05-16 03:36:27] [INFO ] Flow matrix only has 1553 transitions (discarded 42 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2022-05-16 03:36:27] [INFO ] Computed 24 place invariants in 46 ms
[2022-05-16 03:36:29] [INFO ] Implicit Places using invariants and state equation in 2512 ms returned []
Implicit Place search using SMT with State Equation took 3719 ms to find 0 implicit places.
[2022-05-16 03:36:29] [INFO ] Flow matrix only has 1553 transitions (discarded 42 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2022-05-16 03:36:29] [INFO ] Computed 24 place invariants in 48 ms
[2022-05-16 03:36:31] [INFO ] Dead Transitions using invariants and state equation in 1624 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1067/1550 places, 1595/2118 transitions.
Finished structural reductions, in 1 iterations. Remains : 1067/1550 places, 1595/2118 transitions.
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s424 1), p1:(EQ s366 1), p0:(EQ s365 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 8640 reset in 2216 ms.
Product exploration explored 100000 steps with 8656 reset in 2219 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1067 stabilizing places and 2/1595 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 950 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 321 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 03:36:37] [INFO ] Flow matrix only has 1553 transitions (discarded 42 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2022-05-16 03:36:37] [INFO ] Computed 24 place invariants in 72 ms
[2022-05-16 03:36:38] [INFO ] [Real]Absence check using 24 positive place invariants in 22 ms returned sat
[2022-05-16 03:36:38] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 03:36:38] [INFO ] [Nat]Absence check using 24 positive place invariants in 22 ms returned sat
[2022-05-16 03:36:39] [INFO ] After 1166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 03:36:40] [INFO ] After 1466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 189 ms.
[2022-05-16 03:36:40] [INFO ] After 2089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1067/1067 places, 1595/1595 transitions.
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 1067 transition count 1552
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 65 place count 1045 transition count 1530
Iterating global reduction 1 with 22 rules applied. Total rules applied 87 place count 1045 transition count 1530
Free-agglomeration rule applied 906 times.
Iterating global reduction 1 with 906 rules applied. Total rules applied 993 place count 1045 transition count 624
Reduce places removed 908 places and 0 transitions.
Drop transitions removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Graph (trivial) has 155 edges and 137 vertex of which 107 / 137 are part of one of the 22 SCC in 0 ms
Free SCC test removed 85 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 1 with 1310 rules applied. Total rules applied 2303 place count 52 transition count 223
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 149 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 156 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 2 with 165 rules applied. Total rules applied 2468 place count 44 transition count 66
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 3 rules applied. Total rules applied 2471 place count 43 transition count 64
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 4 with 8 rules applied. Total rules applied 2479 place count 42 transition count 57
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2493 place count 35 transition count 50
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 2507 place count 35 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2507 place count 35 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2509 place count 34 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2510 place count 34 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2511 place count 33 transition count 34
Applied a total of 2511 rules in 737 ms. Remains 33 /1067 variables (removed 1034) and now considering 34/1595 (removed 1561) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/1067 places, 34/1595 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) p0)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 783 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Support contains 3 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1595/1595 transitions.
Applied a total of 0 rules in 38 ms. Remains 1067 /1067 variables (removed 0) and now considering 1595/1595 (removed 0) transitions.
[2022-05-16 03:36:42] [INFO ] Flow matrix only has 1553 transitions (discarded 42 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2022-05-16 03:36:42] [INFO ] Computed 24 place invariants in 41 ms
[2022-05-16 03:36:43] [INFO ] Implicit Places using invariants in 1441 ms returned []
[2022-05-16 03:36:43] [INFO ] Flow matrix only has 1553 transitions (discarded 42 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2022-05-16 03:36:43] [INFO ] Computed 24 place invariants in 61 ms
[2022-05-16 03:36:46] [INFO ] Implicit Places using invariants and state equation in 2528 ms returned []
Implicit Place search using SMT with State Equation took 3985 ms to find 0 implicit places.
[2022-05-16 03:36:46] [INFO ] Flow matrix only has 1553 transitions (discarded 42 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2022-05-16 03:36:46] [INFO ] Computed 24 place invariants in 43 ms
[2022-05-16 03:36:47] [INFO ] Dead Transitions using invariants and state equation in 1706 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1067/1067 places, 1595/1595 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1067 stabilizing places and 2/1595 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 638 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 325 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 03:36:49] [INFO ] Flow matrix only has 1553 transitions (discarded 42 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2022-05-16 03:36:49] [INFO ] Computed 24 place invariants in 42 ms
[2022-05-16 03:36:49] [INFO ] [Real]Absence check using 24 positive place invariants in 17 ms returned sat
[2022-05-16 03:36:49] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 03:36:50] [INFO ] [Nat]Absence check using 24 positive place invariants in 15 ms returned sat
[2022-05-16 03:36:51] [INFO ] After 840ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 03:36:51] [INFO ] After 1079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 136 ms.
[2022-05-16 03:36:51] [INFO ] After 1460ms 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 1067 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1067/1067 places, 1595/1595 transitions.
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 1067 transition count 1552
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 65 place count 1045 transition count 1530
Iterating global reduction 1 with 22 rules applied. Total rules applied 87 place count 1045 transition count 1530
Free-agglomeration rule applied 906 times.
Iterating global reduction 1 with 906 rules applied. Total rules applied 993 place count 1045 transition count 624
Reduce places removed 908 places and 0 transitions.
Drop transitions removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Graph (trivial) has 155 edges and 137 vertex of which 107 / 137 are part of one of the 22 SCC in 0 ms
Free SCC test removed 85 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 1 with 1310 rules applied. Total rules applied 2303 place count 52 transition count 223
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 149 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 156 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 2 with 165 rules applied. Total rules applied 2468 place count 44 transition count 66
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 3 rules applied. Total rules applied 2471 place count 43 transition count 64
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 4 with 8 rules applied. Total rules applied 2479 place count 42 transition count 57
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2493 place count 35 transition count 50
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 2507 place count 35 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2507 place count 35 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2509 place count 34 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2510 place count 34 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2511 place count 33 transition count 34
Applied a total of 2511 rules in 499 ms. Remains 33 /1067 variables (removed 1034) and now considering 34/1595 (removed 1561) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/1067 places, 34/1595 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p2) p0)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 8 factoid took 730 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 8690 reset in 2121 ms.
Product exploration explored 100000 steps with 8700 reset in 1869 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Support contains 3 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1595/1595 transitions.
Applied a total of 0 rules in 186 ms. Remains 1067 /1067 variables (removed 0) and now considering 1595/1595 (removed 0) transitions.
[2022-05-16 03:36:57] [INFO ] Redundant transitions in 37 ms returned []
[2022-05-16 03:36:57] [INFO ] Flow matrix only has 1553 transitions (discarded 42 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2022-05-16 03:36:57] [INFO ] Computed 24 place invariants in 57 ms
[2022-05-16 03:36:59] [INFO ] Dead Transitions using invariants and state equation in 1845 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1067/1067 places, 1595/1595 transitions.
Product exploration explored 100000 steps with 8665 reset in 2273 ms.
Product exploration explored 100000 steps with 8664 reset in 2263 ms.
Built C files in :
/tmp/ltsmin16348173648007210861
[2022-05-16 03:37:04] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16348173648007210861
Running compilation step : cd /tmp/ltsmin16348173648007210861;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16348173648007210861;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16348173648007210861;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1595/1595 transitions.
Applied a total of 0 rules in 33 ms. Remains 1067 /1067 variables (removed 0) and now considering 1595/1595 (removed 0) transitions.
[2022-05-16 03:37:07] [INFO ] Flow matrix only has 1553 transitions (discarded 42 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2022-05-16 03:37:07] [INFO ] Computed 24 place invariants in 42 ms
[2022-05-16 03:37:08] [INFO ] Implicit Places using invariants in 1306 ms returned []
[2022-05-16 03:37:08] [INFO ] Flow matrix only has 1553 transitions (discarded 42 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2022-05-16 03:37:08] [INFO ] Computed 24 place invariants in 41 ms
[2022-05-16 03:37:11] [INFO ] Implicit Places using invariants and state equation in 2495 ms returned []
Implicit Place search using SMT with State Equation took 3807 ms to find 0 implicit places.
[2022-05-16 03:37:11] [INFO ] Flow matrix only has 1553 transitions (discarded 42 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2022-05-16 03:37:11] [INFO ] Computed 24 place invariants in 77 ms
[2022-05-16 03:37:12] [INFO ] Dead Transitions using invariants and state equation in 1862 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1067/1067 places, 1595/1595 transitions.
Built C files in :
/tmp/ltsmin14460842341842403384
[2022-05-16 03:37:13] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14460842341842403384
Running compilation step : cd /tmp/ltsmin14460842341842403384;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14460842341842403384;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14460842341842403384;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 03:37:16] [INFO ] Flatten gal took : 84 ms
[2022-05-16 03:37:16] [INFO ] Flatten gal took : 81 ms
[2022-05-16 03:37:16] [INFO ] Time to serialize gal into /tmp/LTL5357888642072314909.gal : 18 ms
[2022-05-16 03:37:16] [INFO ] Time to serialize properties into /tmp/LTL4661883040343678358.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5357888642072314909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4661883040343678358.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5357888...266
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(p2570==1)")))U((X(F(!(F("(p2634==1)")))))||("(p2953==1)"))))))
Formula 0 simplified : !XG(XF"(p2570==1)" U ("(p2953==1)" | XF!F"(p2634==1)"))
Detected timeout of ITS tools.
[2022-05-16 03:37:31] [INFO ] Flatten gal took : 84 ms
[2022-05-16 03:37:31] [INFO ] Applying decomposition
[2022-05-16 03:37:31] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13536114366453271387.txt' '-o' '/tmp/graph13536114366453271387.bin' '-w' '/tmp/graph13536114366453271387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13536114366453271387.bin' '-l' '-1' '-v' '-w' '/tmp/graph13536114366453271387.weights' '-q' '0' '-e' '0.001'
[2022-05-16 03:37:31] [INFO ] Decomposing Gal with order
[2022-05-16 03:37:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 03:37:32] [INFO ] Removed a total of 630 redundant transitions.
[2022-05-16 03:37:32] [INFO ] Flatten gal took : 448 ms
[2022-05-16 03:37:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 20 ms.
[2022-05-16 03:37:32] [INFO ] Time to serialize gal into /tmp/LTL8809041716628194506.gal : 14 ms
[2022-05-16 03:37:32] [INFO ] Time to serialize properties into /tmp/LTL13488702457642542637.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8809041716628194506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13488702457642542637.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8809041...246
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(i13.u42.p2570==1)")))U((X(F(!(F("(i13.u39.p2634==1)")))))||("(i14.u46.p2953==1)"))))))
Formula 0 simplified : !XG(XF"(i13.u42.p2570==1)" U ("(i14.u46.p2953==1)" | XF!F"(i13.u39.p2634==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3530209099240819811
[2022-05-16 03:37:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3530209099240819811
Running compilation step : cd /tmp/ltsmin3530209099240819811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3530209099240819811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3530209099240819811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-14 finished in 85257 ms.
[2022-05-16 03:37:50] [INFO ] Flatten gal took : 55 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4489302904118879346
[2022-05-16 03:37:50] [INFO ] Too many transitions (2118) to apply POR reductions. Disabling POR matrices.
[2022-05-16 03:37:50] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4489302904118879346
Running compilation step : cd /tmp/ltsmin4489302904118879346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 03:37:50] [INFO ] Applying decomposition
[2022-05-16 03:37:50] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5611458370762762236.txt' '-o' '/tmp/graph5611458370762762236.bin' '-w' '/tmp/graph5611458370762762236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5611458370762762236.bin' '-l' '-1' '-v' '-w' '/tmp/graph5611458370762762236.weights' '-q' '0' '-e' '0.001'
[2022-05-16 03:37:50] [INFO ] Decomposing Gal with order
[2022-05-16 03:37:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 03:37:51] [INFO ] Removed a total of 666 redundant transitions.
[2022-05-16 03:37:51] [INFO ] Flatten gal took : 373 ms
[2022-05-16 03:37:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 77 ms.
[2022-05-16 03:37:51] [INFO ] Time to serialize gal into /tmp/LTLFireability1696889270196516029.gal : 39 ms
[2022-05-16 03:37:51] [INFO ] Time to serialize properties into /tmp/LTLFireability6783625515919049914.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1696889270196516029.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6783625515919049914.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 3 LTL properties
Checking formula 0 : !((F(G("(i1.u30.p376!=1)"))))
Formula 0 simplified : !FG"(i1.u30.p376!=1)"
Compilation finished in 8033 ms.
Running link step : cd /tmp/ltsmin4489302904118879346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin4489302904118879346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin4489302904118879346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4489302904118879346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 04:00:09] [INFO ] Applying decomposition
[2022-05-16 04:00:09] [INFO ] Flatten gal took : 258 ms
[2022-05-16 04:00:09] [INFO ] Decomposing Gal with order
[2022-05-16 04:00:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 04:00:10] [INFO ] Removed a total of 593 redundant transitions.
[2022-05-16 04:00:10] [INFO ] Flatten gal took : 835 ms
[2022-05-16 04:00:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1982 labels/synchronizations in 1241 ms.
[2022-05-16 04:00:12] [INFO ] Time to serialize gal into /tmp/LTLFireability11660298838793289251.gal : 107 ms
[2022-05-16 04:00:12] [INFO ] Time to serialize properties into /tmp/LTLFireability1686731660429307616.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11660298838793289251.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1686731660429307616.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u23.p376!=1)"))))
Formula 0 simplified : !FG"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u23.p376!=1)"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin4489302904118879346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4489302904118879346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(<>((LTLAPp2==true))) U (X(<>(!<>((LTLAPp3==true))))||(LTLAPp4==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 04:22:30] [INFO ] Flatten gal took : 265 ms
[2022-05-16 04:22:30] [INFO ] Input system was already deterministic with 2118 transitions.
[2022-05-16 04:22:30] [INFO ] Transformed 1550 places.
[2022-05-16 04:22:30] [INFO ] Transformed 2118 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-16 04:22:32] [INFO ] Time to serialize gal into /tmp/LTLFireability10069160718501814512.gal : 16 ms
[2022-05-16 04:22:32] [INFO ] Time to serialize properties into /tmp/LTLFireability14407088521086234551.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10069160718501814512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14407088521086234551.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(p376!=1)"))))
Formula 0 simplified : !FG"(p376!=1)"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-22b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-smll-165260575800156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-22b.tgz
mv FlexibleBarrier-PT-22b 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 '
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 ;