Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r201-smll-167840347800491.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is HirschbergSinclair-PT-45, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347800491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K Feb 26 02:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 02:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 02:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 02:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 02:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 02:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 616K Mar 5 18:22 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 HirschbergSinclair-PT-45-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678743781129

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-45
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 21:43:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:43:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:43:04] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-13 21:43:04] [INFO ] Transformed 1138 places.
[2023-03-13 21:43:04] [INFO ] Transformed 1042 transitions.
[2023-03-13 21:43:04] [INFO ] Parsed PT model containing 1138 places and 1042 transitions and 3176 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1042/1042 transitions.
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1094 transition count 1042
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 85 place count 1053 transition count 1001
Iterating global reduction 1 with 41 rules applied. Total rules applied 126 place count 1053 transition count 1001
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 164 place count 1015 transition count 963
Iterating global reduction 1 with 38 rules applied. Total rules applied 202 place count 1015 transition count 963
Applied a total of 202 rules in 593 ms. Remains 1015 /1138 variables (removed 123) and now considering 963/1042 (removed 79) transitions.
// Phase 1: matrix 963 rows 1015 cols
[2023-03-13 21:43:05] [INFO ] Computed 52 place invariants in 46 ms
[2023-03-13 21:43:06] [INFO ] Implicit Places using invariants in 1229 ms returned []
[2023-03-13 21:43:06] [INFO ] Invariant cache hit.
[2023-03-13 21:43:10] [INFO ] Implicit Places using invariants and state equation in 4126 ms returned []
Implicit Place search using SMT with State Equation took 5414 ms to find 0 implicit places.
[2023-03-13 21:43:10] [INFO ] Invariant cache hit.
[2023-03-13 21:43:11] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1015/1138 places, 963/1042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7063 ms. Remains : 1015/1138 places, 963/1042 transitions.
Support contains 41 out of 1015 places after structural reductions.
[2023-03-13 21:43:12] [INFO ] Flatten gal took : 153 ms
[2023-03-13 21:43:12] [INFO ] Flatten gal took : 85 ms
[2023-03-13 21:43:12] [INFO ] Input system was already deterministic with 963 transitions.
Support contains 39 out of 1015 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 753 ms. (steps per millisecond=13 ) properties (out of 24) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-13 21:43:13] [INFO ] Invariant cache hit.
[2023-03-13 21:43:14] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-13 21:43:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2023-03-13 21:43:15] [INFO ] [Nat]Absence check using 1 positive and 51 generalized place invariants in 225 ms returned sat
[2023-03-13 21:43:16] [INFO ] After 986ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :2
[2023-03-13 21:43:16] [INFO ] After 1275ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-13 21:43:16] [INFO ] After 2559ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :2
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 1015 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1015/1015 places, 963/963 transitions.
Graph (complete) has 1931 edges and 1015 vertex of which 975 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.5 ms
Discarding 40 places :
Also discarding 0 output transitions
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 455 rules applied. Total rules applied 456 place count 975 transition count 508
Reduce places removed 416 places and 0 transitions.
Graph (complete) has 976 edges and 559 vertex of which 477 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.2 ms
Discarding 82 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 418 rules applied. Total rules applied 874 place count 477 transition count 507
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 2 with 83 rules applied. Total rules applied 957 place count 476 transition count 425
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 961 place count 472 transition count 421
Iterating global reduction 3 with 4 rules applied. Total rules applied 965 place count 472 transition count 421
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 968 place count 472 transition count 418
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 804 edges and 469 vertex of which 463 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 4 rules applied. Total rules applied 972 place count 463 transition count 418
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 978 place count 463 transition count 412
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 979 place count 462 transition count 411
Iterating global reduction 6 with 1 rules applied. Total rules applied 980 place count 462 transition count 411
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 986 place count 462 transition count 405
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 992 place count 456 transition count 405
Reduce places removed 44 places and 44 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 1036 place count 412 transition count 361
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 7 with 300 rules applied. Total rules applied 1336 place count 373 transition count 100
Reduce places removed 261 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 262 rules applied. Total rules applied 1598 place count 112 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1599 place count 111 transition count 99
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 17 Pre rules applied. Total rules applied 1599 place count 111 transition count 82
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 1633 place count 94 transition count 82
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 1634 place count 93 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1634 place count 93 transition count 81
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1636 place count 92 transition count 81
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1642 place count 89 transition count 78
Applied a total of 1642 rules in 231 ms. Remains 89 /1015 variables (removed 926) and now considering 78/963 (removed 885) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 89/1015 places, 78/963 transitions.
Incomplete random walk after 10000 steps, including 123 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Finished Best-First random walk after 1528 steps, including 8 resets, run visited all 2 properties in 22 ms. (steps per millisecond=69 )
FORMULA HirschbergSinclair-PT-45-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1015 stabilizing places and 963 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1015 transition count 963
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-45-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1015 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1015/1015 places, 963/963 transitions.
Graph (complete) has 1931 edges and 1015 vertex of which 1014 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 43 places and 43 transitions.
Drop transitions removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 427 rules applied. Total rules applied 428 place count 971 transition count 493
Reduce places removed 427 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 429 rules applied. Total rules applied 857 place count 544 transition count 491
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 859 place count 542 transition count 491
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 866 place count 535 transition count 484
Iterating global reduction 3 with 7 rules applied. Total rules applied 873 place count 535 transition count 484
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 876 place count 535 transition count 481
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 879 place count 532 transition count 481
Applied a total of 879 rules in 143 ms. Remains 532 /1015 variables (removed 483) and now considering 481/963 (removed 482) transitions.
// Phase 1: matrix 481 rows 532 cols
[2023-03-13 21:43:17] [INFO ] Computed 51 place invariants in 4 ms
[2023-03-13 21:43:18] [INFO ] Implicit Places using invariants in 825 ms returned []
[2023-03-13 21:43:18] [INFO ] Invariant cache hit.
[2023-03-13 21:43:19] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-13 21:43:21] [INFO ] Implicit Places using invariants and state equation in 3245 ms returned []
Implicit Place search using SMT with State Equation took 4074 ms to find 0 implicit places.
[2023-03-13 21:43:21] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-13 21:43:21] [INFO ] Invariant cache hit.
[2023-03-13 21:43:22] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/1015 places, 481/963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4764 ms. Remains : 532/1015 places, 481/963 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s127 s95)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 731 reset in 881 ms.
Product exploration explored 100000 steps with 673 reset in 804 ms.
Computed a total of 532 stabilizing places and 481 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 532 transition count 481
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 211 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 481/481 transitions.
Applied a total of 0 rules in 34 ms. Remains 532 /532 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2023-03-13 21:43:25] [INFO ] Invariant cache hit.
[2023-03-13 21:43:26] [INFO ] Implicit Places using invariants in 817 ms returned []
[2023-03-13 21:43:26] [INFO ] Invariant cache hit.
[2023-03-13 21:43:26] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-13 21:43:28] [INFO ] Implicit Places using invariants and state equation in 2534 ms returned []
Implicit Place search using SMT with State Equation took 3360 ms to find 0 implicit places.
[2023-03-13 21:43:28] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-13 21:43:28] [INFO ] Invariant cache hit.
[2023-03-13 21:43:29] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3963 ms. Remains : 532/532 places, 481/481 transitions.
Computed a total of 532 stabilizing places and 481 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 532 transition count 481
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 703 reset in 619 ms.
Product exploration explored 100000 steps with 726 reset in 708 ms.
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 481/481 transitions.
Applied a total of 0 rules in 26 ms. Remains 532 /532 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2023-03-13 21:43:31] [INFO ] Invariant cache hit.
[2023-03-13 21:43:32] [INFO ] Implicit Places using invariants in 830 ms returned []
[2023-03-13 21:43:32] [INFO ] Invariant cache hit.
[2023-03-13 21:43:32] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-13 21:43:35] [INFO ] Implicit Places using invariants and state equation in 2987 ms returned []
Implicit Place search using SMT with State Equation took 3820 ms to find 0 implicit places.
[2023-03-13 21:43:35] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-13 21:43:35] [INFO ] Invariant cache hit.
[2023-03-13 21:43:36] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4479 ms. Remains : 532/532 places, 481/481 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-00 finished in 18559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((p0 U (p1||G(p0))))))))'
Support contains 2 out of 1015 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1015/1015 places, 963/963 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1014 transition count 963
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 1007 transition count 956
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 1007 transition count 956
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 1003 transition count 952
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 1003 transition count 952
Applied a total of 23 rules in 131 ms. Remains 1003 /1015 variables (removed 12) and now considering 952/963 (removed 11) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2023-03-13 21:43:36] [INFO ] Computed 51 place invariants in 9 ms
[2023-03-13 21:43:37] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-13 21:43:37] [INFO ] Invariant cache hit.
[2023-03-13 21:43:41] [INFO ] Implicit Places using invariants and state equation in 3981 ms returned []
Implicit Place search using SMT with State Equation took 4701 ms to find 0 implicit places.
[2023-03-13 21:43:41] [INFO ] Invariant cache hit.
[2023-03-13 21:43:42] [INFO ] Dead Transitions using invariants and state equation in 1227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1003/1015 places, 952/963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6062 ms. Remains : 1003/1015 places, 952/963 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-02 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:(GT s964 s434)], 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 HirschbergSinclair-PT-45-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-02 finished in 6185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&F(p1)))'
Support contains 4 out of 1015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1015/1015 places, 963/963 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1014 transition count 963
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 1009 transition count 958
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 1009 transition count 958
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 1006 transition count 955
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 1006 transition count 955
Applied a total of 17 rules in 131 ms. Remains 1006 /1015 variables (removed 9) and now considering 955/963 (removed 8) transitions.
// Phase 1: matrix 955 rows 1006 cols
[2023-03-13 21:43:42] [INFO ] Computed 51 place invariants in 8 ms
[2023-03-13 21:43:43] [INFO ] Implicit Places using invariants in 908 ms returned []
[2023-03-13 21:43:43] [INFO ] Invariant cache hit.
[2023-03-13 21:43:47] [INFO ] Implicit Places using invariants and state equation in 4180 ms returned []
Implicit Place search using SMT with State Equation took 5092 ms to find 0 implicit places.
[2023-03-13 21:43:47] [INFO ] Invariant cache hit.
[2023-03-13 21:43:48] [INFO ] Dead Transitions using invariants and state equation in 1186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1006/1015 places, 955/963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6414 ms. Remains : 1006/1015 places, 955/963 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s572 s12), p0:(GT s198 s165)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 8633 steps with 46 reset in 73 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-09 finished in 6720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p0)) U (p1 U (p2||G(p1)))))))'
Support contains 5 out of 1015 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1015/1015 places, 963/963 transitions.
Graph (complete) has 1931 edges and 1015 vertex of which 1014 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 42 places and 42 transitions.
Drop transitions removed 406 transitions
Trivial Post-agglo rules discarded 406 transitions
Performed 406 trivial Post agglomeration. Transition count delta: 406
Iterating post reduction 0 with 406 rules applied. Total rules applied 407 place count 972 transition count 515
Reduce places removed 406 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 407 rules applied. Total rules applied 814 place count 566 transition count 514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 815 place count 565 transition count 514
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 821 place count 559 transition count 508
Iterating global reduction 3 with 6 rules applied. Total rules applied 827 place count 559 transition count 508
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 829 place count 559 transition count 506
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 831 place count 557 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 833 place count 556 transition count 505
Applied a total of 833 rules in 103 ms. Remains 556 /1015 variables (removed 459) and now considering 505/963 (removed 458) transitions.
// Phase 1: matrix 505 rows 556 cols
[2023-03-13 21:43:49] [INFO ] Computed 51 place invariants in 4 ms
[2023-03-13 21:43:50] [INFO ] Implicit Places using invariants in 879 ms returned []
[2023-03-13 21:43:50] [INFO ] Invariant cache hit.
[2023-03-13 21:43:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-13 21:43:52] [INFO ] Implicit Places using invariants and state equation in 2595 ms returned []
Implicit Place search using SMT with State Equation took 3490 ms to find 0 implicit places.
[2023-03-13 21:43:52] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 21:43:52] [INFO ] Invariant cache hit.
[2023-03-13 21:43:53] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/1015 places, 505/963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4249 ms. Remains : 556/1015 places, 505/963 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GT 2 s271) (GT s344 s40)), p1:(GT s344 s40), p0:(GT s137 s31)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 551 steps with 0 reset in 5 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-11 finished in 4466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 4 out of 1015 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1015/1015 places, 963/963 transitions.
Graph (complete) has 1931 edges and 1015 vertex of which 1014 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 45 places and 45 transitions.
Drop transitions removed 423 transitions
Trivial Post-agglo rules discarded 423 transitions
Performed 423 trivial Post agglomeration. Transition count delta: 423
Iterating post reduction 0 with 423 rules applied. Total rules applied 424 place count 969 transition count 495
Reduce places removed 423 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 425 rules applied. Total rules applied 849 place count 546 transition count 493
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 851 place count 544 transition count 493
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 858 place count 537 transition count 486
Iterating global reduction 3 with 7 rules applied. Total rules applied 865 place count 537 transition count 486
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 868 place count 537 transition count 483
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 871 place count 534 transition count 483
Applied a total of 871 rules in 89 ms. Remains 534 /1015 variables (removed 481) and now considering 483/963 (removed 480) transitions.
// Phase 1: matrix 483 rows 534 cols
[2023-03-13 21:43:53] [INFO ] Computed 51 place invariants in 4 ms
[2023-03-13 21:43:54] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-13 21:43:54] [INFO ] Invariant cache hit.
[2023-03-13 21:43:56] [INFO ] Implicit Places using invariants and state equation in 2238 ms returned []
Implicit Place search using SMT with State Equation took 2881 ms to find 0 implicit places.
[2023-03-13 21:43:56] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 21:43:56] [INFO ] Invariant cache hit.
[2023-03-13 21:43:57] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 534/1015 places, 483/963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3724 ms. Remains : 534/1015 places, 483/963 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s200 s148), p1:(LEQ s137 s335)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 189 reset in 399 ms.
Product exploration explored 100000 steps with 189 reset in 451 ms.
Computed a total of 534 stabilizing places and 483 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 534 transition count 483
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 21:43:58] [INFO ] Invariant cache hit.
[2023-03-13 21:43:59] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 21:43:59] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 140 ms returned sat
[2023-03-13 21:43:59] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-12 finished in 6125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-13 21:44:00] [INFO ] Flatten gal took : 68 ms
[2023-03-13 21:44:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-13 21:44:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1015 places, 963 transitions and 2892 arcs took 12 ms.
Total runtime 56203 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/833/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HirschbergSinclair-PT-45-LTLCardinality-00

BK_STOP 1678743841975

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name HirschbergSinclair-PT-45-LTLCardinality-00
ltl formula formula --ltl=/tmp/833/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1015 places, 963 transitions and 2892 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.030 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/833/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/833/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/833/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/833/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="HirschbergSinclair-PT-45"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is HirschbergSinclair-PT-45, 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 r201-smll-167840347800491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-45.tgz
mv HirschbergSinclair-PT-45 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;