About the Execution of 2023-gold for FunctionPointer-PT-b008
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16220.483 | 3600000.00 | 3847385.00 | 169639.70 | TFFTTFFFFF?TFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625000147.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FunctionPointer-PT-b008, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625000147
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 16:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Apr 11 16:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716517485064
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b008
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 02:24:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 02:24:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:24:46] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-24 02:24:46] [INFO ] Transformed 306 places.
[2024-05-24 02:24:46] [INFO ] Transformed 840 transitions.
[2024-05-24 02:24:46] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b008-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 33 place count 189 transition count 496
Iterating global reduction 1 with 24 rules applied. Total rules applied 57 place count 189 transition count 496
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 81 place count 189 transition count 472
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 179 transition count 452
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 179 transition count 452
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 179 transition count 448
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 176 transition count 442
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 176 transition count 442
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 174 transition count 434
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 174 transition count 434
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 172 transition count 430
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 172 transition count 430
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 170 transition count 422
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 170 transition count 422
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 169 transition count 418
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 169 transition count 418
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 168 transition count 416
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 168 transition count 416
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 167 transition count 414
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 167 transition count 414
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 166 transition count 412
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 166 transition count 412
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 165 transition count 410
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 165 transition count 410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 164 transition count 408
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 164 transition count 408
Applied a total of 135 rules in 82 ms. Remains 164 /222 variables (removed 58) and now considering 408/648 (removed 240) transitions.
[2024-05-24 02:24:47] [INFO ] Flow matrix only has 279 transitions (discarded 129 similar events)
// Phase 1: matrix 279 rows 164 cols
[2024-05-24 02:24:47] [INFO ] Computed 2 invariants in 18 ms
[2024-05-24 02:24:47] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-24 02:24:47] [INFO ] Flow matrix only has 279 transitions (discarded 129 similar events)
[2024-05-24 02:24:47] [INFO ] Invariant cache hit.
[2024-05-24 02:24:47] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-24 02:24:47] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-05-24 02:24:47] [INFO ] Flow matrix only has 279 transitions (discarded 129 similar events)
[2024-05-24 02:24:47] [INFO ] Invariant cache hit.
[2024-05-24 02:24:47] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/222 places, 408/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 775 ms. Remains : 164/222 places, 408/648 transitions.
Support contains 20 out of 164 places after structural reductions.
[2024-05-24 02:24:48] [INFO ] Flatten gal took : 59 ms
[2024-05-24 02:24:48] [INFO ] Flatten gal took : 25 ms
[2024-05-24 02:24:48] [INFO ] Input system was already deterministic with 408 transitions.
Support contains 19 out of 164 places (down from 20) after GAL structural reductions.
Incomplete random walk after 10003 steps, including 19 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 02:24:48] [INFO ] Flow matrix only has 279 transitions (discarded 129 similar events)
[2024-05-24 02:24:48] [INFO ] Invariant cache hit.
[2024-05-24 02:24:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:24:48] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA FunctionPointer-PT-b008-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
FORMULA FunctionPointer-PT-b008-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 877 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 408/408 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 408
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 152 transition count 382
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 152 transition count 382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 31 place count 152 transition count 374
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 36 place count 147 transition count 364
Iterating global reduction 2 with 5 rules applied. Total rules applied 41 place count 147 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 142 transition count 348
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 142 transition count 348
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 137 transition count 334
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 137 transition count 334
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 132 transition count 320
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 132 transition count 320
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 127 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 127 transition count 304
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 85 place count 123 transition count 294
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 123 transition count 294
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 119 transition count 286
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 119 transition count 286
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 115 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 115 transition count 278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 112 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 112 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 109 transition count 266
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 108 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 108 transition count 264
Applied a total of 119 rules in 30 ms. Remains 108 /164 variables (removed 56) and now considering 264/408 (removed 144) transitions.
[2024-05-24 02:24:49] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
// Phase 1: matrix 179 rows 108 cols
[2024-05-24 02:24:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:24:49] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-24 02:24:49] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2024-05-24 02:24:49] [INFO ] Invariant cache hit.
[2024-05-24 02:24:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-24 02:24:49] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-05-24 02:24:49] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2024-05-24 02:24:49] [INFO ] Invariant cache hit.
[2024-05-24 02:24:49] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/164 places, 264/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 450 ms. Remains : 108/164 places, 264/408 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ s97 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 266 ms.
Product exploration explored 100000 steps with 33333 reset in 206 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b008-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b008-LTLCardinality-00 finished in 1290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(p0)||(X(p1)&&F(p2)))))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 408/408 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 392
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 156 transition count 384
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 153 transition count 378
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 153 transition count 378
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 150 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 150 transition count 366
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 147 transition count 360
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 147 transition count 360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 145 transition count 352
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 145 transition count 352
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 143 transition count 344
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 143 transition count 344
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 141 transition count 340
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 141 transition count 340
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 139 transition count 336
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 139 transition count 336
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 137 transition count 332
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 137 transition count 332
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 135 transition count 328
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 135 transition count 328
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 133 transition count 324
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 133 transition count 324
Applied a total of 70 rules in 36 ms. Remains 133 /164 variables (removed 31) and now considering 324/408 (removed 84) transitions.
[2024-05-24 02:24:50] [INFO ] Flow matrix only has 223 transitions (discarded 101 similar events)
// Phase 1: matrix 223 rows 133 cols
[2024-05-24 02:24:50] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 02:24:50] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-24 02:24:50] [INFO ] Flow matrix only has 223 transitions (discarded 101 similar events)
[2024-05-24 02:24:50] [INFO ] Invariant cache hit.
[2024-05-24 02:24:50] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-24 02:24:50] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-24 02:24:50] [INFO ] Flow matrix only has 223 transitions (discarded 101 similar events)
[2024-05-24 02:24:50] [INFO ] Invariant cache hit.
[2024-05-24 02:24:50] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/164 places, 324/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 595 ms. Remains : 133/164 places, 324/408 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s80 s104), p2:(GT s124 s116), p1:(GT 2 s98)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 714 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b008-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b008-LTLCardinality-03 finished in 1262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(!p0 U p1)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 408/408 transitions.
Graph (complete) has 877 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 152 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 152 transition count 382
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 29 place count 152 transition count 376
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 146 transition count 364
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 146 transition count 364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 140 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 140 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 134 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 134 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 71 place count 128 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 128 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 122 transition count 290
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 94 place count 117 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 117 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 112 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 112 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 114 place count 107 transition count 258
Iterating global reduction 1 with 5 rules applied. Total rules applied 119 place count 107 transition count 258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 123 place count 103 transition count 250
Iterating global reduction 1 with 4 rules applied. Total rules applied 127 place count 103 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 100 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 99 transition count 242
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 99 transition count 240
Applied a total of 137 rules in 86 ms. Remains 99 /164 variables (removed 65) and now considering 240/408 (removed 168) transitions.
[2024-05-24 02:24:51] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
// Phase 1: matrix 163 rows 99 cols
[2024-05-24 02:24:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:24:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-24 02:24:51] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2024-05-24 02:24:51] [INFO ] Invariant cache hit.
[2024-05-24 02:24:51] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 02:24:51] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-24 02:24:51] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 02:24:51] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2024-05-24 02:24:51] [INFO ] Invariant cache hit.
[2024-05-24 02:24:52] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/164 places, 240/408 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 432 ms. Remains : 99/164 places, 240/408 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s91 0), p1:(LEQ s72 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b008-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLCardinality-09 finished in 529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U G(p1)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 408/408 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 408
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 152 transition count 382
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 152 transition count 382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 31 place count 152 transition count 374
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 36 place count 147 transition count 364
Iterating global reduction 2 with 5 rules applied. Total rules applied 41 place count 147 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 142 transition count 348
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 142 transition count 348
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 137 transition count 334
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 137 transition count 334
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 132 transition count 320
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 132 transition count 320
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 127 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 127 transition count 304
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 85 place count 123 transition count 294
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 123 transition count 294
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 119 transition count 286
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 119 transition count 286
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 116 transition count 280
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 116 transition count 280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 114 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 114 transition count 276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 112 transition count 272
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 112 transition count 272
Applied a total of 111 rules in 26 ms. Remains 112 /164 variables (removed 52) and now considering 272/408 (removed 136) transitions.
[2024-05-24 02:24:52] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
// Phase 1: matrix 186 rows 112 cols
[2024-05-24 02:24:52] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 02:24:52] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-24 02:24:52] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:24:52] [INFO ] Invariant cache hit.
[2024-05-24 02:24:52] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 02:24:52] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-24 02:24:52] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:24:52] [INFO ] Invariant cache hit.
[2024-05-24 02:24:52] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/164 places, 272/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 381 ms. Remains : 112/164 places, 272/408 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s81 0), p0:(GT 1 s102)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 412 reset in 305 ms.
Product exploration explored 100000 steps with 421 reset in 325 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 p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10001 steps, including 11 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 02:24:53] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:24:53] [INFO ] Invariant cache hit.
[2024-05-24 02:24:53] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 02:24:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 02:24:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:54] [INFO ] After 158ms SMT Verify possible using all constraints in natural 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 p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-24 02:24:54] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:24:54] [INFO ] Invariant cache hit.
[2024-05-24 02:24:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-24 02:24:54] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:24:54] [INFO ] Invariant cache hit.
[2024-05-24 02:24:54] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 02:24:54] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-24 02:24:54] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:24:54] [INFO ] Invariant cache hit.
[2024-05-24 02:24:54] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 112/112 places, 272/272 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 : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 3754 steps, including 2 resets, run visited all 2 properties in 18 ms. (steps per millisecond=208 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 451 reset in 221 ms.
Product exploration explored 100000 steps with 445 reset in 234 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 272/272 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 112 transition count 268
Applied a total of 4 rules in 24 ms. Remains 112 /112 variables (removed 0) and now considering 268/272 (removed 4) transitions.
[2024-05-24 02:24:56] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 02:24:56] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 112 cols
[2024-05-24 02:24:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:24:56] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/112 places, 268/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 112/112 places, 268/272 transitions.
Built C files in :
/tmp/ltsmin4948044205232406928
[2024-05-24 02:24:57] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4948044205232406928
Running compilation step : cd /tmp/ltsmin4948044205232406928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 504 ms.
Running link step : cd /tmp/ltsmin4948044205232406928;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4948044205232406928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13027622285019174699.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-24 02:25:12] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
// Phase 1: matrix 186 rows 112 cols
[2024-05-24 02:25:12] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 02:25:12] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-24 02:25:12] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:25:12] [INFO ] Invariant cache hit.
[2024-05-24 02:25:12] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 02:25:12] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-24 02:25:12] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:25:12] [INFO ] Invariant cache hit.
[2024-05-24 02:25:12] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 112/112 places, 272/272 transitions.
Built C files in :
/tmp/ltsmin9258917132356051545
[2024-05-24 02:25:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9258917132356051545
Running compilation step : cd /tmp/ltsmin9258917132356051545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 409 ms.
Running link step : cd /tmp/ltsmin9258917132356051545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9258917132356051545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8934517192955570697.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 02:25:27] [INFO ] Flatten gal took : 15 ms
[2024-05-24 02:25:27] [INFO ] Flatten gal took : 13 ms
[2024-05-24 02:25:27] [INFO ] Time to serialize gal into /tmp/LTL4544706220900015485.gal : 4 ms
[2024-05-24 02:25:27] [INFO ] Time to serialize properties into /tmp/LTL14993846309704042077.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4544706220900015485.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3861890018285429393.hoa' '-atoms' '/tmp/LTL14993846309704042077.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14993846309704042077.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3861890018285429393.hoa
Detected timeout of ITS tools.
[2024-05-24 02:25:42] [INFO ] Flatten gal took : 12 ms
[2024-05-24 02:25:42] [INFO ] Flatten gal took : 11 ms
[2024-05-24 02:25:42] [INFO ] Time to serialize gal into /tmp/LTL9094944361116766064.gal : 2 ms
[2024-05-24 02:25:42] [INFO ] Time to serialize properties into /tmp/LTL18278850436048362864.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9094944361116766064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18278850436048362864.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(l249<1)")))U(G("(l143<=0)"))))))
Formula 0 simplified : XX(FG!"(l249<1)" R F!"(l143<=0)")
Detected timeout of ITS tools.
[2024-05-24 02:25:57] [INFO ] Flatten gal took : 13 ms
[2024-05-24 02:25:57] [INFO ] Applying decomposition
[2024-05-24 02:25:57] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2160787017229305999.txt' '-o' '/tmp/graph2160787017229305999.bin' '-w' '/tmp/graph2160787017229305999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2160787017229305999.bin' '-l' '-1' '-v' '-w' '/tmp/graph2160787017229305999.weights' '-q' '0' '-e' '0.001'
[2024-05-24 02:25:57] [INFO ] Decomposing Gal with order
[2024-05-24 02:25:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:25:58] [INFO ] Removed a total of 452 redundant transitions.
[2024-05-24 02:25:58] [INFO ] Flatten gal took : 72 ms
[2024-05-24 02:25:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 30 ms.
[2024-05-24 02:25:58] [INFO ] Time to serialize gal into /tmp/LTL3622016694252238601.gal : 173 ms
[2024-05-24 02:25:58] [INFO ] Time to serialize properties into /tmp/LTL9300968508057909621.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3622016694252238601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9300968508057909621.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(u29.l249<1)")))U(G("(i9.u21.l143<=0)"))))))
Formula 0 simplified : XX(FG!"(u29.l249<1)" R F!"(i9.u21.l143<=0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6134307838514194718
[2024-05-24 02:26:13] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6134307838514194718
Running compilation step : cd /tmp/ltsmin6134307838514194718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 392 ms.
Running link step : cd /tmp/ltsmin6134307838514194718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6134307838514194718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp0==true))) U []((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-b008-LTLCardinality-10 finished in 96327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 408/408 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 408
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 153 transition count 384
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 153 transition count 384
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 153 transition count 378
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 33 place count 147 transition count 366
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 147 transition count 366
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 44 place count 142 transition count 350
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 142 transition count 350
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 137 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 137 transition count 338
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 132 transition count 322
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 132 transition count 322
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 128 transition count 308
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 128 transition count 308
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 125 transition count 302
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 125 transition count 302
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 122 transition count 296
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 122 transition count 296
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 119 transition count 290
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 119 transition count 290
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 116 transition count 284
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 116 transition count 284
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 113 transition count 278
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 113 transition count 278
Applied a total of 107 rules in 30 ms. Remains 113 /164 variables (removed 51) and now considering 278/408 (removed 130) transitions.
[2024-05-24 02:26:28] [INFO ] Flow matrix only has 188 transitions (discarded 90 similar events)
// Phase 1: matrix 188 rows 113 cols
[2024-05-24 02:26:28] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 02:26:28] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-24 02:26:28] [INFO ] Flow matrix only has 188 transitions (discarded 90 similar events)
[2024-05-24 02:26:28] [INFO ] Invariant cache hit.
[2024-05-24 02:26:28] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:26:28] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-05-24 02:26:28] [INFO ] Flow matrix only has 188 transitions (discarded 90 similar events)
[2024-05-24 02:26:28] [INFO ] Invariant cache hit.
[2024-05-24 02:26:28] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/164 places, 278/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 113/164 places, 278/408 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT s95 s89), p0:(LEQ 1 s92)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 372 steps with 2 reset in 2 ms.
FORMULA FunctionPointer-PT-b008-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLCardinality-14 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U G(p1)))))'
Found a Lengthening insensitive property : FunctionPointer-PT-b008-LTLCardinality-10
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 164/164 places, 408/408 transitions.
Graph (complete) has 877 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 152 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 152 transition count 382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 31 place count 152 transition count 374
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 147 transition count 364
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 147 transition count 364
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 142 transition count 348
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 142 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 137 transition count 334
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 137 transition count 334
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 132 transition count 320
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 132 transition count 320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 127 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 127 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 123 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 123 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 119 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 119 transition count 286
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 116 transition count 280
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 116 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 114 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 114 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 112 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 112 transition count 272
Applied a total of 111 rules in 42 ms. Remains 112 /164 variables (removed 52) and now considering 272/408 (removed 136) transitions.
[2024-05-24 02:26:29] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
// Phase 1: matrix 186 rows 112 cols
[2024-05-24 02:26:29] [INFO ] Computed 2 invariants in 4 ms
[2024-05-24 02:26:29] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-24 02:26:29] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:26:29] [INFO ] Invariant cache hit.
[2024-05-24 02:26:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 02:26:29] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-24 02:26:29] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:26:29] [INFO ] Invariant cache hit.
[2024-05-24 02:26:29] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 112/164 places, 272/408 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 365 ms. Remains : 112/164 places, 272/408 transitions.
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s81 0), p0:(GT 1 s102)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 423 reset in 231 ms.
Product exploration explored 100000 steps with 433 reset in 235 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 p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10001 steps, including 12 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 02:26:30] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:26:30] [INFO ] Invariant cache hit.
[2024-05-24 02:26:30] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 02:26:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 02:26:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:26:30] [INFO ] After 71ms SMT Verify possible using all constraints in natural 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 p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-24 02:26:31] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:26:31] [INFO ] Invariant cache hit.
[2024-05-24 02:26:31] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-24 02:26:31] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:26:31] [INFO ] Invariant cache hit.
[2024-05-24 02:26:31] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 02:26:31] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-24 02:26:31] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:26:31] [INFO ] Invariant cache hit.
[2024-05-24 02:26:31] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 112/112 places, 272/272 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 : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 02:26:31] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:26:31] [INFO ] Invariant cache hit.
[2024-05-24 02:26:31] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-24 02:26:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:26:31] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 02:26:31] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 02:26:31] [INFO ] After 10ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 02:26:31] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 02:26:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 02:26:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:26:32] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 02:26:32] [INFO ] After 14ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 02:26:32] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-24 02:26:32] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 272/272 transitions.
Graph (complete) has 455 edges and 112 vertex of which 88 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 88 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 87 transition count 222
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 87 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 86 transition count 220
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 86 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 85 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 85 transition count 218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 84 transition count 216
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 84 transition count 216
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 84 transition count 212
Applied a total of 61 rules in 26 ms. Remains 84 /112 variables (removed 28) and now considering 212/272 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 84/112 places, 212/272 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished Best-First random walk after 4708 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1177 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 604 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 419 reset in 227 ms.
Product exploration explored 100000 steps with 395 reset in 231 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 272/272 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 112 transition count 268
Applied a total of 4 rules in 18 ms. Remains 112 /112 variables (removed 0) and now considering 268/272 (removed 4) transitions.
[2024-05-24 02:26:34] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 02:26:34] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 112 cols
[2024-05-24 02:26:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:26:34] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/112 places, 268/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 112/112 places, 268/272 transitions.
Built C files in :
/tmp/ltsmin2463440426645069911
[2024-05-24 02:26:34] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2463440426645069911
Running compilation step : cd /tmp/ltsmin2463440426645069911;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 384 ms.
Running link step : cd /tmp/ltsmin2463440426645069911;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2463440426645069911;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased418653567286808311.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-24 02:26:49] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
// Phase 1: matrix 186 rows 112 cols
[2024-05-24 02:26:49] [INFO ] Computed 2 invariants in 4 ms
[2024-05-24 02:26:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-24 02:26:49] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:26:49] [INFO ] Invariant cache hit.
[2024-05-24 02:26:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 02:26:49] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-24 02:26:49] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-24 02:26:49] [INFO ] Invariant cache hit.
[2024-05-24 02:26:49] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 112/112 places, 272/272 transitions.
Built C files in :
/tmp/ltsmin898399003662969356
[2024-05-24 02:26:49] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin898399003662969356
Running compilation step : cd /tmp/ltsmin898399003662969356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 390 ms.
Running link step : cd /tmp/ltsmin898399003662969356;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin898399003662969356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7267762551055230144.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 02:27:04] [INFO ] Flatten gal took : 12 ms
[2024-05-24 02:27:04] [INFO ] Flatten gal took : 10 ms
[2024-05-24 02:27:04] [INFO ] Time to serialize gal into /tmp/LTL17234624316674875807.gal : 2 ms
[2024-05-24 02:27:04] [INFO ] Time to serialize properties into /tmp/LTL12958188675583098525.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17234624316674875807.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1315722390810642289.hoa' '-atoms' '/tmp/LTL12958188675583098525.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12958188675583098525.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1315722390810642289.hoa
Detected timeout of ITS tools.
[2024-05-24 02:27:19] [INFO ] Flatten gal took : 10 ms
[2024-05-24 02:27:19] [INFO ] Flatten gal took : 10 ms
[2024-05-24 02:27:19] [INFO ] Time to serialize gal into /tmp/LTL14145156069433603219.gal : 2 ms
[2024-05-24 02:27:19] [INFO ] Time to serialize properties into /tmp/LTL9116623929322926807.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14145156069433603219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9116623929322926807.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(l249<1)")))U(G("(l143<=0)"))))))
Formula 0 simplified : XX(FG!"(l249<1)" R F!"(l143<=0)")
Detected timeout of ITS tools.
[2024-05-24 02:27:34] [INFO ] Flatten gal took : 19 ms
[2024-05-24 02:27:34] [INFO ] Applying decomposition
[2024-05-24 02:27:34] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13656337328692337678.txt' '-o' '/tmp/graph13656337328692337678.bin' '-w' '/tmp/graph13656337328692337678.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13656337328692337678.bin' '-l' '-1' '-v' '-w' '/tmp/graph13656337328692337678.weights' '-q' '0' '-e' '0.001'
[2024-05-24 02:27:34] [INFO ] Decomposing Gal with order
[2024-05-24 02:27:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:27:35] [INFO ] Removed a total of 452 redundant transitions.
[2024-05-24 02:27:35] [INFO ] Flatten gal took : 21 ms
[2024-05-24 02:27:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 7 ms.
[2024-05-24 02:27:35] [INFO ] Time to serialize gal into /tmp/LTL2918166950331963331.gal : 3 ms
[2024-05-24 02:27:35] [INFO ] Time to serialize properties into /tmp/LTL3917744115215844952.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2918166950331963331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3917744115215844952.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(u30.l249<1)")))U(G("(i8.u23.l143<=0)"))))))
Formula 0 simplified : XX(FG!"(u30.l249<1)" R F!"(i8.u23.l143<=0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18193957657809134502
[2024-05-24 02:27:50] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18193957657809134502
Running compilation step : cd /tmp/ltsmin18193957657809134502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 373 ms.
Running link step : cd /tmp/ltsmin18193957657809134502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin18193957657809134502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp0==true))) U []((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-b008-LTLCardinality-10 finished in 96266 ms.
[2024-05-24 02:28:05] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
[2024-05-24 02:28:05] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin2430614054360949869
[2024-05-24 02:28:05] [INFO ] Computing symmetric may disable matrix : 408 transitions.
[2024-05-24 02:28:05] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:28:05] [INFO ] Flatten gal took : 21 ms
[2024-05-24 02:28:05] [INFO ] Computing symmetric may enable matrix : 408 transitions.
[2024-05-24 02:28:05] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14756859819936906410.txt' '-o' '/tmp/graph14756859819936906410.bin' '-w' '/tmp/graph14756859819936906410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14756859819936906410.bin' '-l' '-1' '-v' '-w' '/tmp/graph14756859819936906410.weights' '-q' '0' '-e' '0.001'
[2024-05-24 02:28:05] [INFO ] Decomposing Gal with order
[2024-05-24 02:28:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:28:05] [INFO ] Computing Do-Not-Accords matrix : 408 transitions.
[2024-05-24 02:28:05] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:28:05] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2430614054360949869
Running compilation step : cd /tmp/ltsmin2430614054360949869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 02:28:05] [INFO ] Removed a total of 696 redundant transitions.
[2024-05-24 02:28:05] [INFO ] Flatten gal took : 35 ms
[2024-05-24 02:28:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 229 labels/synchronizations in 11 ms.
[2024-05-24 02:28:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality16410397361483955696.gal : 3 ms
[2024-05-24 02:28:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality10090742232510151232.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16410397361483955696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10090742232510151232.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(i0.u1.l249<1)")))U(G("(i8.u32.l143<=0)"))))))
Formula 0 simplified : XX(FG!"(i0.u1.l249<1)" R F!"(i8.u32.l143<=0)")
Compilation finished in 921 ms.
Running link step : cd /tmp/ltsmin2430614054360949869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2430614054360949869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp0==true))) U []((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: LTL layer: formula: X(X(([](<>((LTLAPp0==true))) U []((LTLAPp1==true)))))
pins2lts-mc-linux64( 7/ 8), 0.018: "X(X(([](<>((LTLAPp0==true))) U []((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.018: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.084: There are 411 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.084: State length is 165, there are 421 groups
pins2lts-mc-linux64( 0/ 8), 0.084: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.084: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.084: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.084: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.126: [Blue] ~93 levels ~960 states ~3216 transitions
pins2lts-mc-linux64( 3/ 8), 0.151: [Blue] ~173 levels ~1920 states ~5616 transitions
pins2lts-mc-linux64( 3/ 8), 0.224: [Blue] ~333 levels ~3840 states ~10416 transitions
pins2lts-mc-linux64( 4/ 8), 0.323: [Blue] ~960 levels ~7680 states ~34072 transitions
pins2lts-mc-linux64( 4/ 8), 0.489: [Blue] ~1920 levels ~15360 states ~68568 transitions
pins2lts-mc-linux64( 4/ 8), 0.760: [Blue] ~3840 levels ~30720 states ~138176 transitions
pins2lts-mc-linux64( 4/ 8), 1.308: [Blue] ~7680 levels ~61440 states ~277784 transitions
pins2lts-mc-linux64( 3/ 8), 2.118: [Blue] ~10253 levels ~122880 states ~308016 transitions
pins2lts-mc-linux64( 3/ 8), 3.207: [Blue] ~20493 levels ~245760 states ~615216 transitions
pins2lts-mc-linux64( 3/ 8), 5.054: [Blue] ~40973 levels ~491520 states ~1229616 transitions
pins2lts-mc-linux64( 7/ 8), 8.470: [Blue] ~122880 levels ~983040 states ~5693672 transitions
pins2lts-mc-linux64( 7/ 8), 15.053: [Blue] ~245760 levels ~1966080 states ~11387112 transitions
pins2lts-mc-linux64( 7/ 8), 28.651: [Blue] ~491520 levels ~3932160 states ~22773992 transitions
pins2lts-mc-linux64( 7/ 8), 57.324: [Blue] ~983040 levels ~7864320 states ~45547752 transitions
pins2lts-mc-linux64( 1/ 8), 61.616: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 61.774:
pins2lts-mc-linux64( 0/ 8), 61.774: Explored 7751495 states 35906499 transitions, fanout: 4.632
pins2lts-mc-linux64( 0/ 8), 61.774: Total exploration time 61.680 sec (61.500 sec minimum, 61.588 sec on average)
pins2lts-mc-linux64( 0/ 8), 61.774: States per second: 125673, Transitions per second: 582142
pins2lts-mc-linux64( 0/ 8), 61.774:
pins2lts-mc-linux64( 0/ 8), 61.774: State space has 31909187 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 61.774: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 61.774: blue states: 7751495 (24.29%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 61.774: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 61.774: all-red states: 252220 (0.79%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 61.774:
pins2lts-mc-linux64( 0/ 8), 61.774: Total memory used for local state coloring: 109.5MB
pins2lts-mc-linux64( 0/ 8), 61.774:
pins2lts-mc-linux64( 0/ 8), 61.774: Queue width: 8B, total height: 7173140, memory: 54.73MB
pins2lts-mc-linux64( 0/ 8), 61.774: Tree memory: 499.4MB, 16.4 B/state, compr.: 2.5%
pins2lts-mc-linux64( 0/ 8), 61.774: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 61.774: Stored 419 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 61.774: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 61.774: Est. total memory use: 554.2MB (~1078.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2430614054360949869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp0==true))) U []((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2430614054360949869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp0==true))) U []((LTLAPp1==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.
[2024-05-24 02:49:11] [INFO ] Flatten gal took : 13 ms
[2024-05-24 02:49:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality1041174035344726229.gal : 2 ms
[2024-05-24 02:49:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality17238261719771259929.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1041174035344726229.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17238261719771259929.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(l249<1)")))U(G("(l143<=0)"))))))
Formula 0 simplified : XX(FG!"(l249<1)" R F!"(l143<=0)")
Detected timeout of ITS tools.
[2024-05-24 03:10:32] [INFO ] Flatten gal took : 227 ms
[2024-05-24 03:10:33] [INFO ] Input system was already deterministic with 408 transitions.
[2024-05-24 03:10:33] [INFO ] Transformed 164 places.
[2024-05-24 03:10:33] [INFO ] Transformed 408 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 03:10:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality6480713019716601922.gal : 21 ms
[2024-05-24 03:10:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality279331412140799797.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6480713019716601922.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality279331412140799797.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((G(F("(l249<1)")))U(G("(l143<=0)"))))))
Formula 0 simplified : XX(FG!"(l249<1)" R F!"(l143<=0)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 169864 kB
After kill :
MemTotal: 16393216 kB
MemFree: 12879960 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-b008"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FunctionPointer-PT-b008, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625000147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b008.tgz
mv FunctionPointer-PT-b008 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;