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.r025-smll-171620165900091.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 AutoFlight-PT-03a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620165900091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 22:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 12 22:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 22:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 22:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 23K 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 AutoFlight-PT-03a-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-03a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716270710668

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-03a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 05:51:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 05:51:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 05:51:53] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-05-21 05:51:53] [INFO ] Transformed 82 places.
[2024-05-21 05:51:53] [INFO ] Transformed 80 transitions.
[2024-05-21 05:51:53] [INFO ] Found NUPN structural information;
[2024-05-21 05:51:53] [INFO ] Parsed PT model containing 82 places and 80 transitions and 260 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 15 transitions
Reduce redundant transitions removed 15 transitions.
FORMULA AutoFlight-PT-03a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 65/65 transitions.
Applied a total of 0 rules in 27 ms. Remains 82 /82 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 82 cols
[2024-05-21 05:51:53] [INFO ] Computed 22 invariants in 21 ms
[2024-05-21 05:51:54] [INFO ] Implicit Places using invariants in 565 ms returned [7, 14, 21, 24, 30, 47, 61, 67, 73, 79, 81]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 655 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/82 places, 65/65 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 68 transition count 62
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 68 transition count 62
Applied a total of 6 rules in 20 ms. Remains 68 /71 variables (removed 3) and now considering 62/65 (removed 3) transitions.
// Phase 1: matrix 62 rows 68 cols
[2024-05-21 05:51:54] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 05:51:54] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 05:51:54] [INFO ] Invariant cache hit.
[2024-05-21 05:51:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 05:51:54] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 68/82 places, 62/65 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1002 ms. Remains : 68/82 places, 62/65 transitions.
Support contains 21 out of 68 places after structural reductions.
[2024-05-21 05:51:54] [INFO ] Flatten gal took : 50 ms
[2024-05-21 05:51:54] [INFO ] Flatten gal took : 24 ms
[2024-05-21 05:51:55] [INFO ] Input system was already deterministic with 62 transitions.
RANDOM walk for 40000 steps (1469 resets) in 1966 ms. (20 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40000 steps (8 resets) in 468 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 323 ms. (123 steps per ms) remains 2/2 properties
[2024-05-21 05:51:55] [INFO ] Invariant cache hit.
[2024-05-21 05:51:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 42/44 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 24/68 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/130 variables, 68/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 80 constraints, problems are : Problem set: 1 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Int declared 44/130 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 2/11 constraints, State Equation: 0/68 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA AutoFlight-PT-03a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 66 transition count 43
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 48 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 47 transition count 42
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 39 place count 47 transition count 38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 50 place count 40 transition count 38
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 3 with 2 rules applied. Total rules applied 52 place count 40 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 54 place count 38 transition count 36
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 55 place count 37 transition count 35
Iterating global reduction 5 with 1 rules applied. Total rules applied 56 place count 37 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 72 place count 29 transition count 27
Applied a total of 72 rules in 37 ms. Remains 29 /68 variables (removed 39) and now considering 27/62 (removed 35) transitions.
// Phase 1: matrix 27 rows 29 cols
[2024-05-21 05:51:56] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 05:51:56] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 05:51:56] [INFO ] Invariant cache hit.
[2024-05-21 05:51:56] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-21 05:51:56] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-21 05:51:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 27/56 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 36 constraints, problems are : Problem set: 0 solved, 16 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 27/56 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 52 constraints, problems are : Problem set: 0 solved, 16 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 785ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 787ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/68 places, 27/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 944 ms. Remains : 29/68 places, 27/62 transitions.
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLCardinality-00
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-03a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLCardinality-00 finished in 1371 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((F(p1)&&p0)))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 67 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 66 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 66 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 59
Applied a total of 6 rules in 17 ms. Remains 65 /68 variables (removed 3) and now considering 59/62 (removed 3) transitions.
// Phase 1: matrix 59 rows 65 cols
[2024-05-21 05:51:57] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 05:51:57] [INFO ] Implicit Places using invariants in 88 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 59/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 64 /64 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 64/68 places, 59/62 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLCardinality-01 finished in 388 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))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 66 transition count 42
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 47 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 46 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 41 place count 46 transition count 37
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 52 place count 39 transition count 37
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 3 with 3 rules applied. Total rules applied 55 place count 39 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 58 place count 36 transition count 34
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 59 place count 35 transition count 33
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 35 transition count 33
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 76 place count 27 transition count 25
Applied a total of 76 rules in 23 ms. Remains 27 /68 variables (removed 41) and now considering 25/62 (removed 37) transitions.
// Phase 1: matrix 25 rows 27 cols
[2024-05-21 05:51:58] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 05:51:58] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 05:51:58] [INFO ] Invariant cache hit.
[2024-05-21 05:51:58] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-21 05:51:58] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-21 05:51:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 25/52 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 34 constraints, problems are : Problem set: 0 solved, 14 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 25/52 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 48 constraints, problems are : Problem set: 0 solved, 14 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 766ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 767ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/68 places, 25/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 937 ms. Remains : 27/68 places, 25/62 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLCardinality-03
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLCardinality-03 finished in 1006 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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 62/62 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 68 transition count 42
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 48 transition count 42
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 40 place count 48 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 45 transition count 39
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 43 transition count 37
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 43 transition count 37
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 64 place count 36 transition count 30
Applied a total of 64 rules in 15 ms. Remains 36 /68 variables (removed 32) and now considering 30/62 (removed 32) transitions.
// Phase 1: matrix 30 rows 36 cols
[2024-05-21 05:51:59] [INFO ] Computed 11 invariants in 0 ms
[2024-05-21 05:51:59] [INFO ] Implicit Places using invariants in 61 ms returned [14, 15, 16, 17]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/68 places, 30/62 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 32 transition count 27
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 7 place count 29 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 28 transition count 26
Applied a total of 8 rules in 5 ms. Remains 28 /32 variables (removed 4) and now considering 26/30 (removed 4) transitions.
// Phase 1: matrix 26 rows 28 cols
[2024-05-21 05:51:59] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 05:51:59] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 05:51:59] [INFO ] Invariant cache hit.
[2024-05-21 05:51:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 05:51:59] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/68 places, 26/62 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 213 ms. Remains : 28/68 places, 26/62 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLCardinality-05
Product exploration explored 100000 steps with 6809 reset in 611 ms.
Stack based approach found an accepted trace after 44 steps with 3 reset with depth 17 and stack size 17 in 1 ms.
FORMULA AutoFlight-PT-03a-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03a-LTLCardinality-05 finished in 899 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 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 62/62 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 66 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 66 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 64 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 64 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 63 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 63 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 62 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 62 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 61 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 61 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 53
Applied a total of 18 rules in 22 ms. Remains 59 /68 variables (removed 9) and now considering 53/62 (removed 9) transitions.
// Phase 1: matrix 53 rows 59 cols
[2024-05-21 05:52:00] [INFO ] Computed 11 invariants in 1 ms
[2024-05-21 05:52:00] [INFO ] Implicit Places using invariants in 65 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/68 places, 53/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 58/68 places, 53/62 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLCardinality-11 finished in 182 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))))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 62/62 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 66 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 66 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 64 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 64 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 63 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 63 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 62 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 62 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 61 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 61 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 58 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 58 transition count 52
Applied a total of 20 rules in 9 ms. Remains 58 /68 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 58 cols
[2024-05-21 05:52:00] [INFO ] Computed 11 invariants in 1 ms
[2024-05-21 05:52:00] [INFO ] Implicit Places using invariants in 48 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/68 places, 52/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 57/68 places, 52/62 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLCardinality-12
Product exploration explored 100000 steps with 11878 reset in 238 ms.
Product exploration explored 100000 steps with 11857 reset in 228 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 134 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 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 22 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 160 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 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 52 rows 57 cols
[2024-05-21 05:52:01] [INFO ] Computed 10 invariants in 5 ms
[2024-05-21 05:52:01] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 05:52:01] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-21 05:52:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 05:52:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 05:52:01] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-21 05:52:01] [INFO ] Computed and/alt/rep : 51/102/51 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-21 05:52:02] [INFO ] Added : 51 causal constraints over 11 iterations in 164 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-21 05:52:02] [INFO ] Invariant cache hit.
[2024-05-21 05:52:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 05:52:02] [INFO ] Invariant cache hit.
[2024-05-21 05:52:02] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 51 sub problems to find dead transitions.
[2024-05-21 05:52:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 52/109 variables, 57/67 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 0/109 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 67 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 52/109 variables, 57/67 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 51/118 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 118 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1355 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 2706ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2709ms
Finished structural reductions in LTL mode , in 1 iterations and 3066 ms. Remains : 57/57 places, 52/52 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 159 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 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 27 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 180 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 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 05:52:05] [INFO ] Invariant cache hit.
[2024-05-21 05:52:05] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 05:52:06] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 05:52:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 05:52:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 05:52:06] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 05:52:06] [INFO ] Computed and/alt/rep : 51/102/51 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-21 05:52:06] [INFO ] Added : 51 causal constraints over 11 iterations in 151 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11853 reset in 200 ms.
Product exploration explored 100000 steps with 11921 reset in 239 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 57 transition count 52
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 13 place count 57 transition count 52
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 57 transition count 52
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 23 place count 49 transition count 44
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 49 transition count 44
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 49 transition count 44
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 45 transition count 40
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 45 transition count 40
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 48 rules in 17 ms. Remains 45 /57 variables (removed 12) and now considering 40/52 (removed 12) transitions.
[2024-05-21 05:52:07] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
// Phase 1: matrix 40 rows 45 cols
[2024-05-21 05:52:07] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 05:52:07] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 05:52:07] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 8 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 05:52:07] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 05:52:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 05:52:07] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-21 05:52:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-21 05:52:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-21 05:52:08] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-21 05:52:08] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-05-21 05:52:08] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/19 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/19 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 40/85 variables, 45/64 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 8/72 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/72 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/72 constraints. Problems are: Problem set: 12 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 72 constraints, problems are : Problem set: 12 solved, 27 unsolved in 1297 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 45/45 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 12 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 13/45 variables, 10/10 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/19 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/19 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 40/85 variables, 45/64 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 8/72 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 27/99 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/99 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/85 variables, 0/99 constraints. Problems are: Problem set: 12 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 99 constraints, problems are : Problem set: 12 solved, 27 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 45/45 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 27/39 constraints, Known Traps: 9/9 constraints]
After SMT, in 2107ms problems are : Problem set: 12 solved, 27 unsolved
Search for dead transitions found 12 dead transitions in 2110ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 45/57 places, 28/52 transitions.
Graph (complete) has 82 edges and 45 vertex of which 33 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 33 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 10 ms. Remains 33 /45 variables (removed 12) and now considering 52/28 (removed -24) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/57 places, 52/52 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2147 ms. Remains : 33/57 places, 52/52 transitions.
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 57 cols
[2024-05-21 05:52:09] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 05:52:09] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 05:52:09] [INFO ] Invariant cache hit.
[2024-05-21 05:52:09] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 51 sub problems to find dead transitions.
[2024-05-21 05:52:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 52/109 variables, 57/67 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 0/109 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 67 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 52/109 variables, 57/67 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 51/118 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 118 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1373 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 2630ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2635ms
Finished structural reductions in LTL mode , in 1 iterations and 2836 ms. Remains : 57/57 places, 52/52 transitions.
Treatment of property AutoFlight-PT-03a-LTLCardinality-12 finished in 12267 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(((p1 U (G(p1)||(p1&&G(p2))))&&p0)))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 66 transition count 42
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 47 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 46 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 41 place count 46 transition count 37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 52 place count 39 transition count 37
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 3 with 2 rules applied. Total rules applied 54 place count 39 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 56 place count 37 transition count 35
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 57 place count 36 transition count 34
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 36 transition count 34
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 72 place count 29 transition count 27
Applied a total of 72 rules in 12 ms. Remains 29 /68 variables (removed 39) and now considering 27/62 (removed 35) transitions.
// Phase 1: matrix 27 rows 29 cols
[2024-05-21 05:52:12] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 05:52:12] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 05:52:12] [INFO ] Invariant cache hit.
[2024-05-21 05:52:12] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-21 05:52:12] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-21 05:52:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 05:52:12] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 27/56 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 27/56 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 53 constraints, problems are : Problem set: 0 solved, 16 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 755ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 756ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/68 places, 27/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 892 ms. Remains : 29/68 places, 27/62 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-03a-LTLCardinality-14
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLCardinality-14 finished in 1166 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))))'
Found a Shortening insensitive property : AutoFlight-PT-03a-LTLCardinality-12
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 68/68 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 66 transition count 39
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 44 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 45 place count 44 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 51 place count 40 transition count 37
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 2 with 2 rules applied. Total rules applied 53 place count 40 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 38 transition count 35
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 57 place count 36 transition count 33
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 36 transition count 33
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 75 place count 28 transition count 25
Applied a total of 75 rules in 14 ms. Remains 28 /68 variables (removed 40) and now considering 25/62 (removed 37) transitions.
// Phase 1: matrix 25 rows 28 cols
[2024-05-21 05:52:13] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 05:52:13] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 05:52:13] [INFO ] Invariant cache hit.
[2024-05-21 05:52:14] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 13 sub problems to find dead transitions.
[2024-05-21 05:52:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 25/53 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/53 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 36 constraints, problems are : Problem set: 0 solved, 13 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 25/53 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 49 constraints, problems are : Problem set: 0 solved, 13 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 493ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 494ms
Starting structural reductions in LI_LTL mode, iteration 1 : 28/68 places, 25/62 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 640 ms. Remains : 28/68 places, 25/62 transitions.
Running random walk in product with property : AutoFlight-PT-03a-LTLCardinality-12
Product exploration explored 100000 steps with 15884 reset in 161 ms.
Stack based approach found an accepted trace after 16777 steps with 2668 reset with depth 16 and stack size 16 in 33 ms.
Treatment of property AutoFlight-PT-03a-LTLCardinality-12 finished in 1185 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-21 05:52:14] [INFO ] Flatten gal took : 11 ms
[2024-05-21 05:52:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-21 05:52:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 62 transitions and 166 arcs took 8 ms.
Total runtime 22021 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutoFlight-PT-03a

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/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: 984
MODEL NAME: /home/mcc/execution/413/model
68 places, 62 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutoFlight-PT-03a-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716270736115

--------------------
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="AutoFlight-PT-03a"
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 AutoFlight-PT-03a, 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 r025-smll-171620165900091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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