fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r492-smll-171636266200131
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Echo-PT-d04r03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1887.684 3600000.00 3712962.00 11356.10 FFFF?TTTTF?T??FF normal

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.r492-smll-171636266200131.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 Echo-PT-d04r03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266200131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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 5.9K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 04:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 04:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 530K 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 Echo-PT-d04r03-LTLCardinality-00
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-01
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-02
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-03
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-04
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-05
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-06
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-07
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-08
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-09
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-10
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-11
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-12
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-13
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-14
FORMULA_NAME Echo-PT-d04r03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717212013597

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d04r03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:20:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 03:20:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:20:16] [INFO ] Load time of PNML (sax parser for PT used): 406 ms
[2024-06-01 03:20:16] [INFO ] Transformed 1019 places.
[2024-06-01 03:20:16] [INFO ] Transformed 850 transitions.
[2024-06-01 03:20:16] [INFO ] Found NUPN structural information;
[2024-06-01 03:20:16] [INFO ] Parsed PT model containing 1019 places and 850 transitions and 6340 arcs in 667 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Echo-PT-d04r03-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d04r03-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d04r03-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d04r03-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d04r03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d04r03-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 1019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1019/1019 places, 850/850 transitions.
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 941 transition count 850
Applied a total of 78 rules in 215 ms. Remains 941 /1019 variables (removed 78) and now considering 850/850 (removed 0) transitions.
// Phase 1: matrix 850 rows 941 cols
[2024-06-01 03:20:18] [INFO ] Computed 435 invariants in 1243 ms
[2024-06-01 03:20:52] [INFO ] Performed 11/941 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 03:21:28] [INFO ] Performed 52/941 implicitness test of which 0 returned IMPLICIT in 68 seconds.
[2024-06-01 03:22:05] [INFO ] Performed 96/941 implicitness test of which 0 returned IMPLICIT in 104 seconds.
[2024-06-01 03:22:39] [INFO ] Performed 122/941 implicitness test of which 0 returned IMPLICIT in 139 seconds.
[2024-06-01 03:22:39] [INFO ] Timeout of Implicit test with SMT after 139 seconds.
[2024-06-01 03:22:39] [INFO ] Implicit Places using invariants in 142253 ms returned []
[2024-06-01 03:22:39] [INFO ] Invariant cache hit.
[2024-06-01 03:25:19] [INFO ] Implicit Places using invariants and state equation in 160020 ms returned []
Implicit Place search using SMT with State Equation took 302334 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2024-06-01 03:25:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/937 variables, 189/1126 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 937/1791 variables, and 1126 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30074 ms.
Refiners :[Domain max(s): 937/941 constraints, Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 189/422 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/937 variables, 189/1126 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/937 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 3 (OVERLAPS) 3/940 variables, 13/1139 constraints. Problems are: Problem set: 0 solved, 849 unsolved
SMT process timed out in 61331ms, After SMT, problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 61381ms
Starting structural reductions in LTL mode, iteration 1 : 941/1019 places, 850/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363985 ms. Remains : 941/1019 places, 850/850 transitions.
Support contains 33 out of 941 places after structural reductions.
[2024-06-01 03:26:21] [INFO ] Flatten gal took : 361 ms
[2024-06-01 03:26:21] [INFO ] Flatten gal took : 202 ms
[2024-06-01 03:26:22] [INFO ] Input system was already deterministic with 850 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 22774 steps (138 resets) in 1546 ms. (14 steps per ms) remains 0/17 properties
Computed a total of 941 stabilizing places and 850 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 941 transition count 850
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 850/850 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 938 transition count 850
Applied a total of 3 rules in 59 ms. Remains 938 /941 variables (removed 3) and now considering 850/850 (removed 0) transitions.
// Phase 1: matrix 850 rows 938 cols
[2024-06-01 03:26:24] [INFO ] Computed 432 invariants in 1277 ms
[2024-06-01 03:27:00] [INFO ] Performed 10/938 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 03:27:33] [INFO ] Performed 23/938 implicitness test of which 0 returned IMPLICIT in 65 seconds.
[2024-06-01 03:28:05] [INFO ] Performed 25/938 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2024-06-01 03:28:38] [INFO ] Performed 28/938 implicitness test of which 0 returned IMPLICIT in 130 seconds.
[2024-06-01 03:28:38] [INFO ] Timeout of Implicit test with SMT after 130 seconds.
[2024-06-01 03:28:38] [INFO ] Implicit Places using invariants in 134721 ms returned []
[2024-06-01 03:28:38] [INFO ] Invariant cache hit.
[2024-06-01 03:29:27] [INFO ] Performed 23/938 implicitness test of which 0 returned IMPLICIT in 36 seconds.
[2024-06-01 03:29:59] [INFO ] Performed 25/938 implicitness test of which 0 returned IMPLICIT in 68 seconds.
[2024-06-01 03:30:31] [INFO ] Performed 27/938 implicitness test of which 0 returned IMPLICIT in 100 seconds.
[2024-06-01 03:31:04] [INFO ] Performed 29/938 implicitness test of which 0 returned IMPLICIT in 132 seconds.
[2024-06-01 03:31:04] [INFO ] Timeout of Implicit test with SMT after 132 seconds.
[2024-06-01 03:31:04] [INFO ] Implicit Places using invariants and state equation in 145868 ms returned []
Implicit Place search using SMT with State Equation took 280604 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2024-06-01 03:31:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30025 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30046 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 0/849 constraints, Known Traps: 0/0 constraints]
After SMT, in 61070ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 61086ms
Starting structural reductions in LTL mode, iteration 1 : 938/941 places, 850/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 341755 ms. Remains : 938/941 places, 850/850 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d04r03-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 68 steps with 0 reset in 7 ms.
FORMULA Echo-PT-d04r03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d04r03-LTLCardinality-00 finished in 342141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(F(p1))&&p0)))))'
Support contains 4 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 850/850 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 939 transition count 850
Applied a total of 2 rules in 35 ms. Remains 939 /941 variables (removed 2) and now considering 850/850 (removed 0) transitions.
// Phase 1: matrix 850 rows 939 cols
[2024-06-01 03:32:06] [INFO ] Computed 433 invariants in 1105 ms
[2024-06-01 03:32:41] [INFO ] Performed 26/939 implicitness test of which 0 returned IMPLICIT in 33 seconds.
[2024-06-01 03:33:13] [INFO ] Performed 29/939 implicitness test of which 0 returned IMPLICIT in 65 seconds.
[2024-06-01 03:33:47] [INFO ] Performed 54/939 implicitness test of which 0 returned IMPLICIT in 99 seconds.
[2024-06-01 03:34:19] [INFO ] Performed 59/939 implicitness test of which 0 returned IMPLICIT in 131 seconds.
[2024-06-01 03:34:19] [INFO ] Timeout of Implicit test with SMT after 131 seconds.
[2024-06-01 03:34:19] [INFO ] Implicit Places using invariants in 134194 ms returned []
[2024-06-01 03:34:19] [INFO ] Invariant cache hit.
[2024-06-01 03:36:59] [INFO ] Implicit Places using invariants and state equation in 160018 ms returned []
Implicit Place search using SMT with State Equation took 294216 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2024-06-01 03:36:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/937 variables, 208/1145 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 937/1789 variables, and 1145 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30024 ms.
Refiners :[Domain max(s): 937/939 constraints, Positive P Invariants (semi-flows): 0/5 constraints, Generalized P Invariants (flows): 208/428 constraints, State Equation: 0/939 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/937 variables, 208/1145 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/937 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 3 (OVERLAPS) 1/938 variables, 5/1150 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/938 variables, 1/1151 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 938/1789 variables, and 1362 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30031 ms.
Refiners :[Domain max(s): 938/939 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 419/428 constraints, State Equation: 0/939 constraints, PredecessorRefiner: 0/849 constraints, Known Traps: 0/0 constraints]
After SMT, in 60804ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60815ms
Starting structural reductions in LTL mode, iteration 1 : 939/941 places, 850/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355069 ms. Remains : 939/941 places, 850/850 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Echo-PT-d04r03-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d04r03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d04r03-LTLCardinality-01 finished in 355437 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&&G(p1)))))'
Support contains 4 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 850/850 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 938 transition count 850
Applied a total of 3 rules in 36 ms. Remains 938 /941 variables (removed 3) and now considering 850/850 (removed 0) transitions.
// Phase 1: matrix 850 rows 938 cols
[2024-06-01 03:38:02] [INFO ] Computed 432 invariants in 1101 ms
[2024-06-01 03:38:37] [INFO ] Performed 12/938 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 03:39:12] [INFO ] Performed 57/938 implicitness test of which 0 returned IMPLICIT in 67 seconds.
[2024-06-01 03:39:45] [INFO ] Performed 67/938 implicitness test of which 0 returned IMPLICIT in 101 seconds.
[2024-06-01 03:40:17] [INFO ] Performed 69/938 implicitness test of which 0 returned IMPLICIT in 133 seconds.
[2024-06-01 03:40:17] [INFO ] Timeout of Implicit test with SMT after 133 seconds.
[2024-06-01 03:40:17] [INFO ] Implicit Places using invariants in 136668 ms returned []
[2024-06-01 03:40:17] [INFO ] Invariant cache hit.
[2024-06-01 03:41:01] [INFO ] Performed 44/938 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 03:41:45] [INFO ] Performed 68/938 implicitness test of which 0 returned IMPLICIT in 74 seconds.
[2024-06-01 03:42:17] [INFO ] Performed 70/938 implicitness test of which 0 returned IMPLICIT in 106 seconds.
[2024-06-01 03:42:49] [INFO ] Performed 72/938 implicitness test of which 0 returned IMPLICIT in 138 seconds.
[2024-06-01 03:42:49] [INFO ] Timeout of Implicit test with SMT after 138 seconds.
[2024-06-01 03:42:49] [INFO ] Implicit Places using invariants and state equation in 151721 ms returned []
Implicit Place search using SMT with State Equation took 288392 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2024-06-01 03:42:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30024 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30023 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 0/849 constraints, Known Traps: 0/0 constraints]
After SMT, in 60625ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60636ms
Starting structural reductions in LTL mode, iteration 1 : 938/941 places, 850/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349070 ms. Remains : 938/941 places, 850/850 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Echo-PT-d04r03-LTLCardinality-04
Product exploration explored 100000 steps with 613 reset in 1581 ms.
Product exploration explored 100000 steps with 613 reset in 1573 ms.
Computed a total of 938 stabilizing places and 850 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 938 transition count 850
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 280 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 6627 steps (40 resets) in 341 ms. (19 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 654 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Support contains 4 out of 938 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 938/938 places, 850/850 transitions.
Applied a total of 0 rules in 111 ms. Remains 938 /938 variables (removed 0) and now considering 850/850 (removed 0) transitions.
[2024-06-01 03:43:55] [INFO ] Invariant cache hit.
[2024-06-01 03:44:31] [INFO ] Performed 24/938 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 03:45:04] [INFO ] Performed 27/938 implicitness test of which 0 returned IMPLICIT in 65 seconds.
[2024-06-01 03:45:37] [INFO ] Performed 47/938 implicitness test of which 0 returned IMPLICIT in 99 seconds.
[2024-06-01 03:46:10] [INFO ] Performed 58/938 implicitness test of which 0 returned IMPLICIT in 132 seconds.
[2024-06-01 03:46:10] [INFO ] Timeout of Implicit test with SMT after 132 seconds.
[2024-06-01 03:46:10] [INFO ] Implicit Places using invariants in 134997 ms returned []
[2024-06-01 03:46:10] [INFO ] Invariant cache hit.
[2024-06-01 03:47:09] [INFO ] Performed 45/938 implicitness test of which 0 returned IMPLICIT in 45 seconds.
[2024-06-01 03:47:41] [INFO ] Performed 47/938 implicitness test of which 0 returned IMPLICIT in 78 seconds.
[2024-06-01 03:48:13] [INFO ] Performed 49/938 implicitness test of which 0 returned IMPLICIT in 110 seconds.
[2024-06-01 03:48:45] [INFO ] Performed 51/938 implicitness test of which 0 returned IMPLICIT in 142 seconds.
[2024-06-01 03:48:45] [INFO ] Timeout of Implicit test with SMT after 142 seconds.
[2024-06-01 03:48:45] [INFO ] Implicit Places using invariants and state equation in 154973 ms returned []
Implicit Place search using SMT with State Equation took 289972 ms to find 0 implicit places.
[2024-06-01 03:48:45] [INFO ] Redundant transitions in 53 ms returned []
Running 849 sub problems to find dead transitions.
[2024-06-01 03:48:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30022 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30019 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 0/849 constraints, Known Traps: 0/0 constraints]
After SMT, in 60574ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60585ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 350733 ms. Remains : 938/938 places, 850/850 transitions.
Computed a total of 938 stabilizing places and 850 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 938 transition count 850
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 197 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 3249 steps (19 resets) in 51 ms. (62 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 617 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 1199 reset in 1615 ms.
Product exploration explored 100000 steps with 1221 reset in 1517 ms.
Support contains 4 out of 938 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 938/938 places, 850/850 transitions.
Applied a total of 0 rules in 117 ms. Remains 938 /938 variables (removed 0) and now considering 850/850 (removed 0) transitions.
[2024-06-01 03:49:51] [INFO ] Invariant cache hit.
[2024-06-01 03:50:28] [INFO ] Performed 24/938 implicitness test of which 0 returned IMPLICIT in 33 seconds.
[2024-06-01 03:51:00] [INFO ] Performed 26/938 implicitness test of which 0 returned IMPLICIT in 65 seconds.
[2024-06-01 03:51:32] [INFO ] Performed 28/938 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2024-06-01 03:52:05] [INFO ] Performed 35/938 implicitness test of which 0 returned IMPLICIT in 130 seconds.
[2024-06-01 03:52:05] [INFO ] Timeout of Implicit test with SMT after 130 seconds.
[2024-06-01 03:52:05] [INFO ] Implicit Places using invariants in 133422 ms returned []
[2024-06-01 03:52:05] [INFO ] Invariant cache hit.
[2024-06-01 03:52:48] [INFO ] Performed 44/938 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 03:53:20] [INFO ] Performed 46/938 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-06-01 03:54:05] [INFO ] Performed 67/938 implicitness test of which 0 returned IMPLICIT in 107 seconds.
[2024-06-01 03:54:45] [INFO ] Performed 74/938 implicitness test of which 0 returned IMPLICIT in 147 seconds.
[2024-06-01 03:54:45] [INFO ] Timeout of Implicit test with SMT after 147 seconds.
[2024-06-01 03:54:45] [INFO ] Implicit Places using invariants and state equation in 160009 ms returned []
Implicit Place search using SMT with State Equation took 293433 ms to find 0 implicit places.
[2024-06-01 03:54:45] [INFO ] Redundant transitions in 14 ms returned []
Running 849 sub problems to find dead transitions.
[2024-06-01 03:54:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30019 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30021 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 0/849 constraints, Known Traps: 0/0 constraints]
After SMT, in 60507ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60517ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 354091 ms. Remains : 938/938 places, 850/850 transitions.
Treatment of property Echo-PT-d04r03-LTLCardinality-04 finished in 1065221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 850/850 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 938 transition count 850
Applied a total of 3 rules in 23 ms. Remains 938 /941 variables (removed 3) and now considering 850/850 (removed 0) transitions.
[2024-06-01 03:55:46] [INFO ] Invariant cache hit.
[2024-06-01 03:56:21] [INFO ] Performed 23/938 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 03:56:53] [INFO ] Performed 25/938 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 03:57:27] [INFO ] Performed 43/938 implicitness test of which 0 returned IMPLICIT in 98 seconds.
[2024-06-01 03:57:59] [INFO ] Performed 45/938 implicitness test of which 0 returned IMPLICIT in 130 seconds.
[2024-06-01 03:57:59] [INFO ] Timeout of Implicit test with SMT after 130 seconds.
[2024-06-01 03:57:59] [INFO ] Implicit Places using invariants in 133420 ms returned []
[2024-06-01 03:57:59] [INFO ] Invariant cache hit.
[2024-06-01 03:58:54] [INFO ] Performed 38/938 implicitness test of which 0 returned IMPLICIT in 42 seconds.
[2024-06-01 03:59:35] [INFO ] Performed 57/938 implicitness test of which 0 returned IMPLICIT in 82 seconds.
[2024-06-01 04:00:07] [INFO ] Performed 60/938 implicitness test of which 0 returned IMPLICIT in 115 seconds.
[2024-06-01 04:00:39] [INFO ] Performed 62/938 implicitness test of which 0 returned IMPLICIT in 146 seconds.
[2024-06-01 04:00:39] [INFO ] Timeout of Implicit test with SMT after 146 seconds.
[2024-06-01 04:00:39] [INFO ] Implicit Places using invariants and state equation in 160018 ms returned []
Implicit Place search using SMT with State Equation took 293439 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2024-06-01 04:00:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30024 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30019 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 0/849 constraints, Known Traps: 0/0 constraints]
After SMT, in 60675ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60685ms
Starting structural reductions in LTL mode, iteration 1 : 938/941 places, 850/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354149 ms. Remains : 938/941 places, 850/850 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Echo-PT-d04r03-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 734 ms.
Product exploration explored 100000 steps with 50000 reset in 572 ms.
Computed a total of 938 stabilizing places and 850 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 938 transition count 850
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d04r03-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d04r03-LTLCardinality-06 finished in 356113 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(p1)||p0)))'
Support contains 2 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 850/850 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 938 transition count 850
Applied a total of 3 rules in 29 ms. Remains 938 /941 variables (removed 3) and now considering 850/850 (removed 0) transitions.
[2024-06-01 04:01:42] [INFO ] Invariant cache hit.
[2024-06-01 04:02:18] [INFO ] Performed 22/938 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 04:02:50] [INFO ] Performed 24/938 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 04:03:22] [INFO ] Performed 29/938 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2024-06-01 04:03:56] [INFO ] Performed 52/938 implicitness test of which 0 returned IMPLICIT in 131 seconds.
[2024-06-01 04:03:56] [INFO ] Timeout of Implicit test with SMT after 131 seconds.
[2024-06-01 04:03:56] [INFO ] Implicit Places using invariants in 134530 ms returned []
[2024-06-01 04:03:56] [INFO ] Invariant cache hit.
[2024-06-01 04:04:46] [INFO ] Performed 23/938 implicitness test of which 0 returned IMPLICIT in 36 seconds.
[2024-06-01 04:05:21] [INFO ] Performed 27/938 implicitness test of which 0 returned IMPLICIT in 71 seconds.
[2024-06-01 04:05:54] [INFO ] Performed 68/938 implicitness test of which 0 returned IMPLICIT in 104 seconds.
[2024-06-01 04:06:24] [INFO ] Performed 106/938 implicitness test of which 0 returned IMPLICIT in 135 seconds.
[2024-06-01 04:06:24] [INFO ] Timeout of Implicit test with SMT after 135 seconds.
[2024-06-01 04:06:24] [INFO ] Implicit Places using invariants and state equation in 148144 ms returned []
Implicit Place search using SMT with State Equation took 282676 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2024-06-01 04:06:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30023 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30021 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 0/849 constraints, Known Traps: 0/0 constraints]
After SMT, in 60523ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
Starting structural reductions in LTL mode, iteration 1 : 938/941 places, 850/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343244 ms. Remains : 938/941 places, 850/850 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d04r03-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 699 ms.
Product exploration explored 100000 steps with 50000 reset in 636 ms.
Computed a total of 938 stabilizing places and 850 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 938 transition count 850
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d04r03-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d04r03-LTLCardinality-07 finished in 345192 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(p1) U G(p2))&&p0) U X(X(p2))))'
Support contains 7 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 850/850 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 938 transition count 850
Applied a total of 3 rules in 16 ms. Remains 938 /941 variables (removed 3) and now considering 850/850 (removed 0) transitions.
[2024-06-01 04:07:27] [INFO ] Invariant cache hit.
[2024-06-01 04:08:03] [INFO ] Performed 23/938 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 04:08:35] [INFO ] Performed 28/938 implicitness test of which 0 returned IMPLICIT in 65 seconds.
[2024-06-01 04:09:10] [INFO ] Performed 62/938 implicitness test of which 0 returned IMPLICIT in 99 seconds.
[2024-06-01 04:09:43] [INFO ] Performed 68/938 implicitness test of which 0 returned IMPLICIT in 133 seconds.
[2024-06-01 04:09:43] [INFO ] Timeout of Implicit test with SMT after 133 seconds.
[2024-06-01 04:09:43] [INFO ] Implicit Places using invariants in 136162 ms returned []
[2024-06-01 04:09:43] [INFO ] Invariant cache hit.
[2024-06-01 04:10:34] [INFO ] Performed 24/938 implicitness test of which 0 returned IMPLICIT in 38 seconds.
[2024-06-01 04:11:20] [INFO ] Performed 49/938 implicitness test of which 0 returned IMPLICIT in 84 seconds.
[2024-06-01 04:12:00] [INFO ] Performed 66/938 implicitness test of which 0 returned IMPLICIT in 124 seconds.
[2024-06-01 04:12:00] [INFO ] Timeout of Implicit test with SMT after 124 seconds.
[2024-06-01 04:12:00] [INFO ] Implicit Places using invariants and state equation in 136829 ms returned []
Implicit Place search using SMT with State Equation took 272993 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2024-06-01 04:12:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30048 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 937/1788 variables, and 1360 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30022 ms.
Refiners :[Domain max(s): 937/938 constraints, Generalized P Invariants (flows): 423/432 constraints, State Equation: 0/938 constraints, PredecessorRefiner: 0/849 constraints, Known Traps: 0/0 constraints]
After SMT, in 60607ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60616ms
Starting structural reductions in LTL mode, iteration 1 : 938/941 places, 850/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 333628 ms. Remains : 938/941 places, 850/850 transitions.
Stuttering acceptance computed with spot in 611 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : Echo-PT-d04r03-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 640 ms.
Product exploration explored 100000 steps with 33333 reset in 726 ms.
Computed a total of 938 stabilizing places and 850 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 938 transition count 850
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p2)), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 25 ms. Reduced automaton from 12 states, 26 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d04r03-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d04r03-LTLCardinality-08 finished in 336312 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 U (F(p1)&&X(X(p0)))))))'
Support contains 4 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 850/850 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 939 transition count 850
Applied a total of 2 rules in 14 ms. Remains 939 /941 variables (removed 2) and now considering 850/850 (removed 0) transitions.
// Phase 1: matrix 850 rows 939 cols
[2024-06-01 04:13:04] [INFO ] Computed 433 invariants in 1047 ms
[2024-06-01 04:13:40] [INFO ] Performed 24/939 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 04:14:14] [INFO ] Performed 51/939 implicitness test of which 0 returned IMPLICIT in 66 seconds.
[2024-06-01 04:14:47] [INFO ] Performed 59/939 implicitness test of which 0 returned IMPLICIT in 99 seconds.
[2024-06-01 04:15:19] [INFO ] Performed 64/939 implicitness test of which 0 returned IMPLICIT in 131 seconds.
[2024-06-01 04:15:19] [INFO ] Timeout of Implicit test with SMT after 131 seconds.
[2024-06-01 04:15:19] [INFO ] Implicit Places using invariants in 135739 ms returned []
[2024-06-01 04:15:19] [INFO ] Invariant cache hit.
[2024-06-01 04:17:59] [INFO ] Implicit Places using invariants and state equation in 160020 ms returned []
Implicit Place search using SMT with State Equation took 295762 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2024-06-01 04:17:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/937 variables, 127/1064 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 (/ 1.0 3.0))
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)timeout

