fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r165-tall-167838850700668
Last Updated
May 14, 2023

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16209.119 3600000.00 3728380.00 122589.00 TFFFTFFF?FFTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850700668.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is FunctionPointer-PT-b004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850700668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K Mar 5 18:22 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-b004-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679544003852

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b004
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-23 04:00:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 04:00:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 04:00:05] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-23 04:00:05] [INFO ] Transformed 306 places.
[2023-03-23 04:00:05] [INFO ] Transformed 840 transitions.
[2023-03-23 04:00:05] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 35 place count 187 transition count 548
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 187 transition count 548
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 187 transition count 478
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 142 place count 175 transition count 454
Iterating global reduction 2 with 12 rules applied. Total rules applied 154 place count 175 transition count 454
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 174 place count 175 transition count 434
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 181 place count 168 transition count 420
Iterating global reduction 3 with 7 rules applied. Total rules applied 188 place count 168 transition count 420
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 194 place count 162 transition count 396
Iterating global reduction 3 with 6 rules applied. Total rules applied 200 place count 162 transition count 396
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 205 place count 157 transition count 386
Iterating global reduction 3 with 5 rules applied. Total rules applied 210 place count 157 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 212 place count 155 transition count 378
Iterating global reduction 3 with 2 rules applied. Total rules applied 214 place count 155 transition count 378
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 216 place count 153 transition count 370
Iterating global reduction 3 with 2 rules applied. Total rules applied 218 place count 153 transition count 370
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 220 place count 151 transition count 366
Iterating global reduction 3 with 2 rules applied. Total rules applied 222 place count 151 transition count 366
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 224 place count 149 transition count 362
Iterating global reduction 3 with 2 rules applied. Total rules applied 226 place count 149 transition count 362
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 228 place count 147 transition count 358
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 147 transition count 358
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 232 place count 145 transition count 354
Iterating global reduction 3 with 2 rules applied. Total rules applied 234 place count 145 transition count 354
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 236 place count 143 transition count 350
Iterating global reduction 3 with 2 rules applied. Total rules applied 238 place count 143 transition count 350
Applied a total of 238 rules in 83 ms. Remains 143 /222 variables (removed 79) and now considering 350/648 (removed 298) transitions.
[2023-03-23 04:00:05] [INFO ] Flow matrix only has 237 transitions (discarded 113 similar events)
// Phase 1: matrix 237 rows 143 cols
[2023-03-23 04:00:05] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-23 04:00:06] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-23 04:00:06] [INFO ] Flow matrix only has 237 transitions (discarded 113 similar events)
[2023-03-23 04:00:06] [INFO ] Invariant cache hit.
[2023-03-23 04:00:06] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-23 04:00:06] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2023-03-23 04:00:06] [INFO ] Flow matrix only has 237 transitions (discarded 113 similar events)
[2023-03-23 04:00:06] [INFO ] Invariant cache hit.
[2023-03-23 04:00:06] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/222 places, 350/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 946 ms. Remains : 143/222 places, 350/648 transitions.
Support contains 19 out of 143 places after structural reductions.
[2023-03-23 04:00:06] [INFO ] Flatten gal took : 51 ms
[2023-03-23 04:00:06] [INFO ] Flatten gal took : 21 ms
[2023-03-23 04:00:06] [INFO ] Input system was already deterministic with 350 transitions.
Support contains 18 out of 143 places (down from 19) after GAL structural reductions.
Incomplete random walk after 10003 steps, including 20 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-23 04:00:07] [INFO ] Flow matrix only has 237 transitions (discarded 113 similar events)
[2023-03-23 04:00:07] [INFO ] Invariant cache hit.
[2023-03-23 04:00:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 04:00:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 04:00:07] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 04:00:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 04:00:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 04:00:07] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 04:00:07] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-23 04:00:07] [INFO ] After 22ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 04:00:07] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-23 04:00:07] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 350/350 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 340
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 340
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 134 transition count 332
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 134 transition count 332
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 130 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 130 transition count 316
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 126 transition count 300
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 126 transition count 300
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 122 transition count 292
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 118 transition count 284
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 118 transition count 284
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 114 transition count 276
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 114 transition count 276
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 110 transition count 268
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 110 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 106 transition count 260
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 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 78 place count 106 transition count 256
Applied a total of 78 rules in 74 ms. Remains 106 /143 variables (removed 37) and now considering 256/350 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 106/143 places, 256/350 transitions.
Finished random walk after 4838 steps, including 8 resets, run visited all 1 properties in 10 ms. (steps per millisecond=483 )
FORMULA FunctionPointer-PT-b004-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1)||(X(p0)&&F(!p0)))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 350/350 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 336
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 336
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 132 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 132 transition count 326
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 127 transition count 306
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 127 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 122 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 122 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 117 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 117 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 112 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 112 transition count 266
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 107 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 107 transition count 256
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 102 transition count 246
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 102 transition count 246
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 97 transition count 236
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 97 transition count 236
Applied a total of 92 rules in 22 ms. Remains 97 /143 variables (removed 46) and now considering 236/350 (removed 114) transitions.
[2023-03-23 04:00:07] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2023-03-23 04:00:07] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 04:00:08] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-23 04:00:08] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-23 04:00:08] [INFO ] Invariant cache hit.
[2023-03-23 04:00:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 04:00:08] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-23 04:00:08] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-23 04:00:08] [INFO ] Invariant cache hit.
[2023-03-23 04:00:08] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/143 places, 236/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 97/143 places, 236/350 transitions.
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s65 1)), p1:(AND (GEQ s1 1) (GEQ s90 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 124 steps with 2 reset in 6 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-02 finished in 779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0||X(p1))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 350/350 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 139 transition count 340
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 139 transition count 340
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 136 transition count 334
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 136 transition count 334
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 133 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 133 transition count 322
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 130 transition count 310
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 130 transition count 310
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 127 transition count 304
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 127 transition count 304
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 124 transition count 298
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 124 transition count 298
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 121 transition count 292
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 121 transition count 292
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 118 transition count 286
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 118 transition count 286
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 115 transition count 280
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 115 transition count 280
Applied a total of 56 rules in 18 ms. Remains 115 /143 variables (removed 28) and now considering 280/350 (removed 70) transitions.
[2023-03-23 04:00:08] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
// Phase 1: matrix 189 rows 115 cols
[2023-03-23 04:00:08] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 04:00:08] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-23 04:00:08] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2023-03-23 04:00:08] [INFO ] Invariant cache hit.
[2023-03-23 04:00:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-23 04:00:08] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-23 04:00:08] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2023-03-23 04:00:08] [INFO ] Invariant cache hit.
[2023-03-23 04:00:08] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/143 places, 280/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 115/143 places, 280/350 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s96 1)), p1:(AND (GEQ s0 1) (GEQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 185 steps with 0 reset in 3 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-06 finished in 462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 350/350 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 340
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 340
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 134 transition count 332
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 134 transition count 332
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 130 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 130 transition count 316
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 126 transition count 300
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 126 transition count 300
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 122 transition count 292
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 118 transition count 284
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 118 transition count 284
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 114 transition count 276
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 114 transition count 276
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 110 transition count 268
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 110 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 106 transition count 260
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 106 transition count 260
Applied a total of 74 rules in 23 ms. Remains 106 /143 variables (removed 37) and now considering 260/350 (removed 90) transitions.
[2023-03-23 04:00:09] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2023-03-23 04:00:09] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 04:00:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-23 04:00:09] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-23 04:00:09] [INFO ] Invariant cache hit.
[2023-03-23 04:00:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 04:00:09] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-23 04:00:09] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-23 04:00:09] [INFO ] Invariant cache hit.
[2023-03-23 04:00:09] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/143 places, 260/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 106/143 places, 260/350 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-07 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||F(G(p0)))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 350/350 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 336
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 336
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 132 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 132 transition count 326
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 127 transition count 306
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 127 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 122 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 122 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 117 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 117 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 112 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 112 transition count 266
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 107 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 107 transition count 256
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 102 transition count 246
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 102 transition count 246
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 97 transition count 236
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 97 transition count 236
Applied a total of 92 rules in 29 ms. Remains 97 /143 variables (removed 46) and now considering 236/350 (removed 114) transitions.
[2023-03-23 04:00:09] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2023-03-23 04:00:09] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 04:00:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-23 04:00:09] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-23 04:00:09] [INFO ] Invariant cache hit.
[2023-03-23 04:00:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 04:00:09] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-23 04:00:09] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-23 04:00:09] [INFO ] Invariant cache hit.
[2023-03-23 04:00:10] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/143 places, 236/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 97/143 places, 236/350 transitions.
Stuttering acceptance computed with spot in 110 ms :[false, (NOT p0), false]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s0 1) (LT s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 312 reset in 260 ms.
Product exploration explored 100000 steps with 273 reset in 251 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 5089 steps, including 12 resets, run visited all 1 properties in 15 ms. (steps per millisecond=339 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 236/236 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 97 transition count 234
Applied a total of 2 rules in 32 ms. Remains 97 /97 variables (removed 0) and now considering 234/236 (removed 2) transitions.
[2023-03-23 04:00:11] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-23 04:00:11] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-23 04:00:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-23 04:00:11] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 04:00:11] [INFO ] Invariant cache hit.
[2023-03-23 04:00:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 04:00:11] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-23 04:00:11] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-23 04:00:11] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 04:00:11] [INFO ] Invariant cache hit.
[2023-03-23 04:00:11] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/97 places, 234/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 97/97 places, 234/236 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 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 1032 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=172 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 486 reset in 198 ms.
Product exploration explored 100000 steps with 486 reset in 188 ms.
Built C files in :
/tmp/ltsmin17992727598121229425
[2023-03-23 04:00:12] [INFO ] Computing symmetric may disable matrix : 234 transitions.
[2023-03-23 04:00:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 04:00:12] [INFO ] Computing symmetric may enable matrix : 234 transitions.
[2023-03-23 04:00:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 04:00:12] [INFO ] Computing Do-Not-Accords matrix : 234 transitions.
[2023-03-23 04:00:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 04:00:12] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17992727598121229425
Running compilation step : cd /tmp/ltsmin17992727598121229425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 608 ms.
Running link step : cd /tmp/ltsmin17992727598121229425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin17992727598121229425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5383255056848647755.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 234/234 transitions.
Applied a total of 0 rules in 15 ms. Remains 97 /97 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-23 04:00:27] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 04:00:27] [INFO ] Invariant cache hit.
[2023-03-23 04:00:27] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-23 04:00:27] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 04:00:27] [INFO ] Invariant cache hit.
[2023-03-23 04:00:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 04:00:27] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-23 04:00:27] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-23 04:00:27] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 04:00:27] [INFO ] Invariant cache hit.
[2023-03-23 04:00:27] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 ms. Remains : 97/97 places, 234/234 transitions.
Built C files in :
/tmp/ltsmin9223308999209676498
[2023-03-23 04:00:27] [INFO ] Computing symmetric may disable matrix : 234 transitions.
[2023-03-23 04:00:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 04:00:27] [INFO ] Computing symmetric may enable matrix : 234 transitions.
[2023-03-23 04:00:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 04:00:27] [INFO ] Computing Do-Not-Accords matrix : 234 transitions.
[2023-03-23 04:00:27] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 04:00:27] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9223308999209676498
Running compilation step : cd /tmp/ltsmin9223308999209676498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 433 ms.
Running link step : cd /tmp/ltsmin9223308999209676498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9223308999209676498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13184403857853461568.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 04:00:42] [INFO ] Flatten gal took : 12 ms
[2023-03-23 04:00:42] [INFO ] Flatten gal took : 11 ms
[2023-03-23 04:00:42] [INFO ] Time to serialize gal into /tmp/LTL10426000669250817262.gal : 3 ms
[2023-03-23 04:00:42] [INFO ] Time to serialize properties into /tmp/LTL6977818982968613686.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10426000669250817262.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13781311518150342583.hoa' '-atoms' '/tmp/LTL6977818982968613686.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6977818982968613686.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13781311518150342583.hoa
Detected timeout of ITS tools.
[2023-03-23 04:00:57] [INFO ] Flatten gal took : 10 ms
[2023-03-23 04:00:57] [INFO ] Flatten gal took : 11 ms
[2023-03-23 04:00:57] [INFO ] Time to serialize gal into /tmp/LTL11650548913167269360.gal : 2 ms
[2023-03-23 04:00:57] [INFO ] Time to serialize properties into /tmp/LTL18380119574547750004.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11650548913167269360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18380119574547750004.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((s0<1)||(l61<1))")))||("((s0>=1)&&(l61>=1))"))))
Formula 0 simplified : X(!"((s0>=1)&&(l61>=1))" & GF!"((s0<1)||(l61<1))")
Detected timeout of ITS tools.
[2023-03-23 04:01:13] [INFO ] Flatten gal took : 10 ms
[2023-03-23 04:01:13] [INFO ] Applying decomposition
[2023-03-23 04:01:13] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6141532863987098088.txt' '-o' '/tmp/graph6141532863987098088.bin' '-w' '/tmp/graph6141532863987098088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6141532863987098088.bin' '-l' '-1' '-v' '-w' '/tmp/graph6141532863987098088.weights' '-q' '0' '-e' '0.001'
[2023-03-23 04:01:13] [INFO ] Decomposing Gal with order
[2023-03-23 04:01:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 04:01:13] [INFO ] Removed a total of 387 redundant transitions.
[2023-03-23 04:01:13] [INFO ] Flatten gal took : 55 ms
[2023-03-23 04:01:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 12 ms.
[2023-03-23 04:01:13] [INFO ] Time to serialize gal into /tmp/LTL14618277363077394193.gal : 4 ms
[2023-03-23 04:01:13] [INFO ] Time to serialize properties into /tmp/LTL7712451191067280961.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14618277363077394193.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7712451191067280961.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i7.u0.s0<1)||(u10.l61<1))")))||("((i7.u0.s0>=1)&&(u10.l61>=1))"))))
Formula 0 simplified : X(!"((i7.u0.s0>=1)&&(u10.l61>=1))" & GF!"((i7.u0.s0<1)||(u10.l61<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12963846921809372549
[2023-03-23 04:01:28] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12963846921809372549
Running compilation step : cd /tmp/ltsmin12963846921809372549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 329 ms.
Running link step : cd /tmp/ltsmin12963846921809372549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12963846921809372549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||!(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-b004-LTLFireability-08 finished in 93758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 350/350 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 336
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 336
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 132 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 132 transition count 326
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 127 transition count 306
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 127 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 122 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 122 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 117 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 117 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 112 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 112 transition count 266
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 107 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 107 transition count 256
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 102 transition count 246
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 102 transition count 246
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 97 transition count 236
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 97 transition count 236
Applied a total of 92 rules in 36 ms. Remains 97 /143 variables (removed 46) and now considering 236/350 (removed 114) transitions.
[2023-03-23 04:01:43] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2023-03-23 04:01:43] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 04:01:43] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-23 04:01:43] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-23 04:01:43] [INFO ] Invariant cache hit.
[2023-03-23 04:01:43] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 04:01:43] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-23 04:01:43] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-23 04:01:43] [INFO ] Invariant cache hit.
[2023-03-23 04:01:43] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/143 places, 236/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 97/143 places, 236/350 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s3 1) (GEQ s65 1)), p0:(OR (LT s1 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-09 finished in 512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 350/350 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 336
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 336
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 132 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 132 transition count 326
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 127 transition count 306
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 127 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 122 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 122 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 117 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 117 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 112 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 112 transition count 266
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 107 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 107 transition count 256
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 102 transition count 246
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 102 transition count 246
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 97 transition count 236
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 97 transition count 236
Applied a total of 92 rules in 20 ms. Remains 97 /143 variables (removed 46) and now considering 236/350 (removed 114) transitions.
[2023-03-23 04:01:43] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-23 04:01:43] [INFO ] Invariant cache hit.
[2023-03-23 04:01:43] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-23 04:01:43] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-23 04:01:43] [INFO ] Invariant cache hit.
[2023-03-23 04:01:44] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 04:01:44] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-23 04:01:44] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-23 04:01:44] [INFO ] Invariant cache hit.
[2023-03-23 04:01:44] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/143 places, 236/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 97/143 places, 236/350 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 187 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-10 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 350/350 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 338
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 338
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 133 transition count 328
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 133 transition count 328
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 129 transition count 312
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 129 transition count 312
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 125 transition count 296
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 125 transition count 296
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 121 transition count 288
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 121 transition count 288
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 117 transition count 280
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 117 transition count 280
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 113 transition count 272
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 113 transition count 272
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 109 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 109 transition count 264
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 105 transition count 256
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 105 transition count 256
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 105 transition count 252
Applied a total of 80 rules in 37 ms. Remains 105 /143 variables (removed 38) and now considering 252/350 (removed 98) transitions.
[2023-03-23 04:01:44] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2023-03-23 04:01:44] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 04:01:44] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-23 04:01:44] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-23 04:01:44] [INFO ] Invariant cache hit.
[2023-03-23 04:01:44] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 04:01:44] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-23 04:01:44] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-23 04:01:44] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-23 04:01:44] [INFO ] Invariant cache hit.
[2023-03-23 04:01:44] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/143 places, 252/350 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 105/143 places, 252/350 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s92 1)), p1:(OR (LT s3 1) (LT s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 469 reset in 218 ms.
Product exploration explored 100000 steps with 503 reset in 223 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10002 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 04:01:45] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-23 04:01:45] [INFO ] Invariant cache hit.
[2023-03-23 04:01:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 04:01:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 04:01:45] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 182 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b004-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b004-LTLFireability-11 finished in 1431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 350/350 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 338
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 338
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 134 transition count 330
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 134 transition count 330
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 130 transition count 314
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 130 transition count 314
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 126 transition count 298
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 126 transition count 298
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 122 transition count 290
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 122 transition count 290
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 118 transition count 282
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 118 transition count 282
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 114 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 114 transition count 274
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 110 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 110 transition count 266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 106 transition count 258
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 106 transition count 258
Applied a total of 74 rules in 17 ms. Remains 106 /143 variables (removed 37) and now considering 258/350 (removed 92) transitions.
[2023-03-23 04:01:45] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2023-03-23 04:01:45] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 04:01:45] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-23 04:01:45] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2023-03-23 04:01:45] [INFO ] Invariant cache hit.
[2023-03-23 04:01:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 04:01:45] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-23 04:01:45] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2023-03-23 04:01:45] [INFO ] Invariant cache hit.
[2023-03-23 04:01:46] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/143 places, 258/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 106/143 places, 258/350 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s24 1)), p0:(AND (GEQ s0 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-13 finished in 483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 350/350 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 336
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 336
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 132 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 132 transition count 326
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 127 transition count 306
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 127 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 122 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 122 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 117 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 117 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 112 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 112 transition count 266
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 107 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 107 transition count 256
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 102 transition count 246
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 102 transition count 246
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 97 transition count 236
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 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 94 place count 97 transition count 234
Applied a total of 94 rules in 31 ms. Remains 97 /143 variables (removed 46) and now considering 234/350 (removed 116) transitions.
[2023-03-23 04:01:46] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-23 04:01:46] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 04:01:46] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-23 04:01:46] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 04:01:46] [INFO ] Invariant cache hit.
[2023-03-23 04:01:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 04:01:46] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-23 04:01:46] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-23 04:01:46] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 04:01:46] [INFO ] Invariant cache hit.
[2023-03-23 04:01:46] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/143 places, 234/350 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 350 ms. Remains : 97/143 places, 234/350 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-14 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 s1 1) (LT s12 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 721 reset in 264 ms.
Stack based approach found an accepted trace after 20859 steps with 161 reset with depth 26 and stack size 26 in 46 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-14 finished in 755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||F(G(p0)))))'
[2023-03-23 04:01:47] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15099571291436071718
[2023-03-23 04:01:47] [INFO ] Computing symmetric may disable matrix : 350 transitions.
[2023-03-23 04:01:47] [INFO ] Applying decomposition
[2023-03-23 04:01:47] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 04:01:47] [INFO ] Computing symmetric may enable matrix : 350 transitions.
[2023-03-23 04:01:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 04:01:47] [INFO ] Flatten gal took : 14 ms
[2023-03-23 04:01:47] [INFO ] Computing Do-Not-Accords matrix : 350 transitions.
[2023-03-23 04:01:47] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 04:01:47] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15099571291436071718
Running compilation step : cd /tmp/ltsmin15099571291436071718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6216259177189936421.txt' '-o' '/tmp/graph6216259177189936421.bin' '-w' '/tmp/graph6216259177189936421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6216259177189936421.bin' '-l' '-1' '-v' '-w' '/tmp/graph6216259177189936421.weights' '-q' '0' '-e' '0.001'
[2023-03-23 04:01:47] [INFO ] Decomposing Gal with order
[2023-03-23 04:01:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 04:01:47] [INFO ] Removed a total of 585 redundant transitions.
[2023-03-23 04:01:47] [INFO ] Flatten gal took : 28 ms
[2023-03-23 04:01:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 9 ms.
[2023-03-23 04:01:47] [INFO ] Time to serialize gal into /tmp/LTLFireability2486755676954492968.gal : 3 ms
[2023-03-23 04:01:47] [INFO ] Time to serialize properties into /tmp/LTLFireability2360643909540681755.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2486755676954492968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2360643909540681755.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((!("((i13.u1.s0<1)||(i2.u11.l61<1))"))||(F(G("((i13.u1.s0<1)||(i2.u11.l61<1))"))))))
Formula 0 simplified : X("((i13.u1.s0<1)||(i2.u11.l61<1))" & GF!"((i13.u1.s0<1)||(i2.u11.l61<1))")
Compilation finished in 681 ms.
Running link step : cd /tmp/ltsmin15099571291436071718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15099571291436071718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((!(LTLAPp0==true)||<>([]((LTLAPp0==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: LTL layer: formula: X((!(LTLAPp0==true)||<>([]((LTLAPp0==true)))))
pins2lts-mc-linux64( 1/ 8), 0.010: "X((!(LTLAPp0==true)||<>([]((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed 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( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.058: There are 352 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.058: State length is 144, there are 356 groups
pins2lts-mc-linux64( 0/ 8), 0.058: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.058: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.058: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.058: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.096: [Blue] ~120 levels ~960 states ~4488 transitions
pins2lts-mc-linux64( 6/ 8), 0.140: [Blue] ~240 levels ~1920 states ~9128 transitions
pins2lts-mc-linux64( 6/ 8), 0.211: [Blue] ~480 levels ~3840 states ~18408 transitions
pins2lts-mc-linux64( 0/ 8), 0.340: [Blue] ~712 levels ~7680 states ~25240 transitions
pins2lts-mc-linux64( 0/ 8), 0.535: [Blue] ~1376 levels ~15360 states ~50024 transitions
pins2lts-mc-linux64( 0/ 8), 0.858: [Blue] ~2704 levels ~30720 states ~99584 transitions
pins2lts-mc-linux64( 0/ 8), 1.329: [Blue] ~5363 levels ~61440 states ~198840 transitions
pins2lts-mc-linux64( 0/ 8), 2.001: [Blue] ~10680 levels ~122880 states ~397368 transitions
pins2lts-mc-linux64( 0/ 8), 2.913: [Blue] ~21313 levels ~245760 states ~794328 transitions
pins2lts-mc-linux64( 0/ 8), 4.258: [Blue] ~42584 levels ~491520 states ~1588432 transitions
pins2lts-mc-linux64( 0/ 8), 6.747: [Blue] ~85119 levels ~983040 states ~3176408 transitions
pins2lts-mc-linux64( 0/ 8), 12.302: [Blue] ~170188 levels ~1966080 states ~6352328 transitions
pins2lts-mc-linux64( 0/ 8), 23.606: [Blue] ~340328 levels ~3932160 states ~12704232 transitions
pins2lts-mc-linux64( 2/ 8), 44.973: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 45.101:
pins2lts-mc-linux64( 0/ 8), 45.101: Explored 6758422 states 37328840 transitions, fanout: 5.523
pins2lts-mc-linux64( 0/ 8), 45.101: Total exploration time 45.020 sec (44.900 sec minimum, 44.960 sec on average)
pins2lts-mc-linux64( 0/ 8), 45.101: States per second: 150120, Transitions per second: 829161
pins2lts-mc-linux64( 0/ 8), 45.101:
pins2lts-mc-linux64( 0/ 8), 45.101: State space has 35140923 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 45.101: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 45.101: blue states: 6758422 (19.23%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 45.101: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 45.101: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 45.101:
pins2lts-mc-linux64( 0/ 8), 45.101: Total memory used for local state coloring: 98.9MB
pins2lts-mc-linux64( 0/ 8), 45.101:
pins2lts-mc-linux64( 0/ 8), 45.101: Queue width: 8B, total height: 6483622, memory: 49.47MB
pins2lts-mc-linux64( 0/ 8), 45.101: Tree memory: 524.1MB, 15.6 B/state, compr.: 2.7%
pins2lts-mc-linux64( 0/ 8), 45.101: Tree fill ratio (roots/leafs): 26.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 45.101: Stored 352 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 45.101: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 45.101: Est. total memory use: 573.6MB (~1073.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15099571291436071718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((!(LTLAPp0==true)||<>([]((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15099571291436071718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((!(LTLAPp0==true)||<>([]((LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-23 04:22:20] [INFO ] Flatten gal took : 14 ms
[2023-03-23 04:22:20] [INFO ] Time to serialize gal into /tmp/LTLFireability81108036512751029.gal : 11 ms
[2023-03-23 04:22:20] [INFO ] Time to serialize properties into /tmp/LTLFireability2665678327459801112.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability81108036512751029.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2665678327459801112.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...295
Read 1 LTL properties
Checking formula 0 : !((X((!("((s0<1)||(l61<1))"))||(F(G("((s0<1)||(l61<1))"))))))
Formula 0 simplified : X("((s0<1)||(l61<1))" & GF!"((s0<1)||(l61<1))")
Detected timeout of ITS tools.
[2023-03-23 04:42:56] [INFO ] Flatten gal took : 286 ms
[2023-03-23 04:42:57] [INFO ] Input system was already deterministic with 350 transitions.
[2023-03-23 04:42:57] [INFO ] Transformed 143 places.
[2023-03-23 04:42:57] [INFO ] Transformed 350 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 04:42:57] [INFO ] Time to serialize gal into /tmp/LTLFireability13722134955405460734.gal : 16 ms
[2023-03-23 04:42:57] [INFO ] Time to serialize properties into /tmp/LTLFireability11053769005580355172.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13722134955405460734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11053769005580355172.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b004"
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-5348"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b004, 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 r165-tall-167838850700668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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