Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 156K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 13 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C05M04P03D02-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717286961828

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C05M04P03D02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 00:09:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 00:09:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 00:09:24] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2024-06-02 00:09:24] [INFO ] Transformed 111 places.
[2024-06-02 00:09:24] [INFO ] Transformed 45 transitions.
[2024-06-02 00:09:24] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 467 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 18 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 89 transition count 45
Applied a total of 22 rules in 52 ms. Remains 89 /111 variables (removed 22) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 89 cols
[2024-06-02 00:09:25] [INFO ] Computed 45 invariants in 30 ms
[2024-06-02 00:09:25] [INFO ] Implicit Places using invariants in 596 ms returned [12, 22, 26, 39]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 669 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/111 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 763 ms. Remains : 85/111 places, 45/45 transitions.
Support contains 47 out of 85 places after structural reductions.
[2024-06-02 00:09:26] [INFO ] Flatten gal took : 52 ms
[2024-06-02 00:09:26] [INFO ] Flatten gal took : 22 ms
[2024-06-02 00:09:26] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 46 out of 85 places (down from 47) after GAL structural reductions.
RANDOM walk for 632 steps (0 resets) in 272 ms. (2 steps per ms) remains 0/17 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(!p0) U X(p1)))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 65 transition count 45
Applied a total of 20 rules in 6 ms. Remains 65 /85 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-06-02 00:09:26] [INFO ] Computed 21 invariants in 2 ms
[2024-06-02 00:09:26] [INFO ] Implicit Places using invariants in 133 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/85 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 64/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 560 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 142 steps with 0 reset in 5 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-00 finished in 838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 18 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 64 transition count 45
Applied a total of 21 rules in 5 ms. Remains 64 /85 variables (removed 21) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-06-02 00:09:27] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 00:09:27] [INFO ] Implicit Places using invariants in 96 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/85 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 63/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-01 finished in 306 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)||X(F((!p0&&F(!p1)))))))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 65 transition count 45
Applied a total of 20 rules in 4 ms. Remains 65 /85 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-06-02 00:09:27] [INFO ] Computed 21 invariants in 3 ms
[2024-06-02 00:09:27] [INFO ] Implicit Places using invariants in 123 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/85 places, 45/45 transitions.
Applied a total of 0 rules in 6 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 64/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 269 ms :[p1, (OR p0 p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-04
Product exploration explored 100000 steps with 1317 reset in 665 ms.
Product exploration explored 100000 steps with 1311 reset in 248 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 144 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 1258 steps (0 resets) in 134 ms. (9 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 380 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 209 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-06-02 00:09:30] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 00:09:30] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 00:09:30] [INFO ] Invariant cache hit.
[2024-06-02 00:09:30] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-02 00:09:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/109 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 84 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1519 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/109 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 44/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 128 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1050 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 2623ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2639ms
Finished structural reductions in LTL mode , in 1 iterations and 2956 ms. Remains : 64/64 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 1072 steps (0 resets) in 24 ms. (42 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 206 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 201 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 1316 reset in 220 ms.
Product exploration explored 100000 steps with 1314 reset in 299 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 221 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 45
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 9 place count 64 transition count 45
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 24 place count 64 transition count 45
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 64 transition count 45
Deduced a syphon composed of 28 places in 1 ms
Applied a total of 28 rules in 40 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-02 00:09:35] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-06-02 00:09:35] [INFO ] Computed 20 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-02 00:09:36] [INFO ] Deduced a trap composed of 1 places in 53 ms of which 16 ms to minimize.
[2024-06-02 00:09:36] [INFO ] Deduced a trap composed of 1 places in 33 ms of which 2 ms to minimize.
[2024-06-02 00:09:36] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 2 ms to minimize.
[2024-06-02 00:09:36] [INFO ] Deduced a trap composed of 1 places in 27 ms of which 3 ms to minimize.
[2024-06-02 00:09:36] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 3 ms to minimize.
[2024-06-02 00:09:36] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-02 00:09:36] [INFO ] Deduced a trap composed of 1 places in 32 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-02 00:09:36] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-02 00:09:36] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-02 00:09:36] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-02 00:09:36] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-02 00:09:36] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 12/28 constraints. Problems are: Problem set: 11 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/28 constraints. Problems are: Problem set: 11 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 4/32 constraints. Problems are: Problem set: 11 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 11 solved, 33 unsolved
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 6 (OVERLAPS) 45/109 variables, 64/96 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/96 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/96 constraints. Problems are: Problem set: 28 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 96 constraints, problems are : Problem set: 28 solved, 16 unsolved in 1188 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 28 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 2/3 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 11/14 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 13/46 variables, 12/26 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/26 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 17/63 variables, 4/30 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/30 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/31 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 1/32 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 45/109 variables, 64/96 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/109 variables, 16/112 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/109 variables, 0/112 constraints. Problems are: Problem set: 28 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 0/109 variables, 0/112 constraints. Problems are: Problem set: 28 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 112 constraints, problems are : Problem set: 28 solved, 16 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/44 constraints, Known Traps: 12/12 constraints]
After SMT, in 1630ms problems are : Problem set: 28 solved, 16 unsolved
Search for dead transitions found 28 dead transitions in 1634ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 64/64 places, 17/45 transitions.
Graph (complete) has 74 edges and 64 vertex of which 36 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 0 output transitions
Reduce places removed 11 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 24 transition count 17
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 24 transition count 17
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 24 transition count 17
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 19 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 19 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 19 transition count 12
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 18 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 18 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 25 rules in 20 ms. Remains 18 /64 variables (removed 46) and now considering 11/17 (removed 6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/64 places, 11/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1709 ms. Remains : 18/64 places, 11/45 transitions.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-06-02 00:09:37] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 00:09:37] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 00:09:37] [INFO ] Invariant cache hit.
[2024-06-02 00:09:37] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-02 00:09:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/109 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 84 constraints, problems are : Problem set: 0 solved, 44 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/109 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 44/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 128 constraints, problems are : Problem set: 0 solved, 44 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1913ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1914ms
Finished structural reductions in LTL mode , in 1 iterations and 2091 ms. Remains : 64/64 places, 45/45 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-04 finished in 11703 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' '!((!p0 U (p1||G(!p0))))'
Support contains 6 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 66 transition count 37
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 23 rules applied. Total rules applied 35 place count 52 transition count 28
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 45 place count 43 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 42 transition count 27
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 46 place count 42 transition count 19
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 66 place count 30 transition count 19
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 4 with 1 rules applied. Total rules applied 67 place count 30 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 68 place count 29 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 68 place count 29 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 74 place count 26 transition count 15
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 89 place count 17 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 90 place count 16 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 90 place count 16 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 93 place count 14 transition count 8
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 7 with 1 rules applied. Total rules applied 94 place count 14 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 96 place count 12 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 96 place count 12 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 98 place count 11 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 100 place count 10 transition count 5
Applied a total of 100 rules in 18 ms. Remains 10 /85 variables (removed 75) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 10 cols
[2024-06-02 00:09:39] [INFO ] Computed 6 invariants in 0 ms
[2024-06-02 00:09:39] [INFO ] Implicit Places using invariants in 27 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/85 places, 5/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47 ms. Remains : 9/85 places, 5/45 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (AND (NOT p1) p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-05 finished in 553 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 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 18 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 64 transition count 45
Applied a total of 21 rules in 6 ms. Remains 64 /85 variables (removed 21) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-06-02 00:09:40] [INFO ] Computed 20 invariants in 9 ms
[2024-06-02 00:09:40] [INFO ] Implicit Places using invariants in 101 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/85 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 63/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-06 finished in 246 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 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 18 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 63 transition count 45
Applied a total of 22 rules in 3 ms. Remains 63 /85 variables (removed 22) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2024-06-02 00:09:40] [INFO ] Computed 19 invariants in 1 ms
[2024-06-02 00:09:40] [INFO ] Implicit Places using invariants in 76 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/85 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 62/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-08
Product exploration explored 100000 steps with 956 reset in 282 ms.
Product exploration explored 100000 steps with 952 reset in 366 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 386 steps (0 resets) in 5 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 62 cols
[2024-06-02 00:09:41] [INFO ] Computed 18 invariants in 1 ms
[2024-06-02 00:09:41] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-02 00:09:41] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-02 00:09:41] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 00:09:41] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-02 00:09:41] [INFO ] Added : 32 causal constraints over 7 iterations in 112 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 62 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 36 place count 47 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 48 place count 35 transition count 24
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 48 place count 35 transition count 15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 69 place count 23 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 23 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 20 transition count 12
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 91 place count 10 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 92 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 95 place count 7 transition count 5
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 4 with 1 rules applied. Total rules applied 96 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 98 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 98 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 100 place count 4 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 103 place count 2 transition count 2
Applied a total of 103 rules in 24 ms. Remains 2 /62 variables (removed 60) and now considering 2/45 (removed 43) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-02 00:09:41] [INFO ] Computed 1 invariants in 1 ms
[2024-06-02 00:09:41] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-02 00:09:41] [INFO ] Invariant cache hit.
[2024-06-02 00:09:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-02 00:09:42] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-02 00:09:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 76ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/62 places, 2/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 2/62 places, 2/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-08 finished in 1872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 67 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 23 rules applied. Total rules applied 34 place count 54 transition count 27
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 44 place count 44 transition count 27
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 44 place count 44 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 65 place count 32 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 65 place count 32 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 69 place count 30 transition count 16
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 84 place count 21 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 18 transition count 8
Applied a total of 89 rules in 12 ms. Remains 18 /85 variables (removed 67) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 18 cols
[2024-06-02 00:09:42] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 00:09:42] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 00:09:42] [INFO ] Invariant cache hit.
[2024-06-02 00:09:42] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-06-02 00:09:42] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-02 00:09:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/18 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8/26 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 29 constraints, problems are : Problem set: 0 solved, 7 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/18 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8/26 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/26 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 36 constraints, problems are : Problem set: 0 solved, 7 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 333ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 333ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/85 places, 8/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 459 ms. Remains : 18/85 places, 8/45 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 311 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-09 finished in 943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 18 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 64 transition count 38
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 21 rules applied. Total rules applied 31 place count 52 transition count 29
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 40 place count 43 transition count 29
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 40 place count 43 transition count 20
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 61 place count 31 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 61 place count 31 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 67 place count 28 transition count 17
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 83 place count 18 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 17 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 84 place count 17 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 89 place count 14 transition count 9
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 4 with 1 rules applied. Total rules applied 90 place count 14 transition count 8
Reduce places removed 2 places and 0 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 5 with 3 rules applied. Total rules applied 93 place count 12 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 94 place count 11 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 96 place count 10 transition count 6
Applied a total of 96 rules in 12 ms. Remains 10 /85 variables (removed 75) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 10 cols
[2024-06-02 00:09:43] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 00:09:43] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 00:09:43] [INFO ] Invariant cache hit.
[2024-06-02 00:09:43] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-02 00:09:43] [INFO ] Redundant transitions in 1 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-02 00:09:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/16 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, 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/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/16 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 205ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/85 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 10/85 places, 6/45 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-10
Product exploration explored 100000 steps with 5405 reset in 150 ms.
Product exploration explored 100000 steps with 5369 reset in 378 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 148 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 265 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-02 00:09:45] [INFO ] Invariant cache hit.
[2024-06-02 00:09:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 00:09:45] [INFO ] Invariant cache hit.
[2024-06-02 00:09:45] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-02 00:09:45] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-02 00:09:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/16 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, 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/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/16 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 240ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 10/10 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 39 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 275 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 5396 reset in 154 ms.
Product exploration explored 100000 steps with 5339 reset in 163 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-02 00:09:46] [INFO ] Invariant cache hit.
[2024-06-02 00:09:46] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 00:09:46] [INFO ] Invariant cache hit.
[2024-06-02 00:09:46] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-02 00:09:46] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-02 00:09:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/16 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, 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/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/16 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 209ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 210ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 10/10 places, 6/6 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-10 finished in 4047 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&&X(F(p1))))))'
Support contains 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 68 transition count 45
Applied a total of 17 rules in 1 ms. Remains 68 /85 variables (removed 17) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 68 cols
[2024-06-02 00:09:47] [INFO ] Computed 24 invariants in 1 ms
[2024-06-02 00:09:47] [INFO ] Implicit Places using invariants in 82 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/85 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 67/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-11
Product exploration explored 100000 steps with 2824 reset in 220 ms.
Product exploration explored 100000 steps with 2830 reset in 237 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 146 steps (0 resets) in 4 ms. (29 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 45 rows 67 cols
[2024-06-02 00:09:48] [INFO ] Computed 23 invariants in 1 ms
[2024-06-02 00:09:48] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-02 00:09:48] [INFO ] [Real]Absence check using 16 positive and 7 generalized place invariants in 5 ms returned sat
[2024-06-02 00:09:48] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 00:09:48] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-02 00:09:48] [INFO ] Added : 11 causal constraints over 3 iterations in 53 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-02 00:09:48] [INFO ] Invariant cache hit.
[2024-06-02 00:09:48] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-06-02 00:09:48] [INFO ] [Real]Absence check using 16 positive and 7 generalized place invariants in 5 ms returned sat
[2024-06-02 00:09:48] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 00:09:48] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-02 00:09:48] [INFO ] Added : 11 causal constraints over 3 iterations in 45 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-02 00:09:48] [INFO ] Invariant cache hit.
[2024-06-02 00:09:49] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 00:09:49] [INFO ] Invariant cache hit.
[2024-06-02 00:09:49] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-02 00:09:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/112 variables, 67/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 90 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1333 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/112 variables, 67/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 134 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1374 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 2717ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2718ms
Finished structural reductions in LTL mode , in 1 iterations and 2912 ms. Remains : 67/67 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 169 steps (0 resets) in 4 ms. (33 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-02 00:09:52] [INFO ] Invariant cache hit.
[2024-06-02 00:09:52] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-06-02 00:09:52] [INFO ] [Real]Absence check using 16 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-02 00:09:52] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 00:09:52] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-02 00:09:52] [INFO ] Added : 11 causal constraints over 3 iterations in 35 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-02 00:09:52] [INFO ] Invariant cache hit.
[2024-06-02 00:09:52] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-02 00:09:52] [INFO ] [Real]Absence check using 16 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-02 00:09:52] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-06-02 00:09:52] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-02 00:09:52] [INFO ] Added : 11 causal constraints over 3 iterations in 34 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2819 reset in 135 ms.
Product exploration explored 100000 steps with 2832 reset in 159 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 67 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 7 place count 67 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 21 place count 67 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 67 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 66 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 66 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 30 rules in 7 ms. Remains 66 /67 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2024-06-02 00:09:53] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 66 cols
[2024-06-02 00:09:53] [INFO ] Computed 23 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-02 00:09:53] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-02 00:09:53] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2024-06-02 00:09:53] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2024-06-02 00:09:53] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-02 00:09:53] [INFO ] Deduced a trap composed of 1 places in 27 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-02 00:09:53] [INFO ] Deduced a trap composed of 1 places in 30 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-02 00:09:53] [INFO ] Deduced a trap composed of 1 places in 51 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-02 00:09:53] [INFO ] Deduced a trap composed of 1 places in 33 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-02 00:09:53] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
[2024-06-02 00:09:53] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 10/32 constraints. Problems are: Problem set: 10 solved, 33 unsolved
[2024-06-02 00:09:54] [INFO ] Deduced a trap composed of 1 places in 29 ms of which 1 ms to minimize.
[2024-06-02 00:09:54] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/34 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/34 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/35 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/35 constraints. Problems are: Problem set: 11 solved, 32 unsolved
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 7 (OVERLAPS) 44/110 variables, 66/101 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/101 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/110 variables, 0/101 constraints. Problems are: Problem set: 27 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 101 constraints, problems are : Problem set: 27 solved, 16 unsolved in 1210 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 27 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 5/6 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 11/17 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 29/65 variables, 14/31 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/33 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 1/35 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/35 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 44/110 variables, 66/101 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 16/117 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/117 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/110 variables, 0/117 constraints. Problems are: Problem set: 27 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 117 constraints, problems are : Problem set: 27 solved, 16 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 16/43 constraints, Known Traps: 12/12 constraints]
After SMT, in 1589ms problems are : Problem set: 27 solved, 16 unsolved
Search for dead transitions found 27 dead transitions in 1590ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 17/45 transitions.
Graph (complete) has 80 edges and 66 vertex of which 39 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 0 output transitions
Reduce places removed 11 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 6 place count 27 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 27 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 27 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 26 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 26 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 13 rules in 6 ms. Remains 26 /66 variables (removed 40) and now considering 16/17 (removed 1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/67 places, 16/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1610 ms. Remains : 26/67 places, 16/45 transitions.
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2024-06-02 00:09:54] [INFO ] Computed 23 invariants in 1 ms
[2024-06-02 00:09:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 00:09:55] [INFO ] Invariant cache hit.
[2024-06-02 00:09:55] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-02 00:09:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/112 variables, 67/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 90 constraints, problems are : Problem set: 0 solved, 44 unsolved in 893 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/112 variables, 67/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 134 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1922ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1925ms
Finished structural reductions in LTL mode , in 1 iterations and 2051 ms. Remains : 67/67 places, 45/45 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-11 finished in 9973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((X(G(p2))&&p1)))))'
Support contains 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 66 transition count 40
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 13 rules applied. Total rules applied 21 place count 58 transition count 35
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 26 place count 53 transition count 35
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 26 place count 53 transition count 23
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 54 place count 37 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 54 place count 37 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 34 transition count 20
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 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 78 place count 23 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 22 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 22 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 82 place count 20 transition count 12
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 4 with 1 rules applied. Total rules applied 83 place count 20 transition count 11
Reduce places removed 2 places and 0 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 5 with 3 rules applied. Total rules applied 86 place count 18 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 87 place count 17 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 92 place count 14 transition count 8
Applied a total of 92 rules in 9 ms. Remains 14 /85 variables (removed 71) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 14 cols
[2024-06-02 00:09:57] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 00:09:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 00:09:57] [INFO ] Invariant cache hit.
[2024-06-02 00:09:57] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-02 00:09:57] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-02 00:09:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8/22 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 21 constraints, problems are : Problem set: 0 solved, 7 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8/22 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 28 constraints, problems are : Problem set: 0 solved, 7 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 236ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/85 places, 8/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 14/85 places, 8/45 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 120 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-12 finished in 581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 66 transition count 37
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 25 rules applied. Total rules applied 37 place count 52 transition count 26
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 49 place count 41 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 40 transition count 25
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 50 place count 40 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 70 place count 28 transition count 17
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 4 with 1 rules applied. Total rules applied 71 place count 28 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 72 place count 27 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 72 place count 27 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 78 place count 24 transition count 13
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 11 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 96 place count 13 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 98 place count 12 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 99 place count 11 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 99 place count 11 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 102 place count 9 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 102 place count 9 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 105 place count 7 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 108 place count 5 transition count 2
Applied a total of 108 rules in 5 ms. Remains 5 /85 variables (removed 80) and now considering 2/45 (removed 43) transitions.
// Phase 1: matrix 2 rows 5 cols
[2024-06-02 00:09:57] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 00:09:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 00:09:57] [INFO ] Invariant cache hit.
[2024-06-02 00:09:57] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-02 00:09:57] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-02 00:09:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 10 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 60ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/85 places, 2/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 5/85 places, 2/45 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 91 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-13 finished in 260 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)||X(F((!p0&&F(!p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(F(p1))))))'
Found a Shortening insensitive property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-11
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 68 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 17 rules applied. Total rules applied 28 place count 57 transition count 32
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 35 place count 51 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 50 transition count 31
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 36 place count 50 transition count 20
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 27 rules applied. Total rules applied 63 place count 34 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 63 place count 34 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 69 place count 31 transition count 17
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 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 87 place count 20 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 19 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 88 place count 19 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 91 place count 17 transition count 9
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 5 with 1 rules applied. Total rules applied 92 place count 17 transition count 8
Reduce places removed 2 places and 0 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 6 with 3 rules applied. Total rules applied 95 place count 15 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 97 place count 14 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 98 place count 13 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 101 place count 11 transition count 5
Applied a total of 101 rules in 23 ms. Remains 11 /85 variables (removed 74) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 11 cols
[2024-06-02 00:09:58] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 00:09:58] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-02 00:09:58] [INFO ] Invariant cache hit.
[2024-06-02 00:09:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-06-02 00:09:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/16 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 4 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/16 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 22 constraints, problems are : Problem set: 0 solved, 4 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 172ms
Starting structural reductions in LI_LTL mode, iteration 1 : 11/85 places, 5/45 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 256 ms. Remains : 11/85 places, 5/45 transitions.
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-11
Product exploration explored 100000 steps with 12694 reset in 138 ms.
Product exploration explored 100000 steps with 12665 reset in 160 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 35 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1)]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-02 00:09:59] [INFO ] Invariant cache hit.
[2024-06-02 00:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 00:09:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-02 00:09:59] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-02 00:09:59] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 11 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-02 00:09:59] [INFO ] Invariant cache hit.
[2024-06-02 00:09:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-02 00:09:59] [INFO ] Invariant cache hit.
[2024-06-02 00:09:59] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-06-02 00:09:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/16 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 4 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/16 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 22 constraints, problems are : Problem set: 0 solved, 4 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 166ms
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 11/11 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 38 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 120 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 133 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-02 00:10:00] [INFO ] Invariant cache hit.
[2024-06-02 00:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 00:10:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-02 00:10:00] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-02 00:10:00] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 12653 reset in 115 ms.
Product exploration explored 100000 steps with 12649 reset in 136 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 5/5 transitions.
Ensure Unique test removed 5 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 6 /11 variables (removed 5) and now considering 5/5 (removed 0) transitions.
[2024-06-02 00:10:01] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-06-02 00:10:01] [INFO ] Computed 2 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 00:10:01] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem TDEAD3 is UNSAT
At refinement iteration 5 (OVERLAPS) 5/11 variables, 6/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/11 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 9 constraints, problems are : Problem set: 2 solved, 2 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/11 variables, 6/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/11 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 11 constraints, problems are : Problem set: 2 solved, 2 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 140ms problems are : Problem set: 2 solved, 2 unsolved
Search for dead transitions found 2 dead transitions in 141ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 6/11 places, 3/5 transitions.
Graph (complete) has 6 edges and 6 vertex of which 4 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 3 /6 variables (removed 3) and now considering 3/3 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/11 places, 3/5 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 3/11 places, 3/5 transitions.
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 5/5 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 6 transition count 5
Applied a total of 5 rules in 0 ms. Remains 6 /11 variables (removed 5) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-06-02 00:10:01] [INFO ] Computed 2 invariants in 1 ms
[2024-06-02 00:10:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-02 00:10:01] [INFO ] Invariant cache hit.
[2024-06-02 00:10:01] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-06-02 00:10:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Starting structural reductions in LTL mode, iteration 1 : 6/11 places, 5/5 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 6/11 places, 5/5 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-11 finished in 3701 ms.
[2024-06-02 00:10:01] [INFO ] Flatten gal took : 10 ms
[2024-06-02 00:10:01] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-02 00:10:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 45 transitions and 170 arcs took 2 ms.
Total runtime 37863 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : IOTPpurchase-PT-C05M04P03D02-LTLFireability-10
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717287030972

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name IOTPpurchase-PT-C05M04P03D02-LTLFireability-04
ltl formula formula --ltl=/tmp/1687/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 85 places, 45 transitions and 170 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1687/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1687/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1687/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1687/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 87 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 86, there are 53 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~99 levels ~10000 states ~19372 transitions
pnml2lts-mc( 3/ 4): ~100 levels ~20000 states ~61940 transitions
pnml2lts-mc( 3/ 4): ~100 levels ~40000 states ~134320 transitions
pnml2lts-mc( 3/ 4): ~100 levels ~80000 states ~285892 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 65926
pnml2lts-mc( 0/ 4): unique states count: 65926
pnml2lts-mc( 0/ 4): unique transitions count: 220748
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 187590
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 83967
pnml2lts-mc( 0/ 4): - cum. max stack depth: 393
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 83967 states 296214 transitions, fanout: 3.528
pnml2lts-mc( 0/ 4): Total exploration time 0.680 sec (0.680 sec minimum, 0.680 sec on average)
pnml2lts-mc( 0/ 4): States per second: 123481, Transitions per second: 435609
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.3MB, 20.7 B/state, compr.: 6.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 45 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.3MB (~256.0MB paged-in)
ltl formula name IOTPpurchase-PT-C05M04P03D02-LTLFireability-10
ltl formula formula --ltl=/tmp/1687/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 85 places, 45 transitions and 170 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1687/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1687/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1687/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1687/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 87 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 86, there are 54 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~287 levels ~10000 states ~29944 transitions
pnml2lts-mc( 0/ 4): ~287 levels ~20000 states ~66284 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~40000 states ~93592 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~80000 states ~196804 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~160000 states ~421532 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~320000 states ~878456 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~640000 states ~1833128 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~1280000 states ~3713880 transitions
pnml2lts-mc( 2/ 4): ~224 levels ~2560000 states ~9338064 transitions
pnml2lts-mc( 2/ 4): ~224 levels ~5120000 states ~21224820 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8087026
pnml2lts-mc( 0/ 4): unique states count: 8104714
pnml2lts-mc( 0/ 4): unique transitions count: 62245599
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 54031419
pnml2lts-mc( 0/ 4): - claim found count: 23028
pnml2lts-mc( 0/ 4): - claim success count: 8104778
pnml2lts-mc( 0/ 4): - cum. max stack depth: 17788
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8104778 states 62245936 transitions, fanout: 7.680
pnml2lts-mc( 0/ 4): Total exploration time 27.390 sec (27.370 sec minimum, 27.378 sec on average)
pnml2lts-mc( 0/ 4): States per second: 295903, Transitions per second: 2272579
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 126.1MB, 16.2 B/state, compr.: 4.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 24.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 45 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 126.1MB (~256.0MB paged-in)
ltl formula name IOTPpurchase-PT-C05M04P03D02-LTLFireability-11
ltl formula formula --ltl=/tmp/1687/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 85 places, 45 transitions and 170 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1687/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1687/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1687/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1687/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 87 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 86, there are 56 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3825
pnml2lts-mc( 0/ 4): unique states count: 3825
pnml2lts-mc( 0/ 4): unique transitions count: 11638
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 8055
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4097
pnml2lts-mc( 0/ 4): - cum. max stack depth: 191
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4097 states 12814 transitions, fanout: 3.128
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 81940, Transitions per second: 256280
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 19.2 B/state, compr.: 5.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 45 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IOTPpurchase-PT-C05M04P03D02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is IOTPpurchase-PT-C05M04P03D02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r500-smll-171649588100380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C05M04P03D02.tgz
mv IOTPpurchase-PT-C05M04P03D02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;