About the Execution of 2023-gold for FireWire-PT-10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1562.415 | 38882.00 | 97034.00 | 457.60 | FFTFFTFFTFFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r571-tall-171734910300152.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-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910300152
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 101K 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-10-LTLCardinality-00
FORMULA_NAME FireWire-PT-10-LTLCardinality-01
FORMULA_NAME FireWire-PT-10-LTLCardinality-02
FORMULA_NAME FireWire-PT-10-LTLCardinality-03
FORMULA_NAME FireWire-PT-10-LTLCardinality-04
FORMULA_NAME FireWire-PT-10-LTLCardinality-05
FORMULA_NAME FireWire-PT-10-LTLCardinality-06
FORMULA_NAME FireWire-PT-10-LTLCardinality-07
FORMULA_NAME FireWire-PT-10-LTLCardinality-08
FORMULA_NAME FireWire-PT-10-LTLCardinality-09
FORMULA_NAME FireWire-PT-10-LTLCardinality-10
FORMULA_NAME FireWire-PT-10-LTLCardinality-11
FORMULA_NAME FireWire-PT-10-LTLCardinality-12
FORMULA_NAME FireWire-PT-10-LTLCardinality-13
FORMULA_NAME FireWire-PT-10-LTLCardinality-14
FORMULA_NAME FireWire-PT-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717369566977
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-10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 23:06:08] [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:06:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:06:08] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-06-02 23:06:08] [INFO ] Transformed 131 places.
[2024-06-02 23:06:08] [INFO ] Transformed 409 transitions.
[2024-06-02 23:06:08] [INFO ] Found NUPN structural information;
[2024-06-02 23:06:08] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 125 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 5 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 353/353 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 128 transition count 347
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 128 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 128 transition count 345
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 128 transition count 339
Applied a total of 14 rules in 33 ms. Remains 128 /131 variables (removed 3) and now considering 339/353 (removed 14) transitions.
[2024-06-02 23:06:09] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
// Phase 1: matrix 313 rows 128 cols
[2024-06-02 23:06:09] [INFO ] Computed 8 invariants in 14 ms
[2024-06-02 23:06:09] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-02 23:06:09] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
[2024-06-02 23:06:09] [INFO ] Invariant cache hit.
[2024-06-02 23:06:09] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 23:06:09] [INFO ] Implicit Places using invariants and state equation in 441 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 878 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/131 places, 339/353 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 918 ms. Remains : 127/131 places, 339/353 transitions.
Support contains 12 out of 127 places after structural reductions.
[2024-06-02 23:06:09] [INFO ] Flatten gal took : 49 ms
[2024-06-02 23:06:09] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:06:09] [INFO ] Input system was already deterministic with 339 transitions.
Incomplete random walk after 10000 steps, including 548 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:06:10] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
// Phase 1: matrix 313 rows 127 cols
[2024-06-02 23:06:10] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:06:10] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:06:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 23:06:10] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:06:10] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 23:06:10] [INFO ] After 45ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:06:10] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 3 ms to minimize.
[2024-06-02 23:06:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2024-06-02 23:06:10] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:06:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-06-02 23:06:10] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-06-02 23:06:10] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 339/339 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 336
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 125 transition count 331
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 125 transition count 331
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 125 transition count 330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 124 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 124 transition count 328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 123 transition count 327
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 120 transition count 333
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 120 transition count 327
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 120 transition count 324
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 120 transition count 325
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 33 place count 118 transition count 323
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 118 transition count 321
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 117 transition count 320
Applied a total of 36 rules in 92 ms. Remains 117 /127 variables (removed 10) and now considering 320/339 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 117/127 places, 320/339 transitions.
Incomplete random walk after 10000 steps, including 587 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 138 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Finished probabilistic random walk after 800608 steps, run visited all 2 properties in 1415 ms. (steps per millisecond=565 )
Probabilistic random walk after 800608 steps, saw 167026 distinct states, run finished after 1415 ms. (steps per millisecond=565 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
Computed a total of 22 stabilizing places and 46 stable transitions
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 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 112 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 109 transition count 311
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 109 transition count 305
Applied a total of 41 rules in 57 ms. Remains 109 /127 variables (removed 18) and now considering 305/339 (removed 34) transitions.
[2024-06-02 23:06:12] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 109 cols
[2024-06-02 23:06:12] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:06:12] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 23:06:12] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 23:06:12] [INFO ] Invariant cache hit.
[2024-06-02 23:06:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:06:13] [INFO ] Implicit Places using invariants and state equation in 220 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 291 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/127 places, 305/339 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 357 ms. Remains : 108/127 places, 305/339 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 144 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s99 0) (NEQ s45 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 3 ms.
FORMULA FireWire-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLCardinality-06 finished in 551 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(p0))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 336
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 125 transition count 334
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 124 transition count 331
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 123 transition count 329
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 122 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 121 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 120 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 119 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 118 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 117 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 116 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 115 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 115 transition count 310
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 114 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 111 transition count 315
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 111 transition count 309
Applied a total of 38 rules in 55 ms. Remains 111 /127 variables (removed 16) and now considering 309/339 (removed 30) transitions.
[2024-06-02 23:06:13] [INFO ] Flow matrix only has 276 transitions (discarded 33 similar events)
// Phase 1: matrix 276 rows 111 cols
[2024-06-02 23:06:13] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:06:13] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-02 23:06:13] [INFO ] Flow matrix only has 276 transitions (discarded 33 similar events)
[2024-06-02 23:06:13] [INFO ] Invariant cache hit.
[2024-06-02 23:06:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 23:06:13] [INFO ] Implicit Places using invariants and state equation in 170 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 303 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/127 places, 309/339 transitions.
Applied a total of 0 rules in 9 ms. Remains 110 /110 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 368 ms. Remains : 110/127 places, 309/339 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-10-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-10-LTLCardinality-08 finished in 897 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(p0)&&X(X(G(p1)))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 309
Applied a total of 25 rules in 35 ms. Remains 115 /127 variables (removed 12) and now considering 309/339 (removed 30) transitions.
[2024-06-02 23:06:14] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
// Phase 1: matrix 283 rows 115 cols
[2024-06-02 23:06:14] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:06:14] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-02 23:06:14] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2024-06-02 23:06:14] [INFO ] Invariant cache hit.
[2024-06-02 23:06:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:06:14] [INFO ] Implicit Places using invariants and state equation in 178 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 541 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/127 places, 309/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 578 ms. Remains : 114/127 places, 309/339 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : FireWire-PT-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s0 1)), p1:(AND (EQ s86 0) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLCardinality-13 finished in 796 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)||G((p1 U p2)))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 123 transition count 330
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 120 transition count 336
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 120 transition count 330
Applied a total of 21 rules in 32 ms. Remains 120 /127 variables (removed 7) and now considering 330/339 (removed 9) transitions.
[2024-06-02 23:06:15] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
// Phase 1: matrix 297 rows 120 cols
[2024-06-02 23:06:15] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:06:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 23:06:15] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2024-06-02 23:06:15] [INFO ] Invariant cache hit.
[2024-06-02 23:06:15] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-02 23:06:15] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-06-02 23:06:15] [INFO ] Redundant transitions in 16 ms returned []
[2024-06-02 23:06:15] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2024-06-02 23:06:15] [INFO ] Invariant cache hit.
[2024-06-02 23:06:15] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/127 places, 330/339 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 449 ms. Remains : 120/127 places, 330/339 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s84 0) (EQ s108 1)), p2:(OR (EQ s8 0) (EQ s36 1)), p1:(OR (EQ s36 0) (EQ s0 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 216 ms.
Computed a total of 19 stabilizing places and 40 stable transitions
Computed a total of 19 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR (AND p0 p2) (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 197 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 535 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 23:06:16] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2024-06-02 23:06:16] [INFO ] Invariant cache hit.
[2024-06-02 23:06:16] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 23:06:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:06:16] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-06-02 23:06:16] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-02 23:06:16] [INFO ] After 72ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2024-06-02 23:06:16] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:06:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-06-02 23:06:17] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:06:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-06-02 23:06:17] [INFO ] After 302ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-06-02 23:06:17] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 330/330 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 120 transition count 324
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 120 transition count 325
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 118 transition count 323
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 118 transition count 321
Applied a total of 14 rules in 17 ms. Remains 118 /120 variables (removed 2) and now considering 321/330 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 118/120 places, 321/330 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 946183 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 946183 steps, saw 200117 distinct states, run finished after 3002 ms. (steps per millisecond=315 ) properties seen :2
Running SMT prover for 1 properties.
[2024-06-02 23:06:20] [INFO ] Flow matrix only has 292 transitions (discarded 29 similar events)
// Phase 1: matrix 292 rows 118 cols
[2024-06-02 23:06:20] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 23:06:20] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:06:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:06:20] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:06:20] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 23:06:20] [INFO ] After 22ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:06:20] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-06-02 23:06:20] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-06-02 23:06:20] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 321/321 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 118/118 places, 321/321 transitions.
Incomplete random walk after 10000 steps, including 534 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1959626 steps, run timeout after 3001 ms. (steps per millisecond=652 ) properties seen :{}
Probabilistic random walk after 1959626 steps, saw 425717 distinct states, run finished after 3001 ms. (steps per millisecond=652 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:06:23] [INFO ] Flow matrix only has 292 transitions (discarded 29 similar events)
[2024-06-02 23:06:23] [INFO ] Invariant cache hit.
[2024-06-02 23:06:23] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:06:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:06:23] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:06:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 23:06:23] [INFO ] After 23ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:06:23] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-06-02 23:06:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-02 23:06:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2024-06-02 23:06:23] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-06-02 23:06:23] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 321/321 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 118/118 places, 321/321 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 321/321 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2024-06-02 23:06:23] [INFO ] Flow matrix only has 292 transitions (discarded 29 similar events)
[2024-06-02 23:06:23] [INFO ] Invariant cache hit.
[2024-06-02 23:06:24] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 23:06:24] [INFO ] Flow matrix only has 292 transitions (discarded 29 similar events)
[2024-06-02 23:06:24] [INFO ] Invariant cache hit.
[2024-06-02 23:06:24] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 23:06:24] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-06-02 23:06:24] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:06:24] [INFO ] Flow matrix only has 292 transitions (discarded 29 similar events)
[2024-06-02 23:06:24] [INFO ] Invariant cache hit.
[2024-06-02 23:06:24] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 118/118 places, 321/321 transitions.
Graph (trivial) has 101 edges and 118 vertex of which 27 / 118 are part of one of the 3 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 72 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 93 transition count 204
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 93 transition count 198
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 93 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 92 transition count 197
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 92 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 92 transition count 196
Applied a total of 13 rules in 17 ms. Remains 92 /118 variables (removed 26) and now considering 196/321 (removed 125) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:06:24] [INFO ] Flow matrix only has 194 transitions (discarded 2 similar events)
// Phase 1: matrix 194 rows 92 cols
[2024-06-02 23:06:24] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 23:06:24] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:06:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:06:24] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:06:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 23:06:24] [INFO ] After 12ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:06:24] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:06:24] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-02 23:06:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2024-06-02 23:06:24] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-06-02 23:06:24] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR (AND p0 p2) (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p0 p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) p1)), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 308 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 120 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 330/330 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2024-06-02 23:06:25] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
// Phase 1: matrix 297 rows 120 cols
[2024-06-02 23:06:25] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:06:25] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 23:06:25] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2024-06-02 23:06:25] [INFO ] Invariant cache hit.
[2024-06-02 23:06:25] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-02 23:06:25] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-02 23:06:25] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 23:06:25] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2024-06-02 23:06:25] [INFO ] Invariant cache hit.
[2024-06-02 23:06:25] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 430 ms. Remains : 120/120 places, 330/330 transitions.
Computed a total of 19 stabilizing places and 40 stable transitions
Computed a total of 19 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 596 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:06:25] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2024-06-02 23:06:25] [INFO ] Invariant cache hit.
[2024-06-02 23:06:25] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:06:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:06:26] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:06:26] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-02 23:06:26] [INFO ] After 35ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:06:26] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-06-02 23:06:26] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 330/330 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 120 transition count 324
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 120 transition count 325
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 118 transition count 323
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 118 transition count 321
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 117 transition count 320
Applied a total of 15 rules in 22 ms. Remains 117 /120 variables (removed 3) and now considering 320/330 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 117/120 places, 320/330 transitions.
Incomplete random walk after 10000 steps, including 577 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1812338 steps, run timeout after 3001 ms. (steps per millisecond=603 ) properties seen :{}
Probabilistic random walk after 1812338 steps, saw 396609 distinct states, run finished after 3001 ms. (steps per millisecond=603 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:06:29] [INFO ] Flow matrix only has 291 transitions (discarded 29 similar events)
// Phase 1: matrix 291 rows 117 cols
[2024-06-02 23:06:29] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:06:29] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:06:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:06:29] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:06:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:06:29] [INFO ] After 31ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:06:29] [INFO ] After 57ms 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:06:29] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 320/320 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 117/117 places, 320/320 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 320/320 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2024-06-02 23:06:29] [INFO ] Flow matrix only has 291 transitions (discarded 29 similar events)
[2024-06-02 23:06:29] [INFO ] Invariant cache hit.
[2024-06-02 23:06:29] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 23:06:29] [INFO ] Flow matrix only has 291 transitions (discarded 29 similar events)
[2024-06-02 23:06:29] [INFO ] Invariant cache hit.
[2024-06-02 23:06:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:06:29] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-06-02 23:06:29] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:06:29] [INFO ] Flow matrix only has 291 transitions (discarded 29 similar events)
[2024-06-02 23:06:29] [INFO ] Invariant cache hit.
[2024-06-02 23:06:29] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 117/117 places, 320/320 transitions.
Graph (trivial) has 101 edges and 117 vertex of which 27 / 117 are part of one of the 3 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions removed 72 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 92 transition count 203
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 92 transition count 197
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 92 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 91 transition count 196
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 91 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 91 transition count 195
Applied a total of 13 rules in 12 ms. Remains 91 /117 variables (removed 26) and now considering 195/320 (removed 125) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:06:29] [INFO ] Flow matrix only has 193 transitions (discarded 2 similar events)
// Phase 1: matrix 193 rows 91 cols
[2024-06-02 23:06:29] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:06:29] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:06:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:06:29] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:06:29] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:06:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-06-02 23:06:29] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-06-02 23:06:29] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 46 ms.
Product exploration explored 100000 steps with 1 reset in 92 ms.
Built C files in :
/tmp/ltsmin399419003831788290
[2024-06-02 23:06:30] [INFO ] Computing symmetric may disable matrix : 330 transitions.
[2024-06-02 23:06:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:06:30] [INFO ] Computing symmetric may enable matrix : 330 transitions.
[2024-06-02 23:06:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:06:30] [INFO ] Computing Do-Not-Accords matrix : 330 transitions.
[2024-06-02 23:06:30] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:06:30] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin399419003831788290
Running compilation step : cd /tmp/ltsmin399419003831788290;'/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 763 ms.
Running link step : cd /tmp/ltsmin399419003831788290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin399419003831788290;'/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/stateBased13530609386950676928.hoa' '--buchi-type=spotba'
LTSmin run took 13506 ms.
FORMULA FireWire-PT-10-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-10-LTLCardinality-14 finished in 29949 ms.
All properties solved by simple procedures.
Total runtime 36401 ms.
BK_STOP 1717369605859
--------------------
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-10"
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-10, 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-171734910300152"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-10.tgz
mv FireWire-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;