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.r500-smll-171649587600187.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 HouseConstruction-PT-00100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587600187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 11 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 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 HouseConstruction-PT-00100-LTLCardinality-00
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-01
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-02
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-03
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-04
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-05
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-06
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-07
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-08
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-09
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-10
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-11
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-12
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-13
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-14
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717258814060

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-00100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:20:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:20:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:20:16] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-01 16:20:16] [INFO ] Transformed 26 places.
[2024-06-01 16:20:16] [INFO ] Transformed 18 transitions.
[2024-06-01 16:20:16] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HouseConstruction-PT-00100-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 21 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2024-06-01 16:20:17] [INFO ] Computed 8 invariants in 15 ms
[2024-06-01 16:20:17] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 16:20:17] [INFO ] Invariant cache hit.
[2024-06-01 16:20:17] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 16:20:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/44 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 605 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 51 constraints, problems are : Problem set: 0 solved, 17 unsolved in 483 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 1141ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1165ms
Finished structural reductions in LTL mode , in 1 iterations and 1693 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 25 out of 26 places after structural reductions.
[2024-06-01 16:20:19] [INFO ] Flatten gal took : 33 ms
[2024-06-01 16:20:19] [INFO ] Flatten gal took : 12 ms
[2024-06-01 16:20:19] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 26178 steps (12 resets) in 159 ms. (163 steps per ms) remains 0/28 properties
Computed a total of 26 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))||G(p2)))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 17 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 13 transition count 10
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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 12 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 11 transition count 8
Applied a total of 8 rules in 75 ms. Remains 11 /26 variables (removed 15) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-06-01 16:20:20] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 16:20:20] [INFO ] Implicit Places using invariants in 57 ms returned [3, 5, 7]
[2024-06-01 16:20:20] [INFO ] Actually due to overlaps returned [3, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/26 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 9/26 places, 8/18 transitions.
Stuttering acceptance computed with spot in 515 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 3 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-00 finished in 773 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||X(F((p0&&F(p1))))))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 19 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 13 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 12 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 9 transition count 6
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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 8 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 7 transition count 4
Applied a total of 29 rules in 20 ms. Remains 7 /26 variables (removed 19) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 7 cols
[2024-06-01 16:20:20] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 16:20:20] [INFO ] Implicit Places using invariants in 37 ms returned [0, 3]
[2024-06-01 16:20:20] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/26 places, 4/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5 transition count 4
Applied a total of 1 rules in 2 ms. Remains 5 /6 variables (removed 1) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-06-01 16:20:20] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 16:20:20] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 16:20:20] [INFO ] Invariant cache hit.
[2024-06-01 16:20:20] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 5/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-01
Product exploration explored 100000 steps with 1217 reset in 532 ms.
Product exploration explored 100000 steps with 1201 reset in 243 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 570 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 1212 steps (0 resets) in 4 ms. (242 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 1007 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 16:20:23] [INFO ] Invariant cache hit.
[2024-06-01 16:20:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 16:20:23] [INFO ] Invariant cache hit.
[2024-06-01 16:20:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-06-01 16:20:23] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 16:20:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/9 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 64 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/9 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 48 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 5/5 places, 4/4 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 842 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 1212 steps (0 resets) in 5 ms. (202 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 1045 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 1269 reset in 124 ms.
Product exploration explored 100000 steps with 1288 reset in 524 ms.
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 16:20:27] [INFO ] Invariant cache hit.
[2024-06-01 16:20:27] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 16:20:27] [INFO ] Invariant cache hit.
[2024-06-01 16:20:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-01 16:20:27] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 16:20:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/9 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 54 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/9 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 52 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 5/5 places, 4/4 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-01 finished in 6979 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 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 8 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 4 transition count 4
Applied a total of 8 rules in 6 ms. Remains 4 /26 variables (removed 22) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 16:20:27] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 16:20:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 16:20:27] [INFO ] Invariant cache hit.
[2024-06-01 16:20:27] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 16:20:27] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 16:20:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 103 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 562 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 691ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 691ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 760 ms. Remains : 4/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-02
Product exploration explored 100000 steps with 249 reset in 179 ms.
Product exploration explored 100000 steps with 249 reset in 259 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 27 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00100-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLCardinality-02 finished in 1344 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)&&F(G(p1)))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 14
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 21 transition count 9
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 17 place count 15 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 24 place count 10 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 9 transition count 6
Applied a total of 25 rules in 8 ms. Remains 9 /26 variables (removed 17) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-06-01 16:20:29] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 16:20:29] [INFO ] Implicit Places using invariants in 36 ms returned [0, 3, 7]
[2024-06-01 16:20:29] [INFO ] Actually due to overlaps returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/26 places, 6/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 6
Applied a total of 1 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-06-01 16:20:29] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 16:20:29] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 16:20:29] [INFO ] Invariant cache hit.
[2024-06-01 16:20:29] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/26 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 6/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-03
Stuttering criterion allowed to conclude after 600 steps with 0 reset in 2 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-03 finished in 289 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(F(p0)))&&F(p1)))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 16:20:29] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 16:20:29] [INFO ] Implicit Places using invariants in 53 ms returned [3, 9, 13, 19]
[2024-06-01 16:20:29] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 16:20:29] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 16:20:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 16:20:29] [INFO ] Invariant cache hit.
[2024-06-01 16:20:29] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-04
Product exploration explored 100000 steps with 24907 reset in 313 ms.
Product exploration explored 100000 steps with 25029 reset in 198 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 408 steps (0 resets) in 5 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 5 factoid took 220 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 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 16:20:31] [INFO ] Invariant cache hit.
[2024-06-01 16:20:31] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 16:20:31] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 16:20:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:20:31] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 16:20:31] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 16:20:31] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:20:31] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 16:20:31] [INFO ] Invariant cache hit.
[2024-06-01 16:20:31] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 16:20:31] [INFO ] Invariant cache hit.
[2024-06-01 16:20:31] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 16:20:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 17 unsolved in 346 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 41 constraints, problems are : Problem set: 0 solved, 17 unsolved in 320 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 683ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 685ms
Finished structural reductions in LTL mode , in 1 iterations and 804 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 266 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 164 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 408 steps (0 resets) in 5 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 213 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 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 16:20:33] [INFO ] Invariant cache hit.
[2024-06-01 16:20:33] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 16:20:33] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 16:20:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:20:33] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 16:20:33] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 16:20:33] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:20:33] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25004 reset in 304 ms.
Product exploration explored 100000 steps with 24985 reset in 96 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 5 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 5 /21 variables (removed 16) and now considering 5/18 (removed 13) transitions.
[2024-06-01 16:20:34] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 16:20:34] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem TDEAD0 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/9 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 5 constraints, problems are : Problem set: 1 solved, 3 unsolved in 60 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 8 constraints, problems are : Problem set: 1 solved, 3 unsolved in 70 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 1 solved, 3 unsolved
Search for dead transitions found 1 dead transitions in 146ms
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 : 5/21 places, 4/18 transitions.
Graph (complete) has 3 edges and 5 vertex of which 4 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 4 /5 variables (removed 1) and now considering 4/4 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/21 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 157 ms. Remains : 4/21 places, 4/18 transitions.
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 16:20:34] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 16:20:34] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 16:20:34] [INFO ] Invariant cache hit.
[2024-06-01 16:20:34] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 16:20:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 17 unsolved in 364 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 41 constraints, problems are : Problem set: 0 solved, 17 unsolved in 303 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 675ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 675ms
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-04 finished in 5791 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(G(p0)))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 16:20:35] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 16:20:35] [INFO ] Implicit Places using invariants in 53 ms returned [3, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-06 finished in 192 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&&F(p1)))&&X(F(p1))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-06-01 16:20:35] [INFO ] Invariant cache hit.
[2024-06-01 16:20:35] [INFO ] Implicit Places using invariants in 41 ms returned [3, 9, 13, 19]
[2024-06-01 16:20:35] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 16:20:35] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 16:20:35] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 16:20:35] [INFO ] Invariant cache hit.
[2024-06-01 16:20:35] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-07
Product exploration explored 100000 steps with 545 reset in 223 ms.
Product exploration explored 100000 steps with 619 reset in 273 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 330 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 7579 steps (1 resets) in 16 ms. (445 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 768 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 16:20:38] [INFO ] Invariant cache hit.
[2024-06-01 16:20:38] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 16:20:38] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 16:20:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:20:38] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 16:20:38] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 16:20:38] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 16:20:38] [INFO ] Added : 17 causal constraints over 4 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 11
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 13 transition count 10
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 14 place count 13 transition count 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 25 place count 7 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 26 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 28 place count 5 transition count 4
Applied a total of 28 rules in 6 ms. Remains 5 /21 variables (removed 16) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-06-01 16:20:38] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 16:20:38] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 16:20:38] [INFO ] Invariant cache hit.
[2024-06-01 16:20:38] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-01 16:20:38] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 16:20:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/9 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 71 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 70 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/21 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 5/21 places, 4/18 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 303 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 2937 steps (5 resets) in 4 ms. (587 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 874 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 16:20:40] [INFO ] Invariant cache hit.
[2024-06-01 16:20:40] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 16:20:40] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 16:20:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:20:40] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 16:20:40] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 16:20:40] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 16:20:40] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2882 reset in 104 ms.
Product exploration explored 100000 steps with 2779 reset in 140 ms.
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 16:20:41] [INFO ] Invariant cache hit.
[2024-06-01 16:20:41] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 16:20:41] [INFO ] Invariant cache hit.
[2024-06-01 16:20:41] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-06-01 16:20:41] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 16:20:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/9 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 74 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 65 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 143ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 5/5 places, 4/4 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-07 finished in 6034 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((G(F(p0)) U (p1&&F(p2))))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 22 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 21 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6 place count 21 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 14 place count 17 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 16 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 22 place count 11 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 10 transition count 7
Applied a total of 23 rules in 9 ms. Remains 10 /26 variables (removed 16) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-06-01 16:20:41] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 16:20:41] [INFO ] Implicit Places using invariants in 30 ms returned [3, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/26 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41 ms. Remains : 8/26 places, 7/18 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-09
Stuttering criterion allowed to conclude after 2098 steps with 32 reset in 5 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-09 finished in 415 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&&G(F(p0)))||(p1&&X(p1)))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 18 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 15 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 15 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 6 transition count 6
Applied a total of 17 rules in 5 ms. Remains 6 /26 variables (removed 20) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-06-01 16:20:41] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 16:20:41] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 16:20:41] [INFO ] Invariant cache hit.
[2024-06-01 16:20:41] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-06-01 16:20:41] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 16:20:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 83 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/12 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 90 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 176ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/26 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 6/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p0), (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3066 steps with 77 reset in 7 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-10 finished in 588 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 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 25 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 22 transition count 14
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 22 transition count 8
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 21 place count 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 13 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 12 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 9 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 8 transition count 5
Applied a total of 28 rules in 11 ms. Remains 8 /26 variables (removed 18) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2024-06-01 16:20:42] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 16:20:42] [INFO ] Implicit Places using invariants in 31 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/26 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45 ms. Remains : 7/26 places, 5/18 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-11
Product exploration explored 100000 steps with 199 reset in 150 ms.
Product exploration explored 100000 steps with 199 reset in 138 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 105 steps (0 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 16:20:43] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 16:20:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 16:20:43] [INFO ] Invariant cache hit.
[2024-06-01 16:20:43] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 16:20:43] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 16:20:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/12 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 146 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/12 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 79 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 228ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 228ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 105 steps (0 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 224 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 199 reset in 120 ms.
Product exploration explored 100000 steps with 199 reset in 182 ms.
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 16:20:44] [INFO ] Invariant cache hit.
[2024-06-01 16:20:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 16:20:44] [INFO ] Invariant cache hit.
[2024-06-01 16:20:44] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-06-01 16:20:44] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 16:20:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/12 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 70 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/12 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 70 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 145ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 7/7 places, 5/5 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-11 finished in 2377 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))||(F(p0)&&F(p1))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 15 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 14 transition count 8
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 9 transition count 6
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 8 transition count 5
Applied a total of 13 rules in 18 ms. Remains 8 /26 variables (removed 18) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2024-06-01 16:20:44] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 16:20:44] [INFO ] Implicit Places using invariants in 31 ms returned [2, 3, 6]
[2024-06-01 16:20:44] [INFO ] Actually due to overlaps returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/26 places, 5/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5 transition count 5
Applied a total of 1 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 16:20:44] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 16:20:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 16:20:44] [INFO ] Invariant cache hit.
[2024-06-01 16:20:44] [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.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/26 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 5/26 places, 5/18 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-12
Product exploration explored 100000 steps with 24963 reset in 78 ms.
Product exploration explored 100000 steps with 24966 reset in 82 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 297 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 408 steps (0 resets) in 4 ms. (81 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 8 factoid took 355 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
[2024-06-01 16:20:46] [INFO ] Invariant cache hit.
[2024-06-01 16:20:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 16:20:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:20:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 16:20:46] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 16:20:46] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 5 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 16:20:46] [INFO ] Invariant cache hit.
[2024-06-01 16:20:46] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 16:20:46] [INFO ] Invariant cache hit.
[2024-06-01 16:20:46] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 16:20:46] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 16:20:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 77 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/10 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 78 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 158ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 5/5 places, 5/5 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 408 steps (0 resets) in 6 ms. (58 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 358 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-06-01 16:20:47] [INFO ] Invariant cache hit.
[2024-06-01 16:20:47] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 16:20:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:20:47] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 16:20:47] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 16:20:47] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25050 reset in 73 ms.
Product exploration explored 100000 steps with 25018 reset in 79 ms.
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 2 ms. Remains 4 /5 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 16:20:47] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 16:20:47] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 16:20:47] [INFO ] Invariant cache hit.
[2024-06-01 16:20:47] [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.
[2024-06-01 16:20:47] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 16:20:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 63 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 66 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 4/5 places, 4/5 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-12 finished in 3288 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 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 19 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 23 place count 11 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 11 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 8 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 8 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 7 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 4 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 2 transition count 2
Applied a total of 37 rules in 5 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 16:20:48] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 16:20:48] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 16:20:48] [INFO ] Invariant cache hit.
[2024-06-01 16:20:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 16:20:48] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 16:20:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/26 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-13
Product exploration explored 100000 steps with 497 reset in 76 ms.
Product exploration explored 100000 steps with 497 reset in 91 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00100-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLCardinality-13 finished in 415 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||(G(p1)&&X(p2)&&(p3||F(p0))))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 16:20:48] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 16:20:48] [INFO ] Implicit Places using invariants in 47 ms returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-14
Product exploration explored 100000 steps with 3628 reset in 242 ms.
Product exploration explored 100000 steps with 3617 reset in 266 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 440 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40016 steps (20 resets) in 31 ms. (1250 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 16:20:50] [INFO ] Computed 4 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/37 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/39 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/37 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/39 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 18 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1) (NOT p3) p2))), (F (NOT (AND (OR p0 p1 p2) (OR p0 p3 p2)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F p3), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 1491 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 295 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2024-06-01 16:20:52] [INFO ] Invariant cache hit.
[2024-06-01 16:20:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 16:20:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 16:20:52] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:20:52] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 16:20:52] [INFO ] Invariant cache hit.
[2024-06-01 16:20:52] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 16:20:52] [INFO ] Invariant cache hit.
[2024-06-01 16:20:52] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 16:20:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 350 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 43 constraints, problems are : Problem set: 0 solved, 17 unsolved in 348 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 709ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 709ms
Finished structural reductions in LTL mode , in 1 iterations and 799 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 449 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40016 steps (20 resets) in 26 ms. (1482 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
[2024-06-01 16:20:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/37 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/39 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/37 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/39 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1) (NOT p3) p2))), (F (NOT (AND (OR p0 p1 p2) (OR p0 p3 p2)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F p3), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 1482 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2024-06-01 16:20:55] [INFO ] Invariant cache hit.
[2024-06-01 16:20:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-06-01 16:20:55] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 16:20:55] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:20:55] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3619 reset in 245 ms.
Product exploration explored 100000 steps with 3632 reset in 270 ms.
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 16:20:56] [INFO ] Invariant cache hit.
[2024-06-01 16:20:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 16:20:56] [INFO ] Invariant cache hit.
[2024-06-01 16:20:56] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 16:20:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 339 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 43 constraints, problems are : Problem set: 0 solved, 17 unsolved in 351 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 698ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 699ms
Finished structural reductions in LTL mode , in 1 iterations and 791 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-14 finished in 9239 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)||G(p1)))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 16:20:57] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 16:20:57] [INFO ] Implicit Places using invariants in 51 ms returned [3, 9, 13, 19]
[2024-06-01 16:20:57] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 16:20:57] [INFO ] Computed 3 invariants in 5 ms
[2024-06-01 16:20:57] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 16:20:57] [INFO ] Invariant cache hit.
[2024-06-01 16:20:57] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 326 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-15 finished in 444 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||X(F((p0&&F(p1))))))))'
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(F(p0)))&&F(p1)))'
Found a Shortening insensitive property : HouseConstruction-PT-00100-LTLCardinality-04
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 7 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 4 ms. Remains 6 /26 variables (removed 20) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-06-01 16:20:58] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 16:20:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 16:20:58] [INFO ] Invariant cache hit.
[2024-06-01 16:20:58] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 16:20:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 82 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/12 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 89 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 179ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 179ms
Starting structural reductions in LI_LTL mode, iteration 1 : 6/26 places, 6/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 241 ms. Remains : 6/26 places, 6/18 transitions.
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-04
Product exploration explored 100000 steps with 21678 reset in 77 ms.
Product exploration explored 100000 steps with 21781 reset in 87 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 294 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0)]
Knowledge based reduction with 4 factoid took 351 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 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 16:21:00] [INFO ] Invariant cache hit.
[2024-06-01 16:21:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 16:21:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:21:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 16:21:00] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 16:21:00] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 16:21:00] [INFO ] Invariant cache hit.
[2024-06-01 16:21:00] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 16:21:00] [INFO ] Invariant cache hit.
[2024-06-01 16:21:00] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 16:21:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 72 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/12 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 93 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 171ms
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 6/6 places, 6/6 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 170 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 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 203 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 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 16:21:01] [INFO ] Invariant cache hit.
[2024-06-01 16:21:01] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 16:21:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:21:01] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 16:21:01] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 16:21:01] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21820 reset in 71 ms.
Product exploration explored 100000 steps with 21508 reset in 97 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Graph (complete) has 5 edges and 6 vertex of which 4 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 3 ms. Remains 4 /6 variables (removed 2) and now considering 4/6 (removed 2) transitions.
[2024-06-01 16:21:02] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 16:21:02] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 55 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 60 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 143ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/6 places, 4/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 4/6 places, 4/6 transitions.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5 transition count 5
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Applied a total of 2 rules in 3 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 16:21:02] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 16:21:02] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 16:21:02] [INFO ] Invariant cache hit.
[2024-06-01 16:21:02] [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 4 sub problems to find dead transitions.
[2024-06-01 16:21:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 73 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/10 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 64 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Starting structural reductions in LTL mode, iteration 1 : 5/6 places, 5/6 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 5/6 places, 5/6 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-04 finished in 4344 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&&F(p1)))&&X(F(p1))))'
Found a Shortening insensitive property : HouseConstruction-PT-00100-LTLCardinality-07
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 19 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 19 place count 14 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 14 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 12 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 12 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 11 transition count 6
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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 10 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 9 transition count 4
Applied a total of 27 rules in 6 ms. Remains 9 /26 variables (removed 17) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 9 cols
[2024-06-01 16:21:02] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 16:21:03] [INFO ] Implicit Places using invariants in 37 ms returned [0, 3, 5, 7]
[2024-06-01 16:21:03] [INFO ] Actually due to overlaps returned [0, 3, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 6/26 places, 4/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 47 ms. Remains : 6/26 places, 4/18 transitions.
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-07
Product exploration explored 100000 steps with 2974 reset in 105 ms.
Product exploration explored 100000 steps with 3075 reset in 129 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 315 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 1517 steps (1 resets) in 6 ms. (216 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 677 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 4 rows 6 cols
[2024-06-01 16:21:05] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 16:21:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 16:21:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 16:21:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:21:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 16:21:05] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 16:21:05] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 16:21:05] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 16:21:05] [INFO ] Invariant cache hit.
[2024-06-01 16:21:05] [INFO ] Implicit Places using invariants in 27 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30 ms. Remains : 5/6 places, 4/4 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 426 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 3142 steps (6 resets) in 7 ms. (392 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 947 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 319 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 4 rows 5 cols
[2024-06-01 16:21:07] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 16:21:07] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 16:21:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 16:21:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:21:07] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 16:21:07] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 16:21:07] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 16:21:07] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2819 reset in 108 ms.
Product exploration explored 100000 steps with 2608 reset in 121 ms.
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 16:21:08] [INFO ] Invariant cache hit.
[2024-06-01 16:21:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 16:21:08] [INFO ] Invariant cache hit.
[2024-06-01 16:21:08] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-06-01 16:21:08] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 16:21:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/9 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 65 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 83 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 167ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 5/5 places, 4/4 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-07 finished in 5727 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)))'
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))||(F(p0)&&F(p1))))'
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||(G(p1)&&X(p2)&&(p3||F(p0))))))'
Found a Shortening insensitive property : HouseConstruction-PT-00100-LTLCardinality-14
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 17 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 15 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 15 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 13 transition count 9
Applied a total of 7 rules in 6 ms. Remains 13 /26 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-06-01 16:21:09] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 16:21:09] [INFO ] Implicit Places using invariants in 45 ms returned [1, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/26 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 54 ms. Remains : 11/26 places, 9/18 transitions.
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-14
Product exploration explored 100000 steps with 7962 reset in 323 ms.
Product exploration explored 100000 steps with 7900 reset in 298 ms.
Computed a total of 11 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 22 factoid took 722 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40036 steps (40 resets) in 17 ms. (2224 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
// Phase 1: matrix 9 rows 11 cols
[2024-06-01 16:21:10] [INFO ] Computed 2 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/17 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/20 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 1 unsolved in 53 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/17 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/20 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 14 constraints, problems are : Problem set: 0 solved, 1 unsolved in 60 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1) (NOT p3) p2))), (F (NOT (AND (OR p0 p1 p2) (OR p0 p3 p2)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F p3), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (F (NOT p1))]
Knowledge based reduction with 22 factoid took 1970 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2024-06-01 16:21:13] [INFO ] Invariant cache hit.
[2024-06-01 16:21:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 16:21:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 16:21:13] [INFO ] Computed and/alt/rep : 8/10/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 16:21:13] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 16:21:13] [INFO ] Invariant cache hit.
[2024-06-01 16:21:13] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 16:21:13] [INFO ] Invariant cache hit.
[2024-06-01 16:21:13] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2024-06-01 16:21:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/19 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 8 unsolved in 153 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/19 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 21 constraints, problems are : Problem set: 0 solved, 8 unsolved in 156 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 317ms
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 11/11 places, 9/9 transitions.
Computed a total of 11 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 22 factoid took 791 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40037 steps (40 resets) in 11 ms. (3336 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-06-01 16:21:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/17 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/20 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 1 unsolved in 49 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/17 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/20 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 14 constraints, problems are : Problem set: 0 solved, 1 unsolved in 59 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1) (NOT p3) p2))), (F (NOT (AND (OR p0 p1 p2) (OR p0 p3 p2)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F p3), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (F (NOT p1))]
Knowledge based reduction with 22 factoid took 1279 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2024-06-01 16:21:16] [INFO ] Invariant cache hit.
[2024-06-01 16:21:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 16:21:16] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 16:21:16] [INFO ] Computed and/alt/rep : 8/10/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 16:21:16] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 7905 reset in 142 ms.
Product exploration explored 100000 steps with 7877 reset in 151 ms.
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 16:21:16] [INFO ] Invariant cache hit.
[2024-06-01 16:21:16] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 16:21:16] [INFO ] Invariant cache hit.
[2024-06-01 16:21:17] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2024-06-01 16:21:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/19 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 8 unsolved in 110 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/19 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 21 constraints, problems are : Problem set: 0 solved, 8 unsolved in 110 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 226ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 226ms
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 11/11 places, 9/9 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-14 finished in 8511 ms.
[2024-06-01 16:21:17] [INFO ] Flatten gal took : 4 ms
[2024-06-01 16:21:17] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 16:21:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 26 places, 18 transitions and 51 arcs took 4 ms.
Total runtime 60747 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA HouseConstruction-PT-00100-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HouseConstruction-PT-00100-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HouseConstruction-PT-00100-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HouseConstruction-PT-00100-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HouseConstruction-PT-00100-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HouseConstruction-PT-00100-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717259167479

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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 HouseConstruction-PT-00100-LTLCardinality-01
ltl formula formula --ltl=/tmp/2895/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 26 places, 18 transitions and 51 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2895/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2895/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2895/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2895/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 27 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 27, there are 26 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( 1/ 4): ~1504 levels ~10000 states ~26328 transitions
pnml2lts-mc( 1/ 4): ~1799 levels ~20000 states ~40928 transitions
pnml2lts-mc( 1/ 4): ~1799 levels ~40000 states ~70928 transitions
pnml2lts-mc( 1/ 4): ~1799 levels ~80000 states ~144824 transitions
pnml2lts-mc( 1/ 4): ~1799 levels ~160000 states ~303560 transitions
pnml2lts-mc( 1/ 4): ~1799 levels ~320000 states ~621416 transitions
pnml2lts-mc( 1/ 4): ~1799 levels ~640000 states ~1256916 transitions
pnml2lts-mc( 1/ 4): ~1799 levels ~1280000 states ~2768684 transitions
pnml2lts-mc( 3/ 4): ~1798 levels ~2560000 states ~5960756 transitions
pnml2lts-mc( 3/ 4): ~1798 levels ~5120000 states ~12245216 transitions
pnml2lts-mc( 3/ 4): ~1798 levels ~10240000 states ~24800276 transitions
pnml2lts-mc( 3/ 4): ~1798 levels ~20480000 states ~49885716 transitions
pnml2lts-mc( 3/ 4): ~1798 levels ~40960000 states ~102571324 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33531187
pnml2lts-mc( 0/ 4): unique states count: 33537808
pnml2lts-mc( 0/ 4): unique transitions count: 144461273
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 110906824
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33537925
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7198
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33537925 states 144461535 transitions, fanout: 4.307
pnml2lts-mc( 0/ 4): Total exploration time 56.350 sec (56.340 sec minimum, 56.342 sec on average)
pnml2lts-mc( 0/ 4): States per second: 595172, Transitions per second: 2563648
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 288.9MB, 9.0 B/state, compr.: 8.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/51.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 288.9MB (~256.0MB paged-in)
ltl formula name HouseConstruction-PT-00100-LTLCardinality-04
ltl formula formula --ltl=/tmp/2895/ltl_1_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 26 places, 18 transitions and 51 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2895/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2895/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2895/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2895/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 28 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 27, there are 28 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: 201
pnml2lts-mc( 0/ 4): unique states count: 201
pnml2lts-mc( 0/ 4): unique transitions count: 200
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 463
pnml2lts-mc( 0/ 4): - cum. max stack depth: 364
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 463 states 719 transitions, fanout: 1.553
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 46300, Transitions per second: 71900
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, 32.2 B/state, compr.: 29.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 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 HouseConstruction-PT-00100-LTLCardinality-07
ltl formula formula --ltl=/tmp/2895/ltl_2_
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
pnml2lts-mc( 0/ 4): Petri net has 26 places, 18 transitions and 51 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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/2895/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2895/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2895/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2895/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 28 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 27, there are 23 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( 1/ 4): ~1601 levels ~10000 states ~27684 transitions
pnml2lts-mc( 1/ 4): ~1601 levels ~20000 states ~50432 transitions
pnml2lts-mc( 1/ 4): ~1601 levels ~40000 states ~98680 transitions
pnml2lts-mc( 1/ 4): ~1601 levels ~80000 states ~204016 transitions
pnml2lts-mc( 1/ 4): ~1601 levels ~160000 states ~412720 transitions
pnml2lts-mc( 0/ 4): ~1602 levels ~320000 states ~706520 transitions
pnml2lts-mc( 0/ 4): ~1602 levels ~640000 states ~1451448 transitions
pnml2lts-mc( 0/ 4): ~1602 levels ~1280000 states ~2948064 transitions
pnml2lts-mc( 0/ 4): ~1602 levels ~2560000 states ~6001360 transitions
pnml2lts-mc( 0/ 4): ~1602 levels ~5120000 states ~12157684 transitions
pnml2lts-mc( 0/ 4): ~1602 levels ~10240000 states ~24566812 transitions
pnml2lts-mc( 0/ 4): ~1602 levels ~20480000 states ~49558620 transitions
pnml2lts-mc( 0/ 4): ~1602 levels ~40960000 states ~99796708 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33534142
pnml2lts-mc( 0/ 4): unique states count: 33540459
pnml2lts-mc( 0/ 4): unique transitions count: 121899898
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 88345502
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33540468
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6802
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33540468 states 121899917 transitions, fanout: 3.634
pnml2lts-mc( 0/ 4): Total exploration time 50.070 sec (50.060 sec minimum, 50.067 sec on average)
pnml2lts-mc( 0/ 4): States per second: 669872, Transitions per second: 2434590
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 299.3MB, 9.4 B/state, compr.: 8.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/67.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 299.3MB (~256.0MB paged-in)
ltl formula name HouseConstruction-PT-00100-LTLCardinality-11
ltl formula formula --ltl=/tmp/2895/ltl_3_
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 26 places, 18 transitions and 51 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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/2895/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2895/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2895/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2895/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 27 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 27, there are 24 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( 2/ 4): ~1801 levels ~10000 states ~24696 transitions
pnml2lts-mc( 2/ 4): ~1801 levels ~20000 states ~70980 transitions
pnml2lts-mc( 2/ 4): ~1801 levels ~40000 states ~158472 transitions
pnml2lts-mc( 2/ 4): ~1801 levels ~80000 states ~406684 transitions
pnml2lts-mc( 0/ 4): ~1797 levels ~160000 states ~576048 transitions
pnml2lts-mc( 3/ 4): ~1794 levels ~320000 states ~925336 transitions
pnml2lts-mc( 0/ 4): ~1797 levels ~640000 states ~2387956 transitions
pnml2lts-mc( 0/ 4): ~1797 levels ~1280000 states ~4829468 transitions
pnml2lts-mc( 0/ 4): ~1797 levels ~2560000 states ~9753748 transitions
pnml2lts-mc( 0/ 4): ~1797 levels ~5120000 states ~19675180 transitions
pnml2lts-mc( 0/ 4): ~1797 levels ~10240000 states ~39586344 transitions
pnml2lts-mc( 0/ 4): ~1797 levels ~20480000 states ~82255500 transitions
pnml2lts-mc( 0/ 4): ~1797 levels ~40960000 states ~181907136 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33535548
pnml2lts-mc( 0/ 4): unique states count: 33542149
pnml2lts-mc( 0/ 4): unique transitions count: 201819279
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 168271432
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33545809
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7190
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33545809 states 201844785 transitions, fanout: 6.017
pnml2lts-mc( 0/ 4): Total exploration time 67.360 sec (67.340 sec minimum, 67.345 sec on average)
pnml2lts-mc( 0/ 4): States per second: 498008, Transitions per second: 2996508
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 285.2MB, 8.9 B/state, compr.: 8.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/45.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 285.2MB (~256.0MB paged-in)
ltl formula name HouseConstruction-PT-00100-LTLCardinality-12
ltl formula formula --ltl=/tmp/2895/ltl_4_
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 26 places, 18 transitions and 51 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.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2895/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2895/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2895/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2895/ltl_4_
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 28 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 27, there are 24 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( 2/ 4): ~802 levels ~10000 states ~17624 transitions
pnml2lts-mc( 2/ 4): ~802 levels ~20000 states ~41148 transitions
pnml2lts-mc( 0/ 4): ~796 levels ~40000 states ~75000 transitions
pnml2lts-mc( 0/ 4): ~796 levels ~80000 states ~151580 transitions
pnml2lts-mc( 0/ 4): ~796 levels ~160000 states ~308028 transitions
pnml2lts-mc( 0/ 4): ~796 levels ~320000 states ~627160 transitions
pnml2lts-mc( 0/ 4): ~796 levels ~640000 states ~1253692 transitions
pnml2lts-mc( 0/ 4): ~796 levels ~1280000 states ~2512364 transitions
pnml2lts-mc( 0/ 4): ~796 levels ~2560000 states ~5643580 transitions
pnml2lts-mc( 0/ 4): ~796 levels ~5120000 states ~12252948 transitions
pnml2lts-mc( 0/ 4): ~796 levels ~10240000 states ~26492384 transitions
pnml2lts-mc( 0/ 4): ~796 levels ~20480000 states ~56356760 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33548164
pnml2lts-mc( 0/ 4): unique states count: 33550774
pnml2lts-mc( 0/ 4): unique transitions count: 99823858
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 70579137
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 34696339
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3190
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 34696339 states 106142354 transitions, fanout: 3.059
pnml2lts-mc( 0/ 4): Total exploration time 45.530 sec (45.520 sec minimum, 45.528 sec on average)
pnml2lts-mc( 0/ 4): States per second: 762054, Transitions per second: 2331262
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 273.3MB, 8.5 B/state, compr.: 7.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/26.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 273.3MB (~256.0MB paged-in)
ltl formula name HouseConstruction-PT-00100-LTLCardinality-14
ltl formula formula --ltl=/tmp/2895/ltl_5_
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
pnml2lts-mc( 0/ 4): Petri net has 26 places, 18 transitions and 51 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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( 1/ 4): LTL layer: formula: /tmp/2895/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2895/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2895/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2895/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 27 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 27, there are 28 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( 1/ 4): ~1801 levels ~10000 states ~28812 transitions
pnml2lts-mc( 1/ 4): ~1801 levels ~20000 states ~69860 transitions
pnml2lts-mc( 1/ 4): ~1801 levels ~40000 states ~164912 transitions
pnml2lts-mc( 3/ 4): ~1797 levels ~80000 states ~275844 transitions
pnml2lts-mc( 3/ 4): ~1797 levels ~160000 states ~563912 transitions
pnml2lts-mc( 3/ 4): ~1797 levels ~320000 states ~1149904 transitions
pnml2lts-mc( 3/ 4): ~1797 levels ~640000 states ~2339340 transitions
pnml2lts-mc( 3/ 4): ~1797 levels ~1280000 states ~4741972 transitions
pnml2lts-mc( 3/ 4): ~1797 levels ~2560000 states ~9600904 transitions
pnml2lts-mc( 3/ 4): ~1797 levels ~5120000 states ~19413116 transitions
pnml2lts-mc( 3/ 4): ~1797 levels ~10240000 states ~39139964 transitions
pnml2lts-mc( 3/ 4): ~1797 levels ~20480000 states ~80633736 transitions
pnml2lts-mc( 3/ 4): ~1797 levels ~40960000 states ~179825720 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33533497
pnml2lts-mc( 0/ 4): unique states count: 33540102
pnml2lts-mc( 0/ 4): unique transitions count: 199573159
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 166080620
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33572826
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7192
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33572826 states 199888717 transitions, fanout: 5.954
pnml2lts-mc( 0/ 4): Total exploration time 68.200 sec (68.190 sec minimum, 68.197 sec on average)
pnml2lts-mc( 0/ 4): States per second: 492270, Transitions per second: 2930920
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 307.3MB, 9.6 B/state, compr.: 8.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/80.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 307.3MB (~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="HouseConstruction-PT-00100"
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 HouseConstruction-PT-00100, 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 r500-smll-171649587600187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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