Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662339300787.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ResAllocation-PT-R003C003, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662339300787
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 23:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 11 23:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 11 23:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 23:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 21K May 18 16:43 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 ResAllocation-PT-R003C003-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C003-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717264612153

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:56:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:56:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:56:53] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2024-06-01 17:56:53] [INFO ] Transformed 18 places.
[2024-06-01 17:56:53] [INFO ] Transformed 12 transitions.
[2024-06-01 17:56:53] [INFO ] Found NUPN structural information;
[2024-06-01 17:56:53] [INFO ] Parsed PT model containing 18 places and 12 transitions and 48 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R003C003-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 9 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2024-06-01 17:56:53] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 17:56:53] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 17:56:53] [INFO ] Invariant cache hit.
[2024-06-01 17:56:53] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 17:56:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 17:56:53] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 8 ms to minimize.
[2024-06-01 17:56:53] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:56:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2024-06-01 17:56:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/18 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 17:56:54] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 12/30 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 50 constraints, problems are : Problem set: 0 solved, 9 unsolved in 360 ms.
Refiners :[Domain max(s): 18/18 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/18 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 12/30 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 59 constraints, problems are : Problem set: 0 solved, 9 unsolved in 137 ms.
Refiners :[Domain max(s): 18/18 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints]
After SMT, in 531ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 540ms
Finished structural reductions in LTL mode , in 1 iterations and 748 ms. Remains : 18/18 places, 12/12 transitions.
Support contains 16 out of 18 places after structural reductions.
[2024-06-01 17:56:54] [INFO ] Flatten gal took : 19 ms
[2024-06-01 17:56:54] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:56:54] [INFO ] Input system was already deterministic with 12 transitions.
Support contains 15 out of 18 places (down from 16) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 282 steps (30 resets) in 43 ms. (6 steps per ms) remains 0/20 properties
FORMULA ResAllocation-PT-R003C003-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&F((p1 U (p2||G(p1)))))))'
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-06-01 17:56:54] [INFO ] Invariant cache hit.
[2024-06-01 17:56:54] [INFO ] Implicit Places using invariants in 41 ms returned [13, 15, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 15/18 places, 12/12 transitions.
Stuttering acceptance computed with spot in 421 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLCardinality-03
Stuttering criterion allowed to conclude after 16 steps with 2 reset in 2 ms.
FORMULA ResAllocation-PT-R003C003-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C003-LTLCardinality-03 finished in 528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 15 transition count 10
Applied a total of 5 rules in 11 ms. Remains 15 /18 variables (removed 3) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 15 cols
[2024-06-01 17:56:55] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 17:56:55] [INFO ] Implicit Places using invariants in 39 ms returned [12, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/18 places, 10/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54 ms. Remains : 13/18 places, 10/12 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLCardinality-04
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C003-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C003-LTLCardinality-04 finished in 107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F((p1&&X(p2))))))'
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2024-06-01 17:56:55] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 17:56:55] [INFO ] Implicit Places using invariants in 33 ms returned [13, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 16/18 places, 12/12 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLCardinality-06
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 1 ms.
FORMULA ResAllocation-PT-R003C003-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C003-LTLCardinality-06 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-06-01 17:56:55] [INFO ] Invariant cache hit.
[2024-06-01 17:56:55] [INFO ] Implicit Places using invariants in 36 ms returned [15, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 16/18 places, 12/12 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R003C003-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R003C003-LTLCardinality-07 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-06-01 17:56:56] [INFO ] Invariant cache hit.
[2024-06-01 17:56:56] [INFO ] Implicit Places using invariants in 27 ms returned [13, 15, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 15/18 places, 12/12 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLCardinality-10
Product exploration explored 100000 steps with 28535 reset in 86 ms.
Product exploration explored 100000 steps with 28544 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 286 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 5 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1)]
Knowledge based reduction with 2 factoid took 317 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 12 rows 15 cols
[2024-06-01 17:56:57] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 17:56:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 17:56:57] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 17:56:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:56:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 17:56:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 17:56:57] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 17:56:57] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-06-01 17:56:57] [INFO ] Invariant cache hit.
[2024-06-01 17:56:57] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 17:56:57] [INFO ] Invariant cache hit.
[2024-06-01 17:56:57] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 17:56:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 17:56:57] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:56:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 17:56:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 17:56:57] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 40 constraints, problems are : Problem set: 0 solved, 9 unsolved in 184 ms.
Refiners :[Domain max(s): 15/15 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 49 constraints, problems are : Problem set: 0 solved, 9 unsolved in 72 ms.
Refiners :[Domain max(s): 15/15 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 260ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 261ms
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 15/15 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 5 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 17:56:58] [INFO ] Invariant cache hit.
[2024-06-01 17:56:58] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 17:56:58] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 17:56:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:56:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 17:56:58] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 17:56:58] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 17:56:58] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 28563 reset in 91 ms.
Product exploration explored 100000 steps with 28576 reset in 59 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 12/12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 12
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 4 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-06-01 17:56:59] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 15 cols
[2024-06-01 17:56:59] [INFO ] Computed 6 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 17:56:59] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 17:56:59] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem TDEAD9 is UNSAT
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/38 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 38 constraints, problems are : Problem set: 2 solved, 7 unsolved in 106 ms.
Refiners :[Domain max(s): 15/15 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 4/17 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 2/19 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/21 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/23 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 12/27 variables, 15/38 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 7/45 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/27 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/27 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 45 constraints, problems are : Problem set: 2 solved, 7 unsolved in 79 ms.
Refiners :[Domain max(s): 15/15 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 191ms problems are : Problem set: 2 solved, 7 unsolved
Search for dead transitions found 2 dead transitions in 192ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/15 places, 10/12 transitions.
Graph (complete) has 40 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 13 /15 variables (removed 2) and now considering 10/10 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/15 places, 10/12 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 13/15 places, 10/12 transitions.
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 15 cols
[2024-06-01 17:56:59] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 17:56:59] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 17:56:59] [INFO ] Invariant cache hit.
[2024-06-01 17:56:59] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 17:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 17:56:59] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:56:59] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 17:56:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:56:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 40 constraints, problems are : Problem set: 0 solved, 9 unsolved in 178 ms.
Refiners :[Domain max(s): 15/15 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 49 constraints, problems are : Problem set: 0 solved, 9 unsolved in 78 ms.
Refiners :[Domain max(s): 15/15 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 262ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 262ms
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 15/15 places, 12/12 transitions.
Treatment of property ResAllocation-PT-R003C003-LTLCardinality-10 finished in 3591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(G(p0))))))))'
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2024-06-01 17:56:59] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 17:56:59] [INFO ] Implicit Places using invariants in 28 ms returned [13, 15, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 15/18 places, 12/12 transitions.
Stuttering acceptance computed with spot in 390 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C003-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C003-LTLCardinality-11 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!p1||(p2&&(X(p3)||(!p0&&F(p2)))))))'
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-06-01 17:57:00] [INFO ] Invariant cache hit.
[2024-06-01 17:57:00] [INFO ] Implicit Places using invariants in 24 ms returned [13, 15, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25 ms. Remains : 15/18 places, 12/12 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLCardinality-12
Product exploration explored 100000 steps with 40452 reset in 105 ms.
Product exploration explored 100000 steps with 40508 reset in 122 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X (AND p1 p2 p0 (NOT p3))), (X (NOT (AND p1 p2 p0 (NOT p3)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p2 p0 (NOT p3)))), (X (X (NOT (AND p1 p2 p0 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 631 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
RANDOM walk for 509 steps (58 resets) in 33 ms. (14 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X (AND p1 p2 p0 (NOT p3))), (X (NOT (AND p1 p2 p0 (NOT p3)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p2 p0 (NOT p3)))), (X (X (NOT (AND p1 p2 p0 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (AND p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND p0 p1 p2 (NOT p3)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2 p3))), (F p3), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 922 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
Stuttering acceptance computed with spot in 142 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
// Phase 1: matrix 12 rows 15 cols
[2024-06-01 17:57:02] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 17:57:02] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 17:57:02] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 17:57:02] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 17:57:02] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG (AND p0 p1 (NOT p3))
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-06-01 17:57:02] [INFO ] Invariant cache hit.
[2024-06-01 17:57:02] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 17:57:02] [INFO ] Invariant cache hit.
[2024-06-01 17:57:02] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 17:57:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 17:57:02] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:57:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:57:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 17:57:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 40 constraints, problems are : Problem set: 0 solved, 9 unsolved in 175 ms.
Refiners :[Domain max(s): 15/15 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 49 constraints, problems are : Problem set: 0 solved, 9 unsolved in 77 ms.
Refiners :[Domain max(s): 15/15 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 259ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 259ms
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 15/15 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 p2 (NOT p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 p2 (NOT p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 640 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
RANDOM walk for 758 steps (84 resets) in 39 ms. (18 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 p2 (NOT p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 p2 (NOT p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (AND p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND p0 p1 p2 (NOT p3)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2 p3))), (F p3), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 850 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
Stuttering acceptance computed with spot in 179 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
[2024-06-01 17:57:04] [INFO ] Invariant cache hit.
[2024-06-01 17:57:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 17:57:04] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 17:57:04] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 17:57:04] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (AND p0 p1 (NOT p3))
Stuttering acceptance computed with spot in 138 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
Product exploration explored 100000 steps with 40462 reset in 150 ms.
Product exploration explored 100000 steps with 40426 reset in 113 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 145 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 12/12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-06-01 17:57:05] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 15 cols
[2024-06-01 17:57:05] [INFO ] Computed 6 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 17:57:05] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-06-01 17:57:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:57:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem TDEAD10 is UNSAT
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/39 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 39 constraints, problems are : Problem set: 1 solved, 8 unsolved in 133 ms.
Refiners :[Domain max(s): 15/15 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/22 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/15 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 12/27 variables, 15/39 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 8/47 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/27 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/27 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 47 constraints, problems are : Problem set: 1 solved, 8 unsolved in 79 ms.
Refiners :[Domain max(s): 15/15 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 218ms problems are : Problem set: 1 solved, 8 unsolved
Search for dead transitions found 1 dead transitions in 218ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/15 places, 11/12 transitions.
Graph (complete) has 41 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/15 places, 11/12 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 14/15 places, 11/12 transitions.
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 15 cols
[2024-06-01 17:57:05] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 17:57:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 17:57:05] [INFO ] Invariant cache hit.
[2024-06-01 17:57:05] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 17:57:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 17:57:05] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:57:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:57:05] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 17:57:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 40 constraints, problems are : Problem set: 0 solved, 9 unsolved in 151 ms.
Refiners :[Domain max(s): 15/15 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 49 constraints, problems are : Problem set: 0 solved, 9 unsolved in 67 ms.
Refiners :[Domain max(s): 15/15 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 221ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 222ms
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 15/15 places, 12/12 transitions.
Treatment of property ResAllocation-PT-R003C003-LTLCardinality-12 finished in 5969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 16 transition count 10
Applied a total of 4 rules in 1 ms. Remains 16 /18 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 16 cols
[2024-06-01 17:57:06] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 17:57:06] [INFO ] Implicit Places using invariants in 27 ms returned [11, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/18 places, 10/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30 ms. Remains : 14/18 places, 10/12 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLCardinality-14
Product exploration explored 100000 steps with 13187 reset in 144 ms.
Stack based approach found an accepted trace after 273 steps with 35 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ResAllocation-PT-R003C003-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C003-LTLCardinality-14 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 16 transition count 10
Applied a total of 4 rules in 2 ms. Remains 16 /18 variables (removed 2) and now considering 10/12 (removed 2) transitions.
[2024-06-01 17:57:06] [INFO ] Invariant cache hit.
[2024-06-01 17:57:06] [INFO ] Implicit Places using invariants in 24 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 10/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27 ms. Remains : 15/18 places, 10/12 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLCardinality-15
Stuttering criterion allowed to conclude after 41 steps with 5 reset in 0 ms.
FORMULA ResAllocation-PT-R003C003-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C003-LTLCardinality-15 finished in 107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Found a Shortening insensitive property : ResAllocation-PT-R003C003-LTLCardinality-10
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 15 transition count 10
Applied a total of 5 rules in 1 ms. Remains 15 /18 variables (removed 3) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 15 cols
[2024-06-01 17:57:06] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 17:57:06] [INFO ] Implicit Places using invariants in 27 ms returned [12, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/18 places, 10/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 30 ms. Remains : 13/18 places, 10/12 transitions.
Running random walk in product with property : ResAllocation-PT-R003C003-LTLCardinality-10
Product exploration explored 100000 steps with 28610 reset in 44 ms.
Product exploration explored 100000 steps with 28556 reset in 57 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 265 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1)]
Knowledge based reduction with 2 factoid took 309 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 10 rows 13 cols
[2024-06-01 17:57:07] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 17:57:07] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 17:57:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 17:57:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:57:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 17:57:07] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 17:57:07] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 17:57:07] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 13 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 17:57:07] [INFO ] Invariant cache hit.
[2024-06-01 17:57:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 17:57:07] [INFO ] Invariant cache hit.
[2024-06-01 17:57:07] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-06-01 17:57:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 17:57:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 33 constraints, problems are : Problem set: 0 solved, 7 unsolved in 86 ms.
Refiners :[Domain max(s): 13/13 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 40 constraints, problems are : Problem set: 0 solved, 7 unsolved in 53 ms.
Refiners :[Domain max(s): 13/13 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 13/13 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 17:57:08] [INFO ] Invariant cache hit.
[2024-06-01 17:57:08] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 17:57:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 17:57:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:57:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 17:57:08] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 17:57:08] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 17:57:08] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 28616 reset in 130 ms.
Product exploration explored 100000 steps with 28509 reset in 159 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 17:57:09] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 17:57:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 17:57:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 33 constraints, problems are : Problem set: 0 solved, 7 unsolved in 88 ms.
Refiners :[Domain max(s): 13/13 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 40 constraints, problems are : Problem set: 0 solved, 7 unsolved in 57 ms.
Refiners :[Domain max(s): 13/13 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 150ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 13/13 places, 10/10 transitions.
Support contains 2 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 17:57:09] [INFO ] Invariant cache hit.
[2024-06-01 17:57:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 17:57:09] [INFO ] Invariant cache hit.
[2024-06-01 17:57:09] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-06-01 17:57:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 17:57:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 33 constraints, problems are : Problem set: 0 solved, 7 unsolved in 82 ms.
Refiners :[Domain max(s): 13/13 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 40 constraints, problems are : Problem set: 0 solved, 7 unsolved in 52 ms.
Refiners :[Domain max(s): 13/13 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 13/13 places, 10/10 transitions.
Treatment of property ResAllocation-PT-R003C003-LTLCardinality-10 finished in 3276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!p1||(p2&&(X(p3)||(!p0&&F(p2)))))))'
Found a Shortening insensitive property : ResAllocation-PT-R003C003-LTLCardinality-12
Stuttering acceptance computed with spot in 139 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 16 transition count 11
Applied a total of 3 rules in 4 ms. Remains 16 /18 variables (removed 2) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 16 cols
[2024-06-01 17:57:10] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 17:57:10] [INFO ] Implicit Places using invariants in 28 ms returned [13, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/18 places, 11/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 33 ms. Remains : 14/18 places, 11/12 transitions.
Running random walk in product with property : ResAllocation-PT-R003C003-LTLCardinality-12
Product exploration explored 100000 steps with 40488 reset in 78 ms.
Product exploration explored 100000 steps with 40347 reset in 81 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X (AND p1 p2 p0 (NOT p3))), (X (NOT (AND p1 p2 p0 (NOT p3)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p2 p0 (NOT p3)))), (X (X (NOT (AND p1 p2 p0 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 525 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
RANDOM walk for 485 steps (59 resets) in 26 ms. (17 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X (AND p1 p2 p0 (NOT p3))), (X (NOT (AND p1 p2 p0 (NOT p3)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p2 p0 (NOT p3)))), (X (X (NOT (AND p1 p2 p0 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (AND p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND p0 p1 p2 (NOT p3)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2 p3))), (F p3), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 903 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
Stuttering acceptance computed with spot in 126 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
// Phase 1: matrix 11 rows 14 cols
[2024-06-01 17:57:12] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 17:57:12] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 17:57:12] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 17:57:12] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 17:57:12] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND p0 p1 (NOT p3))
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-06-01 17:57:12] [INFO ] Invariant cache hit.
[2024-06-01 17:57:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 17:57:12] [INFO ] Invariant cache hit.
[2024-06-01 17:57:12] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2024-06-01 17:57:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:57:12] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-06-01 17:57:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:57:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/25 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 37 constraints, problems are : Problem set: 0 solved, 8 unsolved in 126 ms.
Refiners :[Domain max(s): 14/14 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/25 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 45 constraints, problems are : Problem set: 0 solved, 8 unsolved in 66 ms.
Refiners :[Domain max(s): 14/14 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 197ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 198ms
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 14/14 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 p2 (NOT p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 p2 (NOT p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 605 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
RANDOM walk for 421 steps (45 resets) in 16 ms. (24 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 p2 (NOT p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 p2 (NOT p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (AND p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND p0 p1 p2 (NOT p3)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2 p3))), (F p3), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 909 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
Stuttering acceptance computed with spot in 136 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
[2024-06-01 17:57:14] [INFO ] Invariant cache hit.
[2024-06-01 17:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 17:57:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 17:57:14] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 17:57:14] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND p0 p1 (NOT p3))
Stuttering acceptance computed with spot in 116 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
Product exploration explored 100000 steps with 40536 reset in 75 ms.
Product exploration explored 100000 steps with 40544 reset in 77 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 235 ms :[(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3)))]
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-06-01 17:57:14] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 17:57:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:57:15] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:57:15] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 17:57:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/25 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 37 constraints, problems are : Problem set: 0 solved, 8 unsolved in 142 ms.
Refiners :[Domain max(s): 14/14 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/25 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 45 constraints, problems are : Problem set: 0 solved, 8 unsolved in 71 ms.
Refiners :[Domain max(s): 14/14 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 215ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 216ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 14/14 places, 11/11 transitions.
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-06-01 17:57:15] [INFO ] Invariant cache hit.
[2024-06-01 17:57:15] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 17:57:15] [INFO ] Invariant cache hit.
[2024-06-01 17:57:15] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2024-06-01 17:57:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:57:15] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:57:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:57:15] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/25 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 37 constraints, problems are : Problem set: 0 solved, 8 unsolved in 134 ms.
Refiners :[Domain max(s): 14/14 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/25 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 45 constraints, problems are : Problem set: 0 solved, 8 unsolved in 71 ms.
Refiners :[Domain max(s): 14/14 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 208ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 209ms
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 14/14 places, 11/11 transitions.
Treatment of property ResAllocation-PT-R003C003-LTLCardinality-12 finished in 5715 ms.
[2024-06-01 17:57:15] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:57:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2024-06-01 17:57:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 12 transitions and 48 arcs took 1 ms.
Total runtime 22262 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ResAllocation-PT-R003C003-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C003-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717264635743

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ResAllocation-PT-R003C003-LTLCardinality-10
ltl formula formula --ltl=/tmp/2034/ltl_0_
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 18 places, 12 transitions and 48 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2034/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2034/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2034/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2034/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): There are 20 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 19, there are 35 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 37
pnml2lts-mc( 0/ 4): unique states count: 37
pnml2lts-mc( 0/ 4): unique transitions count: 43
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 12
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 46
pnml2lts-mc( 0/ 4): - cum. max stack depth: 18
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 46 states 73 transitions, fanout: 1.587
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 21.2 B/state, compr.: 27.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResAllocation-PT-R003C003-LTLCardinality-12
ltl formula formula --ltl=/tmp/2034/ltl_1_
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 18 places, 12 transitions and 48 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2034/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2034/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2034/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2034/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 20 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 19, there are 100 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 14
pnml2lts-mc( 0/ 4): unique states count: 14
pnml2lts-mc( 0/ 4): unique transitions count: 13
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33 states 56 transitions, fanout: 1.697
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 26.9 B/state, compr.: 34.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="ResAllocation-PT-R003C003"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is ResAllocation-PT-R003C003, 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 r520-tall-171662339300787"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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