fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r105-tall-167814481300491
Last Updated
May 14, 2023

About the Execution of LTSMin+red for DES-PT-60a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
510.111 135780.00 164757.00 801.80 TF?FFFFFFFF?TFTF normal

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.r105-tall-167814481300491.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 DES-PT-60a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481300491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 110K 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 DES-PT-60a-LTLCardinality-00
FORMULA_NAME DES-PT-60a-LTLCardinality-01
FORMULA_NAME DES-PT-60a-LTLCardinality-02
FORMULA_NAME DES-PT-60a-LTLCardinality-03
FORMULA_NAME DES-PT-60a-LTLCardinality-04
FORMULA_NAME DES-PT-60a-LTLCardinality-05
FORMULA_NAME DES-PT-60a-LTLCardinality-06
FORMULA_NAME DES-PT-60a-LTLCardinality-07
FORMULA_NAME DES-PT-60a-LTLCardinality-08
FORMULA_NAME DES-PT-60a-LTLCardinality-09
FORMULA_NAME DES-PT-60a-LTLCardinality-10
FORMULA_NAME DES-PT-60a-LTLCardinality-11
FORMULA_NAME DES-PT-60a-LTLCardinality-12
FORMULA_NAME DES-PT-60a-LTLCardinality-13
FORMULA_NAME DES-PT-60a-LTLCardinality-14
FORMULA_NAME DES-PT-60a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678311975483

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 21:46:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 21:46:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:46:17] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-08 21:46:17] [INFO ] Transformed 354 places.
[2023-03-08 21:46:17] [INFO ] Transformed 311 transitions.
[2023-03-08 21:46:17] [INFO ] Found NUPN structural information;
[2023-03-08 21:46:17] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-60a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 353 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 353 transition count 296
Applied a total of 2 rules in 68 ms. Remains 353 /354 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 353 cols
[2023-03-08 21:46:17] [INFO ] Computed 59 place invariants in 34 ms
[2023-03-08 21:46:18] [INFO ] Implicit Places using invariants in 409 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 443 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 352/354 places, 296/297 transitions.
Applied a total of 0 rules in 15 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 526 ms. Remains : 352/354 places, 296/297 transitions.
Support contains 23 out of 352 places after structural reductions.
[2023-03-08 21:46:18] [INFO ] Flatten gal took : 66 ms
[2023-03-08 21:46:18] [INFO ] Flatten gal took : 30 ms
[2023-03-08 21:46:18] [INFO ] Input system was already deterministic with 296 transitions.
Incomplete random walk after 10000 steps, including 232 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 14) seen :9
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 21:46:19] [INFO ] Computed 58 place invariants in 21 ms
[2023-03-08 21:46:19] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 21:46:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 21:46:19] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 72 ms returned sat
[2023-03-08 21:46:19] [INFO ] After 464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 21:46:20] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 4 ms to minimize.
[2023-03-08 21:46:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-08 21:46:20] [INFO ] After 872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-08 21:46:20] [INFO ] After 1352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 4 properties in 149 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 351 transition count 293
Applied a total of 9 rules in 58 ms. Remains 351 /352 variables (removed 1) and now considering 293/296 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 351/352 places, 293/296 transitions.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1483698 steps, run timeout after 3001 ms. (steps per millisecond=494 ) properties seen :{}
Probabilistic random walk after 1483698 steps, saw 207015 distinct states, run finished after 3003 ms. (steps per millisecond=494 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 21:46:23] [INFO ] Computed 60 place invariants in 19 ms
[2023-03-08 21:46:23] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 21:46:23] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 21:46:23] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:46:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 21:46:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 129 ms returned sat
[2023-03-08 21:46:24] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:46:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:46:24] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 21:46:24] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2023-03-08 21:46:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-08 21:46:24] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 21:46:24] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 27 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 21:46:24] [INFO ] Invariant cache hit.
[2023-03-08 21:46:24] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-08 21:46:24] [INFO ] Invariant cache hit.
[2023-03-08 21:46:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:46:25] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2023-03-08 21:46:25] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-08 21:46:25] [INFO ] Invariant cache hit.
[2023-03-08 21:46:25] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 939 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 26 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 21:46:25] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-08 21:46:25] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 21:46:25] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 21:46:25] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:46:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 21:46:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 128 ms returned sat
[2023-03-08 21:46:26] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:46:26] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2023-03-08 21:46:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-08 21:46:26] [INFO ] After 348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 21:46:26] [INFO ] After 564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 255 stabilizing places and 250 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((G(F(p0))||G((p1||G(p2))))))'
Support contains 7 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 21:46:26] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 21:46:26] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-08 21:46:26] [INFO ] Invariant cache hit.
[2023-03-08 21:46:27] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2023-03-08 21:46:27] [INFO ] Invariant cache hit.
[2023-03-08 21:46:27] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 787 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-60a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s268 0) (EQ s280 1)), p0:(EQ s308 1), p2:(OR (AND (EQ s263 0) (EQ s10 1)) (AND (EQ s245 0) (EQ s26 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 2382 reset in 337 ms.
Product exploration explored 100000 steps with 2397 reset in 277 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 603 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 11 factoid took 669 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
[2023-03-08 21:46:29] [INFO ] Invariant cache hit.
[2023-03-08 21:46:30] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 21:46:30] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 30 ms returned sat
[2023-03-08 21:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:46:40] [INFO ] [Real]Absence check using state equation in 10629 ms returned sat
[2023-03-08 21:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:46:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-08 21:46:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 117 ms returned sat
[2023-03-08 21:46:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:46:43] [INFO ] [Nat]Absence check using state equation in 1996 ms returned sat
[2023-03-08 21:46:43] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-08 21:46:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-08 21:46:43] [INFO ] Computed and/alt/rep : 288/864/288 causal constraints (skipped 7 transitions) in 21 ms.
[2023-03-08 21:46:45] [INFO ] Added : 164 causal constraints over 33 iterations in 2078 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 22 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 21:46:45] [INFO ] Invariant cache hit.
[2023-03-08 21:46:45] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-08 21:46:45] [INFO ] Invariant cache hit.
[2023-03-08 21:46:45] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2023-03-08 21:46:45] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-08 21:46:45] [INFO ] Invariant cache hit.
[2023-03-08 21:46:46] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 867 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
[2023-03-08 21:46:46] [INFO ] Invariant cache hit.
[2023-03-08 21:46:46] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 21:46:46] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 32 ms returned sat
[2023-03-08 21:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:46:57] [INFO ] [Real]Absence check using state equation in 10412 ms returned sat
[2023-03-08 21:46:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:46:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 21:46:57] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 119 ms returned sat
[2023-03-08 21:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:46:59] [INFO ] [Nat]Absence check using state equation in 1989 ms returned sat
[2023-03-08 21:46:59] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-08 21:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-08 21:46:59] [INFO ] Computed and/alt/rep : 288/864/288 causal constraints (skipped 7 transitions) in 22 ms.
[2023-03-08 21:47:01] [INFO ] Added : 164 causal constraints over 33 iterations in 1999 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4625 reset in 296 ms.
Product exploration explored 100000 steps with 4643 reset in 316 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 21:47:02] [INFO ] Invariant cache hit.
[2023-03-08 21:47:02] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-08 21:47:02] [INFO ] Invariant cache hit.
[2023-03-08 21:47:03] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2023-03-08 21:47:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 21:47:03] [INFO ] Invariant cache hit.
[2023-03-08 21:47:03] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 976 ms. Remains : 352/352 places, 296/296 transitions.
Treatment of property DES-PT-60a-LTLCardinality-02 finished in 36974 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))||p0) U X(p2)))'
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 21:47:03] [INFO ] Invariant cache hit.
[2023-03-08 21:47:03] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-08 21:47:03] [INFO ] Invariant cache hit.
[2023-03-08 21:47:04] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2023-03-08 21:47:04] [INFO ] Invariant cache hit.
[2023-03-08 21:47:04] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 908 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s310 0) (EQ s34 1) (EQ s239 0) (EQ s136 1) (EQ s237 1)), p2:(EQ s291 1), p1:(EQ s237 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-03 finished in 1209 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 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 20 ms. Remains 351 /352 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 351 cols
[2023-03-08 21:47:04] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 21:47:04] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-08 21:47:04] [INFO ] Invariant cache hit.
[2023-03-08 21:47:05] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2023-03-08 21:47:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:47:05] [INFO ] Invariant cache hit.
[2023-03-08 21:47:05] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 849 ms. Remains : 351/352 places, 295/296 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-04 finished in 906 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)&&F(p1))))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 21:47:05] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 21:47:05] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-08 21:47:05] [INFO ] Invariant cache hit.
[2023-03-08 21:47:06] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2023-03-08 21:47:06] [INFO ] Invariant cache hit.
[2023-03-08 21:47:06] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 794 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-60a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s251 0) (EQ s87 1)), p1:(OR (EQ s343 0) (EQ s5 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-07 finished in 935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 21:47:06] [INFO ] Invariant cache hit.
[2023-03-08 21:47:06] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-08 21:47:06] [INFO ] Invariant cache hit.
[2023-03-08 21:47:07] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2023-03-08 21:47:07] [INFO ] Invariant cache hit.
[2023-03-08 21:47:07] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 766 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s203 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-08 finished in 895 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 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 21:47:07] [INFO ] Invariant cache hit.
[2023-03-08 21:47:07] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-08 21:47:07] [INFO ] Invariant cache hit.
[2023-03-08 21:47:08] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-08 21:47:08] [INFO ] Invariant cache hit.
[2023-03-08 21:47:08] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 785 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s278 0) (NEQ s251 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]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-09 finished in 874 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(X(G(p0)))))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 21:47:08] [INFO ] Invariant cache hit.
[2023-03-08 21:47:08] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-08 21:47:08] [INFO ] Invariant cache hit.
[2023-03-08 21:47:08] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2023-03-08 21:47:08] [INFO ] Invariant cache hit.
[2023-03-08 21:47:09] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s191 0) (EQ s245 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-10 finished in 970 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 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 8 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 21:47:09] [INFO ] Invariant cache hit.
[2023-03-08 21:47:09] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-08 21:47:09] [INFO ] Invariant cache hit.
[2023-03-08 21:47:09] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2023-03-08 21:47:09] [INFO ] Invariant cache hit.
[2023-03-08 21:47:10] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 786 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-11 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:(EQ s73 0)], 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]]
Product exploration explored 100000 steps with 2218 reset in 269 ms.
Product exploration explored 100000 steps with 2223 reset in 255 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1340845 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1340845 steps, saw 188985 distinct states, run finished after 3003 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 21:47:14] [INFO ] Invariant cache hit.
[2023-03-08 21:47:14] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:47:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 21:47:14] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 28 ms returned sat
[2023-03-08 21:47:14] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:47:14] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 21:47:14] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 351 transition count 293
Applied a total of 9 rules in 34 ms. Remains 351 /352 variables (removed 1) and now considering 293/296 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 351/352 places, 293/296 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1293058 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :{}
Probabilistic random walk after 1293058 steps, saw 179946 distinct states, run finished after 3001 ms. (steps per millisecond=430 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 21:47:17] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 21:47:17] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:47:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 21:47:18] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 131 ms returned sat
[2023-03-08 21:47:18] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:47:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:47:18] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 21:47:18] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 21:47:18] [INFO ] After 536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2381 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=396 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 16 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 21:47:18] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-08 21:47:18] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-08 21:47:18] [INFO ] Invariant cache hit.
[2023-03-08 21:47:19] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2023-03-08 21:47:19] [INFO ] Invariant cache hit.
[2023-03-08 21:47:19] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 798 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1392567 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :{}
Probabilistic random walk after 1392567 steps, saw 195185 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 21:47:22] [INFO ] Invariant cache hit.
[2023-03-08 21:47:22] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:47:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 21:47:23] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 27 ms returned sat
[2023-03-08 21:47:23] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:47:23] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 21:47:23] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 351 transition count 293
Applied a total of 9 rules in 33 ms. Remains 351 /352 variables (removed 1) and now considering 293/296 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 351/352 places, 293/296 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1369119 steps, run timeout after 3001 ms. (steps per millisecond=456 ) properties seen :{}
Probabilistic random walk after 1369119 steps, saw 191481 distinct states, run finished after 3001 ms. (steps per millisecond=456 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 21:47:26] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 21:47:26] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:47:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 21:47:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 131 ms returned sat
[2023-03-08 21:47:27] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:47:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:47:27] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 21:47:27] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 21:47:27] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2387 steps, including 2 resets, run visited all 1 properties in 10 ms. (steps per millisecond=238 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2249 reset in 220 ms.
Product exploration explored 100000 steps with 2208 reset in 238 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 21:47:28] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 21:47:28] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 21:47:28] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 258 ms. Remains : 352/352 places, 296/296 transitions.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 8 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 21:47:28] [INFO ] Invariant cache hit.
[2023-03-08 21:47:28] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-08 21:47:28] [INFO ] Invariant cache hit.
[2023-03-08 21:47:29] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2023-03-08 21:47:29] [INFO ] Invariant cache hit.
[2023-03-08 21:47:29] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 844 ms. Remains : 352/352 places, 296/296 transitions.
Treatment of property DES-PT-60a-LTLCardinality-11 finished in 20082 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 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 14 ms. Remains 351 /352 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 351 cols
[2023-03-08 21:47:29] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 21:47:29] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-08 21:47:29] [INFO ] Invariant cache hit.
[2023-03-08 21:47:30] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2023-03-08 21:47:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:47:30] [INFO ] Invariant cache hit.
[2023-03-08 21:47:30] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 885 ms. Remains : 351/352 places, 295/296 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-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:(EQ s310 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-13 finished in 939 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(F(p0))||G((p1||G(p2))))))'
Found a Lengthening insensitive property : DES-PT-60a-LTLCardinality-02
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 352 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 21:47:30] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 21:47:30] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-08 21:47:30] [INFO ] Invariant cache hit.
[2023-03-08 21:47:31] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2023-03-08 21:47:31] [INFO ] Invariant cache hit.
[2023-03-08 21:47:31] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 866 ms. Remains : 352/352 places, 296/296 transitions.
Running random walk in product with property : DES-PT-60a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s268 0) (EQ s280 1)), p0:(EQ s308 1), p2:(OR (AND (EQ s263 0) (EQ s10 1)) (AND (EQ s245 0) (EQ s26 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2384 reset in 214 ms.
Product exploration explored 100000 steps with 2401 reset in 236 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 522 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 11 factoid took 510 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2023-03-08 21:47:33] [INFO ] Invariant cache hit.
[2023-03-08 21:47:33] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 21:47:33] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-08 21:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:47:43] [INFO ] [Real]Absence check using state equation in 10196 ms returned sat
[2023-03-08 21:47:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:47:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-08 21:47:43] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 113 ms returned sat
[2023-03-08 21:47:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:47:45] [INFO ] [Nat]Absence check using state equation in 1896 ms returned sat
[2023-03-08 21:47:45] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-08 21:47:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-08 21:47:45] [INFO ] Computed and/alt/rep : 288/864/288 causal constraints (skipped 7 transitions) in 21 ms.
[2023-03-08 21:47:47] [INFO ] Added : 164 causal constraints over 33 iterations in 1886 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 20 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 21:47:47] [INFO ] Invariant cache hit.
[2023-03-08 21:47:48] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-08 21:47:48] [INFO ] Invariant cache hit.
[2023-03-08 21:47:48] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2023-03-08 21:47:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:47:48] [INFO ] Invariant cache hit.
[2023-03-08 21:47:48] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 896 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2023-03-08 21:47:49] [INFO ] Invariant cache hit.
[2023-03-08 21:47:49] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 21:47:49] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 30 ms returned sat
[2023-03-08 21:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:47:59] [INFO ] [Real]Absence check using state equation in 10204 ms returned sat
[2023-03-08 21:47:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:47:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 21:47:59] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 113 ms returned sat
[2023-03-08 21:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:48:01] [INFO ] [Nat]Absence check using state equation in 1885 ms returned sat
[2023-03-08 21:48:01] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-08 21:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-08 21:48:01] [INFO ] Computed and/alt/rep : 288/864/288 causal constraints (skipped 7 transitions) in 18 ms.
[2023-03-08 21:48:03] [INFO ] Added : 164 causal constraints over 33 iterations in 1898 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4554 reset in 237 ms.
Product exploration explored 100000 steps with 4705 reset in 264 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 18 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 21:48:04] [INFO ] Invariant cache hit.
[2023-03-08 21:48:04] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-08 21:48:04] [INFO ] Invariant cache hit.
[2023-03-08 21:48:05] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-08 21:48:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:48:05] [INFO ] Invariant cache hit.
[2023-03-08 21:48:05] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 905 ms. Remains : 352/352 places, 296/296 transitions.
Treatment of property DES-PT-60a-LTLCardinality-02 finished in 35069 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)))'
Found a Lengthening insensitive property : DES-PT-60a-LTLCardinality-11
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 15 ms. Remains 351 /352 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 351 cols
[2023-03-08 21:48:05] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 21:48:05] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-08 21:48:05] [INFO ] Invariant cache hit.
[2023-03-08 21:48:06] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2023-03-08 21:48:06] [INFO ] Invariant cache hit.
[2023-03-08 21:48:06] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 897 ms. Remains : 351/352 places, 295/296 transitions.
Running random walk in product with property : DES-PT-60a-LTLCardinality-11 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:(EQ s72 0)], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2256 reset in 202 ms.
Product exploration explored 100000 steps with 2259 reset in 225 ms.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Detected a total of 254/351 stabilizing places and 249/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1343572 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1343572 steps, saw 189357 distinct states, run finished after 3002 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 21:48:10] [INFO ] Invariant cache hit.
[2023-03-08 21:48:10] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:48:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 21:48:10] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 87 ms returned sat
[2023-03-08 21:48:10] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:48:10] [INFO ] After 485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 21:48:11] [INFO ] After 703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 295/295 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 293
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 351 transition count 293
Applied a total of 4 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 293/295 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 351/351 places, 293/295 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1304085 steps, run timeout after 3001 ms. (steps per millisecond=434 ) properties seen :{}
Probabilistic random walk after 1304085 steps, saw 181617 distinct states, run finished after 3001 ms. (steps per millisecond=434 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 21:48:14] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 21:48:14] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:48:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 21:48:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 145 ms returned sat
[2023-03-08 21:48:14] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:48:14] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2023-03-08 21:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-08 21:48:14] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 21:48:14] [INFO ] After 722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 21:48:14] [INFO ] Invariant cache hit.
[2023-03-08 21:48:15] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-08 21:48:15] [INFO ] Invariant cache hit.
[2023-03-08 21:48:15] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2023-03-08 21:48:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 21:48:15] [INFO ] Invariant cache hit.
[2023-03-08 21:48:15] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 896 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 21:48:15] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 21:48:15] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:48:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 21:48:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 146 ms returned sat
[2023-03-08 21:48:16] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:48:16] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 21:48:16] [INFO ] After 656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 351/351 places, 295/295 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 351 cols
[2023-03-08 21:48:16] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 21:48:17] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-08 21:48:17] [INFO ] Invariant cache hit.
[2023-03-08 21:48:17] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2023-03-08 21:48:17] [INFO ] Invariant cache hit.
[2023-03-08 21:48:17] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 823 ms. Remains : 351/351 places, 295/295 transitions.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Detected a total of 254/351 stabilizing places and 249/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 232 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1342624 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1342624 steps, saw 189231 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 21:48:21] [INFO ] Invariant cache hit.
[2023-03-08 21:48:21] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:48:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 21:48:21] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 85 ms returned sat
[2023-03-08 21:48:21] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:48:21] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 21:48:21] [INFO ] After 662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 295/295 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 293
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 351 transition count 293
Applied a total of 4 rules in 29 ms. Remains 351 /351 variables (removed 0) and now considering 293/295 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 351/351 places, 293/295 transitions.
Incomplete random walk after 10000 steps, including 155 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1351504 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :{}
Probabilistic random walk after 1351504 steps, saw 189194 distinct states, run finished after 3001 ms. (steps per millisecond=450 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 21:48:24] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-08 21:48:24] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:48:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 21:48:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 146 ms returned sat
[2023-03-08 21:48:25] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:48:25] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2023-03-08 21:48:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-08 21:48:25] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 21:48:25] [INFO ] After 724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 21:48:25] [INFO ] Invariant cache hit.
[2023-03-08 21:48:26] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-08 21:48:26] [INFO ] Invariant cache hit.
[2023-03-08 21:48:26] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2023-03-08 21:48:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:48:26] [INFO ] Invariant cache hit.
[2023-03-08 21:48:26] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 973 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 21:48:26] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 21:48:26] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:48:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 21:48:27] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 150 ms returned sat
[2023-03-08 21:48:27] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:48:27] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 21:48:27] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2273 reset in 188 ms.
Product exploration explored 100000 steps with 2288 reset in 212 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 351/351 places, 295/295 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2023-03-08 21:48:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 295 rows 351 cols
[2023-03-08 21:48:28] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 21:48:28] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 351/351 places, 295/295 transitions.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 351/351 places, 295/295 transitions.
Applied a total of 0 rules in 4 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2023-03-08 21:48:28] [INFO ] Invariant cache hit.
[2023-03-08 21:48:28] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-08 21:48:28] [INFO ] Invariant cache hit.
[2023-03-08 21:48:29] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2023-03-08 21:48:29] [INFO ] Invariant cache hit.
[2023-03-08 21:48:29] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 833 ms. Remains : 351/351 places, 295/295 transitions.
Treatment of property DES-PT-60a-LTLCardinality-11 finished in 24274 ms.
[2023-03-08 21:48:29] [INFO ] Flatten gal took : 24 ms
[2023-03-08 21:48:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 21:48:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 352 places, 296 transitions and 1425 arcs took 7 ms.
Total runtime 132468 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1671/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1671/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-60a-LTLCardinality-02
Could not compute solution for formula : DES-PT-60a-LTLCardinality-11

BK_STOP 1678312111263

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name DES-PT-60a-LTLCardinality-02
ltl formula formula --ltl=/tmp/1671/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 352 places, 296 transitions and 1425 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1671/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1671/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1671/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1671/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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 DES-PT-60a-LTLCardinality-11
ltl formula formula --ltl=/tmp/1671/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
pnml2lts-mc( 0/ 4): Petri net has 352 places, 296 transitions and 1425 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1671/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1671/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1671/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1671/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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:
0: pnml2lts-mc(+0xa23f4) [0x559c66b6a3f4]
1: pnml2lts-mc(+0xa2496) [0x559c66b6a496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f78fadfd140]
3: pnml2lts-mc(+0x405be5) [0x559c66ecdbe5]
4: pnml2lts-mc(+0x16b3f9) [0x559c66c333f9]
5: pnml2lts-mc(+0x164ac4) [0x559c66c2cac4]
6: pnml2lts-mc(+0x272e0a) [0x559c66d3ae0a]
7: pnml2lts-mc(+0xb61f0) [0x559c66b7e1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f78fac504d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f78fac5067a]
10: pnml2lts-mc(+0xa1581) [0x559c66b69581]
11: pnml2lts-mc(+0xa1910) [0x559c66b69910]
12: pnml2lts-mc(+0xa32a2) [0x559c66b6b2a2]
13: pnml2lts-mc(+0xa50f4) [0x559c66b6d0f4]
14: pnml2lts-mc(+0x3f34b3) [0x559c66ebb4b3]
15: pnml2lts-mc(+0x7c63d) [0x559c66b4463d]
16: pnml2lts-mc(+0x67d86) [0x559c66b2fd86]
17: pnml2lts-mc(+0x60a8a) [0x559c66b28a8a]
18: pnml2lts-mc(+0x5eb15) [0x559c66b26b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f78fac38d0a]
20: pnml2lts-mc(+0x6075e) [0x559c66b2875e]

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="DES-PT-60a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-60a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481300491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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