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.r109-tall-171624208500422.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 DES-PT-10b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K 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 DES-PT-10b-LTLCardinality-00
FORMULA_NAME DES-PT-10b-LTLCardinality-01
FORMULA_NAME DES-PT-10b-LTLCardinality-02
FORMULA_NAME DES-PT-10b-LTLCardinality-03
FORMULA_NAME DES-PT-10b-LTLCardinality-04
FORMULA_NAME DES-PT-10b-LTLCardinality-05
FORMULA_NAME DES-PT-10b-LTLCardinality-06
FORMULA_NAME DES-PT-10b-LTLCardinality-07
FORMULA_NAME DES-PT-10b-LTLCardinality-08
FORMULA_NAME DES-PT-10b-LTLCardinality-09
FORMULA_NAME DES-PT-10b-LTLCardinality-10
FORMULA_NAME DES-PT-10b-LTLCardinality-11
FORMULA_NAME DES-PT-10b-LTLCardinality-12
FORMULA_NAME DES-PT-10b-LTLCardinality-13
FORMULA_NAME DES-PT-10b-LTLCardinality-14
FORMULA_NAME DES-PT-10b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716333568936

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=DES-PT-10b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 23:19:30] [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-21 23:19:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:19:30] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-21 23:19:30] [INFO ] Transformed 320 places.
[2024-05-21 23:19:30] [INFO ] Transformed 271 transitions.
[2024-05-21 23:19:30] [INFO ] Found NUPN structural information;
[2024-05-21 23:19:30] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-10b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 296 transition count 250
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 296 transition count 250
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 283 transition count 237
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 283 transition count 237
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 283 transition count 228
Applied a total of 80 rules in 63 ms. Remains 283 /320 variables (removed 37) and now considering 228/271 (removed 43) transitions.
// Phase 1: matrix 228 rows 283 cols
[2024-05-21 23:19:31] [INFO ] Computed 62 invariants in 32 ms
[2024-05-21 23:19:31] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-21 23:19:31] [INFO ] Invariant cache hit.
[2024-05-21 23:19:31] [INFO ] Implicit Places using invariants and state equation in 350 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 896 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 282/320 places, 228/271 transitions.
Applied a total of 0 rules in 5 ms. Remains 282 /282 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 964 ms. Remains : 282/320 places, 228/271 transitions.
Support contains 23 out of 282 places after structural reductions.
[2024-05-21 23:19:31] [INFO ] Flatten gal took : 43 ms
[2024-05-21 23:19:31] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:19:31] [INFO ] Input system was already deterministic with 228 transitions.
Support contains 21 out of 282 places (down from 23) after GAL structural reductions.
Finished random walk after 1522 steps, including 13 resets, run visited all 14 properties in 60 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
FORMULA DES-PT-10b-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 548 edges and 282 vertex of which 277 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 277 transition count 222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 274 transition count 219
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 274 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 274 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 273 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 273 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 273 transition count 214
Applied a total of 23 rules in 30 ms. Remains 273 /282 variables (removed 9) and now considering 214/228 (removed 14) transitions.
// Phase 1: matrix 214 rows 273 cols
[2024-05-21 23:19:32] [INFO ] Computed 61 invariants in 15 ms
[2024-05-21 23:19:32] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 23:19:32] [INFO ] Invariant cache hit.
[2024-05-21 23:19:32] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-05-21 23:19:32] [INFO ] Invariant cache hit.
[2024-05-21 23:19:32] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 273/282 places, 214/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 599 ms. Remains : 273/282 places, 214/228 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 329 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s76 0) (EQ s145 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 180 steps with 3 reset in 5 ms.
FORMULA DES-PT-10b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLCardinality-03 finished in 987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 548 edges and 282 vertex of which 277 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 276 transition count 209
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 261 transition count 209
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 261 transition count 198
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 250 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 248 transition count 196
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 248 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 248 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 247 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 247 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 247 transition count 192
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 64 place count 246 transition count 191
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 212 place count 172 transition count 117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 220 place count 168 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 166 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 223 place count 165 transition count 124
Applied a total of 223 rules in 66 ms. Remains 165 /282 variables (removed 117) and now considering 124/228 (removed 104) transitions.
// Phase 1: matrix 124 rows 165 cols
[2024-05-21 23:19:33] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 23:19:33] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 23:19:33] [INFO ] Invariant cache hit.
[2024-05-21 23:19:33] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-21 23:19:33] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 23:19:33] [INFO ] Invariant cache hit.
[2024-05-21 23:19:33] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/282 places, 124/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 423 ms. Remains : 165/282 places, 124/228 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s86 0) (EQ s69 1) (EQ s50 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4644 reset in 347 ms.
Product exploration explored 100000 steps with 4597 reset in 321 ms.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 55 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 124/124 transitions.
Applied a total of 0 rules in 12 ms. Remains 165 /165 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-21 23:19:34] [INFO ] Invariant cache hit.
[2024-05-21 23:19:34] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 23:19:34] [INFO ] Invariant cache hit.
[2024-05-21 23:19:34] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-21 23:19:34] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 23:19:34] [INFO ] Invariant cache hit.
[2024-05-21 23:19:35] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 375 ms. Remains : 165/165 places, 124/124 transitions.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4645 reset in 239 ms.
Product exploration explored 100000 steps with 4632 reset in 326 ms.
Built C files in :
/tmp/ltsmin3756181639481602381
[2024-05-21 23:19:35] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2024-05-21 23:19:35] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:19:36] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2024-05-21 23:19:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:19:36] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2024-05-21 23:19:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:19:36] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3756181639481602381
Running compilation step : cd /tmp/ltsmin3756181639481602381;'/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 382 ms.
Running link step : cd /tmp/ltsmin3756181639481602381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3756181639481602381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1641822576124229308.hoa' '--buchi-type=spotba'
LTSmin run took 2789 ms.
FORMULA DES-PT-10b-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10b-LTLCardinality-04 finished in 6068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 548 edges and 282 vertex of which 277 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 276 transition count 210
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 262 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 261 transition count 209
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 31 place count 261 transition count 198
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 53 place count 250 transition count 198
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 57 place count 246 transition count 194
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 246 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 246 transition count 193
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 65 place count 243 transition count 190
Iterating global reduction 4 with 3 rules applied. Total rules applied 68 place count 243 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 72 place count 243 transition count 186
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 74 place count 242 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 74 place count 242 transition count 183
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 78 place count 240 transition count 183
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 228 place count 165 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 163 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 161 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 160 transition count 108
Applied a total of 235 rules in 61 ms. Remains 160 /282 variables (removed 122) and now considering 108/228 (removed 120) transitions.
// Phase 1: matrix 108 rows 160 cols
[2024-05-21 23:19:39] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 23:19:39] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 23:19:39] [INFO ] Invariant cache hit.
[2024-05-21 23:19:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:19:39] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-05-21 23:19:39] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:19:39] [INFO ] Invariant cache hit.
[2024-05-21 23:19:39] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/282 places, 108/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 401 ms. Remains : 160/282 places, 108/228 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s131 0) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 88 steps with 4 reset in 1 ms.
FORMULA DES-PT-10b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLCardinality-06 finished in 456 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(p1) U (p2||X(p3)))||p0)))'
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 279 transition count 225
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 279 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 279 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 277 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 277 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 277 transition count 220
Applied a total of 13 rules in 19 ms. Remains 277 /282 variables (removed 5) and now considering 220/228 (removed 8) transitions.
// Phase 1: matrix 220 rows 277 cols
[2024-05-21 23:19:39] [INFO ] Computed 61 invariants in 7 ms
[2024-05-21 23:19:39] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 23:19:39] [INFO ] Invariant cache hit.
[2024-05-21 23:19:40] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-05-21 23:19:40] [INFO ] Invariant cache hit.
[2024-05-21 23:19:40] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/282 places, 220/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 556 ms. Remains : 277/282 places, 220/228 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s103 0) (EQ s62 1)), p2:(EQ s159 1), p1:(OR (EQ s115 0) (EQ s55 1)), p3:(OR (EQ s68 0) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 887 reset in 255 ms.
Product exploration explored 100000 steps with 890 reset in 247 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 535 edges and 277 vertex of which 272 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 95 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 23:19:41] [INFO ] Invariant cache hit.
[2024-05-21 23:19:41] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:19:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2024-05-21 23:19:41] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 14 ms returned sat
[2024-05-21 23:19:41] [INFO ] After 162ms 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 p0 (NOT p2) p1 p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p3) (NOT p1))), (F (NOT p1)), (F (AND (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 9 factoid took 238 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Support contains 7 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 220/220 transitions.
Applied a total of 0 rules in 10 ms. Remains 277 /277 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2024-05-21 23:19:42] [INFO ] Invariant cache hit.
[2024-05-21 23:19:42] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 23:19:42] [INFO ] Invariant cache hit.
[2024-05-21 23:19:42] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-21 23:19:42] [INFO ] Invariant cache hit.
[2024-05-21 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 519 ms. Remains : 277/277 places, 220/220 transitions.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 535 edges and 277 vertex of which 272 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 82 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Finished random walk after 2080 steps, including 17 resets, run visited all 5 properties in 17 ms. (steps per millisecond=122 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p3)))]
Knowledge based reduction with 6 factoid took 291 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 892 reset in 181 ms.
Product exploration explored 100000 steps with 894 reset in 196 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Support contains 7 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 220/220 transitions.
Graph (complete) has 535 edges and 277 vertex of which 272 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 272 transition count 217
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 14 place count 272 transition count 218
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 272 transition count 218
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 267 transition count 213
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 267 transition count 213
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 109 place count 267 transition count 219
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 118 place count 258 transition count 210
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 127 place count 258 transition count 210
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 258 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 256 transition count 220
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 256 transition count 220
Deduced a syphon composed of 85 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 137 place count 256 transition count 217
Deduced a syphon composed of 85 places in 0 ms
Applied a total of 137 rules in 74 ms. Remains 256 /277 variables (removed 21) and now considering 217/220 (removed 3) transitions.
[2024-05-21 23:19:44] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 217 rows 256 cols
[2024-05-21 23:19:44] [INFO ] Computed 59 invariants in 3 ms
[2024-05-21 23:19:44] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 256/277 places, 217/220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 256/277 places, 217/220 transitions.
Built C files in :
/tmp/ltsmin1704469015530102973
[2024-05-21 23:19:44] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1704469015530102973
Running compilation step : cd /tmp/ltsmin1704469015530102973;'/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 361 ms.
Running link step : cd /tmp/ltsmin1704469015530102973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1704469015530102973;'/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/stateBased17244829841139814078.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 220/220 transitions.
Applied a total of 0 rules in 11 ms. Remains 277 /277 variables (removed 0) and now considering 220/220 (removed 0) transitions.
// Phase 1: matrix 220 rows 277 cols
[2024-05-21 23:19:59] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 23:20:00] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 23:20:00] [INFO ] Invariant cache hit.
[2024-05-21 23:20:00] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-21 23:20:00] [INFO ] Invariant cache hit.
[2024-05-21 23:20:00] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 277/277 places, 220/220 transitions.
Built C files in :
/tmp/ltsmin1029678203576864842
[2024-05-21 23:20:00] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1029678203576864842
Running compilation step : cd /tmp/ltsmin1029678203576864842;'/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 358 ms.
Running link step : cd /tmp/ltsmin1029678203576864842;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1029678203576864842;'/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/stateBased12466519745187038431.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:20:15] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:20:15] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:20:15] [INFO ] Time to serialize gal into /tmp/LTL12541593348715545912.gal : 4 ms
[2024-05-21 23:20:15] [INFO ] Time to serialize properties into /tmp/LTL9192946955119966372.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/LTL12541593348715545912.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5452549155510843654.hoa' '-atoms' '/tmp/LTL9192946955119966372.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/LTL9192946955119966372.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5452549155510843654.hoa
Detected timeout of ITS tools.
[2024-05-21 23:20:30] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:20:30] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:20:30] [INFO ] Time to serialize gal into /tmp/LTL2508749407942340895.gal : 2 ms
[2024-05-21 23:20:30] [INFO ] Time to serialize properties into /tmp/LTL17988145312278049452.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/LTL2508749407942340895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17988145312278049452.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((p129==0)||(p69==1))")||((F("((p145==0)||(p57==1))"))U(("(p197==1)")||(X("((p79==0)||(p78==1))")))))))
Formula 0 simplified : F(!"((p129==0)||(p69==1))" & (G!"((p145==0)||(p57==1))" R (!"(p197==1)" & X!"((p79==0)||(p78==1))")))
Detected timeout of ITS tools.
[2024-05-21 23:20:45] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:20:45] [INFO ] Applying decomposition
[2024-05-21 23:20:45] [INFO ] Flatten gal took : 27 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/graph17773881018506715656.txt' '-o' '/tmp/graph17773881018506715656.bin' '-w' '/tmp/graph17773881018506715656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17773881018506715656.bin' '-l' '-1' '-v' '-w' '/tmp/graph17773881018506715656.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:20:46] [INFO ] Decomposing Gal with order
[2024-05-21 23:20:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:20:46] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-21 23:20:46] [INFO ] Flatten gal took : 304 ms
[2024-05-21 23:20:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 16 ms.
[2024-05-21 23:20:46] [INFO ] Time to serialize gal into /tmp/LTL1983665941600772729.gal : 34 ms
[2024-05-21 23:20:46] [INFO ] Time to serialize properties into /tmp/LTL7530181200051580446.ltl : 19 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/LTL1983665941600772729.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7530181200051580446.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("((i5.u27.p129==0)||(i3.u7.p69==1))")||((F("((i5.u28.p145==0)||(i3.u6.p57==1))"))U(("(i8.i0.u45.p197==1)")||(X("((i4.i0.u12.p79=...187
Formula 0 simplified : F(!"((i5.u27.p129==0)||(i3.u7.p69==1))" & (G!"((i5.u28.p145==0)||(i3.u6.p57==1))" R (!"(i8.i0.u45.p197==1)" & X!"((i4.i0.u12.p79==0)...180
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16849599554714846135
[2024-05-21 23:21:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16849599554714846135
Running compilation step : cd /tmp/ltsmin16849599554714846135;'/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 348 ms.
Running link step : cd /tmp/ltsmin16849599554714846135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin16849599554714846135;'/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' '[](((<>((LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-10b-LTLCardinality-07 finished in 97024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 548 edges and 282 vertex of which 277 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 276 transition count 209
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 261 transition count 209
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 261 transition count 198
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 250 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 246 transition count 194
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 246 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 246 transition count 193
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 243 transition count 190
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 243 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 72 place count 243 transition count 186
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 242 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 74 place count 242 transition count 183
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 78 place count 240 transition count 183
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 228 place count 165 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 232 place count 163 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 161 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 235 place count 160 transition count 108
Applied a total of 235 rules in 50 ms. Remains 160 /282 variables (removed 122) and now considering 108/228 (removed 120) transitions.
// Phase 1: matrix 108 rows 160 cols
[2024-05-21 23:21:16] [INFO ] Computed 58 invariants in 4 ms
[2024-05-21 23:21:16] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:21:16] [INFO ] Invariant cache hit.
[2024-05-21 23:21:17] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-05-21 23:21:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:21:17] [INFO ] Invariant cache hit.
[2024-05-21 23:21:17] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/282 places, 108/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 160/282 places, 108/228 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLCardinality-08 finished in 465 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(p0))))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 277 transition count 222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 274 transition count 219
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 274 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 274 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 273 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 273 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 273 transition count 214
Applied a total of 23 rules in 20 ms. Remains 273 /282 variables (removed 9) and now considering 214/228 (removed 14) transitions.
// Phase 1: matrix 214 rows 273 cols
[2024-05-21 23:21:17] [INFO ] Computed 61 invariants in 5 ms
[2024-05-21 23:21:17] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 23:21:17] [INFO ] Invariant cache hit.
[2024-05-21 23:21:17] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-05-21 23:21:17] [INFO ] Invariant cache hit.
[2024-05-21 23:21:17] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 273/282 places, 214/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 273/282 places, 214/228 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s270 0) (NEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLCardinality-09 finished in 676 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(F(p0))))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 278 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 278 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 275 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 275 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 275 transition count 218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 274 transition count 217
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 274 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 274 transition count 216
Applied a total of 20 rules in 16 ms. Remains 274 /282 variables (removed 8) and now considering 216/228 (removed 12) transitions.
// Phase 1: matrix 216 rows 274 cols
[2024-05-21 23:21:17] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 23:21:18] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 23:21:18] [INFO ] Invariant cache hit.
[2024-05-21 23:21:18] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-05-21 23:21:18] [INFO ] Invariant cache hit.
[2024-05-21 23:21:18] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 274/282 places, 216/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 543 ms. Remains : 274/282 places, 216/228 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s115 0) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 142 ms.
Product exploration explored 100000 steps with 33333 reset in 142 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 96 stabilizing places and 89 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 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10b-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10b-LTLCardinality-11 finished in 993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 548 edges and 282 vertex of which 277 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 276 transition count 209
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 261 transition count 209
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 261 transition count 199
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 251 transition count 199
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 248 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 248 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 248 transition count 195
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 246 transition count 193
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 246 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 246 transition count 191
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 64 place count 246 transition count 189
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 68 place count 244 transition count 189
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 224 place count 166 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 166 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 164 transition count 115
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 164 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 162 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 161 transition count 113
Applied a total of 233 rules in 46 ms. Remains 161 /282 variables (removed 121) and now considering 113/228 (removed 115) transitions.
// Phase 1: matrix 113 rows 161 cols
[2024-05-21 23:21:18] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:21:19] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 23:21:19] [INFO ] Invariant cache hit.
[2024-05-21 23:21:19] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-21 23:21:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:21:19] [INFO ] Invariant cache hit.
[2024-05-21 23:21:19] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/282 places, 113/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 373 ms. Remains : 161/282 places, 113/228 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s46 0) (NEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLCardinality-15 finished in 421 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(p1) U (p2||X(p3)))||p0)))'
Found a Lengthening insensitive property : DES-PT-10b-LTLCardinality-07
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 548 edges and 282 vertex of which 277 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 276 transition count 212
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 264 transition count 212
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 25 place count 264 transition count 203
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 43 place count 255 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 252 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 252 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 252 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 250 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 250 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 250 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 56 place count 250 transition count 193
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 248 transition count 193
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 214 place count 171 transition count 116
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 215 place count 171 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 216 place count 171 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 218 place count 169 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 168 transition count 113
Applied a total of 219 rules in 44 ms. Remains 168 /282 variables (removed 114) and now considering 113/228 (removed 115) transitions.
// Phase 1: matrix 113 rows 168 cols
[2024-05-21 23:21:19] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:21:19] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 23:21:19] [INFO ] Invariant cache hit.
[2024-05-21 23:21:19] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-21 23:21:19] [INFO ] Invariant cache hit.
[2024-05-21 23:21:19] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 168/282 places, 113/228 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 374 ms. Remains : 168/282 places, 113/228 transitions.
Running random walk in product with property : DES-PT-10b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s63 0) (EQ s46 1)), p2:(EQ s89 1), p1:(OR (EQ s73 0) (EQ s41 1)), p3:(OR (EQ s50 0) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3783 reset in 171 ms.
Product exploration explored 100000 steps with 3738 reset in 195 ms.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 157 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Incomplete random walk after 10000 steps, including 368 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 23:21:20] [INFO ] Invariant cache hit.
[2024-05-21 23:21:20] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:21:20] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-21 23:21:20] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 6 ms returned sat
[2024-05-21 23:21:20] [INFO ] After 85ms 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 p0 (NOT p2) p1 p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p3) (NOT p1))), (F (NOT p1)), (F (AND (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Support contains 7 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 113/113 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-21 23:21:21] [INFO ] Invariant cache hit.
[2024-05-21 23:21:21] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 23:21:21] [INFO ] Invariant cache hit.
[2024-05-21 23:21:21] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-21 23:21:21] [INFO ] Invariant cache hit.
[2024-05-21 23:21:21] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 168/168 places, 113/113 transitions.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 88 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Finished random walk after 1334 steps, including 45 resets, run visited all 5 properties in 11 ms. (steps per millisecond=121 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p3)))]
Knowledge based reduction with 6 factoid took 190 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 3745 reset in 187 ms.
Product exploration explored 100000 steps with 3803 reset in 218 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Support contains 7 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-21 23:21:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:21:23] [INFO ] Invariant cache hit.
[2024-05-21 23:21:23] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 168/168 places, 113/113 transitions.
Built C files in :
/tmp/ltsmin15331177366397996524
[2024-05-21 23:21:23] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15331177366397996524
Running compilation step : cd /tmp/ltsmin15331177366397996524;'/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 225 ms.
Running link step : cd /tmp/ltsmin15331177366397996524;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15331177366397996524;'/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/stateBased5639187857430575862.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 113/113 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-21 23:21:38] [INFO ] Invariant cache hit.
[2024-05-21 23:21:38] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 23:21:38] [INFO ] Invariant cache hit.
[2024-05-21 23:21:38] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-21 23:21:38] [INFO ] Invariant cache hit.
[2024-05-21 23:21:38] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 168/168 places, 113/113 transitions.
Built C files in :
/tmp/ltsmin16861154164147246666
[2024-05-21 23:21:38] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16861154164147246666
Running compilation step : cd /tmp/ltsmin16861154164147246666;'/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 224 ms.
Running link step : cd /tmp/ltsmin16861154164147246666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16861154164147246666;'/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/stateBased15475381531447148953.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:21:54] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:21:54] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:21:54] [INFO ] Time to serialize gal into /tmp/LTL15696717103343602711.gal : 2 ms
[2024-05-21 23:21:54] [INFO ] Time to serialize properties into /tmp/LTL14536947771336723543.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/LTL15696717103343602711.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15842997580727379460.hoa' '-atoms' '/tmp/LTL14536947771336723543.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...320
Loading property file /tmp/LTL14536947771336723543.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15842997580727379460.hoa
Detected timeout of ITS tools.
[2024-05-21 23:22:09] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:22:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:22:09] [INFO ] Time to serialize gal into /tmp/LTL12724504400291433900.gal : 14 ms
[2024-05-21 23:22:09] [INFO ] Time to serialize properties into /tmp/LTL6452605616354252934.ltl : 3 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/LTL12724504400291433900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6452605616354252934.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((p129==0)||(p69==1))")||((F("((p145==0)||(p57==1))"))U(("(p197==1)")||(X("((p79==0)||(p78==1))")))))))
Formula 0 simplified : F(!"((p129==0)||(p69==1))" & (G!"((p145==0)||(p57==1))" R (!"(p197==1)" & X!"((p79==0)||(p78==1))")))
Detected timeout of ITS tools.
[2024-05-21 23:22:24] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:22:24] [INFO ] Applying decomposition
[2024-05-21 23:22:24] [INFO ] Flatten gal took : 8 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/graph15906473633316420066.txt' '-o' '/tmp/graph15906473633316420066.bin' '-w' '/tmp/graph15906473633316420066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15906473633316420066.bin' '-l' '-1' '-v' '-w' '/tmp/graph15906473633316420066.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:22:24] [INFO ] Decomposing Gal with order
[2024-05-21 23:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:22:24] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-21 23:22:24] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:22:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-21 23:22:24] [INFO ] Time to serialize gal into /tmp/LTL3397869361744817365.gal : 2 ms
[2024-05-21 23:22:24] [INFO ] Time to serialize properties into /tmp/LTL5352940367639887019.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/LTL3397869361744817365.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5352940367639887019.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("((i3.u7.p129==0)||(i3.u1.p69==1))")||((F("((i3.u8.p145==0)||(i0.u0.p57==1))"))U(("(i6.i1.u16.p197==1)")||(X("((i1.u3.p79==0)||(...177
Formula 0 simplified : F(!"((i3.u7.p129==0)||(i3.u1.p69==1))" & (G!"((i3.u8.p145==0)||(i0.u0.p57==1))" R (!"(i6.i1.u16.p197==1)" & X!"((i1.u3.p79==0)||(i1....170
Reverse transition relation is NOT exact ! Due to transitions t220_t79, t7_t48_t39, t188_t34, t187_t25, u11.t178, u12.t4.t139.t76.t75, u45.t11.t17, u45.t14...543
Computing Next relation with stutter on 8.68949e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1344764035703120914
[2024-05-21 23:22:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1344764035703120914
Running compilation step : cd /tmp/ltsmin1344764035703120914;'/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 239 ms.
Running link step : cd /tmp/ltsmin1344764035703120914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1344764035703120914;'/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' '[](((<>((LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-10b-LTLCardinality-07 finished in 95210 ms.
[2024-05-21 23:22:54] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
[2024-05-21 23:22:54] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin15806119428179150749
[2024-05-21 23:22:54] [INFO ] Computing symmetric may disable matrix : 228 transitions.
[2024-05-21 23:22:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:22:54] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:22:54] [INFO ] Computing symmetric may enable matrix : 228 transitions.
[2024-05-21 23:22:54] [INFO ] Computation of Complete enable matrix. took 1 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/graph13529745792959228062.txt' '-o' '/tmp/graph13529745792959228062.bin' '-w' '/tmp/graph13529745792959228062.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13529745792959228062.bin' '-l' '-1' '-v' '-w' '/tmp/graph13529745792959228062.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:22:54] [INFO ] Decomposing Gal with order
[2024-05-21 23:22:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:22:54] [INFO ] Computing Do-Not-Accords matrix : 228 transitions.
[2024-05-21 23:22:54] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:22:54] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15806119428179150749
Running compilation step : cd /tmp/ltsmin15806119428179150749;'/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-21 23:22:54] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-21 23:22:54] [INFO ] Flatten gal took : 45 ms
[2024-05-21 23:22:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-21 23:22:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality14917923149884069792.gal : 19 ms
[2024-05-21 23:22:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality11740392987122298824.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/LTLCardinality14917923149884069792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11740392987122298824.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 : !((G(("((i4.i1.u26.p129==0)||(i1.u6.p69==1))")||((F("((i4.i1.u28.p145==0)||(i1.u5.p57==1))"))U(("(i10.i1.u47.p197==1)")||(X("((i2.i1.u...193
Formula 0 simplified : F(!"((i4.i1.u26.p129==0)||(i1.u6.p69==1))" & (G!"((i4.i1.u28.p145==0)||(i1.u5.p57==1))" R (!"(i10.i1.u47.p197==1)" & X!"((i2.i1.u10....186
Compilation finished in 502 ms.
Running link step : cd /tmp/ltsmin15806119428179150749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin15806119428179150749;'/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' '[](((<>((LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t90, t168, t187, t188, t220, u34.t79, i0.i0.u22.t100, i0.i1.u14.t112, i0.i1.u14.t114...943
Computing Next relation with stutter on 2.09172e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: LTL layer: formula: [](((<>((LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.004: "[](((<>((LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.053: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.206: DFS-FIFO for weak LTL, using special progress label 233
pins2lts-mc-linux64( 0/ 8), 0.206: There are 234 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.206: State length is 283, there are 235 groups
pins2lts-mc-linux64( 0/ 8), 0.206: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.206: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.206: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.206: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.373: ~1 levels ~960 states ~4112 transitions
pins2lts-mc-linux64( 0/ 8), 0.382: ~1 levels ~1920 states ~8896 transitions
pins2lts-mc-linux64( 0/ 8), 0.478: ~1 levels ~3840 states ~18704 transitions
pins2lts-mc-linux64( 0/ 8), 0.925: ~1 levels ~7680 states ~39552 transitions
pins2lts-mc-linux64( 0/ 8), 1.266: ~1 levels ~15360 states ~82888 transitions
pins2lts-mc-linux64( 0/ 8), 1.956: ~1 levels ~30720 states ~181696 transitions
pins2lts-mc-linux64( 0/ 8), 3.191: ~1 levels ~61440 states ~395768 transitions
pins2lts-mc-linux64( 0/ 8), 6.685: ~1 levels ~122880 states ~838080 transitions
pins2lts-mc-linux64( 0/ 8), 12.144: ~1 levels ~245760 states ~1752680 transitions
pins2lts-mc-linux64( 0/ 8), 20.310: ~1 levels ~491520 states ~3620544 transitions
pins2lts-mc-linux64( 0/ 8), 28.077: ~1 levels ~983040 states ~7459520 transitions
pins2lts-mc-linux64( 0/ 8), 38.709: ~1 levels ~1966080 states ~15034584 transitions
pins2lts-mc-linux64( 0/ 8), 64.938: ~1 levels ~3932160 states ~36011352 transitions
pins2lts-mc-linux64( 3/ 8), 120.788: ~1 levels ~7864320 states ~83112600 transitions
pins2lts-mc-linux64( 3/ 8), 234.146: ~1 levels ~15728640 states ~169475456 transitions
pins2lts-mc-linux64( 6/ 8), 444.888: ~1 levels ~31457280 states ~330609208 transitions
pins2lts-mc-linux64( 6/ 8), 797.224: ~1 levels ~62914560 states ~673472968 transitions
pins2lts-mc-linux64( 1/ 8), 1144.000: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1144.053:
pins2lts-mc-linux64( 0/ 8), 1144.053: mean standard work distribution: 5.8% (states) 3.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1144.053:
pins2lts-mc-linux64( 0/ 8), 1144.053: Explored 79905781 states 987646334 transitions, fanout: 12.360
pins2lts-mc-linux64( 0/ 8), 1144.053: Total exploration time 1143.830 sec (1143.770 sec minimum, 1143.802 sec on average)
pins2lts-mc-linux64( 0/ 8), 1144.053: States per second: 69858, Transitions per second: 863456
pins2lts-mc-linux64( 0/ 8), 1144.053:
pins2lts-mc-linux64( 0/ 8), 1144.053: Progress states detected: 134217319
pins2lts-mc-linux64( 0/ 8), 1144.053: Redundant explorations: -40.4654
pins2lts-mc-linux64( 0/ 8), 1144.053:
pins2lts-mc-linux64( 0/ 8), 1144.053: Queue width: 8B, total height: 91419291, memory: 697.47MB
pins2lts-mc-linux64( 0/ 8), 1144.053: Tree memory: 1112.6MB, 8.7 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 1144.053: Tree fill ratio (roots/leafs): 99.0%/34.0%
pins2lts-mc-linux64( 0/ 8), 1144.053: Stored 228 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1144.053: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1144.053: Est. total memory use: 1810.0MB (~1721.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15806119428179150749;'/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' '[](((<>((LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15806119428179150749;'/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' '[](((<>((LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-21 23:44:02] [INFO ] Applying decomposition
[2024-05-21 23:44:02] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:44:02] [INFO ] Decomposing Gal with order
[2024-05-21 23:44:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:44:02] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-21 23:44:02] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:44:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 10 ms.
[2024-05-21 23:44:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality14891221813231377503.gal : 5 ms
[2024-05-21 23:44:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality16317161216291506983.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14891221813231377503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16317161216291506983.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 : !((G(("((i1.i0.i1.i0.i1.i0.i1.u133.p129==0)||(i1.i0.i0.i0.i0.i0.i0.u16.p69==1))")||((F("((i1.i0.i1.i0.i1.i0.i1.u31.p145==0)||(i1.i0.i0...329
Formula 0 simplified : F(!"((i1.i0.i1.i0.i1.i0.i1.u133.p129==0)||(i1.i0.i0.i0.i0.i0.i0.u16.p69==1))" & (G!"((i1.i0.i1.i0.i1.i0.i1.u31.p145==0)||(i1.i0.i0.i...322
Detected timeout of ITS tools.
[2024-05-22 00:05:11] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:05:11] [INFO ] Input system was already deterministic with 228 transitions.
[2024-05-22 00:05:11] [INFO ] Transformed 282 places.
[2024-05-22 00:05:11] [INFO ] Transformed 228 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-22 00:05:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality14927769156797303018.gal : 3 ms
[2024-05-22 00:05:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality12448213144095488353.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/LTLCardinality14927769156797303018.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12448213144095488353.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("((p129==0)||(p69==1))")||((F("((p145==0)||(p57==1))"))U(("(p197==1)")||(X("((p79==0)||(p78==1))")))))))
Formula 0 simplified : F(!"((p129==0)||(p69==1))" & (G!"((p145==0)||(p57==1))" R (!"(p197==1)" & X!"((p79==0)||(p78==1))")))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 153616 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15808632 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'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.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="DES-PT-10b"
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 DES-PT-10b, 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 r109-tall-171624208500422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;