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-167840347800492.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347800492
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678743851460

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=LTLFireability
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:44:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 21:44:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:44:14] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-13 21:44:14] [INFO ] Transformed 1138 places.
[2023-03-13 21:44:14] [INFO ] Transformed 1042 transitions.
[2023-03-13 21:44:14] [INFO ] Parsed PT model containing 1138 places and 1042 transitions and 3176 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HirschbergSinclair-PT-45-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1042/1042 transitions.
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1093 transition count 1042
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 89 place count 1049 transition count 998
Iterating global reduction 1 with 44 rules applied. Total rules applied 133 place count 1049 transition count 998
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 176 place count 1006 transition count 955
Iterating global reduction 1 with 43 rules applied. Total rules applied 219 place count 1006 transition count 955
Applied a total of 219 rules in 747 ms. Remains 1006 /1138 variables (removed 132) and now considering 955/1042 (removed 87) transitions.
// Phase 1: matrix 955 rows 1006 cols
[2023-03-13 21:44:15] [INFO ] Computed 51 place invariants in 43 ms
[2023-03-13 21:44:16] [INFO ] Implicit Places using invariants in 985 ms returned []
[2023-03-13 21:44:16] [INFO ] Invariant cache hit.
[2023-03-13 21:44:19] [INFO ] Implicit Places using invariants and state equation in 3608 ms returned []
Implicit Place search using SMT with State Equation took 4639 ms to find 0 implicit places.
[2023-03-13 21:44:19] [INFO ] Invariant cache hit.
[2023-03-13 21:44:21] [INFO ] Dead Transitions using invariants and state equation in 1147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1006/1138 places, 955/1042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6540 ms. Remains : 1006/1138 places, 955/1042 transitions.
Support contains 33 out of 1006 places after structural reductions.
[2023-03-13 21:44:21] [INFO ] Flatten gal took : 157 ms
[2023-03-13 21:44:21] [INFO ] Flatten gal took : 82 ms
[2023-03-13 21:44:21] [INFO ] Input system was already deterministic with 955 transitions.
Finished random walk after 977 steps, including 0 resets, run visited all 22 properties in 203 ms. (steps per millisecond=4 )
FORMULA HirschbergSinclair-PT-45-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-45-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1006 stabilizing places and 955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1006 transition count 955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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((G(p1)||p0))))'
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 43 places and 43 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 963 transition count 494
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 545 transition count 494
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 838 place count 543 transition count 492
Iterating global reduction 2 with 2 rules applied. Total rules applied 840 place count 543 transition count 492
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 841 place count 543 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 842 place count 542 transition count 491
Applied a total of 842 rules in 126 ms. Remains 542 /1006 variables (removed 464) and now considering 491/955 (removed 464) transitions.
// Phase 1: matrix 491 rows 542 cols
[2023-03-13 21:44:22] [INFO ] Computed 51 place invariants in 5 ms
[2023-03-13 21:44:23] [INFO ] Implicit Places using invariants in 656 ms returned []
[2023-03-13 21:44:23] [INFO ] Invariant cache hit.
[2023-03-13 21:44:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 21:44:26] [INFO ] Implicit Places using invariants and state equation in 3054 ms returned []
Implicit Place search using SMT with State Equation took 3719 ms to find 0 implicit places.
[2023-03-13 21:44:26] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-13 21:44:26] [INFO ] Invariant cache hit.
[2023-03-13 21:44:26] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 542/1006 places, 491/955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4649 ms. Remains : 542/1006 places, 491/955 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-00 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:(AND (GEQ s19 1) (GEQ s86 1)), p0:(OR (GEQ s352 1) (GEQ s478 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 337 reset in 623 ms.
Product exploration explored 100000 steps with 338 reset in 591 ms.
Computed a total of 542 stabilizing places and 491 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 542 transition count 491
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 (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 305 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 79 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 345 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-13 21:44:29] [INFO ] Invariant cache hit.
[2023-03-13 21:44:30] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 227 ms returned sat
[2023-03-13 21:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:44:44] [INFO ] [Real]Absence check using state equation in 14347 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 491/491 transitions.
Applied a total of 0 rules in 37 ms. Remains 542 /542 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2023-03-13 21:44:44] [INFO ] Invariant cache hit.
[2023-03-13 21:44:45] [INFO ] Implicit Places using invariants in 759 ms returned []
[2023-03-13 21:44:45] [INFO ] Invariant cache hit.
[2023-03-13 21:44:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 21:44:48] [INFO ] Implicit Places using invariants and state equation in 3002 ms returned []
Implicit Place search using SMT with State Equation took 3764 ms to find 0 implicit places.
[2023-03-13 21:44:48] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-13 21:44:48] [INFO ] Invariant cache hit.
[2023-03-13 21:44:49] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4607 ms. Remains : 542/542 places, 491/491 transitions.
Computed a total of 542 stabilizing places and 491 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 542 transition count 491
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 (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 293 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 121 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 328 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-13 21:44:50] [INFO ] Invariant cache hit.
[2023-03-13 21:44:51] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 198 ms returned sat
[2023-03-13 21:44:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:45:05] [INFO ] [Real]Absence check using state equation in 14296 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 337 reset in 443 ms.
Product exploration explored 100000 steps with 338 reset in 500 ms.
Support contains 4 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 491/491 transitions.
Applied a total of 0 rules in 49 ms. Remains 542 /542 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2023-03-13 21:45:06] [INFO ] Invariant cache hit.
[2023-03-13 21:45:07] [INFO ] Implicit Places using invariants in 830 ms returned []
[2023-03-13 21:45:07] [INFO ] Invariant cache hit.
[2023-03-13 21:45:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 21:45:10] [INFO ] Implicit Places using invariants and state equation in 2839 ms returned []
Implicit Place search using SMT with State Equation took 3675 ms to find 0 implicit places.
[2023-03-13 21:45:10] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-13 21:45:10] [INFO ] Invariant cache hit.
[2023-03-13 21:45:10] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4485 ms. Remains : 542/542 places, 491/491 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-00 finished in 48830 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((F(p1)&&X((!p2 U (p1||G(!p2))))&&p0)))'
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 133 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2023-03-13 21:45:11] [INFO ] Computed 51 place invariants in 9 ms
[2023-03-13 21:45:11] [INFO ] Implicit Places using invariants in 694 ms returned []
[2023-03-13 21:45:11] [INFO ] Invariant cache hit.
[2023-03-13 21:45:15] [INFO ] Implicit Places using invariants and state equation in 3830 ms returned []
Implicit Place search using SMT with State Equation took 4537 ms to find 0 implicit places.
[2023-03-13 21:45:15] [INFO ] Invariant cache hit.
[2023-03-13 21:45:17] [INFO ] Dead Transitions using invariants and state equation in 1352 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6026 ms. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) p2)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s49 1) (LT s727 1)), p2:(AND (GEQ s65 1) (GEQ s934 1)), p0:(AND (GEQ s7 1) (GEQ s365 1) (OR (LT s65 1) (LT s934 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-02 finished in 6270 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)))'
Support contains 1 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 45 places and 45 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 427 place count 961 transition count 483
Reduce places removed 427 places and 0 transitions.
Iterating post reduction 1 with 427 rules applied. Total rules applied 854 place count 534 transition count 483
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 855 place count 533 transition count 482
Iterating global reduction 2 with 1 rules applied. Total rules applied 856 place count 533 transition count 482
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 857 place count 533 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 858 place count 532 transition count 481
Applied a total of 858 rules in 95 ms. Remains 532 /1006 variables (removed 474) and now considering 481/955 (removed 474) transitions.
// Phase 1: matrix 481 rows 532 cols
[2023-03-13 21:45:17] [INFO ] Computed 51 place invariants in 4 ms
[2023-03-13 21:45:18] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-13 21:45:18] [INFO ] Invariant cache hit.
[2023-03-13 21:45:20] [INFO ] Implicit Places using invariants and state equation in 2625 ms returned []
Implicit Place search using SMT with State Equation took 3277 ms to find 0 implicit places.
[2023-03-13 21:45:20] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 21:45:20] [INFO ] Invariant cache hit.
[2023-03-13 21:45:21] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/1006 places, 481/955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4135 ms. Remains : 532/1006 places, 481/955 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-05 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:(GEQ s51 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 97643 steps with 1098 reset in 785 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-05 finished in 5017 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((!p0&&G(p1)&&X((F(p2)||G(!p0))))))'
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1005 transition count 954
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1005 transition count 954
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1004 transition count 953
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1004 transition count 953
Applied a total of 4 rules in 128 ms. Remains 1004 /1006 variables (removed 2) and now considering 953/955 (removed 2) transitions.
// Phase 1: matrix 953 rows 1004 cols
[2023-03-13 21:45:22] [INFO ] Computed 51 place invariants in 9 ms
[2023-03-13 21:45:23] [INFO ] Implicit Places using invariants in 877 ms returned []
[2023-03-13 21:45:23] [INFO ] Invariant cache hit.
[2023-03-13 21:45:27] [INFO ] Implicit Places using invariants and state equation in 4086 ms returned []
Implicit Place search using SMT with State Equation took 4965 ms to find 0 implicit places.
[2023-03-13 21:45:27] [INFO ] Invariant cache hit.
[2023-03-13 21:45:28] [INFO ] Dead Transitions using invariants and state equation in 1200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1004/1006 places, 953/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6295 ms. Remains : 1004/1006 places, 953/955 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) (AND p0 (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (LT s3 1) (LT s386 1)), p2:(AND (GEQ s57 1) (GEQ s204 1)), p0:(AND (GEQ s61 1) (GEQ s716 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 418 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-07 finished in 6566 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(F(p0)))'
Support contains 1 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 128 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2023-03-13 21:45:29] [INFO ] Computed 51 place invariants in 8 ms
[2023-03-13 21:45:29] [INFO ] Implicit Places using invariants in 864 ms returned []
[2023-03-13 21:45:29] [INFO ] Invariant cache hit.
[2023-03-13 21:45:34] [INFO ] Implicit Places using invariants and state equation in 4105 ms returned []
Implicit Place search using SMT with State Equation took 4972 ms to find 0 implicit places.
[2023-03-13 21:45:34] [INFO ] Invariant cache hit.
[2023-03-13 21:45:35] [INFO ] Dead Transitions using invariants and state equation in 1381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6485 ms. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s633 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][false, false]]
Product exploration explored 100000 steps with 127 reset in 484 ms.
Product exploration explored 100000 steps with 127 reset in 635 ms.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 798 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=61 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-13 21:45:37] [INFO ] Invariant cache hit.
[2023-03-13 21:45:38] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 242 ms returned sat
[2023-03-13 21:45:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:45:39] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2023-03-13 21:45:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 21:45:40] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 310 ms returned sat
[2023-03-13 21:45:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 21:45:54] [INFO ] [Nat]Absence check using state equation in 13883 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Reduce places removed 45 places and 45 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 427 place count 958 transition count 480
Reduce places removed 427 places and 0 transitions.
Iterating post reduction 1 with 427 rules applied. Total rules applied 854 place count 531 transition count 480
Applied a total of 854 rules in 41 ms. Remains 531 /1003 variables (removed 472) and now considering 480/952 (removed 472) transitions.
// Phase 1: matrix 480 rows 531 cols
[2023-03-13 21:45:54] [INFO ] Computed 51 place invariants in 3 ms
[2023-03-13 21:45:55] [INFO ] Implicit Places using invariants in 804 ms returned []
[2023-03-13 21:45:55] [INFO ] Invariant cache hit.
[2023-03-13 21:45:58] [INFO ] Implicit Places using invariants and state equation in 2759 ms returned []
Implicit Place search using SMT with State Equation took 3567 ms to find 0 implicit places.
[2023-03-13 21:45:58] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 21:45:58] [INFO ] Invariant cache hit.
[2023-03-13 21:45:58] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 531/1003 places, 480/952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4359 ms. Remains : 531/1003 places, 480/952 transitions.
Computed a total of 531 stabilizing places and 480 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 531 transition count 480
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 392 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=98 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-13 21:45:59] [INFO ] Invariant cache hit.
[2023-03-13 21:46:00] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 183 ms returned sat
[2023-03-13 21:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:46:02] [INFO ] [Real]Absence check using state equation in 2273 ms returned sat
[2023-03-13 21:46:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 21:46:03] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 411 ms returned sat
[2023-03-13 21:46:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 21:46:03] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2023-03-13 21:46:03] [INFO ] Computed and/alt/rep : 391/398/391 causal constraints (skipped 0 transitions) in 38 ms.
[2023-03-13 21:46:05] [INFO ] Added : 246 causal constraints over 50 iterations in 1984 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 269 reset in 374 ms.
Product exploration explored 100000 steps with 269 reset in 420 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 480/480 transitions.
Applied a total of 0 rules in 26 ms. Remains 531 /531 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2023-03-13 21:46:06] [INFO ] Invariant cache hit.
[2023-03-13 21:46:07] [INFO ] Implicit Places using invariants in 851 ms returned []
[2023-03-13 21:46:07] [INFO ] Invariant cache hit.
[2023-03-13 21:46:10] [INFO ] Implicit Places using invariants and state equation in 2798 ms returned []
Implicit Place search using SMT with State Equation took 3652 ms to find 0 implicit places.
[2023-03-13 21:46:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 21:46:10] [INFO ] Invariant cache hit.
[2023-03-13 21:46:11] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4492 ms. Remains : 531/531 places, 480/480 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-08 finished in 42245 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)&&F(G(p1)))))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 45 places and 45 transitions.
Drop transitions removed 426 transitions
Trivial Post-agglo rules discarded 426 transitions
Performed 426 trivial Post agglomeration. Transition count delta: 426
Iterating post reduction 0 with 426 rules applied. Total rules applied 426 place count 961 transition count 484
Reduce places removed 426 places and 0 transitions.
Iterating post reduction 1 with 426 rules applied. Total rules applied 852 place count 535 transition count 484
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 854 place count 533 transition count 482
Iterating global reduction 2 with 2 rules applied. Total rules applied 856 place count 533 transition count 482
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 857 place count 533 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 858 place count 532 transition count 481
Applied a total of 858 rules in 63 ms. Remains 532 /1006 variables (removed 474) and now considering 481/955 (removed 474) transitions.
// Phase 1: matrix 481 rows 532 cols
[2023-03-13 21:46:11] [INFO ] Computed 51 place invariants in 4 ms
[2023-03-13 21:46:12] [INFO ] Implicit Places using invariants in 738 ms returned []
[2023-03-13 21:46:12] [INFO ] Invariant cache hit.
[2023-03-13 21:46:14] [INFO ] Implicit Places using invariants and state equation in 2740 ms returned []
Implicit Place search using SMT with State Equation took 3481 ms to find 0 implicit places.
[2023-03-13 21:46:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 21:46:14] [INFO ] Invariant cache hit.
[2023-03-13 21:46:15] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/1006 places, 481/955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4332 ms. Remains : 532/1006 places, 481/955 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s348 1), p1:(GEQ s455 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 526 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-09 finished in 4469 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' '!(((p0 U (p1||X(p2)))||(!p2 U X(!p0))))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 124 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2023-03-13 21:46:15] [INFO ] Computed 51 place invariants in 7 ms
[2023-03-13 21:46:16] [INFO ] Implicit Places using invariants in 966 ms returned []
[2023-03-13 21:46:16] [INFO ] Invariant cache hit.
[2023-03-13 21:46:21] [INFO ] Implicit Places using invariants and state equation in 4334 ms returned []
Implicit Place search using SMT with State Equation took 5301 ms to find 0 implicit places.
[2023-03-13 21:46:21] [INFO ] Invariant cache hit.
[2023-03-13 21:46:22] [INFO ] Dead Transitions using invariants and state equation in 1400 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6828 ms. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 353 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), p0, p0]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p2), acceptance={0} source=8 dest: 9}], [{ cond=p0, acceptance={} source=9 dest: 0}]], initial=2, aps=[p2:(GEQ s951 1), p1:(GEQ s211 1), p0:(GEQ s647 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 943 ms.
Product exploration explored 100000 steps with 50000 reset in 969 ms.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
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 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), true, (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p2))))
Knowledge based reduction with 11 factoid took 178 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-11 finished in 9692 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(G(p0))&&F(p1)))))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 122 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
[2023-03-13 21:46:25] [INFO ] Invariant cache hit.
[2023-03-13 21:46:26] [INFO ] Implicit Places using invariants in 937 ms returned []
[2023-03-13 21:46:26] [INFO ] Invariant cache hit.
[2023-03-13 21:46:30] [INFO ] Implicit Places using invariants and state equation in 4410 ms returned []
Implicit Place search using SMT with State Equation took 5351 ms to find 0 implicit places.
[2023-03-13 21:46:30] [INFO ] Invariant cache hit.
[2023-03-13 21:46:32] [INFO ] Dead Transitions using invariants and state equation in 1315 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6792 ms. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s19 1) (GEQ s757 1)), p0:(GEQ s805 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2597 steps with 2 reset in 11 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-14 finished in 7030 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)))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 123 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
[2023-03-13 21:46:32] [INFO ] Invariant cache hit.
[2023-03-13 21:46:33] [INFO ] Implicit Places using invariants in 910 ms returned []
[2023-03-13 21:46:33] [INFO ] Invariant cache hit.
[2023-03-13 21:46:37] [INFO ] Implicit Places using invariants and state equation in 3941 ms returned []
Implicit Place search using SMT with State Equation took 4853 ms to find 0 implicit places.
[2023-03-13 21:46:37] [INFO ] Invariant cache hit.
[2023-03-13 21:46:38] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6299 ms. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-15 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 (GEQ s7 1) (GEQ s463 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 HirschbergSinclair-PT-45-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-15 finished in 6480 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((G(p1)||p0))))'
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(F(p0)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-45-LTLFireability-08
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 45 places and 45 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 427 place count 961 transition count 483
Reduce places removed 427 places and 0 transitions.
Iterating post reduction 1 with 427 rules applied. Total rules applied 854 place count 534 transition count 483
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 856 place count 532 transition count 481
Iterating global reduction 2 with 2 rules applied. Total rules applied 858 place count 532 transition count 481
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 859 place count 532 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 860 place count 531 transition count 480
Applied a total of 860 rules in 59 ms. Remains 531 /1006 variables (removed 475) and now considering 480/955 (removed 475) transitions.
// Phase 1: matrix 480 rows 531 cols
[2023-03-13 21:46:39] [INFO ] Computed 51 place invariants in 4 ms
[2023-03-13 21:46:39] [INFO ] Implicit Places using invariants in 654 ms returned []
[2023-03-13 21:46:39] [INFO ] Invariant cache hit.
[2023-03-13 21:46:42] [INFO ] Implicit Places using invariants and state equation in 2753 ms returned []
Implicit Place search using SMT with State Equation took 3409 ms to find 0 implicit places.
[2023-03-13 21:46:42] [INFO ] Invariant cache hit.
[2023-03-13 21:46:43] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 531/1006 places, 480/955 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4248 ms. Remains : 531/1006 places, 480/955 transitions.
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s322 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 269 reset in 526 ms.
Product exploration explored 100000 steps with 268 reset in 404 ms.
Computed a total of 531 stabilizing places and 480 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 531 transition count 480
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 399 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=66 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-13 21:46:45] [INFO ] Invariant cache hit.
[2023-03-13 21:46:45] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 181 ms returned sat
[2023-03-13 21:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:46:48] [INFO ] [Real]Absence check using state equation in 2226 ms returned sat
[2023-03-13 21:46:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 21:46:49] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 413 ms returned sat
[2023-03-13 21:46:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 21:46:49] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2023-03-13 21:46:49] [INFO ] Computed and/alt/rep : 391/398/391 causal constraints (skipped 0 transitions) in 33 ms.
[2023-03-13 21:46:51] [INFO ] Added : 246 causal constraints over 50 iterations in 1915 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 480/480 transitions.
Applied a total of 0 rules in 21 ms. Remains 531 /531 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2023-03-13 21:46:51] [INFO ] Invariant cache hit.
[2023-03-13 21:46:52] [INFO ] Implicit Places using invariants in 814 ms returned []
[2023-03-13 21:46:52] [INFO ] Invariant cache hit.
[2023-03-13 21:46:54] [INFO ] Implicit Places using invariants and state equation in 2745 ms returned []
Implicit Place search using SMT with State Equation took 3562 ms to find 0 implicit places.
[2023-03-13 21:46:54] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 21:46:54] [INFO ] Invariant cache hit.
[2023-03-13 21:46:55] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4355 ms. Remains : 531/531 places, 480/480 transitions.
Computed a total of 531 stabilizing places and 480 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 531 transition count 480
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 385 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=96 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-13 21:46:56] [INFO ] Invariant cache hit.
[2023-03-13 21:46:56] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 178 ms returned sat
[2023-03-13 21:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:46:59] [INFO ] [Real]Absence check using state equation in 2216 ms returned sat
[2023-03-13 21:46:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 21:47:00] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 413 ms returned sat
[2023-03-13 21:47:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 21:47:00] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2023-03-13 21:47:00] [INFO ] Computed and/alt/rep : 391/398/391 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-13 21:47:02] [INFO ] Added : 246 causal constraints over 50 iterations in 1823 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 269 reset in 358 ms.
Product exploration explored 100000 steps with 268 reset in 404 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 480/480 transitions.
Applied a total of 0 rules in 21 ms. Remains 531 /531 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2023-03-13 21:47:03] [INFO ] Invariant cache hit.
[2023-03-13 21:47:04] [INFO ] Implicit Places using invariants in 824 ms returned []
[2023-03-13 21:47:04] [INFO ] Invariant cache hit.
[2023-03-13 21:47:06] [INFO ] Implicit Places using invariants and state equation in 2675 ms returned []
Implicit Place search using SMT with State Equation took 3501 ms to find 0 implicit places.
[2023-03-13 21:47:06] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 21:47:06] [INFO ] Invariant cache hit.
[2023-03-13 21:47:07] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4263 ms. Remains : 531/531 places, 480/480 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-08 finished in 28388 ms.
[2023-03-13 21:47:07] [INFO ] Flatten gal took : 58 ms
[2023-03-13 21:47:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-13 21:47:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1006 places, 955 transitions and 2870 arcs took 10 ms.
Total runtime 173751 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1342/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1342/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HirschbergSinclair-PT-45-LTLFireability-00
Could not compute solution for formula : HirschbergSinclair-PT-45-LTLFireability-08

BK_STOP 1678744029717

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name HirschbergSinclair-PT-45-LTLFireability-00
ltl formula formula --ltl=/tmp/1342/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 1006 places, 955 transitions and 2870 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.110 real 0.040 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1342/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1342/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1342/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1342/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name HirschbergSinclair-PT-45-LTLFireability-08
ltl formula formula --ltl=/tmp/1342/ltl_1_
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 1006 places, 955 transitions and 2870 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.130 real 0.020 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1342/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1342/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1342/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1342/ltl_1_
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="LTLFireability"
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 LTLFireability"
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-167840347800492"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;