fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472282200436
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for FunctionPointer-PT-b008

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16217.560 3600000.00 6351597.00 139614.50 FFFF?F?FFFTFFFTF 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.r312-tall-165472282200436.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 FunctionPointer-PT-b008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282200436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 7 17:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Jun 7 17:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.4K Jun 7 17:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 7 17:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Jun 7 17:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 391K Jun 6 12:11 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 FunctionPointer-PT-b008-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654835000812

Running Version 202205111006
[2022-06-10 04:23:21] [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-06-10 04:23:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 04:23:22] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2022-06-10 04:23:22] [INFO ] Transformed 306 places.
[2022-06-10 04:23:22] [INFO ] Transformed 840 transitions.
[2022-06-10 04:23:22] [INFO ] Parsed PT model containing 306 places and 840 transitions in 268 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b008-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 34 place count 188 transition count 550
Iterating global reduction 1 with 24 rules applied. Total rules applied 58 place count 188 transition count 550
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 128 place count 188 transition count 480
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 137 place count 179 transition count 462
Iterating global reduction 2 with 9 rules applied. Total rules applied 146 place count 179 transition count 462
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 166 place count 179 transition count 442
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 171 place count 174 transition count 432
Iterating global reduction 3 with 5 rules applied. Total rules applied 176 place count 174 transition count 432
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 170 transition count 416
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 170 transition count 416
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 188 place count 166 transition count 408
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 166 transition count 408
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 193 place count 165 transition count 404
Iterating global reduction 3 with 1 rules applied. Total rules applied 194 place count 165 transition count 404
Applied a total of 194 rules in 71 ms. Remains 165 /222 variables (removed 57) and now considering 404/648 (removed 244) transitions.
[2022-06-10 04:23:22] [INFO ] Flow matrix only has 277 transitions (discarded 127 similar events)
// Phase 1: matrix 277 rows 165 cols
[2022-06-10 04:23:22] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 04:23:22] [INFO ] Implicit Places using invariants in 241 ms returned []
[2022-06-10 04:23:22] [INFO ] Flow matrix only has 277 transitions (discarded 127 similar events)
// Phase 1: matrix 277 rows 165 cols
[2022-06-10 04:23:22] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 04:23:22] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-10 04:23:22] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2022-06-10 04:23:22] [INFO ] Flow matrix only has 277 transitions (discarded 127 similar events)
// Phase 1: matrix 277 rows 165 cols
[2022-06-10 04:23:22] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 04:23:23] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/222 places, 404/648 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/222 places, 404/648 transitions.
Support contains 28 out of 165 places after structural reductions.
[2022-06-10 04:23:23] [INFO ] Flatten gal took : 59 ms
[2022-06-10 04:23:23] [INFO ] Flatten gal took : 33 ms
[2022-06-10 04:23:23] [INFO ] Input system was already deterministic with 404 transitions.
Support contains 27 out of 165 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-10 04:23:24] [INFO ] Flow matrix only has 277 transitions (discarded 127 similar events)
// Phase 1: matrix 277 rows 165 cols
[2022-06-10 04:23:24] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 04:23:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 04:23:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:23:24] [INFO ] After 92ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:1
[2022-06-10 04:23:24] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-10 04:23:24] [INFO ] After 30ms SMT Verify possible using 60 Read/Feed constraints in real domain returned unsat :2 sat :0 real:2
[2022-06-10 04:23:24] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-06-10 04:23:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 04:23:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-10 04:23:24] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-06-10 04:23:24] [INFO ] After 38ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2022-06-10 04:23:24] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-06-10 04:23:24] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 165/165 places, 404/404 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 384
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 149 transition count 366
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 149 transition count 366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 143 transition count 346
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 143 transition count 346
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 137 transition count 328
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 137 transition count 328
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 131 transition count 314
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 131 transition count 314
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 125 transition count 298
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 125 transition count 298
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 120 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 115 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 115 transition count 276
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 112 transition count 270
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 112 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 111 transition count 268
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 111 transition count 268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 110 transition count 266
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 110 transition count 266
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 114 place count 110 transition count 262
Applied a total of 114 rules in 84 ms. Remains 110 /165 variables (removed 55) and now considering 262/404 (removed 142) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/165 places, 262/404 transitions.
Finished random walk after 3351 steps, including 5 resets, run visited all 2 properties in 23 ms. (steps per millisecond=145 )
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 24 stabilizing places and 64 stable transitions
FORMULA FunctionPointer-PT-b008-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 404/404 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 382
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 147 transition count 362
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 147 transition count 362
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 140 transition count 338
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 140 transition count 338
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 133 transition count 316
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 133 transition count 316
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 126 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 126 transition count 300
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 119 transition count 282
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 119 transition count 282
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 113 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 113 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 110 place count 107 transition count 256
Iterating global reduction 0 with 6 rules applied. Total rules applied 116 place count 107 transition count 256
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 121 place count 102 transition count 246
Iterating global reduction 0 with 5 rules applied. Total rules applied 126 place count 102 transition count 246
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 100 transition count 242
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 100 transition count 242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 135 place count 97 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 136 place count 97 transition count 236
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 138 place count 97 transition count 234
Applied a total of 138 rules in 127 ms. Remains 97 /165 variables (removed 68) and now considering 234/404 (removed 170) transitions.
[2022-06-10 04:23:25] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 04:23:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:23:25] [INFO ] Implicit Places using invariants in 139 ms returned []
[2022-06-10 04:23:25] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 04:23:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:23:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-10 04:23:25] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2022-06-10 04:23:25] [INFO ] Redundant transitions in 11 ms returned []
[2022-06-10 04:23:25] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 04:23:25] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 04:23:25] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/165 places, 234/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/165 places, 234/404 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s40 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 344 steps with 0 reset in 9 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-02 finished in 858 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 404/404 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 386
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 386
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 149 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 149 transition count 368
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 143 transition count 346
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 143 transition count 346
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 137 transition count 326
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 137 transition count 326
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 131 transition count 312
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 131 transition count 312
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 125 transition count 296
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 125 transition count 296
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 119 transition count 282
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 119 transition count 282
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 113 transition count 270
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 113 transition count 270
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 109 place count 108 transition count 260
Iterating global reduction 0 with 5 rules applied. Total rules applied 114 place count 108 transition count 260
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 106 transition count 256
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 106 transition count 256
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 104 transition count 252
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 104 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 103 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 103 transition count 250
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 128 place count 103 transition count 246
Applied a total of 128 rules in 51 ms. Remains 103 /165 variables (removed 62) and now considering 246/404 (removed 158) transitions.
[2022-06-10 04:23:25] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 103 cols
[2022-06-10 04:23:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:23:25] [INFO ] Implicit Places using invariants in 73 ms returned []
[2022-06-10 04:23:25] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 103 cols
[2022-06-10 04:23:25] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 04:23:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 04:23:26] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2022-06-10 04:23:26] [INFO ] Redundant transitions in 11 ms returned []
[2022-06-10 04:23:26] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 103 cols
[2022-06-10 04:23:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:23:26] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/165 places, 246/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/165 places, 246/404 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s81 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 620 steps with 0 reset in 10 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-03 finished in 452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||p1)))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 404/404 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 384
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 149 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 149 transition count 368
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 143 transition count 348
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 143 transition count 348
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 137 transition count 328
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 137 transition count 328
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 131 transition count 314
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 131 transition count 314
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 125 transition count 298
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 125 transition count 298
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 120 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 115 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 115 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 105 place count 110 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 110 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 108 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 108 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 106 transition count 258
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 105 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 105 transition count 256
Applied a total of 120 rules in 22 ms. Remains 105 /165 variables (removed 60) and now considering 256/404 (removed 148) transitions.
[2022-06-10 04:23:26] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
// Phase 1: matrix 173 rows 105 cols
[2022-06-10 04:23:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:23:26] [INFO ] Implicit Places using invariants in 59 ms returned []
[2022-06-10 04:23:26] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
// Phase 1: matrix 173 rows 105 cols
[2022-06-10 04:23:26] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 04:23:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 04:23:26] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2022-06-10 04:23:26] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
// Phase 1: matrix 173 rows 105 cols
[2022-06-10 04:23:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:23:26] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/165 places, 256/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/165 places, 256/404 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s97 1)), p0:(OR (LT s0 1) (LT s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 317 reset in 293 ms.
Product exploration explored 100000 steps with 317 reset in 274 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7130 steps, including 9 resets, run visited all 1 properties in 14 ms. (steps per millisecond=509 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 256/256 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 105 transition count 252
Applied a total of 4 rules in 14 ms. Remains 105 /105 variables (removed 0) and now considering 252/256 (removed 4) transitions.
[2022-06-10 04:23:27] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2022-06-10 04:23:28] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 04:23:28] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-06-10 04:23:28] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2022-06-10 04:23:28] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 04:23:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 04:23:28] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2022-06-10 04:23:28] [INFO ] Redundant transitions in 4 ms returned []
[2022-06-10 04:23:28] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2022-06-10 04:23:28] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 04:23:28] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/105 places, 252/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 252/256 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Finished random walk after 431 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=107 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 449 reset in 224 ms.
Product exploration explored 100000 steps with 463 reset in 349 ms.
Built C files in :
/tmp/ltsmin9840267279197005600
[2022-06-10 04:23:29] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2022-06-10 04:23:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:23:29] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2022-06-10 04:23:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:23:29] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2022-06-10 04:23:29] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:23:29] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9840267279197005600
Running compilation step : cd /tmp/ltsmin9840267279197005600;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 660 ms.
Running link step : cd /tmp/ltsmin9840267279197005600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin9840267279197005600;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14286883841522923754.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 252/252 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2022-06-10 04:23:44] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2022-06-10 04:23:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:23:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2022-06-10 04:23:44] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2022-06-10 04:23:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:23:44] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 04:23:44] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2022-06-10 04:23:44] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 04:23:44] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2022-06-10 04:23:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:23:45] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 252/252 transitions.
Built C files in :
/tmp/ltsmin7215716122540803858
[2022-06-10 04:23:45] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2022-06-10 04:23:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:23:45] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2022-06-10 04:23:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:23:45] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2022-06-10 04:23:45] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:23:45] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7215716122540803858
Running compilation step : cd /tmp/ltsmin7215716122540803858;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 465 ms.
Running link step : cd /tmp/ltsmin7215716122540803858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7215716122540803858;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8777331437204363420.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 04:24:00] [INFO ] Flatten gal took : 14 ms
[2022-06-10 04:24:00] [INFO ] Flatten gal took : 15 ms
[2022-06-10 04:24:00] [INFO ] Time to serialize gal into /tmp/LTL3719600685255732099.gal : 6 ms
[2022-06-10 04:24:00] [INFO ] Time to serialize properties into /tmp/LTL8931567980492023239.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/LTL3719600685255732099.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8931567980492023239.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/LTL3719600...266
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((s0<1)||(l170<1))")))||("((s0>=1)&&(l272>=1))"))))
Formula 0 simplified : !X("((s0>=1)&&(l272>=1))" | GF"((s0<1)||(l170<1))")
Detected timeout of ITS tools.
[2022-06-10 04:24:15] [INFO ] Flatten gal took : 14 ms
[2022-06-10 04:24:15] [INFO ] Applying decomposition
[2022-06-10 04:24:15] [INFO ] Flatten gal took : 12 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/graph17681775454049650771.txt' '-o' '/tmp/graph17681775454049650771.bin' '-w' '/tmp/graph17681775454049650771.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17681775454049650771.bin' '-l' '-1' '-v' '-w' '/tmp/graph17681775454049650771.weights' '-q' '0' '-e' '0.001'
[2022-06-10 04:24:15] [INFO ] Decomposing Gal with order
[2022-06-10 04:24:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 04:24:15] [INFO ] Removed a total of 416 redundant transitions.
[2022-06-10 04:24:15] [INFO ] Flatten gal took : 84 ms
[2022-06-10 04:24:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 12 ms.
[2022-06-10 04:24:15] [INFO ] Time to serialize gal into /tmp/LTL13902605294755489724.gal : 4 ms
[2022-06-10 04:24:15] [INFO ] Time to serialize properties into /tmp/LTL404631037490894346.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/LTL13902605294755489724.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL404631037490894346.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/LTL1390260...245
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((i8.u0.s0<1)||(i9.u23.l170<1))")))||("((i8.u0.s0>=1)&&(i8.u15.l272>=1))"))))
Formula 0 simplified : !X("((i8.u0.s0>=1)&&(i8.u15.l272>=1))" | GF"((i8.u0.s0<1)||(i9.u23.l170<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2198011818029652011
[2022-06-10 04:24:30] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2198011818029652011
Running compilation step : cd /tmp/ltsmin2198011818029652011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 352 ms.
Running link step : cd /tmp/ltsmin2198011818029652011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin2198011818029652011;'/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(([](<>((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-b008-LTLFireability-04 finished in 79599 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(X(F(p0)))))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 404/404 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 382
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 147 transition count 362
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 147 transition count 362
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 141 transition count 342
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 141 transition count 342
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 135 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 135 transition count 324
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 129 transition count 310
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 129 transition count 310
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 123 transition count 294
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 118 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 113 transition count 272
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 113 transition count 272
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 109 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 107 transition count 260
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 107 transition count 260
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 105 transition count 256
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 104 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 104 transition count 254
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 104 transition count 252
Applied a total of 124 rules in 47 ms. Remains 104 /165 variables (removed 61) and now considering 252/404 (removed 152) transitions.
[2022-06-10 04:24:45] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2022-06-10 04:24:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 04:24:45] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-06-10 04:24:45] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2022-06-10 04:24:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:24:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 04:24:46] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2022-06-10 04:24:46] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 04:24:46] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2022-06-10 04:24:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:24:46] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/165 places, 252/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/165 places, 252/404 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-06 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:(OR (LT s0 1) (LT s83 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]]
Product exploration explored 100000 steps with 390 reset in 227 ms.
Product exploration explored 100000 steps with 407 reset in 273 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5760 steps, including 13 resets, run visited all 1 properties in 9 ms. (steps per millisecond=640 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 252/252 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2022-06-10 04:24:47] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2022-06-10 04:24:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:24:47] [INFO ] Implicit Places using invariants in 118 ms returned []
[2022-06-10 04:24:47] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2022-06-10 04:24:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:24:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 04:24:48] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2022-06-10 04:24:48] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 04:24:48] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2022-06-10 04:24:48] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 04:24:48] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 252/252 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10004 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1465591 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :{}
Probabilistic random walk after 1465591 steps, saw 950498 distinct states, run finished after 3002 ms. (steps per millisecond=488 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 04:24:51] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2022-06-10 04:24:51] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 04:24:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 04:24:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:24:51] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 04:24:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 04:24:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 04:24:51] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 04:24:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 04:24:51] [INFO ] After 13ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 04:24:51] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-10 04:24:51] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 104/104 places, 252/252 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 250
Applied a total of 2 rules in 13 ms. Remains 104 /104 variables (removed 0) and now considering 250/252 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 250/252 transitions.
Finished random walk after 7497 steps, including 11 resets, run visited all 1 properties in 15 ms. (steps per millisecond=499 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 436 reset in 262 ms.
Product exploration explored 100000 steps with 399 reset in 219 ms.
Built C files in :
/tmp/ltsmin3631109406716911673
[2022-06-10 04:24:52] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2022-06-10 04:24:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:24:52] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2022-06-10 04:24:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:24:52] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2022-06-10 04:24:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:24:52] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3631109406716911673
Running compilation step : cd /tmp/ltsmin3631109406716911673;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 447 ms.
Running link step : cd /tmp/ltsmin3631109406716911673;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3631109406716911673;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3321401458917759517.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 252/252 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2022-06-10 04:25:07] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2022-06-10 04:25:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:25:07] [INFO ] Implicit Places using invariants in 59 ms returned []
[2022-06-10 04:25:07] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2022-06-10 04:25:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 04:25:07] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 04:25:08] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2022-06-10 04:25:08] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 04:25:08] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2022-06-10 04:25:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 04:25:08] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 252/252 transitions.
Built C files in :
/tmp/ltsmin527732377353018637
[2022-06-10 04:25:08] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2022-06-10 04:25:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:25:08] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2022-06-10 04:25:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:25:08] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2022-06-10 04:25:08] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:25:08] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin527732377353018637
Running compilation step : cd /tmp/ltsmin527732377353018637;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 689 ms.
Running link step : cd /tmp/ltsmin527732377353018637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin527732377353018637;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9050148723948021163.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 04:25:23] [INFO ] Flatten gal took : 13 ms
[2022-06-10 04:25:23] [INFO ] Flatten gal took : 27 ms
[2022-06-10 04:25:23] [INFO ] Time to serialize gal into /tmp/LTL16233497637243121988.gal : 1 ms
[2022-06-10 04:25:23] [INFO ] Time to serialize properties into /tmp/LTL14504342891194024609.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/LTL16233497637243121988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14504342891194024609.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/LTL1623349...268
Read 1 LTL properties
Checking formula 0 : !((G(F(X(F(X(F("((s0<1)||(l166<1))"))))))))
Formula 0 simplified : !GFXFXF"((s0<1)||(l166<1))"
Detected timeout of ITS tools.
[2022-06-10 04:25:38] [INFO ] Flatten gal took : 15 ms
[2022-06-10 04:25:38] [INFO ] Applying decomposition
[2022-06-10 04:25:38] [INFO ] Flatten gal took : 11 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/graph17632636012027524148.txt' '-o' '/tmp/graph17632636012027524148.bin' '-w' '/tmp/graph17632636012027524148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17632636012027524148.bin' '-l' '-1' '-v' '-w' '/tmp/graph17632636012027524148.weights' '-q' '0' '-e' '0.001'
[2022-06-10 04:25:38] [INFO ] Decomposing Gal with order
[2022-06-10 04:25:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 04:25:38] [INFO ] Removed a total of 416 redundant transitions.
[2022-06-10 04:25:38] [INFO ] Flatten gal took : 38 ms
[2022-06-10 04:25:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 11 ms.
[2022-06-10 04:25:38] [INFO ] Time to serialize gal into /tmp/LTL2786919522446484987.gal : 9 ms
[2022-06-10 04:25:38] [INFO ] Time to serialize properties into /tmp/LTL15452869495144615766.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/LTL2786919522446484987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15452869495144615766.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/LTL2786919...246
Read 1 LTL properties
Checking formula 0 : !((G(F(X(F(X(F("((i0.u0.s0<1)||(i10.i0.u26.l166<1))"))))))))
Formula 0 simplified : !GFXFXF"((i0.u0.s0<1)||(i10.i0.u26.l166<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin170933443044887196
[2022-06-10 04:25:53] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin170933443044887196
Running compilation step : cd /tmp/ltsmin170933443044887196;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 340 ms.
Running link step : cd /tmp/ltsmin170933443044887196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin170933443044887196;'/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(<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-b008-LTLFireability-06 finished in 82979 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!(F(!F(p0)) U F(p1))&&!p0))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 404/404 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 382
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 147 transition count 362
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 147 transition count 362
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 140 transition count 338
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 140 transition count 338
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 133 transition count 316
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 133 transition count 316
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 126 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 126 transition count 300
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 119 transition count 282
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 119 transition count 282
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 113 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 113 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 110 place count 107 transition count 256
Iterating global reduction 0 with 6 rules applied. Total rules applied 116 place count 107 transition count 256
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 120 place count 103 transition count 248
Iterating global reduction 0 with 4 rules applied. Total rules applied 124 place count 103 transition count 248
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 101 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 130 place count 99 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 132 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 133 place count 98 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 134 place count 98 transition count 238
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 98 transition count 236
Applied a total of 136 rules in 45 ms. Remains 98 /165 variables (removed 67) and now considering 236/404 (removed 168) transitions.
[2022-06-10 04:26:08] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 04:26:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:26:09] [INFO ] Implicit Places using invariants in 506 ms returned []
[2022-06-10 04:26:09] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 04:26:09] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:26:09] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-10 04:26:09] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2022-06-10 04:26:09] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 04:26:09] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 04:26:09] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 04:26:09] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/165 places, 236/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/165 places, 236/404 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR p1 p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s94 1)), p1:(AND (GEQ s1 1) (GEQ s70 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 433 reset in 325 ms.
Stack based approach found an accepted trace after 652 steps with 1 reset with depth 117 and stack size 117 in 2 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-09 finished in 1350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))||F(p2)))'
Support contains 7 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 404/404 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 158 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 158 transition count 386
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 151 transition count 370
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 151 transition count 370
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 147 transition count 358
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 147 transition count 358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 143 transition count 346
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 143 transition count 346
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 139 transition count 336
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 139 transition count 336
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 135 transition count 324
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 135 transition count 324
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 132 transition count 316
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 132 transition count 316
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 129 transition count 310
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 129 transition count 310
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 126 transition count 304
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 126 transition count 304
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 124 transition count 300
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 124 transition count 300
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 122 transition count 296
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 122 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 121 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 121 transition count 294
Applied a total of 88 rules in 17 ms. Remains 121 /165 variables (removed 44) and now considering 294/404 (removed 110) transitions.
[2022-06-10 04:26:10] [INFO ] Flow matrix only has 200 transitions (discarded 94 similar events)
// Phase 1: matrix 200 rows 121 cols
[2022-06-10 04:26:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:26:10] [INFO ] Implicit Places using invariants in 340 ms returned []
[2022-06-10 04:26:10] [INFO ] Flow matrix only has 200 transitions (discarded 94 similar events)
// Phase 1: matrix 200 rows 121 cols
[2022-06-10 04:26:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:26:10] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-10 04:26:10] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2022-06-10 04:26:10] [INFO ] Flow matrix only has 200 transitions (discarded 94 similar events)
// Phase 1: matrix 200 rows 121 cols
[2022-06-10 04:26:10] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 04:26:10] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/165 places, 294/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/165 places, 294/404 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s15 1) (GEQ s1 1) (GEQ s69 1) (OR (LT s1 1) (LT s102 1))) (AND (GEQ s0 1) (GEQ s92 1))), p1:(AND (GEQ s1 1) (GEQ s69 1)), p0:(...], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 299 ms.
Product exploration explored 100000 steps with 50000 reset in 221 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p1)))
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FunctionPointer-PT-b008-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b008-LTLFireability-10 finished in 1438 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((G(F(p1))&&p0))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 404/404 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 386
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 386
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 149 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 149 transition count 368
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 143 transition count 348
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 143 transition count 348
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 137 transition count 330
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 137 transition count 330
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 131 transition count 316
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 131 transition count 316
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 125 transition count 300
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 125 transition count 300
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 120 transition count 288
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 115 transition count 278
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 115 transition count 278
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 111 transition count 270
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 109 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 109 transition count 266
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 107 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 106 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 106 transition count 260
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 122 place count 106 transition count 256
Applied a total of 122 rules in 33 ms. Remains 106 /165 variables (removed 59) and now considering 256/404 (removed 148) transitions.
[2022-06-10 04:26:11] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 04:26:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:26:11] [INFO ] Implicit Places using invariants in 121 ms returned []
[2022-06-10 04:26:11] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 04:26:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:26:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 04:26:11] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2022-06-10 04:26:11] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 04:26:11] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 04:26:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:26:12] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/165 places, 256/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/165 places, 256/404 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s25 1)), p0:(AND (GEQ s1 1) (GEQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 424 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-11 finished in 634 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(G(!(X(p0) U p1)))||p0))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 404/404 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 158 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 158 transition count 386
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 151 transition count 370
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 151 transition count 370
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 146 transition count 354
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 146 transition count 354
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 141 transition count 338
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 141 transition count 338
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 136 transition count 328
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 136 transition count 328
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 131 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 131 transition count 316
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 127 transition count 306
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 127 transition count 306
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 123 transition count 298
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 123 transition count 298
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 120 transition count 292
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 120 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 119 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 119 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 118 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 118 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 117 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 117 transition count 286
Applied a total of 96 rules in 22 ms. Remains 117 /165 variables (removed 48) and now considering 286/404 (removed 118) transitions.
[2022-06-10 04:26:12] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
// Phase 1: matrix 194 rows 117 cols
[2022-06-10 04:26:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:26:12] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-06-10 04:26:12] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
// Phase 1: matrix 194 rows 117 cols
[2022-06-10 04:26:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:26:12] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-10 04:26:12] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2022-06-10 04:26:12] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
// Phase 1: matrix 194 rows 117 cols
[2022-06-10 04:26:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:26:12] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/165 places, 286/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/165 places, 286/404 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s107 1)), p1:(AND (GEQ s1 1) (GEQ s94 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 361 reset in 270 ms.
Stack based approach found an accepted trace after 883 steps with 3 reset with depth 158 and stack size 158 in 3 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-12 finished in 921 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(X(X(p0)))))&&F(p1)))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 404/404 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 384
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 149 transition count 366
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 149 transition count 366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 143 transition count 346
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 143 transition count 346
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 137 transition count 328
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 137 transition count 328
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 131 transition count 314
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 131 transition count 314
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 125 transition count 298
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 125 transition count 298
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 120 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 115 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 115 transition count 276
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 111 transition count 268
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 109 transition count 264
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 107 transition count 260
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 106 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 106 transition count 258
Applied a total of 118 rules in 29 ms. Remains 106 /165 variables (removed 59) and now considering 258/404 (removed 146) transitions.
[2022-06-10 04:26:13] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 04:26:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 04:26:13] [INFO ] Implicit Places using invariants in 109 ms returned []
[2022-06-10 04:26:13] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 04:26:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:26:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 04:26:13] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2022-06-10 04:26:13] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 04:26:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 04:26:13] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/165 places, 258/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/165 places, 258/404 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s87 1)), p0:(OR (AND (GEQ s1 1) (GEQ s42 1)) (AND (GEQ s0 1) (GEQ s87 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-13 finished in 757 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(X(F(p0)))))))'
[2022-06-10 04:26:14] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14347466173085124859
[2022-06-10 04:26:14] [INFO ] Computing symmetric may disable matrix : 404 transitions.
[2022-06-10 04:26:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:26:14] [INFO ] Computing symmetric may enable matrix : 404 transitions.
[2022-06-10 04:26:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:26:14] [INFO ] Applying decomposition
[2022-06-10 04:26:14] [INFO ] Flatten gal took : 71 ms
[2022-06-10 04:26:14] [INFO ] Computing Do-Not-Accords matrix : 404 transitions.
[2022-06-10 04:26:14] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:26:14] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14347466173085124859
Running compilation step : cd /tmp/ltsmin14347466173085124859;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
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/graph1088742233592582654.txt' '-o' '/tmp/graph1088742233592582654.bin' '-w' '/tmp/graph1088742233592582654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1088742233592582654.bin' '-l' '-1' '-v' '-w' '/tmp/graph1088742233592582654.weights' '-q' '0' '-e' '0.001'
[2022-06-10 04:26:14] [INFO ] Decomposing Gal with order
[2022-06-10 04:26:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 04:26:14] [INFO ] Removed a total of 677 redundant transitions.
[2022-06-10 04:26:14] [INFO ] Flatten gal took : 65 ms
[2022-06-10 04:26:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 251 labels/synchronizations in 28 ms.
[2022-06-10 04:26:14] [INFO ] Time to serialize gal into /tmp/LTLFireability18046298218780758691.gal : 3 ms
[2022-06-10 04:26:14] [INFO ] Time to serialize properties into /tmp/LTLFireability1025717593183548022.ltl : 14 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/LTLFireability18046298218780758691.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1025717593183548022.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 2 LTL properties
Checking formula 0 : !((X((G(F("((i7.i0.u1.s0<1)||(i12.u42.l170<1))")))||("((i7.i0.u1.s0>=1)&&(i7.i1.u16.l272>=1))"))))
Formula 0 simplified : !X("((i7.i0.u1.s0>=1)&&(i7.i1.u16.l272>=1))" | GF"((i7.i0.u1.s0<1)||(i12.u42.l170<1))")
Compilation finished in 1083 ms.
Running link step : cd /tmp/ltsmin14347466173085124859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14347466173085124859;'/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(([](<>((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: LTL layer: formula: X(([](<>((LTLAPp0==true)))||(LTLAPp1==true)))
pins2lts-mc-linux64( 7/ 8), 0.017: "X(([](<>((LTLAPp0==true)))||(LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.018: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.073: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.132: DFS-FIFO for weak LTL, using special progress label 408
pins2lts-mc-linux64( 0/ 8), 0.132: There are 409 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.132: State length is 166, there are 410 groups
pins2lts-mc-linux64( 0/ 8), 0.132: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.132: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.132: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.132: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.830: ~1 levels ~960 states ~4920 transitions
pins2lts-mc-linux64( 6/ 8), 0.873: ~1 levels ~1920 states ~9352 transitions
pins2lts-mc-linux64( 6/ 8), 0.989: ~1 levels ~3840 states ~19304 transitions
pins2lts-mc-linux64( 6/ 8), 1.138: ~1 levels ~7680 states ~39104 transitions
pins2lts-mc-linux64( 7/ 8), 1.652: ~1 levels ~15360 states ~79792 transitions
pins2lts-mc-linux64( 6/ 8), 2.433: ~1 levels ~30720 states ~166280 transitions
pins2lts-mc-linux64( 6/ 8), 3.315: ~1 levels ~61440 states ~330016 transitions
pins2lts-mc-linux64( 6/ 8), 4.261: ~1 levels ~122880 states ~646472 transitions
pins2lts-mc-linux64( 6/ 8), 5.914: ~1 levels ~245760 states ~1276264 transitions
pins2lts-mc-linux64( 2/ 8), 8.526: ~1 levels ~491520 states ~2605528 transitions
pins2lts-mc-linux64( 2/ 8), 11.734: ~32 levels ~983040 states ~3375992 transitions
pins2lts-mc-linux64( 2/ 8), 17.734: ~32 levels ~1966080 states ~4839048 transitions
pins2lts-mc-linux64( 2/ 8), 30.340: ~32 levels ~3932160 states ~8049088 transitions
pins2lts-mc-linux64( 2/ 8), 55.969: ~32 levels ~7864320 states ~14572416 transitions
pins2lts-mc-linux64( 2/ 8), 108.465: ~32 levels ~15728640 states ~28734440 transitions
pins2lts-mc-linux64( 2/ 8), 231.307: ~32 levels ~31457280 states ~63450280 transitions
pins2lts-mc-linux64( 2/ 8), 468.118: ~34 levels ~62914560 states ~124592000 transitions
pins2lts-mc-linux64( 4/ 8), 883.976: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 884.019:
pins2lts-mc-linux64( 0/ 8), 884.019: mean standard work distribution: 17.7% (states) 28.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 884.019:
pins2lts-mc-linux64( 0/ 8), 884.019: Explored 99360383 states 354731489 transitions, fanout: 3.570
pins2lts-mc-linux64( 0/ 8), 884.019: Total exploration time 883.880 sec (883.810 sec minimum, 883.857 sec on average)
pins2lts-mc-linux64( 0/ 8), 884.019: States per second: 112414, Transitions per second: 401334
pins2lts-mc-linux64( 0/ 8), 884.019:
pins2lts-mc-linux64( 0/ 8), 884.020: Progress states detected: 70386916
pins2lts-mc-linux64( 0/ 8), 884.020: Redundant explorations: -25.9705
pins2lts-mc-linux64( 0/ 8), 884.020:
pins2lts-mc-linux64( 0/ 8), 884.020: Queue width: 8B, total height: 62930550, memory: 480.12MB
pins2lts-mc-linux64( 0/ 8), 884.020: Tree memory: 1142.0MB, 8.9 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 884.020: Tree fill ratio (roots/leafs): 99.0%/46.0%
pins2lts-mc-linux64( 0/ 8), 884.020: Stored 406 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 884.020: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 884.020: Est. total memory use: 1622.1MB (~1504.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14347466173085124859;'/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(([](<>((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14347466173085124859;'/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(([](<>((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-10 04:47:11] [INFO ] Flatten gal took : 35 ms
[2022-06-10 04:47:11] [INFO ] Time to serialize gal into /tmp/LTLFireability8555633851442782952.gal : 2 ms
[2022-06-10 04:47:11] [INFO ] Time to serialize properties into /tmp/LTLFireability4708516833794356938.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/LTLFireability8555633851442782952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4708516833794356938.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/LTLFireabi...288
Read 2 LTL properties
Checking formula 0 : !((X((G(F("((s0<1)||(l170<1))")))||("((s0>=1)&&(l272>=1))"))))
Formula 0 simplified : !X("((s0>=1)&&(l272>=1))" | GF"((s0<1)||(l170<1))")
Detected timeout of ITS tools.
[2022-06-10 05:08:10] [INFO ] Flatten gal took : 288 ms
[2022-06-10 05:08:11] [INFO ] Input system was already deterministic with 404 transitions.
[2022-06-10 05:08:21] [INFO ] Transformed 165 places.
[2022-06-10 05:08:21] [INFO ] Transformed 404 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-06-10 05:08:21] [INFO ] Time to serialize gal into /tmp/LTLFireability8246557963222379262.gal : 5 ms
[2022-06-10 05:08:21] [INFO ] Time to serialize properties into /tmp/LTLFireability4956398378337334010.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/LTLFireability8246557963222379262.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4956398378337334010.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...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G(F("((s0<1)||(l170<1))")))||("((s0>=1)&&(l272>=1))"))))
Formula 0 simplified : !X("((s0>=1)&&(l272>=1))" | GF"((s0<1)||(l170<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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="FunctionPointer-PT-b008"
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 FunctionPointer-PT-b008, 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 r312-tall-165472282200436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b008.tgz
mv FunctionPointer-PT-b008 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;