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.r571-tall-171734910400187.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 FireWire-PT-17, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910400187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-17-LTLCardinality-00
FORMULA_NAME FireWire-PT-17-LTLCardinality-01
FORMULA_NAME FireWire-PT-17-LTLCardinality-02
FORMULA_NAME FireWire-PT-17-LTLCardinality-03
FORMULA_NAME FireWire-PT-17-LTLCardinality-04
FORMULA_NAME FireWire-PT-17-LTLCardinality-05
FORMULA_NAME FireWire-PT-17-LTLCardinality-06
FORMULA_NAME FireWire-PT-17-LTLCardinality-07
FORMULA_NAME FireWire-PT-17-LTLCardinality-08
FORMULA_NAME FireWire-PT-17-LTLCardinality-09
FORMULA_NAME FireWire-PT-17-LTLCardinality-10
FORMULA_NAME FireWire-PT-17-LTLCardinality-11
FORMULA_NAME FireWire-PT-17-LTLCardinality-12
FORMULA_NAME FireWire-PT-17-LTLCardinality-13
FORMULA_NAME FireWire-PT-17-LTLCardinality-14
FORMULA_NAME FireWire-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717370638722

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=FireWire-PT-17
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 23:24:00] [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-06-02 23:24:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:24:00] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-06-02 23:24:00] [INFO ] Transformed 428 places.
[2024-06-02 23:24:00] [INFO ] Transformed 656 transitions.
[2024-06-02 23:24:00] [INFO ] Found NUPN structural information;
[2024-06-02 23:24:00] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 131 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 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA FireWire-PT-17-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 656/656 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 423 transition count 656
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 93 place count 335 transition count 568
Iterating global reduction 1 with 88 rules applied. Total rules applied 181 place count 335 transition count 568
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 204 place count 312 transition count 522
Iterating global reduction 1 with 23 rules applied. Total rules applied 227 place count 312 transition count 522
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 230 place count 312 transition count 519
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 231 place count 311 transition count 518
Iterating global reduction 2 with 1 rules applied. Total rules applied 232 place count 311 transition count 518
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 233 place count 310 transition count 517
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 310 transition count 517
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 235 place count 309 transition count 516
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 309 transition count 516
Applied a total of 236 rules in 80 ms. Remains 309 /428 variables (removed 119) and now considering 516/656 (removed 140) transitions.
// Phase 1: matrix 516 rows 309 cols
[2024-06-02 23:24:00] [INFO ] Computed 7 invariants in 29 ms
[2024-06-02 23:24:00] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-06-02 23:24:00] [INFO ] Invariant cache hit.
[2024-06-02 23:24:01] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2024-06-02 23:24:01] [INFO ] Invariant cache hit.
[2024-06-02 23:24:01] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/428 places, 516/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1040 ms. Remains : 309/428 places, 516/656 transitions.
Support contains 19 out of 309 places after structural reductions.
[2024-06-02 23:24:01] [INFO ] Flatten gal took : 72 ms
[2024-06-02 23:24:01] [INFO ] Flatten gal took : 30 ms
[2024-06-02 23:24:01] [INFO ] Input system was already deterministic with 516 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 23:24:02] [INFO ] Invariant cache hit.
[2024-06-02 23:24:02] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 23:24:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 23:24:03] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 23:24:03] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-06-02 23:24:03] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 3 properties in 41 ms.
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 516/516 transitions.
Graph (trivial) has 234 edges and 309 vertex of which 18 / 309 are part of one of the 3 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 853 edges and 294 vertex of which 293 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 293 transition count 440
Reduce places removed 55 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 58 rules applied. Total rules applied 115 place count 238 transition count 437
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 120 place count 235 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 234 transition count 435
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 121 place count 234 transition count 405
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 181 place count 204 transition count 405
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 185 place count 200 transition count 382
Iterating global reduction 4 with 4 rules applied. Total rules applied 189 place count 200 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 200 transition count 380
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 191 place count 200 transition count 379
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 199 transition count 379
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 198 transition count 376
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 198 transition count 376
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 255 place count 168 transition count 346
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 307 place count 142 transition count 423
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 312 place count 142 transition count 418
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 6 with 31 rules applied. Total rules applied 343 place count 142 transition count 387
Free-agglomeration rule applied 22 times.
Iterating global reduction 6 with 22 rules applied. Total rules applied 365 place count 142 transition count 365
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 392 place count 120 transition count 360
Drop transitions removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 7 with 54 rules applied. Total rules applied 446 place count 120 transition count 306
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 448 place count 120 transition count 306
Applied a total of 448 rules in 123 ms. Remains 120 /309 variables (removed 189) and now considering 306/516 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 120/309 places, 306/516 transitions.
Incomplete random walk after 10000 steps, including 517 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished probabilistic random walk after 917648 steps, run visited all 2 properties in 1997 ms. (steps per millisecond=459 )
Probabilistic random walk after 917648 steps, saw 273392 distinct states, run finished after 1997 ms. (steps per millisecond=459 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
FORMULA FireWire-PT-17-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 48 stabilizing places and 51 stable transitions
Graph (complete) has 893 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 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 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 516/516 transitions.
Graph (trivial) has 239 edges and 309 vertex of which 18 / 309 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 856 edges and 294 vertex of which 293 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 292 transition count 443
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 236 transition count 441
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 118 place count 235 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 234 transition count 440
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 119 place count 234 transition count 410
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 179 place count 204 transition count 410
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 184 place count 199 transition count 384
Iterating global reduction 4 with 5 rules applied. Total rules applied 189 place count 199 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 199 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 191 place count 199 transition count 381
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 198 transition count 381
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 197 transition count 378
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 197 transition count 378
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 253 place count 168 transition count 349
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 315 place count 137 transition count 446
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 351 place count 137 transition count 410
Applied a total of 351 rules in 75 ms. Remains 137 /309 variables (removed 172) and now considering 410/516 (removed 106) transitions.
[2024-06-02 23:24:06] [INFO ] Flow matrix only has 395 transitions (discarded 15 similar events)
// Phase 1: matrix 395 rows 137 cols
[2024-06-02 23:24:06] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:24:06] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 23:24:06] [INFO ] Flow matrix only has 395 transitions (discarded 15 similar events)
[2024-06-02 23:24:06] [INFO ] Invariant cache hit.
[2024-06-02 23:24:06] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:24:06] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-02 23:24:06] [INFO ] Redundant transitions in 46 ms returned []
[2024-06-02 23:24:06] [INFO ] Flow matrix only has 395 transitions (discarded 15 similar events)
[2024-06-02 23:24:06] [INFO ] Invariant cache hit.
[2024-06-02 23:24:06] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/309 places, 410/516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 577 ms. Remains : 137/309 places, 410/516 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 123 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLCardinality-01 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 s104 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]]
Product exploration explored 100000 steps with 0 reset in 209 ms.
Product exploration explored 100000 steps with 1 reset in 79 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 817 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1159 steps, run visited all 1 properties in 18 ms. (steps per millisecond=64 )
Probabilistic random walk after 1159 steps, saw 587 distinct states, run finished after 19 ms. (steps per millisecond=61 ) properties seen :1
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 112 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 410/410 transitions.
Applied a total of 0 rules in 12 ms. Remains 137 /137 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2024-06-02 23:24:07] [INFO ] Flow matrix only has 395 transitions (discarded 15 similar events)
[2024-06-02 23:24:07] [INFO ] Invariant cache hit.
[2024-06-02 23:24:07] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 23:24:07] [INFO ] Flow matrix only has 395 transitions (discarded 15 similar events)
[2024-06-02 23:24:07] [INFO ] Invariant cache hit.
[2024-06-02 23:24:07] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:24:07] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-02 23:24:07] [INFO ] Redundant transitions in 20 ms returned []
[2024-06-02 23:24:07] [INFO ] Flow matrix only has 395 transitions (discarded 15 similar events)
[2024-06-02 23:24:07] [INFO ] Invariant cache hit.
[2024-06-02 23:24:07] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 458 ms. Remains : 137/137 places, 410/410 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 824 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 166 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1159 steps, run visited all 1 properties in 7 ms. (steps per millisecond=165 )
Probabilistic random walk after 1159 steps, saw 587 distinct states, run finished after 7 ms. (steps per millisecond=165 ) properties seen :1
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 100 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 76 ms.
Product exploration explored 100000 steps with 5 reset in 80 ms.
Built C files in :
/tmp/ltsmin11426312959878232349
[2024-06-02 23:24:08] [INFO ] Computing symmetric may disable matrix : 410 transitions.
[2024-06-02 23:24:08] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:24:08] [INFO ] Computing symmetric may enable matrix : 410 transitions.
[2024-06-02 23:24:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:24:08] [INFO ] Computing Do-Not-Accords matrix : 410 transitions.
[2024-06-02 23:24:08] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:24:08] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11426312959878232349
Running compilation step : cd /tmp/ltsmin11426312959878232349;'/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 899 ms.
Running link step : cd /tmp/ltsmin11426312959878232349;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11426312959878232349;'/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/stateBased3430614177141159169.hoa' '--buchi-type=spotba'
LTSmin run took 890 ms.
FORMULA FireWire-PT-17-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-17-LTLCardinality-01 finished in 4367 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((G(p0)||X(X(F(p1))))))'
Support contains 3 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 516/516 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 308 transition count 516
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 302 transition count 508
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 302 transition count 508
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 299 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 299 transition count 503
Applied a total of 19 rules in 12 ms. Remains 299 /309 variables (removed 10) and now considering 503/516 (removed 13) transitions.
// Phase 1: matrix 503 rows 299 cols
[2024-06-02 23:24:10] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:24:10] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 23:24:10] [INFO ] Invariant cache hit.
[2024-06-02 23:24:10] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-02 23:24:10] [INFO ] Invariant cache hit.
[2024-06-02 23:24:10] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 299/309 places, 503/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 299/309 places, 503/516 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-17-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s166 1), p0:(OR (EQ s238 0) (EQ s253 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 95 ms.
Computed a total of 45 stabilizing places and 49 stable transitions
Computed a total of 45 stabilizing places and 49 stable transitions
Detected a total of 45/299 stabilizing places and 49/503 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:24:11] [INFO ] Invariant cache hit.
[2024-06-02 23:24:11] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:24:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:24:11] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:24:11] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:24:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 350 ms
[2024-06-02 23:24:12] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-06-02 23:24:12] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 503/503 transitions.
Graph (trivial) has 233 edges and 299 vertex of which 18 / 299 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 284 transition count 430
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 232 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 231 transition count 428
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 108 place count 231 transition count 395
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 174 place count 198 transition count 395
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 197 transition count 375
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 197 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 197 transition count 374
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 233 place count 169 transition count 346
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 293 place count 139 transition count 444
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 299 place count 139 transition count 438
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 335 place count 139 transition count 402
Free-agglomeration rule applied 21 times.
Iterating global reduction 5 with 21 rules applied. Total rules applied 356 place count 139 transition count 381
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 383 place count 118 transition count 375
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 439 place count 118 transition count 319
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 441 place count 118 transition count 319
Applied a total of 441 rules in 58 ms. Remains 118 /299 variables (removed 181) and now considering 319/503 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 118/299 places, 319/503 transitions.
Finished random walk after 8577 steps, including 476 resets, run visited all 1 properties in 13 ms. (steps per millisecond=659 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 503/503 transitions.
Applied a total of 0 rules in 11 ms. Remains 299 /299 variables (removed 0) and now considering 503/503 (removed 0) transitions.
[2024-06-02 23:24:12] [INFO ] Invariant cache hit.
[2024-06-02 23:24:13] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 23:24:13] [INFO ] Invariant cache hit.
[2024-06-02 23:24:13] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-06-02 23:24:13] [INFO ] Invariant cache hit.
[2024-06-02 23:24:13] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 502 ms. Remains : 299/299 places, 503/503 transitions.
Computed a total of 45 stabilizing places and 49 stable transitions
Computed a total of 45 stabilizing places and 49 stable transitions
Detected a total of 45/299 stabilizing places and 49/503 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:24:13] [INFO ] Invariant cache hit.
[2024-06-02 23:24:13] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:24:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:24:13] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:24:14] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 0 ms to minimize.
[2024-06-02 23:24:14] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 0 ms to minimize.
[2024-06-02 23:24:14] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:24:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 348 ms
[2024-06-02 23:24:14] [INFO ] After 480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-06-02 23:24:14] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 503/503 transitions.
Graph (trivial) has 233 edges and 299 vertex of which 18 / 299 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 284 transition count 430
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 232 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 231 transition count 428
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 108 place count 231 transition count 395
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 174 place count 198 transition count 395
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 197 transition count 375
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 197 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 197 transition count 374
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 233 place count 169 transition count 346
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 293 place count 139 transition count 444
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 299 place count 139 transition count 438
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 335 place count 139 transition count 402
Free-agglomeration rule applied 21 times.
Iterating global reduction 5 with 21 rules applied. Total rules applied 356 place count 139 transition count 381
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 383 place count 118 transition count 375
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 439 place count 118 transition count 319
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 441 place count 118 transition count 319
Applied a total of 441 rules in 61 ms. Remains 118 /299 variables (removed 181) and now considering 319/503 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 118/299 places, 319/503 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 147 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 198 steps, run visited all 1 properties in 3 ms. (steps per millisecond=66 )
Probabilistic random walk after 198 steps, saw 129 distinct states, run finished after 3 ms. (steps per millisecond=66 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3 reset in 92 ms.
Product exploration explored 100000 steps with 2 reset in 132 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 503/503 transitions.
Graph (trivial) has 233 edges and 299 vertex of which 18 / 299 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 284 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 284 transition count 486
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 52 place count 284 transition count 507
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 71 place count 284 transition count 507
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 88 place count 267 transition count 471
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 105 place count 267 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 267 transition count 470
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 3 with 36 rules applied. Total rules applied 142 place count 267 transition count 472
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 160 place count 249 transition count 454
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 3 with 18 rules applied. Total rules applied 178 place count 249 transition count 454
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -225
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 3 with 38 rules applied. Total rules applied 216 place count 249 transition count 679
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 226 place count 239 transition count 656
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 236 place count 239 transition count 656
Deduced a syphon composed of 99 places in 0 ms
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 274 place count 239 transition count 618
Deduced a syphon composed of 99 places in 1 ms
Applied a total of 274 rules in 57 ms. Remains 239 /299 variables (removed 60) and now considering 618/503 (removed -115) transitions.
[2024-06-02 23:24:15] [INFO ] Redundant transitions in 46 ms returned []
[2024-06-02 23:24:15] [INFO ] Flow matrix only has 601 transitions (discarded 17 similar events)
// Phase 1: matrix 601 rows 239 cols
[2024-06-02 23:24:15] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:24:15] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/299 places, 618/503 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 239/299 places, 618/503 transitions.
Built C files in :
/tmp/ltsmin5629982000528376047
[2024-06-02 23:24:16] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5629982000528376047
Running compilation step : cd /tmp/ltsmin5629982000528376047;'/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 677 ms.
Running link step : cd /tmp/ltsmin5629982000528376047;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5629982000528376047;'/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/stateBased5119589800778280156.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 503/503 transitions.
Applied a total of 0 rules in 10 ms. Remains 299 /299 variables (removed 0) and now considering 503/503 (removed 0) transitions.
// Phase 1: matrix 503 rows 299 cols
[2024-06-02 23:24:31] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:24:31] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 23:24:31] [INFO ] Invariant cache hit.
[2024-06-02 23:24:31] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-06-02 23:24:31] [INFO ] Invariant cache hit.
[2024-06-02 23:24:31] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 299/299 places, 503/503 transitions.
Built C files in :
/tmp/ltsmin10040100523699680713
[2024-06-02 23:24:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10040100523699680713
Running compilation step : cd /tmp/ltsmin10040100523699680713;'/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 662 ms.
Running link step : cd /tmp/ltsmin10040100523699680713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10040100523699680713;'/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/stateBased14951514485655901957.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 23:24:46] [INFO ] Flatten gal took : 24 ms
[2024-06-02 23:24:46] [INFO ] Flatten gal took : 24 ms
[2024-06-02 23:24:46] [INFO ] Time to serialize gal into /tmp/LTL12734326126343385045.gal : 5 ms
[2024-06-02 23:24:46] [INFO ] Time to serialize properties into /tmp/LTL1155616366752026099.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/LTL12734326126343385045.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17296526329734552658.hoa' '-atoms' '/tmp/LTL1155616366752026099.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1155616366752026099.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17296526329734552658.hoa
Detected timeout of ITS tools.
[2024-06-02 23:25:01] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:25:01] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:25:01] [INFO ] Time to serialize gal into /tmp/LTL3943071172644197276.gal : 3 ms
[2024-06-02 23:25:01] [INFO ] Time to serialize properties into /tmp/LTL14070474581573285770.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/LTL3943071172644197276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14070474581573285770.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((p344==0)||(p361==1))"))||(X(X(F("(p242==1)")))))))
Formula 0 simplified : X(F!"((p344==0)||(p361==1))" & XXG!"(p242==1)")
Detected timeout of ITS tools.
[2024-06-02 23:25:17] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:25:17] [INFO ] Applying decomposition
[2024-06-02 23:25:17] [INFO ] Flatten gal took : 19 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/graph1459477939271504503.txt' '-o' '/tmp/graph1459477939271504503.bin' '-w' '/tmp/graph1459477939271504503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1459477939271504503.bin' '-l' '-1' '-v' '-w' '/tmp/graph1459477939271504503.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:25:17] [INFO ] Decomposing Gal with order
[2024-06-02 23:25:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:25:17] [INFO ] Removed a total of 527 redundant transitions.
[2024-06-02 23:25:17] [INFO ] Flatten gal took : 62 ms
[2024-06-02 23:25:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 13 ms.
[2024-06-02 23:25:17] [INFO ] Time to serialize gal into /tmp/LTL6070663927172352741.gal : 8 ms
[2024-06-02 23:25:17] [INFO ] Time to serialize properties into /tmp/LTL9987879570272947155.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/LTL6070663927172352741.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9987879570272947155.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G("((i10.i1.u93.p344==0)||(i9.u86.p361==1))"))||(X(X(F("(i8.i1.u64.p242==1)")))))))
Formula 0 simplified : X(F!"((i10.i1.u93.p344==0)||(i9.u86.p361==1))" & XXG!"(i8.i1.u64.p242==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2823968039118417379
[2024-06-02 23:25:32] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2823968039118417379
Running compilation step : cd /tmp/ltsmin2823968039118417379;'/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 672 ms.
Running link step : cd /tmp/ltsmin2823968039118417379;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2823968039118417379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FireWire-PT-17-LTLCardinality-05 finished in 97075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 516/516 transitions.
Graph (trivial) has 241 edges and 309 vertex of which 18 / 309 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 856 edges and 294 vertex of which 293 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 292 transition count 443
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 236 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 235 transition count 441
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 117 place count 235 transition count 411
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 177 place count 205 transition count 411
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 182 place count 200 transition count 385
Iterating global reduction 3 with 5 rules applied. Total rules applied 187 place count 200 transition count 385
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 200 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 189 place count 200 transition count 382
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 191 place count 199 transition count 382
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 198 transition count 379
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 198 transition count 379
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 251 place count 169 transition count 350
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -102
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 315 place count 137 transition count 452
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 355 place count 137 transition count 412
Applied a total of 355 rules in 41 ms. Remains 137 /309 variables (removed 172) and now considering 412/516 (removed 104) transitions.
[2024-06-02 23:25:47] [INFO ] Flow matrix only has 394 transitions (discarded 18 similar events)
// Phase 1: matrix 394 rows 137 cols
[2024-06-02 23:25:47] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:25:47] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 23:25:47] [INFO ] Flow matrix only has 394 transitions (discarded 18 similar events)
[2024-06-02 23:25:47] [INFO ] Invariant cache hit.
[2024-06-02 23:25:47] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:25:47] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-06-02 23:25:47] [INFO ] Redundant transitions in 19 ms returned []
[2024-06-02 23:25:47] [INFO ] Flow matrix only has 394 transitions (discarded 18 similar events)
[2024-06-02 23:25:47] [INFO ] Invariant cache hit.
[2024-06-02 23:25:47] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/309 places, 412/516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 531 ms. Remains : 137/309 places, 412/516 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s39 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLCardinality-06 finished in 624 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((X(G(p0))&&G(p1))))'
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 516/516 transitions.
Graph (trivial) has 237 edges and 309 vertex of which 18 / 309 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 856 edges and 294 vertex of which 293 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 292 transition count 444
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 237 transition count 442
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 116 place count 236 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 235 transition count 441
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 117 place count 235 transition count 412
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 175 place count 206 transition count 412
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 179 place count 202 transition count 387
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 202 transition count 387
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 185 place count 202 transition count 385
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 245 place count 172 transition count 355
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -89
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 309 place count 140 transition count 444
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 346 place count 140 transition count 407
Applied a total of 346 rules in 38 ms. Remains 140 /309 variables (removed 169) and now considering 407/516 (removed 109) transitions.
[2024-06-02 23:25:48] [INFO ] Flow matrix only has 392 transitions (discarded 15 similar events)
// Phase 1: matrix 392 rows 140 cols
[2024-06-02 23:25:48] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:25:48] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 23:25:48] [INFO ] Flow matrix only has 392 transitions (discarded 15 similar events)
[2024-06-02 23:25:48] [INFO ] Invariant cache hit.
[2024-06-02 23:25:48] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-02 23:25:48] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-06-02 23:25:48] [INFO ] Redundant transitions in 19 ms returned []
[2024-06-02 23:25:48] [INFO ] Flow matrix only has 392 transitions (discarded 15 similar events)
[2024-06-02 23:25:48] [INFO ] Invariant cache hit.
[2024-06-02 23:25:48] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/309 places, 407/516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 461 ms. Remains : 140/309 places, 407/516 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-17-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s107 1)), p0:(AND (EQ s135 0) (EQ s52 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-17-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLCardinality-08 finished in 609 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 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 516/516 transitions.
Graph (trivial) has 238 edges and 309 vertex of which 18 / 309 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 856 edges and 294 vertex of which 293 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 292 transition count 445
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 238 transition count 443
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 237 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 236 transition count 442
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 115 place count 236 transition count 413
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 173 place count 207 transition count 413
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 178 place count 202 transition count 387
Iterating global reduction 4 with 5 rules applied. Total rules applied 183 place count 202 transition count 387
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 185 place count 202 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 185 place count 202 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 201 transition count 384
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 200 transition count 381
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 200 transition count 381
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 247 place count 171 transition count 352
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 313 place count 138 transition count 456
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 353 place count 138 transition count 416
Applied a total of 353 rules in 50 ms. Remains 138 /309 variables (removed 171) and now considering 416/516 (removed 100) transitions.
[2024-06-02 23:25:48] [INFO ] Flow matrix only has 400 transitions (discarded 16 similar events)
// Phase 1: matrix 400 rows 138 cols
[2024-06-02 23:25:48] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:25:48] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 23:25:48] [INFO ] Flow matrix only has 400 transitions (discarded 16 similar events)
[2024-06-02 23:25:48] [INFO ] Invariant cache hit.
[2024-06-02 23:25:48] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 23:25:48] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-06-02 23:25:48] [INFO ] Redundant transitions in 18 ms returned []
[2024-06-02 23:25:48] [INFO ] Flow matrix only has 400 transitions (discarded 16 similar events)
[2024-06-02 23:25:48] [INFO ] Invariant cache hit.
[2024-06-02 23:25:49] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/309 places, 416/516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 472 ms. Remains : 138/309 places, 416/516 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s67 0) (NEQ s10 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 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLCardinality-10 finished in 524 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 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 516/516 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 308 transition count 516
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 302 transition count 508
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 302 transition count 508
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 300 transition count 504
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 300 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 299 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 299 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 298 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 298 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 297 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 297 transition count 501
Applied a total of 23 rules in 18 ms. Remains 297 /309 variables (removed 12) and now considering 501/516 (removed 15) transitions.
// Phase 1: matrix 501 rows 297 cols
[2024-06-02 23:25:49] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:25:49] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 23:25:49] [INFO ] Invariant cache hit.
[2024-06-02 23:25:49] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-06-02 23:25:49] [INFO ] Invariant cache hit.
[2024-06-02 23:25:49] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 297/309 places, 501/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 511 ms. Remains : 297/309 places, 501/516 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLCardinality-12 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:(OR (EQ s39 0) (EQ s129 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 247 steps with 2 reset in 1 ms.
FORMULA FireWire-PT-17-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLCardinality-12 finished in 641 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((G(p0)||X(X(F(p1))))))'
[2024-06-02 23:25:49] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13631010353520403994
[2024-06-02 23:25:49] [INFO ] Computing symmetric may disable matrix : 516 transitions.
[2024-06-02 23:25:49] [INFO ] Applying decomposition
[2024-06-02 23:25:49] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:25:49] [INFO ] Computing symmetric may enable matrix : 516 transitions.
[2024-06-02 23:25:49] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:25:49] [INFO ] Flatten gal took : 17 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/graph13196076350848770596.txt' '-o' '/tmp/graph13196076350848770596.bin' '-w' '/tmp/graph13196076350848770596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13196076350848770596.bin' '-l' '-1' '-v' '-w' '/tmp/graph13196076350848770596.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:25:49] [INFO ] Decomposing Gal with order
[2024-06-02 23:25:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:25:50] [INFO ] Computing Do-Not-Accords matrix : 516 transitions.
[2024-06-02 23:25:50] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:25:50] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13631010353520403994
Running compilation step : cd /tmp/ltsmin13631010353520403994;'/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-06-02 23:25:50] [INFO ] Removed a total of 520 redundant transitions.
[2024-06-02 23:25:50] [INFO ] Flatten gal took : 26 ms
[2024-06-02 23:25:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 4 ms.
[2024-06-02 23:25:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality11480441487420044109.gal : 4 ms
[2024-06-02 23:25:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality591287275434000201.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/LTLCardinality11480441487420044109.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality591287275434000201.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...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((i8.u94.p344==0)||(i1.u100.p361==1))"))||(X(X(F("(i7.i1.i1.u66.p242==1)")))))))
Formula 0 simplified : X(F!"((i8.u94.p344==0)||(i1.u100.p361==1))" & XXG!"(i7.i1.i1.u66.p242==1)")
Compilation finished in 1045 ms.
Running link step : cd /tmp/ltsmin13631010353520403994;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13631010353520403994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t22, t123, t223, t229, t243, t254, t279, t281, t282, t295, t297, t300, t347, t363, t364, t365...1198
Computing Next relation with stutter on 5.84308e+06 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
8907 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,89.111,2028764,1,0,2.67396e+06,4212,6261,8.14401e+06,367,23553,6632169
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FireWire-PT-17-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 335262 ms.

BK_STOP 1717370976465

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-17"
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 FireWire-PT-17, 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 r571-tall-171734910400187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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