Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692800660.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CANConstruction-PT-060, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692800660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 22:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 25 22:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 219K Feb 25 22:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 22:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 22:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.4M 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 CANConstruction-PT-060-LTLFireability-00
FORMULA_NAME CANConstruction-PT-060-LTLFireability-01
FORMULA_NAME CANConstruction-PT-060-LTLFireability-02
FORMULA_NAME CANConstruction-PT-060-LTLFireability-03
FORMULA_NAME CANConstruction-PT-060-LTLFireability-04
FORMULA_NAME CANConstruction-PT-060-LTLFireability-05
FORMULA_NAME CANConstruction-PT-060-LTLFireability-06
FORMULA_NAME CANConstruction-PT-060-LTLFireability-07
FORMULA_NAME CANConstruction-PT-060-LTLFireability-08
FORMULA_NAME CANConstruction-PT-060-LTLFireability-09
FORMULA_NAME CANConstruction-PT-060-LTLFireability-10
FORMULA_NAME CANConstruction-PT-060-LTLFireability-11
FORMULA_NAME CANConstruction-PT-060-LTLFireability-12
FORMULA_NAME CANConstruction-PT-060-LTLFireability-13
FORMULA_NAME CANConstruction-PT-060-LTLFireability-14
FORMULA_NAME CANConstruction-PT-060-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678504448849

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-060
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:14:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:14:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:14:10] [INFO ] Load time of PNML (sax parser for PT used): 336 ms
[2023-03-11 03:14:10] [INFO ] Transformed 7922 places.
[2023-03-11 03:14:10] [INFO ] Transformed 14880 transitions.
[2023-03-11 03:14:10] [INFO ] Parsed PT model containing 7922 places and 14880 transitions and 44400 arcs in 474 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 4 formulas.
FORMULA CANConstruction-PT-060-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 7922 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Discarding 3466 places :
Symmetric choice reduction at 0 with 3466 rule applications. Total rules 3466 place count 4456 transition count 7948
Iterating global reduction 0 with 3466 rules applied. Total rules applied 6932 place count 4456 transition count 7948
Applied a total of 6932 rules in 1548 ms. Remains 4456 /7922 variables (removed 3466) and now considering 7948/14880 (removed 6932) transitions.
// Phase 1: matrix 7948 rows 4456 cols
[2023-03-11 03:14:13] [INFO ] Computed 121 place invariants in 161 ms
[2023-03-11 03:14:15] [INFO ] Implicit Places using invariants in 3039 ms returned []
[2023-03-11 03:14:15] [INFO ] Invariant cache hit.
[2023-03-11 03:14:17] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-11 03:14:34] [INFO ] Implicit Places using invariants and state equation in 18339 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698, 712, 726, 740, 754, 768, 782, 796, 810, 824, 838]
Discarding 60 places :
Implicit Place search using SMT with State Equation took 21448 ms to find 60 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4396/7922 places, 7948/14880 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 4336 transition count 7888
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 4336 transition count 7888
Applied a total of 120 rules in 1195 ms. Remains 4336 /4396 variables (removed 60) and now considering 7888/7948 (removed 60) transitions.
// Phase 1: matrix 7888 rows 4336 cols
[2023-03-11 03:14:35] [INFO ] Computed 61 place invariants in 103 ms
[2023-03-11 03:14:37] [INFO ] Implicit Places using invariants in 2272 ms returned []
[2023-03-11 03:14:37] [INFO ] Invariant cache hit.
[2023-03-11 03:14:42] [INFO ] Implicit Places using invariants and state equation in 4401 ms returned []
Implicit Place search using SMT with State Equation took 6676 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4336/7922 places, 7888/14880 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30870 ms. Remains : 4336/7922 places, 7888/14880 transitions.
Support contains 48 out of 4336 places after structural reductions.
[2023-03-11 03:14:42] [INFO ] Flatten gal took : 299 ms
[2023-03-11 03:14:42] [INFO ] Flatten gal took : 236 ms
[2023-03-11 03:14:43] [INFO ] Input system was already deterministic with 7888 transitions.
Support contains 45 out of 4336 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 30) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-11 03:14:44] [INFO ] Invariant cache hit.
[2023-03-11 03:14:45] [INFO ] [Real]Absence check using 61 positive place invariants in 87 ms returned sat
[2023-03-11 03:14:51] [INFO ] After 5131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11 real:1
[2023-03-11 03:14:51] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-11 03:14:56] [INFO ] After 4192ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-11 03:14:56] [INFO ] After 12082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-11 03:14:57] [INFO ] [Nat]Absence check using 61 positive place invariants in 123 ms returned sat
[2023-03-11 03:15:04] [INFO ] After 5451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-11 03:15:08] [INFO ] After 4829ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-11 03:15:15] [INFO ] After 11100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 3911 ms.
[2023-03-11 03:15:19] [INFO ] After 22926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 7 different solutions.
Parikh walk visited 2 properties in 176 ms.
Support contains 12 out of 4336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 407 place count 4336 transition count 7481
Reduce places removed 407 places and 0 transitions.
Iterating post reduction 1 with 407 rules applied. Total rules applied 814 place count 3929 transition count 7481
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 814 place count 3929 transition count 7421
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 934 place count 3869 transition count 7421
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 942 place count 3861 transition count 7405
Iterating global reduction 2 with 8 rules applied. Total rules applied 950 place count 3861 transition count 7405
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 7 rules applied. Total rules applied 957 place count 3861 transition count 7398
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 964 place count 3854 transition count 7398
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 1088 place count 3792 transition count 7336
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 1091 place count 3792 transition count 7333
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1094 place count 3789 transition count 7333
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1095 place count 3789 transition count 7333
Applied a total of 1095 rules in 3243 ms. Remains 3789 /4336 variables (removed 547) and now considering 7333/7888 (removed 555) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3244 ms. Remains : 3789/4336 places, 7333/7888 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 7333 rows 3789 cols
[2023-03-11 03:15:23] [INFO ] Computed 61 place invariants in 147 ms
[2023-03-11 03:15:23] [INFO ] [Real]Absence check using 61 positive place invariants in 76 ms returned sat
[2023-03-11 03:15:25] [INFO ] After 2161ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:15:25] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-11 03:15:26] [INFO ] After 593ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:15:26] [INFO ] After 3305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:15:26] [INFO ] [Nat]Absence check using 61 positive place invariants in 72 ms returned sat
[2023-03-11 03:15:29] [INFO ] After 2446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:15:29] [INFO ] After 650ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:15:30] [INFO ] After 1051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-03-11 03:15:30] [INFO ] After 4308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 3 ms.
FORMULA CANConstruction-PT-060-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 181 stabilizing places and 240 stable transitions
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 U (p1 U p0))||G(!X(X(p1))))) U p1))'
Support contains 3 out of 4336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4323 transition count 7862
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4323 transition count 7862
Applied a total of 26 rules in 981 ms. Remains 4323 /4336 variables (removed 13) and now considering 7862/7888 (removed 26) transitions.
// Phase 1: matrix 7862 rows 4323 cols
[2023-03-11 03:15:32] [INFO ] Computed 61 place invariants in 90 ms
[2023-03-11 03:15:34] [INFO ] Implicit Places using invariants in 2500 ms returned []
[2023-03-11 03:15:34] [INFO ] Invariant cache hit.
[2023-03-11 03:15:35] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-11 03:15:36] [INFO ] Implicit Places using invariants and state equation in 1537 ms returned []
Implicit Place search using SMT with State Equation took 4041 ms to find 0 implicit places.
[2023-03-11 03:15:36] [INFO ] Invariant cache hit.
[2023-03-11 03:15:39] [INFO ] Dead Transitions using invariants and state equation in 3392 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4323/4336 places, 7862/7888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8417 ms. Remains : 4323/4336 places, 7862/7888 transitions.
Stuttering acceptance computed with spot in 268 ms :[p1, true, (AND p1 p0), p0, (NOT p1), false, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s30 1) (GEQ s83 1)), p0:(GEQ s3515 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1759 ms.
Product exploration explored 100000 steps with 33333 reset in 2226 ms.
Computed a total of 181 stabilizing places and 240 stable transitions
Computed a total of 181 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 12 factoid took 332 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-060-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-060-LTLFireability-01 finished in 13173 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(p0))'
Support contains 2 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 4336 transition count 7480
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 1 with 408 rules applied. Total rules applied 816 place count 3928 transition count 7480
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 816 place count 3928 transition count 7420
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 936 place count 3868 transition count 7420
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 950 place count 3854 transition count 7392
Iterating global reduction 2 with 14 rules applied. Total rules applied 964 place count 3854 transition count 7392
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 976 place count 3854 transition count 7380
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 988 place count 3842 transition count 7380
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1106 place count 3783 transition count 7321
Applied a total of 1106 rules in 2084 ms. Remains 3783 /4336 variables (removed 553) and now considering 7321/7888 (removed 567) transitions.
// Phase 1: matrix 7321 rows 3783 cols
[2023-03-11 03:15:46] [INFO ] Computed 61 place invariants in 88 ms
[2023-03-11 03:15:49] [INFO ] Implicit Places using invariants in 3527 ms returned []
[2023-03-11 03:15:49] [INFO ] Invariant cache hit.
[2023-03-11 03:15:51] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 5418 ms to find 0 implicit places.
[2023-03-11 03:15:52] [INFO ] Redundant transitions in 830 ms returned []
[2023-03-11 03:15:52] [INFO ] Invariant cache hit.
[2023-03-11 03:15:56] [INFO ] Dead Transitions using invariants and state equation in 3542 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3783/4336 places, 7321/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11880 ms. Remains : 3783/4336 places, 7321/7888 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s76 1) (GEQ s2627 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 445 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-060-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-02 finished in 11965 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(p1))||p0) U p2))'
Support contains 5 out of 4336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 4325 transition count 7866
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 4325 transition count 7866
Applied a total of 22 rules in 1191 ms. Remains 4325 /4336 variables (removed 11) and now considering 7866/7888 (removed 22) transitions.
// Phase 1: matrix 7866 rows 4325 cols
[2023-03-11 03:15:57] [INFO ] Computed 61 place invariants in 107 ms
[2023-03-11 03:15:59] [INFO ] Implicit Places using invariants in 2491 ms returned []
[2023-03-11 03:15:59] [INFO ] Invariant cache hit.
[2023-03-11 03:16:04] [INFO ] Implicit Places using invariants and state equation in 4136 ms returned []
Implicit Place search using SMT with State Equation took 6631 ms to find 0 implicit places.
[2023-03-11 03:16:04] [INFO ] Invariant cache hit.
[2023-03-11 03:16:08] [INFO ] Dead Transitions using invariants and state equation in 4008 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4325/4336 places, 7866/7888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11832 ms. Remains : 4325/4336 places, 7866/7888 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (GEQ s875 1) (GEQ s1795 1)), p0:(OR (GEQ s1873 1) (AND (GEQ s527 1) (GEQ s558 1))), p1:(GEQ s875 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-060-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-03 finished in 11929 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(p0)||G(p1))))'
Support contains 4 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 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 406 place count 4336 transition count 7482
Reduce places removed 406 places and 0 transitions.
Iterating post reduction 1 with 406 rules applied. Total rules applied 812 place count 3930 transition count 7482
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 812 place count 3930 transition count 7422
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 932 place count 3870 transition count 7422
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 946 place count 3856 transition count 7394
Iterating global reduction 2 with 14 rules applied. Total rules applied 960 place count 3856 transition count 7394
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 972 place count 3856 transition count 7382
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 984 place count 3844 transition count 7382
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1100 place count 3786 transition count 7324
Applied a total of 1100 rules in 1876 ms. Remains 3786 /4336 variables (removed 550) and now considering 7324/7888 (removed 564) transitions.
// Phase 1: matrix 7324 rows 3786 cols
[2023-03-11 03:16:10] [INFO ] Computed 61 place invariants in 129 ms
[2023-03-11 03:16:12] [INFO ] Implicit Places using invariants in 2372 ms returned []
[2023-03-11 03:16:12] [INFO ] Invariant cache hit.
[2023-03-11 03:16:14] [INFO ] Implicit Places using invariants and state equation in 2443 ms returned []
Implicit Place search using SMT with State Equation took 4827 ms to find 0 implicit places.
[2023-03-11 03:16:15] [INFO ] Redundant transitions in 680 ms returned []
[2023-03-11 03:16:15] [INFO ] Invariant cache hit.
[2023-03-11 03:16:19] [INFO ] Dead Transitions using invariants and state equation in 3391 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3786/4336 places, 7324/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10791 ms. Remains : 3786/4336 places, 7324/7888 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s15 1)), p1:(OR (LT s90 1) (LT s143 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 238 reset in 1549 ms.
Stack based approach found an accepted trace after 6381 steps with 14 reset with depth 427 and stack size 425 in 160 ms.
FORMULA CANConstruction-PT-060-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-04 finished in 12573 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||X(G((p1&&F(p2)))))))'
Support contains 4 out of 4336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4324 transition count 7864
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4324 transition count 7864
Applied a total of 24 rules in 1396 ms. Remains 4324 /4336 variables (removed 12) and now considering 7864/7888 (removed 24) transitions.
// Phase 1: matrix 7864 rows 4324 cols
[2023-03-11 03:16:22] [INFO ] Computed 61 place invariants in 95 ms
[2023-03-11 03:16:26] [INFO ] Implicit Places using invariants in 4478 ms returned []
[2023-03-11 03:16:26] [INFO ] Invariant cache hit.
[2023-03-11 03:16:31] [INFO ] Implicit Places using invariants and state equation in 4365 ms returned []
Implicit Place search using SMT with State Equation took 8846 ms to find 0 implicit places.
[2023-03-11 03:16:31] [INFO ] Invariant cache hit.
[2023-03-11 03:16:34] [INFO ] Dead Transitions using invariants and state equation in 3811 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4324/4336 places, 7864/7888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14054 ms. Remains : 4324/4336 places, 7864/7888 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s1228 1), p1:(OR (LT s35 1) (LT s114 1)), p2:(LT s2137 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3065 ms.
Product exploration explored 100000 steps with 50000 reset in 2678 ms.
Computed a total of 181 stabilizing places and 240 stable transitions
Computed a total of 181 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-060-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-060-LTLFireability-06 finished in 20073 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(p0))'
Support contains 1 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 4336 transition count 7480
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 1 with 408 rules applied. Total rules applied 816 place count 3928 transition count 7480
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 816 place count 3928 transition count 7420
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 936 place count 3868 transition count 7420
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 949 place count 3855 transition count 7394
Iterating global reduction 2 with 13 rules applied. Total rules applied 962 place count 3855 transition count 7394
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 973 place count 3855 transition count 7383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 984 place count 3844 transition count 7383
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 1106 place count 3783 transition count 7322
Applied a total of 1106 rules in 1561 ms. Remains 3783 /4336 variables (removed 553) and now considering 7322/7888 (removed 566) transitions.
// Phase 1: matrix 7322 rows 3783 cols
[2023-03-11 03:16:42] [INFO ] Computed 61 place invariants in 124 ms
[2023-03-11 03:16:44] [INFO ] Implicit Places using invariants in 2226 ms returned []
[2023-03-11 03:16:44] [INFO ] Invariant cache hit.
[2023-03-11 03:16:48] [INFO ] Implicit Places using invariants and state equation in 3744 ms returned []
Implicit Place search using SMT with State Equation took 5975 ms to find 0 implicit places.
[2023-03-11 03:16:48] [INFO ] Redundant transitions in 452 ms returned []
[2023-03-11 03:16:48] [INFO ] Invariant cache hit.
[2023-03-11 03:16:51] [INFO ] Dead Transitions using invariants and state equation in 3116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3783/4336 places, 7322/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11110 ms. Remains : 3783/4336 places, 7322/7888 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3493 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 420 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-060-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-07 finished in 11177 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((p1||(p2&&G(p3))))||p0)))'
Support contains 6 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 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 406 place count 4336 transition count 7482
Reduce places removed 406 places and 0 transitions.
Iterating post reduction 1 with 406 rules applied. Total rules applied 812 place count 3930 transition count 7482
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 812 place count 3930 transition count 7422
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 932 place count 3870 transition count 7422
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 944 place count 3858 transition count 7398
Iterating global reduction 2 with 12 rules applied. Total rules applied 956 place count 3858 transition count 7398
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 966 place count 3858 transition count 7388
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 976 place count 3848 transition count 7388
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 1096 place count 3788 transition count 7328
Applied a total of 1096 rules in 1483 ms. Remains 3788 /4336 variables (removed 548) and now considering 7328/7888 (removed 560) transitions.
// Phase 1: matrix 7328 rows 3788 cols
[2023-03-11 03:16:53] [INFO ] Computed 61 place invariants in 125 ms
[2023-03-11 03:16:55] [INFO ] Implicit Places using invariants in 2212 ms returned []
[2023-03-11 03:16:55] [INFO ] Invariant cache hit.
[2023-03-11 03:16:56] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-11 03:17:13] [INFO ] Implicit Places using invariants and state equation in 17851 ms returned []
Implicit Place search using SMT with State Equation took 20065 ms to find 0 implicit places.
[2023-03-11 03:17:14] [INFO ] Redundant transitions in 443 ms returned []
[2023-03-11 03:17:14] [INFO ] Invariant cache hit.
[2023-03-11 03:17:16] [INFO ] Dead Transitions using invariants and state equation in 2928 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3788/4336 places, 7328/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24931 ms. Remains : 3788/4336 places, 7328/7888 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s20 1) (LT s81 1)), p1:(GEQ s1626 1), p2:(GEQ s1374 1), p3:(OR (LT s60 1) (LT s88 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 1312 steps with 2 reset in 13 ms.
FORMULA CANConstruction-PT-060-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-08 finished in 25045 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((G((p0||F(p1)))||F(p2))))'
Support contains 5 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 407 place count 4336 transition count 7481
Reduce places removed 407 places and 0 transitions.
Iterating post reduction 1 with 407 rules applied. Total rules applied 814 place count 3929 transition count 7481
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 814 place count 3929 transition count 7421
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 934 place count 3869 transition count 7421
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 947 place count 3856 transition count 7395
Iterating global reduction 2 with 13 rules applied. Total rules applied 960 place count 3856 transition count 7395
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 971 place count 3856 transition count 7384
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 982 place count 3845 transition count 7384
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1100 place count 3786 transition count 7325
Applied a total of 1100 rules in 1815 ms. Remains 3786 /4336 variables (removed 550) and now considering 7325/7888 (removed 563) transitions.
// Phase 1: matrix 7325 rows 3786 cols
[2023-03-11 03:17:19] [INFO ] Computed 61 place invariants in 123 ms
[2023-03-11 03:17:21] [INFO ] Implicit Places using invariants in 2241 ms returned []
[2023-03-11 03:17:21] [INFO ] Invariant cache hit.
[2023-03-11 03:17:22] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-11 03:17:22] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 3574 ms to find 0 implicit places.
[2023-03-11 03:17:23] [INFO ] Redundant transitions in 526 ms returned []
[2023-03-11 03:17:23] [INFO ] Invariant cache hit.
[2023-03-11 03:17:25] [INFO ] Dead Transitions using invariants and state equation in 2981 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3786/4336 places, 7325/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8906 ms. Remains : 3786/4336 places, 7325/7888 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s120 1) (GEQ s2288 1)), p1:(AND (GEQ s13 1) (GEQ s36 1)), p2:(GEQ s2404 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 387 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-060-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-09 finished in 8981 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(((F(p0) U !p1)&&(p0||(F(p2) U p3)))))'
Support contains 7 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 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 406 place count 4336 transition count 7482
Reduce places removed 406 places and 0 transitions.
Iterating post reduction 1 with 406 rules applied. Total rules applied 812 place count 3930 transition count 7482
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 812 place count 3930 transition count 7422
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 932 place count 3870 transition count 7422
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 945 place count 3857 transition count 7396
Iterating global reduction 2 with 13 rules applied. Total rules applied 958 place count 3857 transition count 7396
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 969 place count 3857 transition count 7385
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 980 place count 3846 transition count 7385
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1096 place count 3788 transition count 7327
Applied a total of 1096 rules in 1493 ms. Remains 3788 /4336 variables (removed 548) and now considering 7327/7888 (removed 561) transitions.
// Phase 1: matrix 7327 rows 3788 cols
[2023-03-11 03:17:27] [INFO ] Computed 61 place invariants in 94 ms
[2023-03-11 03:17:29] [INFO ] Implicit Places using invariants in 2191 ms returned []
[2023-03-11 03:17:29] [INFO ] Invariant cache hit.
[2023-03-11 03:17:33] [INFO ] Implicit Places using invariants and state equation in 3695 ms returned []
Implicit Place search using SMT with State Equation took 5888 ms to find 0 implicit places.
[2023-03-11 03:17:33] [INFO ] Redundant transitions in 454 ms returned []
[2023-03-11 03:17:33] [INFO ] Invariant cache hit.
[2023-03-11 03:17:36] [INFO ] Dead Transitions using invariants and state equation in 3058 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3788/4336 places, 7327/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10900 ms. Remains : 3788/4336 places, 7327/7888 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR p1 (AND (NOT p0) (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), p1, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p1 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GEQ s2241 1), p3:(AND (GEQ s17 1) (GEQ s68 1)), p2:(AND (GEQ s21 1) (GEQ s132 1)), p1:(AND (GEQ s7 1) (GEQ s543 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 33300 reset in 2097 ms.
Product exploration explored 100000 steps with 33362 reset in 2270 ms.
Computed a total of 61 stabilizing places and 120 stable transitions
Computed a total of 61 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p1 p0 (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (OR (AND p1 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 1714 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter insensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-11 03:17:44] [INFO ] Invariant cache hit.
[2023-03-11 03:17:45] [INFO ] [Real]Absence check using 61 positive place invariants in 51 ms returned sat
[2023-03-11 03:17:45] [INFO ] After 751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 03:17:45] [INFO ] [Nat]Absence check using 61 positive place invariants in 65 ms returned sat
[2023-03-11 03:17:50] [INFO ] After 4182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-11 03:17:50] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-11 03:17:54] [INFO ] After 3603ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-11 03:17:59] [INFO ] After 8413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 3238 ms.
[2023-03-11 03:18:02] [INFO ] After 16965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 7 out of 3788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3788/3788 places, 7327/7327 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 3788 transition count 7324
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 3785 transition count 7324
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 3785 transition count 7324
Applied a total of 8 rules in 1746 ms. Remains 3785 /3788 variables (removed 3) and now considering 7324/7327 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1746 ms. Remains : 3785/3788 places, 7324/7327 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7324 rows 3785 cols
[2023-03-11 03:18:04] [INFO ] Computed 61 place invariants in 64 ms
[2023-03-11 03:18:05] [INFO ] [Real]Absence check using 61 positive place invariants in 115 ms returned sat
[2023-03-11 03:18:05] [INFO ] After 1000ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:18:06] [INFO ] [Nat]Absence check using 61 positive place invariants in 68 ms returned sat
[2023-03-11 03:18:09] [INFO ] After 3037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:18:09] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-11 03:18:11] [INFO ] After 2051ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 03:18:13] [INFO ] After 3843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1284 ms.
[2023-03-11 03:18:14] [INFO ] After 9173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 4 properties in 7 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p1 p0 (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (OR (AND p1 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p3) (NOT p0) p1 (NOT p2))), (F (AND (NOT p3) p0 p1 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0)))), (F (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p3) (NOT p0) p1)), (F (AND (NOT p3) p0 p1)), (F (AND p3 (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F (AND p3 p1 (NOT p2))), (F (AND (NOT p3) p1)), (F (AND (NOT p3) p1 (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 2153 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 455 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 471 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
// Phase 1: matrix 7327 rows 3788 cols
[2023-03-11 03:18:18] [INFO ] Computed 61 place invariants in 125 ms
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 7 out of 3788 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3788/3788 places, 7327/7327 transitions.
Applied a total of 0 rules in 449 ms. Remains 3788 /3788 variables (removed 0) and now considering 7327/7327 (removed 0) transitions.
[2023-03-11 03:18:33] [INFO ] Invariant cache hit.
[2023-03-11 03:18:36] [INFO ] Implicit Places using invariants in 2424 ms returned []
[2023-03-11 03:18:36] [INFO ] Invariant cache hit.
[2023-03-11 03:18:38] [INFO ] Implicit Places using invariants and state equation in 2262 ms returned []
Implicit Place search using SMT with State Equation took 4689 ms to find 0 implicit places.
[2023-03-11 03:18:38] [INFO ] Invariant cache hit.
[2023-03-11 03:18:41] [INFO ] Dead Transitions using invariants and state equation in 3624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8764 ms. Remains : 3788/3788 places, 7327/7327 transitions.
Computed a total of 61 stabilizing places and 120 stable transitions
Computed a total of 61 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) p0 p1))), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0) p1 (NOT p2)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1165 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 03:18:44] [INFO ] Invariant cache hit.
[2023-03-11 03:18:44] [INFO ] [Real]Absence check using 61 positive place invariants in 79 ms returned sat
[2023-03-11 03:18:44] [INFO ] After 808ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:18:45] [INFO ] [Nat]Absence check using 61 positive place invariants in 60 ms returned sat
[2023-03-11 03:18:48] [INFO ] After 3065ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:18:48] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-11 03:18:51] [INFO ] After 2274ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 03:18:53] [INFO ] After 4233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1341 ms.
[2023-03-11 03:18:54] [INFO ] After 9548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 84 steps, including 1 resets, run visited all 4 properties in 5 ms. (steps per millisecond=16 )
Parikh walk visited 4 properties in 5 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) p0 p1))), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0) p1 (NOT p2)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0) (NOT p3))), (F (AND p1 (NOT p2) p0 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (AND p1 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) (NOT p3))))), (F (AND p1 (NOT p0) (NOT p3))), (F (AND p1 p0 (NOT p3))), (F (AND p1 (NOT p2) (NOT p0) p3)), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (AND p1 (NOT p2) p3)), (F (AND p1 (NOT p3))), (F (AND p1 (NOT p2) (NOT p3)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1362 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 450 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 372 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
[2023-03-11 03:18:56] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 468 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 33298 reset in 2116 ms.
Product exploration explored 100000 steps with 33414 reset in 1912 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 367 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 7 out of 3788 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3788/3788 places, 7327/7327 transitions.
Applied a total of 0 rules in 933 ms. Remains 3788 /3788 variables (removed 0) and now considering 7327/7327 (removed 0) transitions.
[2023-03-11 03:19:18] [INFO ] Redundant transitions in 415 ms returned []
[2023-03-11 03:19:18] [INFO ] Invariant cache hit.
[2023-03-11 03:19:21] [INFO ] Dead Transitions using invariants and state equation in 3510 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4868 ms. Remains : 3788/3788 places, 7327/7327 transitions.
Support contains 7 out of 3788 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3788/3788 places, 7327/7327 transitions.
Applied a total of 0 rules in 286 ms. Remains 3788 /3788 variables (removed 0) and now considering 7327/7327 (removed 0) transitions.
[2023-03-11 03:19:21] [INFO ] Invariant cache hit.
[2023-03-11 03:19:23] [INFO ] Implicit Places using invariants in 2077 ms returned []
[2023-03-11 03:19:23] [INFO ] Invariant cache hit.
[2023-03-11 03:19:24] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-11 03:19:43] [INFO ] Implicit Places using invariants and state equation in 19459 ms returned []
Implicit Place search using SMT with State Equation took 21539 ms to find 0 implicit places.
[2023-03-11 03:19:43] [INFO ] Invariant cache hit.
[2023-03-11 03:19:46] [INFO ] Dead Transitions using invariants and state equation in 3488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25314 ms. Remains : 3788/3788 places, 7327/7327 transitions.
Treatment of property CANConstruction-PT-060-LTLFireability-10 finished in 141296 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(p0)))'
Support contains 2 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 407 place count 4336 transition count 7481
Reduce places removed 407 places and 0 transitions.
Iterating post reduction 1 with 407 rules applied. Total rules applied 814 place count 3929 transition count 7481
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 814 place count 3929 transition count 7421
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 934 place count 3869 transition count 7421
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 948 place count 3855 transition count 7393
Iterating global reduction 2 with 14 rules applied. Total rules applied 962 place count 3855 transition count 7393
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 974 place count 3855 transition count 7381
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 986 place count 3843 transition count 7381
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1104 place count 3784 transition count 7322
Applied a total of 1104 rules in 1557 ms. Remains 3784 /4336 variables (removed 552) and now considering 7322/7888 (removed 566) transitions.
// Phase 1: matrix 7322 rows 3784 cols
[2023-03-11 03:19:49] [INFO ] Computed 61 place invariants in 114 ms
[2023-03-11 03:19:51] [INFO ] Implicit Places using invariants in 2292 ms returned []
[2023-03-11 03:19:51] [INFO ] Invariant cache hit.
[2023-03-11 03:19:52] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-11 03:19:52] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 3676 ms to find 0 implicit places.
[2023-03-11 03:19:53] [INFO ] Redundant transitions in 622 ms returned []
[2023-03-11 03:19:53] [INFO ] Invariant cache hit.
[2023-03-11 03:19:56] [INFO ] Dead Transitions using invariants and state equation in 3623 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3784/4336 places, 7322/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9484 ms. Remains : 3784/4336 places, 7322/7888 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s55 1) (LT s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 240 reset in 1133 ms.
Stack based approach found an accepted trace after 6176 steps with 14 reset with depth 384 and stack size 382 in 70 ms.
FORMULA CANConstruction-PT-060-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-13 finished in 10766 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 U p1)||F(((p3 U (p4||G(p3)))&&p2)))))'
Support contains 6 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 407 place count 4336 transition count 7481
Reduce places removed 407 places and 0 transitions.
Iterating post reduction 1 with 407 rules applied. Total rules applied 814 place count 3929 transition count 7481
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 814 place count 3929 transition count 7421
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 934 place count 3869 transition count 7421
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 946 place count 3857 transition count 7397
Iterating global reduction 2 with 12 rules applied. Total rules applied 958 place count 3857 transition count 7397
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 968 place count 3857 transition count 7387
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 978 place count 3847 transition count 7387
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 1098 place count 3787 transition count 7327
Applied a total of 1098 rules in 1565 ms. Remains 3787 /4336 variables (removed 549) and now considering 7327/7888 (removed 561) transitions.
// Phase 1: matrix 7327 rows 3787 cols
[2023-03-11 03:19:59] [INFO ] Computed 61 place invariants in 128 ms
[2023-03-11 03:20:02] [INFO ] Implicit Places using invariants in 2690 ms returned []
[2023-03-11 03:20:02] [INFO ] Invariant cache hit.
[2023-03-11 03:20:07] [INFO ] Implicit Places using invariants and state equation in 5039 ms returned []
Implicit Place search using SMT with State Equation took 7732 ms to find 0 implicit places.
[2023-03-11 03:20:07] [INFO ] Redundant transitions in 446 ms returned []
[2023-03-11 03:20:07] [INFO ] Invariant cache hit.
[2023-03-11 03:20:11] [INFO ] Dead Transitions using invariants and state equation in 3527 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3787/4336 places, 7327/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13284 ms. Remains : 3787/4336 places, 7327/7888 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p4) p3), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p4) p3), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s2070 1), p0:(AND (GEQ s92 1) (GEQ s128 1)), p2:(AND (OR (LT s144 1) (LT s3715 1)) (LT s1975 1)), p4:(AND (GEQ s144 1) (GEQ s3715 1) (LT s1975 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 237 reset in 1147 ms.
Stack based approach found an accepted trace after 96909 steps with 236 reset with depth 262 and stack size 262 in 1217 ms.
FORMULA CANConstruction-PT-060-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-15 finished in 15952 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(((F(p0) U !p1)&&(p0||(F(p2) U p3)))))'
[2023-03-11 03:20:14] [INFO ] Flatten gal took : 188 ms
[2023-03-11 03:20:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 03:20:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4336 places, 7888 transitions and 30176 arcs took 45 ms.
Total runtime 364040 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANConstruction-PT-060
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA CANConstruction-PT-060-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678504818939

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 CANConstruction-PT-060-LTLFireability-10
lola: time limit : 3596 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CANConstruction-PT-060-LTLFireability-10
lola: result : false
lola: markings : 66
lola: fired transitions : 66
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-060-LTLFireability-10: LTL false LTL model checker


Time elapsed: 4 secs. Pages in use: 1

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="CANConstruction-PT-060"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CANConstruction-PT-060, 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 r039-tajo-167813692800660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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