(s229 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 937/1789 variables, and 1064 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30031 ms.
Refiners :[Domain max(s): 937/939 constraints, Positive P Invariants (semi-flows): 0/6 constraints, Generalized P Invariants (flows): 127/427 constraints, State Equation: 0/939 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/937 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/937 variables, 127/1064 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/937 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 3 (OVERLAPS) 1/938 variables, 6/1070 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/938 variables, 1/1071 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 938/1789 variables, and 1362 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30036 ms.
Refiners :[Domain max(s): 938/939 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 418/427 constraints, State Equation: 0/939 constraints, PredecessorRefiner: 0/849 constraints, Known Traps: 0/0 constraints]
After SMT, in 60583ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60592ms
Starting structural reductions in LTL mode, iteration 1 : 939/941 places, 850/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356371 ms. Remains : 939/941 places, 850/850 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : Echo-PT-d04r03-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d04r03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d04r03-LTLCardinality-09 finished in 356675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 941/941 places, 850/850 transitions.
Graph (complete) has 3625 edges and 941 vertex of which 929 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.10 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 140 ms. Remains 928 /941 variables (removed 13) and now considering 848/850 (removed 2) transitions.
// Phase 1: matrix 848 rows 928 cols
[2024-06-01 04:19:01] [INFO ] Computed 424 invariants in 887 ms
[2024-06-01 04:19:38] [INFO ] Performed 34/928 implicitness test of which 0 returned IMPLICIT in 34 seconds.
[2024-06-01 04:20:12] [INFO ] Performed 60/928 implicitness test of which 0 returned IMPLICIT in 68 seconds.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d04r03.tgz
mv Echo-PT-d04r03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;