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.r003-smll-171620117200195.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 greatspnxred
Input is AirplaneLD-COL-0100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117200195
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.2K Apr 12 03:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 03:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 12 03:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 12 03:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 03:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 03:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 52K 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 AirplaneLD-COL-0100-LTLCardinality-00
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-01
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-02
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-03
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-04
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-05
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-06
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-07
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-08
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-09
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-10
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-11
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-12
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-13
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-14
FORMULA_NAME AirplaneLD-COL-0100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716417028221

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-COL-0100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:30:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 22:30:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:30:30] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-22 22:30:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-22 22:30:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1227 ms
[2024-05-22 22:30:31] [INFO ] Detected 3 constant HL places corresponding to 302 PT places.
[2024-05-22 22:30:31] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 719 PT places and 1212.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 22:30:31] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 6 ms.
[2024-05-22 22:30:31] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA AirplaneLD-COL-0100-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0100-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40000 steps (5026 resets) in 3219 ms. (12 steps per ms) remains 13/27 properties
BEST_FIRST walk for 40003 steps (1414 resets) in 603 ms. (66 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1394 resets) in 299 ms. (133 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1700 resets) in 247 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1344 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1346 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1565 resets) in 192 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1212 resets) in 190 ms. (209 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1593 resets) in 266 ms. (149 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1346 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1318 resets) in 108 ms. (366 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1374 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1410 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1153 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
// Phase 1: matrix 14 rows 17 cols
[2024-05-22 22:30:33] [INFO ] Computed 3 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/15 variables, 2/3 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 29/31 variables, and 18 constraints, problems are : Problem set: 13 solved, 0 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 15/17 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 376ms problems are : Problem set: 13 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
FORMULA AirplaneLD-COL-0100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:30:34] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2024-05-22 22:30:34] [INFO ] Flatten gal took : 23 ms
FORMULA AirplaneLD-COL-0100-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0100-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:30:34] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:200) in guard (OR (GEQ $A 99) (EQ $A 199))introduces in Altitude(200) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:200) in guard (AND (LT $A 99) (NEQ $A 199))introduces in Altitude(200) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 200 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 99) (EQ $A 199)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 99) (NEQ $A 199)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:100) in guard (OR (LEQ $S 49) (EQ $S 99))introduces in Speed(100) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:100) in guard (AND (GT $S 49) (NEQ $S 99))introduces in Speed(100) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:100) in guard (OR (LEQ $S 49) (EQ $S 99))introduces in Speed(100) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:100) in guard (AND (GT $S 49) (NEQ $S 99))introduces in Speed(100) partition with 2 elements
Sort wr.t. initial and guards Speed has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 100 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 49) (EQ $S 99)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 49) (NEQ $S 99)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 49) (EQ $S 99)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 49) (NEQ $S 99)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2024-05-22 22:30:34] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 45 ms.
[2024-05-22 22:30:34] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Reduce places removed 6 places and 0 transitions.
Support contains 18 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 20
Applied a total of 2 rules in 13 ms. Remains 21 /23 variables (removed 2) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 21 cols
[2024-05-22 22:30:34] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 22:30:34] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 22:30:34] [INFO ] Invariant cache hit.
[2024-05-22 22:30:34] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-22 22:30:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 2/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/37 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 4/41 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 23 constraints, problems are : Problem set: 0 solved, 10 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 2/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/37 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 4/41 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 33 constraints, problems are : Problem set: 0 solved, 10 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 449ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 450ms
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 20/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 603 ms. Remains : 21/23 places, 20/20 transitions.
Support contains 18 out of 21 places after structural reductions.
[2024-05-22 22:30:34] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:30:34] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:30:35] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 40000 steps (5031 resets) in 801 ms. (49 steps per ms) remains 4/16 properties
BEST_FIRST walk for 40003 steps (998 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (986 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (990 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (952 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
[2024-05-22 22:30:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/13 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/29 variables, 13/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 39/41 variables, and 21 constraints, problems are : Problem set: 4 solved, 0 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 7 simplifications.
Computed a total of 21 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA AirplaneLD-COL-0100-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((p0 U (G(p0)||(p0&&F(((p1 U (p2||G(p1))) U ((p3&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1)))))))))))'
Support contains 9 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 20/20 transitions.
Graph (complete) has 29 edges and 21 vertex of which 17 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 17
Applied a total of 2 rules in 15 ms. Remains 17 /21 variables (removed 4) and now considering 17/20 (removed 3) transitions.
// Phase 1: matrix 17 rows 17 cols
[2024-05-22 22:30:35] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 22:30:35] [INFO ] Implicit Places using invariants in 32 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/21 places, 17/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 51 ms. Remains : 16/21 places, 17/20 transitions.
Stuttering acceptance computed with spot in 425 ms :[(NOT p0), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AirplaneLD-COL-0100-LTLCardinality-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA AirplaneLD-COL-0100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0100-LTLCardinality-04 finished in 556 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)&&(X(p1) U (X(G(p1))||(p2&&X(p1))))))'
Support contains 8 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 20
Applied a total of 1 rules in 1 ms. Remains 20 /21 variables (removed 1) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-22 22:30:36] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 22:30:36] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 22:30:36] [INFO ] Invariant cache hit.
[2024-05-22 22:30:36] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-22 22:30:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 4/40 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 190 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 4/40 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 31 constraints, problems are : Problem set: 0 solved, 10 unsolved in 163 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 360ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 360ms
Starting structural reductions in LTL mode, iteration 1 : 20/21 places, 20/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 20/21 places, 20/20 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : AirplaneLD-COL-0100-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0100-LTLCardinality-09 finished in 641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 20/20 transitions.
Graph (complete) has 29 edges and 21 vertex of which 8 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 6 transition count 5
Applied a total of 6 rules in 6 ms. Remains 6 /21 variables (removed 15) and now considering 5/20 (removed 15) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-05-22 22:30:36] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 22:30:36] [INFO ] Implicit Places using invariants in 21 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/21 places, 5/20 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.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 3 ms. Remains 4 /5 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-22 22:30:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 22:30:37] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 22:30:37] [INFO ] Invariant cache hit.
[2024-05-22 22:30:37] [INFO ] Implicit Places using invariants and state equation in 24 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/21 places, 4/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 81 ms. Remains : 3/21 places, 4/20 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0100-LTLCardinality-11
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-COL-0100-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0100-LTLCardinality-11 finished in 174 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)||X(F(p1))))'
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 18
Applied a total of 4 rules in 1 ms. Remains 19 /21 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-22 22:30:37] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 22:30:37] [INFO ] Implicit Places using invariants in 31 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/21 places, 18/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 18/21 places, 18/20 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : AirplaneLD-COL-0100-LTLCardinality-13
Product exploration explored 100000 steps with 24914 reset in 300 ms.
Product exploration explored 100000 steps with 24861 reset in 206 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 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 p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 448 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (5025 resets) in 82 ms. (481 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (1092 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
// Phase 1: matrix 18 rows 18 cols
[2024-05-22 22:30:38] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 18/36 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[State Equation: 8/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 663 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 182 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 181 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-22 22:30:39] [INFO ] Invariant cache hit.
[2024-05-22 22:30:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-22 22:30:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:30:39] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-22 22:30:39] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 22:30:39] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (complete) has 16 edges and 18 vertex of which 14 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 12 transition count 13
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 12 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 12 transition count 11
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 8 place count 11 transition count 11
Applied a total of 8 rules in 7 ms. Remains 11 /18 variables (removed 7) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 11 cols
[2024-05-22 22:30:39] [INFO ] Computed 0 invariants in 3 ms
[2024-05-22 22:30:39] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 22:30:39] [INFO ] Invariant cache hit.
[2024-05-22 22:30:39] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/18 places, 11/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 10/18 places, 11/18 transitions.
Computed a total of 10 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 11
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 (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 793 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 268 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8193 resets) in 37 ms. (1052 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (2366 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
// Phase 1: matrix 11 rows 10 cols
[2024-05-22 22:30:40] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 11/21 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[State Equation: 5/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 1268 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 174 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-22 22:30:42] [INFO ] Invariant cache hit.
[2024-05-22 22:30:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-22 22:30:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:30:42] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 22:30:42] [INFO ] Computed and/alt/rep : 5/9/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 22:30:42] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 178 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 32666 reset in 115 ms.
Product exploration explored 100000 steps with 32785 reset in 327 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-22 22:30:43] [INFO ] Invariant cache hit.
[2024-05-22 22:30:43] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 22:30:43] [INFO ] Invariant cache hit.
[2024-05-22 22:30:43] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-22 22:30:43] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-22 22:30:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/21 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 67 ms.
Refiners :[State Equation: 10/10 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/21 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 80 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 151ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 152ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 10/10 places, 11/11 transitions.
Treatment of property AirplaneLD-COL-0100-LTLCardinality-13 finished in 6402 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(F(p0)))'
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 20 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 1 ms. Remains 20 /21 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-22 22:30:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 22:30:43] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 22:30:43] [INFO ] Invariant cache hit.
[2024-05-22 22:30:43] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-22 22:30:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/34 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 4/38 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 22 constraints, problems are : Problem set: 0 solved, 9 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/34 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 4/38 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 31 constraints, problems are : Problem set: 0 solved, 9 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 341ms
Starting structural reductions in LTL mode, iteration 1 : 20/21 places, 18/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 413 ms. Remains : 20/21 places, 18/20 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0100-LTLCardinality-14
Product exploration explored 100000 steps with 20907 reset in 286 ms.
Product exploration explored 100000 steps with 20981 reset in 158 ms.
Computed a total of 20 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 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 p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-COL-0100-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0100-LTLCardinality-14 finished in 994 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(p0))'
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 18
Applied a total of 4 rules in 1 ms. Remains 19 /21 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-22 22:30:44] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 22:30:44] [INFO ] Implicit Places using invariants in 33 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/21 places, 18/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 18/21 places, 18/20 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AirplaneLD-COL-0100-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 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 : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-COL-0100-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0100-LTLCardinality-15 finished in 325 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)||X(F(p1))))'
Found a Shortening insensitive property : AirplaneLD-COL-0100-LTLCardinality-13
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 21/21 places, 20/20 transitions.
Graph (complete) has 29 edges and 21 vertex of which 16 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 15 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 15 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 15 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 14 transition count 13
Applied a total of 6 rules in 3 ms. Remains 14 /21 variables (removed 7) and now considering 13/20 (removed 7) transitions.
// Phase 1: matrix 13 rows 14 cols
[2024-05-22 22:30:45] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 22:30:45] [INFO ] Implicit Places using invariants in 28 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/21 places, 13/20 transitions.
Graph (complete) has 11 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 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 12 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 11 transition count 11
Applied a total of 3 rules in 3 ms. Remains 11 /13 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 11 cols
[2024-05-22 22:30:45] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 22:30:45] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 22:30:45] [INFO ] Invariant cache hit.
[2024-05-22 22:30:45] [INFO ] Implicit Places using invariants and state equation in 28 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 53 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 10/21 places, 11/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 91 ms. Remains : 10/21 places, 11/20 transitions.
Running random walk in product with property : AirplaneLD-COL-0100-LTLCardinality-13
Product exploration explored 100000 steps with 32706 reset in 61 ms.
Product exploration explored 100000 steps with 32661 reset in 66 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 11
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 p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 575 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8191 resets) in 55 ms. (714 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (2367 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
// Phase 1: matrix 11 rows 10 cols
[2024-05-22 22:30:46] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 11/21 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[State Equation: 5/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 597 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 173 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-22 22:30:47] [INFO ] Invariant cache hit.
[2024-05-22 22:30:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-22 22:30:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:30:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-22 22:30:47] [INFO ] Computed and/alt/rep : 5/9/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-22 22:30:47] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-22 22:30:47] [INFO ] Invariant cache hit.
[2024-05-22 22:30:47] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 22:30:47] [INFO ] Invariant cache hit.
[2024-05-22 22:30:47] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-22 22:30:47] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-22 22:30:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/21 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 60 ms.
Refiners :[State Equation: 10/10 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/21 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 67 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 10/10 places, 11/11 transitions.
Computed a total of 10 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 11
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 (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 748 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 179 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8199 resets) in 31 ms. (1250 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (2364 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
[2024-05-22 22:30:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 11/21 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[State Equation: 5/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 1226 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 174 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-22 22:30:50] [INFO ] Invariant cache hit.
[2024-05-22 22:30:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-22 22:30:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:30:50] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-22 22:30:50] [INFO ] Computed and/alt/rep : 5/9/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-22 22:30:50] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 173 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 32722 reset in 78 ms.
Product exploration explored 100000 steps with 32743 reset in 89 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-22 22:30:50] [INFO ] Invariant cache hit.
[2024-05-22 22:30:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 22:30:50] [INFO ] Invariant cache hit.
[2024-05-22 22:30:50] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-22 22:30:50] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-22 22:30:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/21 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 65 ms.
Refiners :[State Equation: 10/10 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/21 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 59 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 10/10 places, 11/11 transitions.
Treatment of property AirplaneLD-COL-0100-LTLCardinality-13 finished in 5908 ms.
[2024-05-22 22:30:50] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:30:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-22 22:30:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21 places, 20 transitions and 50 arcs took 4 ms.
Total runtime 20798 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AirplaneLD-COL-0100

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 21
TRANSITIONS: 20
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1389
MODEL NAME: /home/mcc/execution/414/model
21 places, 20 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AirplaneLD-COL-0100-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716417052000

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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

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="AirplaneLD-COL-0100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is AirplaneLD-COL-0100, 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 r003-smll-171620117200195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-0100.tgz
mv AirplaneLD-COL-0100 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 ;