About the Execution of ITS-Tools for DLCround-PT-12b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2524.363 | 165301.00 | 272304.00 | 859.00 | TTFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r060-tall-165254771800267.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DLCround-PT-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254771800267
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.0K Apr 30 07:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 07:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 07:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 30 07:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.9M May 10 09: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 DLCround-PT-12b-LTLCardinality-00
FORMULA_NAME DLCround-PT-12b-LTLCardinality-01
FORMULA_NAME DLCround-PT-12b-LTLCardinality-02
FORMULA_NAME DLCround-PT-12b-LTLCardinality-03
FORMULA_NAME DLCround-PT-12b-LTLCardinality-04
FORMULA_NAME DLCround-PT-12b-LTLCardinality-05
FORMULA_NAME DLCround-PT-12b-LTLCardinality-06
FORMULA_NAME DLCround-PT-12b-LTLCardinality-07
FORMULA_NAME DLCround-PT-12b-LTLCardinality-08
FORMULA_NAME DLCround-PT-12b-LTLCardinality-09
FORMULA_NAME DLCround-PT-12b-LTLCardinality-10
FORMULA_NAME DLCround-PT-12b-LTLCardinality-11
FORMULA_NAME DLCround-PT-12b-LTLCardinality-12
FORMULA_NAME DLCround-PT-12b-LTLCardinality-13
FORMULA_NAME DLCround-PT-12b-LTLCardinality-14
FORMULA_NAME DLCround-PT-12b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652582860379
Running Version 202205111006
[2022-05-15 02:47:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 02:47:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 02:47:41] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2022-05-15 02:47:42] [INFO ] Transformed 4848 places.
[2022-05-15 02:47:42] [INFO ] Transformed 7836 transitions.
[2022-05-15 02:47:42] [INFO ] Found NUPN structural information;
[2022-05-15 02:47:42] [INFO ] Parsed PT model containing 4848 places and 7836 transitions in 490 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-12b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 4848 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4848/4848 places, 7836/7836 transitions.
Discarding 862 places :
Symmetric choice reduction at 0 with 862 rule applications. Total rules 862 place count 3986 transition count 6974
Iterating global reduction 0 with 862 rules applied. Total rules applied 1724 place count 3986 transition count 6974
Discarding 710 places :
Symmetric choice reduction at 0 with 710 rule applications. Total rules 2434 place count 3276 transition count 6264
Iterating global reduction 0 with 710 rules applied. Total rules applied 3144 place count 3276 transition count 6264
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 3157 place count 3276 transition count 6251
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 3235 place count 3198 transition count 5989
Iterating global reduction 1 with 78 rules applied. Total rules applied 3313 place count 3198 transition count 5989
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 3353 place count 3158 transition count 5949
Iterating global reduction 1 with 40 rules applied. Total rules applied 3393 place count 3158 transition count 5949
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 3397 place count 3158 transition count 5945
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 3421 place count 3134 transition count 5921
Iterating global reduction 2 with 24 rules applied. Total rules applied 3445 place count 3134 transition count 5921
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 3469 place count 3110 transition count 5897
Iterating global reduction 2 with 24 rules applied. Total rules applied 3493 place count 3110 transition count 5897
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 3517 place count 3086 transition count 5873
Iterating global reduction 2 with 24 rules applied. Total rules applied 3541 place count 3086 transition count 5873
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 3553 place count 3074 transition count 5861
Iterating global reduction 2 with 12 rules applied. Total rules applied 3565 place count 3074 transition count 5861
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 3573 place count 3066 transition count 5853
Iterating global reduction 2 with 8 rules applied. Total rules applied 3581 place count 3066 transition count 5853
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 3589 place count 3058 transition count 5845
Iterating global reduction 2 with 8 rules applied. Total rules applied 3597 place count 3058 transition count 5845
Applied a total of 3597 rules in 2726 ms. Remains 3058 /4848 variables (removed 1790) and now considering 5845/7836 (removed 1991) transitions.
// Phase 1: matrix 5845 rows 3058 cols
[2022-05-15 02:47:45] [INFO ] Computed 277 place invariants in 45 ms
[2022-05-15 02:47:46] [INFO ] Implicit Places using invariants in 1338 ms returned []
// Phase 1: matrix 5845 rows 3058 cols
[2022-05-15 02:47:46] [INFO ] Computed 277 place invariants in 38 ms
[2022-05-15 02:47:48] [INFO ] Implicit Places using invariants and state equation in 1998 ms returned []
Implicit Place search using SMT with State Equation took 3406 ms to find 0 implicit places.
// Phase 1: matrix 5845 rows 3058 cols
[2022-05-15 02:47:48] [INFO ] Computed 277 place invariants in 21 ms
[2022-05-15 02:47:51] [INFO ] Dead Transitions using invariants and state equation in 2924 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3058/4848 places, 5845/7836 transitions.
Finished structural reductions, in 1 iterations. Remains : 3058/4848 places, 5845/7836 transitions.
Support contains 25 out of 3058 places after structural reductions.
[2022-05-15 02:47:52] [INFO ] Flatten gal took : 326 ms
[2022-05-15 02:47:52] [INFO ] Flatten gal took : 210 ms
[2022-05-15 02:47:52] [INFO ] Input system was already deterministic with 5845 transitions.
Support contains 23 out of 3058 places (down from 25) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5845 rows 3058 cols
[2022-05-15 02:47:53] [INFO ] Computed 277 place invariants in 15 ms
[2022-05-15 02:47:53] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:47:54] [INFO ] [Nat]Absence check using 277 positive place invariants in 310 ms returned sat
[2022-05-15 02:47:56] [INFO ] After 2288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:47:57] [INFO ] After 2924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 324 ms.
[2022-05-15 02:47:57] [INFO ] After 4067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 814 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=54 )
Parikh walk visited 2 properties in 20 ms.
FORMULA DLCround-PT-12b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 552 stabilizing places and 552 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((F(p0)||F(p1))))))'
Support contains 4 out of 3058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3058/3058 places, 5845/5845 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3048 transition count 5835
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3048 transition count 5835
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 3045 transition count 5832
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 3045 transition count 5832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 3044 transition count 5816
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 3044 transition count 5816
Applied a total of 28 rules in 600 ms. Remains 3044 /3058 variables (removed 14) and now considering 5816/5845 (removed 29) transitions.
// Phase 1: matrix 5816 rows 3044 cols
[2022-05-15 02:47:58] [INFO ] Computed 277 place invariants in 21 ms
[2022-05-15 02:47:59] [INFO ] Implicit Places using invariants in 844 ms returned []
// Phase 1: matrix 5816 rows 3044 cols
[2022-05-15 02:47:59] [INFO ] Computed 277 place invariants in 16 ms
[2022-05-15 02:48:01] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2511 ms to find 0 implicit places.
// Phase 1: matrix 5816 rows 3044 cols
[2022-05-15 02:48:01] [INFO ] Computed 277 place invariants in 16 ms
[2022-05-15 02:48:04] [INFO ] Dead Transitions using invariants and state equation in 3047 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3044/3058 places, 5816/5845 transitions.
Finished structural reductions, in 1 iterations. Remains : 3044/3058 places, 5816/5845 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-12b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1541 0) (EQ s180 1)), p1:(OR (EQ s2786 0) (EQ s672 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1311 ms.
Product exploration explored 100000 steps with 33333 reset in 1236 ms.
Computed a total of 549 stabilizing places and 549 stable transitions
Computed a total of 549 stabilizing places and 549 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DLCround-PT-12b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-12b-LTLCardinality-00 finished in 9350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(p0)))||X(F(X(G(p1))))))'
Support contains 4 out of 3058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3058/3058 places, 5845/5845 transitions.
Graph (trivial) has 2628 edges and 3058 vertex of which 656 / 3058 are part of one of the 56 SCC in 13 ms
Free SCC test removed 600 places
Ensure Unique test removed 644 transitions
Reduce isomorphic transitions removed 644 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 457 transitions
Trivial Post-agglo rules discarded 457 transitions
Performed 457 trivial Post agglomeration. Transition count delta: 457
Iterating post reduction 0 with 457 rules applied. Total rules applied 458 place count 2457 transition count 4743
Reduce places removed 457 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 508 rules applied. Total rules applied 966 place count 2000 transition count 4692
Reduce places removed 34 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 37 rules applied. Total rules applied 1003 place count 1966 transition count 4689
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1006 place count 1963 transition count 4689
Performed 273 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 273 Pre rules applied. Total rules applied 1006 place count 1963 transition count 4416
Deduced a syphon composed of 273 places in 28 ms
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 4 with 546 rules applied. Total rules applied 1552 place count 1690 transition count 4416
Discarding 89 places :
Symmetric choice reduction at 4 with 89 rule applications. Total rules 1641 place count 1601 transition count 3544
Iterating global reduction 4 with 89 rules applied. Total rules applied 1730 place count 1601 transition count 3544
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1734 place count 1601 transition count 3540
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 1734 place count 1601 transition count 3534
Deduced a syphon composed of 6 places in 24 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1746 place count 1595 transition count 3534
Performed 617 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 617 places in 1 ms
Reduce places removed 617 places and 0 transitions.
Iterating global reduction 5 with 1234 rules applied. Total rules applied 2980 place count 978 transition count 2905
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2993 place count 978 transition count 2892
Renaming transitions due to excessive name length > 1024 char.
Discarding 32 places :
Symmetric choice reduction at 6 with 32 rule applications. Total rules 3025 place count 946 transition count 2392
Iterating global reduction 6 with 32 rules applied. Total rules applied 3057 place count 946 transition count 2392
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 3086 place count 946 transition count 2363
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 7 with 2 rules applied. Total rules applied 3088 place count 945 transition count 2362
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -139
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 3114 place count 932 transition count 2501
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 3118 place count 932 transition count 2497
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 3122 place count 928 transition count 2387
Iterating global reduction 8 with 4 rules applied. Total rules applied 3126 place count 928 transition count 2387
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 3130 place count 928 transition count 2383
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 3138 place count 924 transition count 2428
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 9 with 44 rules applied. Total rules applied 3182 place count 924 transition count 2384
Discarding 23 places :
Symmetric choice reduction at 9 with 23 rule applications. Total rules 3205 place count 901 transition count 2338
Iterating global reduction 9 with 23 rules applied. Total rules applied 3228 place count 901 transition count 2338
Discarding 23 places :
Symmetric choice reduction at 9 with 23 rule applications. Total rules 3251 place count 878 transition count 1968
Iterating global reduction 9 with 23 rules applied. Total rules applied 3274 place count 878 transition count 1968
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 3297 place count 878 transition count 1945
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3298 place count 877 transition count 1944
Applied a total of 3298 rules in 1333 ms. Remains 877 /3058 variables (removed 2181) and now considering 1944/5845 (removed 3901) transitions.
[2022-05-15 02:48:08] [INFO ] Flow matrix only has 1903 transitions (discarded 41 similar events)
// Phase 1: matrix 1903 rows 877 cols
[2022-05-15 02:48:08] [INFO ] Computed 277 place invariants in 4 ms
[2022-05-15 02:48:09] [INFO ] Implicit Places using invariants in 380 ms returned []
[2022-05-15 02:48:09] [INFO ] Flow matrix only has 1903 transitions (discarded 41 similar events)
// Phase 1: matrix 1903 rows 877 cols
[2022-05-15 02:48:09] [INFO ] Computed 277 place invariants in 8 ms
[2022-05-15 02:48:09] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-05-15 02:48:10] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
[2022-05-15 02:48:10] [INFO ] Redundant transitions in 203 ms returned []
[2022-05-15 02:48:10] [INFO ] Flow matrix only has 1903 transitions (discarded 41 similar events)
// Phase 1: matrix 1903 rows 877 cols
[2022-05-15 02:48:10] [INFO ] Computed 277 place invariants in 5 ms
[2022-05-15 02:48:11] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 877/3058 places, 1944/5845 transitions.
Finished structural reductions, in 1 iterations. Remains : 877/3058 places, 1944/5845 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-12b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s69 0) (EQ s33 1)), p0:(OR (EQ s702 0) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1021 ms.
Product exploration explored 100000 steps with 0 reset in 1218 ms.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 642 steps, including 0 resets, run visited all 2 properties in 24 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 877 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 877/877 places, 1944/1944 transitions.
Applied a total of 0 rules in 80 ms. Remains 877 /877 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2022-05-15 02:48:14] [INFO ] Flow matrix only has 1903 transitions (discarded 41 similar events)
// Phase 1: matrix 1903 rows 877 cols
[2022-05-15 02:48:14] [INFO ] Computed 277 place invariants in 3 ms
[2022-05-15 02:48:14] [INFO ] Implicit Places using invariants in 446 ms returned []
[2022-05-15 02:48:14] [INFO ] Flow matrix only has 1903 transitions (discarded 41 similar events)
// Phase 1: matrix 1903 rows 877 cols
[2022-05-15 02:48:14] [INFO ] Computed 277 place invariants in 4 ms
[2022-05-15 02:48:15] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-05-15 02:48:15] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
[2022-05-15 02:48:15] [INFO ] Redundant transitions in 95 ms returned []
[2022-05-15 02:48:15] [INFO ] Flow matrix only has 1903 transitions (discarded 41 similar events)
// Phase 1: matrix 1903 rows 877 cols
[2022-05-15 02:48:15] [INFO ] Computed 277 place invariants in 3 ms
[2022-05-15 02:48:16] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 877/877 places, 1944/1944 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3739 steps, including 1 resets, run visited all 2 properties in 67 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 468 steps with 0 reset in 14 ms.
FORMULA DLCround-PT-12b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12b-LTLCardinality-05 finished in 10010 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F(!(X(X(F(p1))) U p2))))'
Support contains 6 out of 3058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3058/3058 places, 5845/5845 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3050 transition count 5837
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3050 transition count 5837
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 3047 transition count 5834
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 3047 transition count 5834
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 3045 transition count 5817
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 3045 transition count 5817
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 3044 transition count 5816
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 3044 transition count 5816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 3043 transition count 5815
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 3043 transition count 5815
Applied a total of 30 rules in 909 ms. Remains 3043 /3058 variables (removed 15) and now considering 5815/5845 (removed 30) transitions.
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:48:18] [INFO ] Computed 277 place invariants in 19 ms
[2022-05-15 02:48:19] [INFO ] Implicit Places using invariants in 1018 ms returned []
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:48:19] [INFO ] Computed 277 place invariants in 13 ms
[2022-05-15 02:48:21] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 2727 ms to find 0 implicit places.
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:48:21] [INFO ] Computed 277 place invariants in 22 ms
[2022-05-15 02:48:24] [INFO ] Dead Transitions using invariants and state equation in 3080 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3043/3058 places, 5815/5845 transitions.
Finished structural reductions, in 1 iterations. Remains : 3043/3058 places, 5815/5845 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
Running random walk in product with property : DLCround-PT-12b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s2154 0) (EQ s2327 1)), p2:(OR (EQ s1798 0) (EQ s1915 1)), p1:(OR (EQ s232 0) (EQ s1572 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 18 reset in 690 ms.
Product exploration explored 100000 steps with 25 reset in 784 ms.
Computed a total of 551 stabilizing places and 551 stable transitions
Computed a total of 551 stabilizing places and 551 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 345 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:48:27] [INFO ] Computed 277 place invariants in 13 ms
[2022-05-15 02:48:27] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 02:48:28] [INFO ] [Nat]Absence check using 277 positive place invariants in 244 ms returned sat
[2022-05-15 02:48:31] [INFO ] After 2486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 02:48:32] [INFO ] After 3709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 627 ms.
[2022-05-15 02:48:32] [INFO ] After 5202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 701 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=116 )
Parikh walk visited 4 properties in 46 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 439 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:48:33] [INFO ] Computed 277 place invariants in 13 ms
[2022-05-15 02:48:37] [INFO ] [Real]Absence check using 277 positive place invariants in 991 ms returned sat
[2022-05-15 02:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 02:48:48] [INFO ] [Real]Absence check using state equation in 11282 ms returned unknown
Could not prove EG (AND (NOT p0) p2)
Support contains 6 out of 3043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3043/3043 places, 5815/5815 transitions.
Applied a total of 0 rules in 136 ms. Remains 3043 /3043 variables (removed 0) and now considering 5815/5815 (removed 0) transitions.
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:48:48] [INFO ] Computed 277 place invariants in 13 ms
[2022-05-15 02:48:49] [INFO ] Implicit Places using invariants in 996 ms returned []
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:48:49] [INFO ] Computed 277 place invariants in 16 ms
[2022-05-15 02:48:51] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 2642 ms to find 0 implicit places.
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:48:51] [INFO ] Computed 277 place invariants in 14 ms
[2022-05-15 02:48:54] [INFO ] Dead Transitions using invariants and state equation in 3040 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3043/3043 places, 5815/5815 transitions.
Computed a total of 551 stabilizing places and 551 stable transitions
Computed a total of 551 stabilizing places and 551 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 359 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:48:55] [INFO ] Computed 277 place invariants in 12 ms
[2022-05-15 02:48:56] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 02:48:56] [INFO ] [Nat]Absence check using 277 positive place invariants in 239 ms returned sat
[2022-05-15 02:48:59] [INFO ] After 2474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 02:49:00] [INFO ] After 3632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 561 ms.
[2022-05-15 02:49:01] [INFO ] After 5029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 717 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=119 )
Parikh walk visited 4 properties in 40 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 544 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:49:02] [INFO ] Computed 277 place invariants in 19 ms
[2022-05-15 02:49:05] [INFO ] [Real]Absence check using 277 positive place invariants in 961 ms returned sat
[2022-05-15 02:49:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 02:49:17] [INFO ] [Real]Absence check using state equation in 11336 ms returned unknown
Could not prove EG (AND (NOT p0) p2)
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
Product exploration explored 100000 steps with 18 reset in 695 ms.
Product exploration explored 100000 steps with 20 reset in 797 ms.
Built C files in :
/tmp/ltsmin3964317057892885536
[2022-05-15 02:49:18] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3964317057892885536
Running compilation step : cd /tmp/ltsmin3964317057892885536;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3964317057892885536;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3964317057892885536;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 3043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3043/3043 places, 5815/5815 transitions.
Applied a total of 0 rules in 146 ms. Remains 3043 /3043 variables (removed 0) and now considering 5815/5815 (removed 0) transitions.
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:49:22] [INFO ] Computed 277 place invariants in 13 ms
[2022-05-15 02:49:23] [INFO ] Implicit Places using invariants in 1051 ms returned []
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:49:23] [INFO ] Computed 277 place invariants in 13 ms
[2022-05-15 02:49:25] [INFO ] Implicit Places using invariants and state equation in 1867 ms returned []
Implicit Place search using SMT with State Equation took 2935 ms to find 0 implicit places.
// Phase 1: matrix 5815 rows 3043 cols
[2022-05-15 02:49:25] [INFO ] Computed 277 place invariants in 15 ms
[2022-05-15 02:49:28] [INFO ] Dead Transitions using invariants and state equation in 2966 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3043/3043 places, 5815/5815 transitions.
Built C files in :
/tmp/ltsmin14248355987537586931
[2022-05-15 02:49:28] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14248355987537586931
Running compilation step : cd /tmp/ltsmin14248355987537586931;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14248355987537586931;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14248355987537586931;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 02:49:31] [INFO ] Flatten gal took : 164 ms
[2022-05-15 02:49:31] [INFO ] Flatten gal took : 233 ms
[2022-05-15 02:49:31] [INFO ] Time to serialize gal into /tmp/LTL14462434092929414910.gal : 32 ms
[2022-05-15 02:49:31] [INFO ] Time to serialize properties into /tmp/LTL6806153911975727111.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14462434092929414910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6806153911975727111.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1446243...267
Read 1 LTL properties
Checking formula 0 : !(((F("((p3367==0)&&(p3654==1))"))||(F(!((X(X(F("((p470==0)||(p2402==1))"))))U("((p2777==0)||(p2970==1))"))))))
Formula 0 simplified : !(F"((p3367==0)&&(p3654==1))" | F!(XXF"((p470==0)||(p2402==1))" U "((p2777==0)||(p2970==1))"))
Detected timeout of ITS tools.
[2022-05-15 02:49:47] [INFO ] Flatten gal took : 154 ms
[2022-05-15 02:49:47] [INFO ] Applying decomposition
[2022-05-15 02:49:47] [INFO ] Flatten gal took : 159 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16933419575925390462.txt' '-o' '/tmp/graph16933419575925390462.bin' '-w' '/tmp/graph16933419575925390462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16933419575925390462.bin' '-l' '-1' '-v' '-w' '/tmp/graph16933419575925390462.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:49:48] [INFO ] Decomposing Gal with order
[2022-05-15 02:49:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:49:49] [INFO ] Removed a total of 5872 redundant transitions.
[2022-05-15 02:49:49] [INFO ] Flatten gal took : 921 ms
[2022-05-15 02:49:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 55 ms.
[2022-05-15 02:49:50] [INFO ] Time to serialize gal into /tmp/LTL5761759755322049487.gal : 62 ms
[2022-05-15 02:49:50] [INFO ] Time to serialize properties into /tmp/LTL10600723821880324998.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5761759755322049487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10600723821880324998.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5761759...246
Read 1 LTL properties
Checking formula 0 : !(((F("((i18.u830.p3367==0)&&(i6.u888.p3654==1))"))||(F(!((X(X(F("((i18.u109.p470==0)||(i4.u658.p2402==1))"))))U("((i2.u723.p2777==0)|...182
Formula 0 simplified : !(F"((i18.u830.p3367==0)&&(i6.u888.p3654==1))" | F!(XXF"((i18.u109.p470==0)||(i4.u658.p2402==1))" U "((i2.u723.p2777==0)||(i0.u757.p...167
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8979484309810436862
[2022-05-15 02:50:05] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8979484309810436862
Running compilation step : cd /tmp/ltsmin8979484309810436862;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8979484309810436862;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8979484309810436862;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DLCround-PT-12b-LTLCardinality-09 finished in 110533 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 3058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3058/3058 places, 5845/5845 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3048 transition count 5835
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3048 transition count 5835
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 3045 transition count 5832
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 3045 transition count 5832
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 3043 transition count 5815
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 3043 transition count 5815
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 3042 transition count 5814
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 3042 transition count 5814
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3041 transition count 5813
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3041 transition count 5813
Applied a total of 34 rules in 870 ms. Remains 3041 /3058 variables (removed 17) and now considering 5813/5845 (removed 32) transitions.
// Phase 1: matrix 5813 rows 3041 cols
[2022-05-15 02:50:09] [INFO ] Computed 277 place invariants in 13 ms
[2022-05-15 02:50:10] [INFO ] Implicit Places using invariants in 992 ms returned []
// Phase 1: matrix 5813 rows 3041 cols
[2022-05-15 02:50:10] [INFO ] Computed 277 place invariants in 12 ms
[2022-05-15 02:50:11] [INFO ] Implicit Places using invariants and state equation in 1655 ms returned []
Implicit Place search using SMT with State Equation took 2670 ms to find 0 implicit places.
// Phase 1: matrix 5813 rows 3041 cols
[2022-05-15 02:50:11] [INFO ] Computed 277 place invariants in 13 ms
[2022-05-15 02:50:14] [INFO ] Dead Transitions using invariants and state equation in 3023 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3041/3058 places, 5813/5845 transitions.
Finished structural reductions, in 1 iterations. Remains : 3041/3058 places, 5813/5845 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-12b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s379 0) (EQ s862 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12b-LTLCardinality-10 finished in 6731 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (!p1 U G(p1)))))'
Support contains 4 out of 3058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3058/3058 places, 5845/5845 transitions.
Graph (trivial) has 2635 edges and 3058 vertex of which 654 / 3058 are part of one of the 56 SCC in 3 ms
Free SCC test removed 598 places
Ensure Unique test removed 642 transitions
Reduce isomorphic transitions removed 642 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 462 rules applied. Total rules applied 463 place count 2459 transition count 4740
Reduce places removed 462 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 513 rules applied. Total rules applied 976 place count 1997 transition count 4689
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 36 rules applied. Total rules applied 1012 place count 1963 transition count 4687
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1014 place count 1961 transition count 4687
Performed 274 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 274 Pre rules applied. Total rules applied 1014 place count 1961 transition count 4413
Deduced a syphon composed of 274 places in 43 ms
Reduce places removed 274 places and 0 transitions.
Iterating global reduction 4 with 548 rules applied. Total rules applied 1562 place count 1687 transition count 4413
Discarding 90 places :
Symmetric choice reduction at 4 with 90 rule applications. Total rules 1652 place count 1597 transition count 3540
Iterating global reduction 4 with 90 rules applied. Total rules applied 1742 place count 1597 transition count 3540
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1746 place count 1597 transition count 3536
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1746 place count 1597 transition count 3529
Deduced a syphon composed of 7 places in 38 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1760 place count 1590 transition count 3529
Performed 612 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 612 places in 1 ms
Reduce places removed 612 places and 0 transitions.
Iterating global reduction 5 with 1224 rules applied. Total rules applied 2984 place count 978 transition count 2905
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2997 place count 978 transition count 2892
Renaming transitions due to excessive name length > 1024 char.
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 3028 place count 947 transition count 2408
Iterating global reduction 6 with 31 rules applied. Total rules applied 3059 place count 947 transition count 2408
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 3088 place count 947 transition count 2379
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 7 with 2 rules applied. Total rules applied 3090 place count 946 transition count 2378
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -172
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 3124 place count 929 transition count 2550
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 3128 place count 929 transition count 2546
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 3132 place count 925 transition count 2434
Iterating global reduction 8 with 4 rules applied. Total rules applied 3136 place count 925 transition count 2434
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 3140 place count 925 transition count 2430
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 3148 place count 921 transition count 2479
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 9 with 59 rules applied. Total rules applied 3207 place count 921 transition count 2420
Discarding 22 places :
Symmetric choice reduction at 9 with 22 rule applications. Total rules 3229 place count 899 transition count 2376
Iterating global reduction 9 with 22 rules applied. Total rules applied 3251 place count 899 transition count 2376
Discarding 22 places :
Symmetric choice reduction at 9 with 22 rule applications. Total rules 3273 place count 877 transition count 2014
Iterating global reduction 9 with 22 rules applied. Total rules applied 3295 place count 877 transition count 2014
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 3317 place count 877 transition count 1992
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3318 place count 876 transition count 1991
Applied a total of 3318 rules in 1085 ms. Remains 876 /3058 variables (removed 2182) and now considering 1991/5845 (removed 3854) transitions.
[2022-05-15 02:50:15] [INFO ] Flow matrix only has 1944 transitions (discarded 47 similar events)
// Phase 1: matrix 1944 rows 876 cols
[2022-05-15 02:50:16] [INFO ] Computed 277 place invariants in 29 ms
[2022-05-15 02:50:16] [INFO ] Implicit Places using invariants in 431 ms returned []
[2022-05-15 02:50:16] [INFO ] Flow matrix only has 1944 transitions (discarded 47 similar events)
// Phase 1: matrix 1944 rows 876 cols
[2022-05-15 02:50:16] [INFO ] Computed 277 place invariants in 4 ms
[2022-05-15 02:50:16] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-05-15 02:50:17] [INFO ] Implicit Places using invariants and state equation in 1075 ms returned []
Implicit Place search using SMT with State Equation took 1523 ms to find 0 implicit places.
[2022-05-15 02:50:17] [INFO ] Redundant transitions in 42 ms returned []
[2022-05-15 02:50:17] [INFO ] Flow matrix only has 1944 transitions (discarded 47 similar events)
// Phase 1: matrix 1944 rows 876 cols
[2022-05-15 02:50:17] [INFO ] Computed 277 place invariants in 6 ms
[2022-05-15 02:50:18] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 876/3058 places, 1991/5845 transitions.
Finished structural reductions, in 1 iterations. Remains : 876/3058 places, 1991/5845 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DLCround-PT-12b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s90 0) (EQ s36 1)), p0:(OR (EQ s104 0) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-12b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12b-LTLCardinality-11 finished in 3513 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((!G(p0) U X(F(!p0)))))))'
Support contains 1 out of 3058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3058/3058 places, 5845/5845 transitions.
Graph (trivial) has 2640 edges and 3058 vertex of which 676 / 3058 are part of one of the 56 SCC in 1 ms
Free SCC test removed 620 places
Ensure Unique test removed 667 transitions
Reduce isomorphic transitions removed 667 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 456 transitions
Trivial Post-agglo rules discarded 456 transitions
Performed 456 trivial Post agglomeration. Transition count delta: 456
Iterating post reduction 0 with 456 rules applied. Total rules applied 457 place count 2437 transition count 4721
Reduce places removed 456 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 507 rules applied. Total rules applied 964 place count 1981 transition count 4670
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 998 place count 1947 transition count 4670
Performed 271 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 271 Pre rules applied. Total rules applied 998 place count 1947 transition count 4399
Deduced a syphon composed of 271 places in 27 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 3 with 542 rules applied. Total rules applied 1540 place count 1676 transition count 4399
Discarding 93 places :
Symmetric choice reduction at 3 with 93 rule applications. Total rules 1633 place count 1583 transition count 3493
Iterating global reduction 3 with 93 rules applied. Total rules applied 1726 place count 1583 transition count 3493
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1730 place count 1583 transition count 3489
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 1730 place count 1583 transition count 3483
Deduced a syphon composed of 6 places in 22 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1742 place count 1577 transition count 3483
Performed 609 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 609 places in 1 ms
Reduce places removed 609 places and 0 transitions.
Iterating global reduction 4 with 1218 rules applied. Total rules applied 2960 place count 968 transition count 2862
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 2973 place count 968 transition count 2849
Renaming transitions due to excessive name length > 1024 char.
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 3005 place count 936 transition count 2349
Iterating global reduction 5 with 32 rules applied. Total rules applied 3037 place count 936 transition count 2349
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 3068 place count 936 transition count 2318
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -131
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 3092 place count 924 transition count 2449
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 3096 place count 924 transition count 2445
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 3100 place count 920 transition count 2337
Iterating global reduction 7 with 4 rules applied. Total rules applied 3104 place count 920 transition count 2337
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 3108 place count 920 transition count 2333
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 3116 place count 916 transition count 2379
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 8 with 49 rules applied. Total rules applied 3165 place count 916 transition count 2330
Discarding 26 places :
Symmetric choice reduction at 8 with 26 rule applications. Total rules 3191 place count 890 transition count 2278
Iterating global reduction 8 with 26 rules applied. Total rules applied 3217 place count 890 transition count 2278
Discarding 26 places :
Symmetric choice reduction at 8 with 26 rule applications. Total rules 3243 place count 864 transition count 1858
Iterating global reduction 8 with 26 rules applied. Total rules applied 3269 place count 864 transition count 1858
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 3295 place count 864 transition count 1832
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3296 place count 863 transition count 1831
Applied a total of 3296 rules in 773 ms. Remains 863 /3058 variables (removed 2195) and now considering 1831/5845 (removed 4014) transitions.
[2022-05-15 02:50:19] [INFO ] Flow matrix only has 1797 transitions (discarded 34 similar events)
// Phase 1: matrix 1797 rows 863 cols
[2022-05-15 02:50:19] [INFO ] Computed 277 place invariants in 3 ms
[2022-05-15 02:50:19] [INFO ] Implicit Places using invariants in 353 ms returned []
[2022-05-15 02:50:19] [INFO ] Flow matrix only has 1797 transitions (discarded 34 similar events)
// Phase 1: matrix 1797 rows 863 cols
[2022-05-15 02:50:19] [INFO ] Computed 277 place invariants in 3 ms
[2022-05-15 02:50:20] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-05-15 02:50:20] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
[2022-05-15 02:50:20] [INFO ] Redundant transitions in 37 ms returned []
[2022-05-15 02:50:20] [INFO ] Flow matrix only has 1797 transitions (discarded 34 similar events)
// Phase 1: matrix 1797 rows 863 cols
[2022-05-15 02:50:20] [INFO ] Computed 277 place invariants in 7 ms
[2022-05-15 02:50:21] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 863/3058 places, 1831/5845 transitions.
Finished structural reductions, in 1 iterations. Remains : 863/3058 places, 1831/5845 transitions.
Stuttering acceptance computed with spot in 56 ms :[p0, p0]
Running random walk in product with property : DLCround-PT-12b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s638 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 DLCround-PT-12b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12b-LTLCardinality-13 finished in 3097 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F(!(X(X(F(p1))) U p2))))'
Found a SL insensitive property : DLCround-PT-12b-LTLCardinality-09
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
Support contains 6 out of 3058 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3058/3058 places, 5845/5845 transitions.
Graph (trivial) has 2631 edges and 3058 vertex of which 676 / 3058 are part of one of the 56 SCC in 2 ms
Free SCC test removed 620 places
Ensure Unique test removed 667 transitions
Reduce isomorphic transitions removed 667 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 452 transitions
Trivial Post-agglo rules discarded 452 transitions
Performed 452 trivial Post agglomeration. Transition count delta: 452
Iterating post reduction 0 with 452 rules applied. Total rules applied 453 place count 2437 transition count 4725
Reduce places removed 452 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 503 rules applied. Total rules applied 956 place count 1985 transition count 4674
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 990 place count 1951 transition count 4674
Performed 271 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 271 Pre rules applied. Total rules applied 990 place count 1951 transition count 4403
Deduced a syphon composed of 271 places in 27 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 3 with 542 rules applied. Total rules applied 1532 place count 1680 transition count 4403
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 1622 place count 1590 transition count 3500
Iterating global reduction 3 with 90 rules applied. Total rules applied 1712 place count 1590 transition count 3500
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1716 place count 1590 transition count 3496
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1716 place count 1590 transition count 3493
Deduced a syphon composed of 3 places in 21 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1722 place count 1587 transition count 3493
Performed 611 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 611 places in 1 ms
Reduce places removed 611 places and 0 transitions.
Iterating global reduction 4 with 1222 rules applied. Total rules applied 2944 place count 976 transition count 2871
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 2956 place count 976 transition count 2859
Renaming transitions due to excessive name length > 1024 char.
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 2988 place count 944 transition count 2359
Iterating global reduction 5 with 32 rules applied. Total rules applied 3020 place count 944 transition count 2359
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 3051 place count 944 transition count 2328
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -142
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 3079 place count 930 transition count 2470
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 3083 place count 930 transition count 2466
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 3087 place count 926 transition count 2356
Iterating global reduction 7 with 4 rules applied. Total rules applied 3091 place count 926 transition count 2356
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 3095 place count 926 transition count 2352
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 3103 place count 922 transition count 2398
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 3109 place count 922 transition count 2392
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 3111 place count 922 transition count 2392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3112 place count 922 transition count 2391
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3113 place count 921 transition count 2390
Applied a total of 3113 rules in 614 ms. Remains 921 /3058 variables (removed 2137) and now considering 2390/5845 (removed 3455) transitions.
[2022-05-15 02:50:22] [INFO ] Flow matrix only has 2323 transitions (discarded 67 similar events)
// Phase 1: matrix 2323 rows 921 cols
[2022-05-15 02:50:22] [INFO ] Computed 277 place invariants in 4 ms
[2022-05-15 02:50:23] [INFO ] Implicit Places using invariants in 769 ms returned []
[2022-05-15 02:50:23] [INFO ] Flow matrix only has 2323 transitions (discarded 67 similar events)
// Phase 1: matrix 2323 rows 921 cols
[2022-05-15 02:50:23] [INFO ] Computed 277 place invariants in 4 ms
[2022-05-15 02:50:23] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 02:50:24] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
[2022-05-15 02:50:24] [INFO ] Flow matrix only has 2323 transitions (discarded 67 similar events)
// Phase 1: matrix 2323 rows 921 cols
[2022-05-15 02:50:24] [INFO ] Computed 277 place invariants in 3 ms
[2022-05-15 02:50:25] [INFO ] Dead Transitions using invariants and state equation in 1168 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 921/3058 places, 2390/5845 transitions.
Finished structural reductions, in 1 iterations. Remains : 921/3058 places, 2390/5845 transitions.
Running random walk in product with property : DLCround-PT-12b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s476 0) (EQ s563 1)), p2:(OR (EQ s297 0) (EQ s356 1)), p1:(OR (EQ s24 0) (EQ s182 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property DLCround-PT-12b-LTLCardinality-09 finished in 3906 ms.
FORMULA DLCround-PT-12b-LTLCardinality-09 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-15 02:50:25] [INFO ] Flatten gal took : 149 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 163995 ms.
BK_STOP 1652583025680
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="DLCround-PT-12b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DLCround-PT-12b, 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 r060-tall-165254771800267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-12b.tgz
mv DLCround-PT-12b 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 ;