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

About the Execution of LTSMin+red for DLCround-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
764.048 196977.00 255920.00 3411.30 FFTFFFTFFTFTFTTT 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.r484-smll-171624275400139.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 DLCround-PT-04b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275400139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K Apr 13 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 13 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 547K 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 DLCround-PT-04b-LTLCardinality-00
FORMULA_NAME DLCround-PT-04b-LTLCardinality-01
FORMULA_NAME DLCround-PT-04b-LTLCardinality-02
FORMULA_NAME DLCround-PT-04b-LTLCardinality-03
FORMULA_NAME DLCround-PT-04b-LTLCardinality-04
FORMULA_NAME DLCround-PT-04b-LTLCardinality-05
FORMULA_NAME DLCround-PT-04b-LTLCardinality-06
FORMULA_NAME DLCround-PT-04b-LTLCardinality-07
FORMULA_NAME DLCround-PT-04b-LTLCardinality-08
FORMULA_NAME DLCround-PT-04b-LTLCardinality-09
FORMULA_NAME DLCround-PT-04b-LTLCardinality-10
FORMULA_NAME DLCround-PT-04b-LTLCardinality-11
FORMULA_NAME DLCround-PT-04b-LTLCardinality-12
FORMULA_NAME DLCround-PT-04b-LTLCardinality-13
FORMULA_NAME DLCround-PT-04b-LTLCardinality-14
FORMULA_NAME DLCround-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717221562989

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:59:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:59:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:59:27] [INFO ] Load time of PNML (sax parser for PT used): 465 ms
[2024-06-01 05:59:27] [INFO ] Transformed 1680 places.
[2024-06-01 05:59:27] [INFO ] Transformed 2364 transitions.
[2024-06-01 05:59:27] [INFO ] Found NUPN structural information;
[2024-06-01 05:59:27] [INFO ] Parsed PT model containing 1680 places and 2364 transitions and 6156 arcs in 756 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-04b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 1680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1680/1680 places, 2364/2364 transitions.
Discarding 286 places :
Symmetric choice reduction at 0 with 286 rule applications. Total rules 286 place count 1394 transition count 2078
Iterating global reduction 0 with 286 rules applied. Total rules applied 572 place count 1394 transition count 2078
Discarding 217 places :
Symmetric choice reduction at 0 with 217 rule applications. Total rules 789 place count 1177 transition count 1861
Iterating global reduction 0 with 217 rules applied. Total rules applied 1006 place count 1177 transition count 1861
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 1011 place count 1177 transition count 1856
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 1057 place count 1131 transition count 1779
Iterating global reduction 1 with 46 rules applied. Total rules applied 1103 place count 1131 transition count 1779
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 1135 place count 1099 transition count 1747
Iterating global reduction 1 with 32 rules applied. Total rules applied 1167 place count 1099 transition count 1747
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1170 place count 1099 transition count 1744
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1187 place count 1082 transition count 1727
Iterating global reduction 2 with 17 rules applied. Total rules applied 1204 place count 1082 transition count 1727
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1219 place count 1067 transition count 1712
Iterating global reduction 2 with 15 rules applied. Total rules applied 1234 place count 1067 transition count 1712
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1249 place count 1052 transition count 1697
Iterating global reduction 2 with 15 rules applied. Total rules applied 1264 place count 1052 transition count 1697
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1275 place count 1041 transition count 1686
Iterating global reduction 2 with 11 rules applied. Total rules applied 1286 place count 1041 transition count 1686
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1293 place count 1034 transition count 1679
Iterating global reduction 2 with 7 rules applied. Total rules applied 1300 place count 1034 transition count 1679
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1307 place count 1027 transition count 1672
Iterating global reduction 2 with 7 rules applied. Total rules applied 1314 place count 1027 transition count 1672
Applied a total of 1314 rules in 1191 ms. Remains 1027 /1680 variables (removed 653) and now considering 1672/2364 (removed 692) transitions.
// Phase 1: matrix 1672 rows 1027 cols
[2024-06-01 05:59:29] [INFO ] Computed 69 invariants in 39 ms
[2024-06-01 05:59:30] [INFO ] Implicit Places using invariants in 1036 ms returned []
[2024-06-01 05:59:30] [INFO ] Invariant cache hit.
[2024-06-01 05:59:32] [INFO ] Implicit Places using invariants and state equation in 1933 ms returned []
Implicit Place search using SMT with State Equation took 3027 ms to find 0 implicit places.
Running 1671 sub problems to find dead transitions.
[2024-06-01 05:59:32] [INFO ] Invariant cache hit.
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 1026/2699 variables, and 0 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 30135 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1027 constraints, PredecessorRefiner: 1671/1671 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/2699 variables, and 0 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1027 constraints, PredecessorRefiner: 0/1671 constraints, Known Traps: 0/0 constraints]
After SMT, in 61504ms problems are : Problem set: 0 solved, 1671 unsolved
Search for dead transitions found 0 dead transitions in 61593ms
Starting structural reductions in LTL mode, iteration 1 : 1027/1680 places, 1672/2364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65879 ms. Remains : 1027/1680 places, 1672/2364 transitions.
Support contains 15 out of 1027 places after structural reductions.
[2024-06-01 06:00:34] [INFO ] Flatten gal took : 279 ms
[2024-06-01 06:00:34] [INFO ] Flatten gal took : 129 ms
[2024-06-01 06:00:35] [INFO ] Input system was already deterministic with 1672 transitions.
Support contains 9 out of 1027 places (down from 15) after GAL structural reductions.
RANDOM walk for 33851 steps (7 resets) in 1674 ms. (20 steps per ms) remains 0/5 properties
FORMULA DLCround-PT-04b-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 137 stabilizing places and 137 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' '!(F(G(p0)))'
Support contains 2 out of 1027 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1027/1027 places, 1672/1672 transitions.
Graph (trivial) has 954 edges and 1027 vertex of which 297 / 1027 are part of one of the 24 SCC in 5 ms
Free SCC test removed 273 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 174 place count 753 transition count 1202
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 202 rules applied. Total rules applied 376 place count 580 transition count 1173
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 397 place count 561 transition count 1171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 398 place count 560 transition count 1171
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 71 Pre rules applied. Total rules applied 398 place count 560 transition count 1100
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 540 place count 489 transition count 1100
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 584 place count 445 transition count 907
Iterating global reduction 4 with 44 rules applied. Total rules applied 628 place count 445 transition count 907
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 632 place count 445 transition count 903
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 632 place count 445 transition count 898
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 642 place count 440 transition count 898
Performed 160 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 5 with 320 rules applied. Total rules applied 962 place count 280 transition count 734
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 967 place count 280 transition count 729
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 982 place count 265 transition count 621
Iterating global reduction 6 with 15 rules applied. Total rules applied 997 place count 265 transition count 621
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1012 place count 265 transition count 606
Performed 16 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1044 place count 249 transition count 699
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1048 place count 245 transition count 653
Iterating global reduction 7 with 4 rules applied. Total rules applied 1052 place count 245 transition count 653
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1073 place count 245 transition count 632
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 1096 place count 245 transition count 609
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1105 place count 236 transition count 591
Iterating global reduction 8 with 9 rules applied. Total rules applied 1114 place count 236 transition count 591
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1123 place count 227 transition count 517
Iterating global reduction 8 with 9 rules applied. Total rules applied 1132 place count 227 transition count 517
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1141 place count 227 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1142 place count 226 transition count 507
Applied a total of 1142 rules in 358 ms. Remains 226 /1027 variables (removed 801) and now considering 507/1672 (removed 1165) transitions.
[2024-06-01 06:00:36] [INFO ] Flow matrix only has 488 transitions (discarded 19 similar events)
// Phase 1: matrix 488 rows 226 cols
[2024-06-01 06:00:36] [INFO ] Computed 69 invariants in 4 ms
[2024-06-01 06:00:36] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 06:00:36] [INFO ] Flow matrix only has 488 transitions (discarded 19 similar events)
[2024-06-01 06:00:36] [INFO ] Invariant cache hit.
[2024-06-01 06:00:36] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 06:00:36] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2024-06-01 06:00:36] [INFO ] Redundant transitions in 37 ms returned []
Running 454 sub problems to find dead transitions.
[2024-06-01 06:00:36] [INFO ] Flow matrix only has 488 transitions (discarded 19 similar events)
[2024-06-01 06:00:36] [INFO ] Invariant cache hit.
[2024-06-01 06:00:36] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 487/713 variables, 226/295 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/713 variables, 32/327 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 454 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 713/714 variables, and 327 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 226/226 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 487/713 variables, 226/295 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/713 variables, 32/327 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 454/781 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 713/714 variables, and 781 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 226/226 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 60500ms
Starting structural reductions in SI_LTL mode, iteration 1 : 226/1027 places, 507/1672 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61606 ms. Remains : 226/1027 places, 507/1672 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLCardinality-08
Stuttering criterion allowed to conclude after 221 steps with 0 reset in 9 ms.
FORMULA DLCround-PT-04b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLCardinality-08 finished in 61999 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((p1 U p2))))'
Support contains 5 out of 1027 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1027/1027 places, 1672/1672 transitions.
Graph (trivial) has 947 edges and 1027 vertex of which 283 / 1027 are part of one of the 25 SCC in 2 ms
Free SCC test removed 258 places
Ensure Unique test removed 278 transitions
Reduce isomorphic transitions removed 278 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 174 place count 768 transition count 1220
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 202 rules applied. Total rules applied 376 place count 595 transition count 1191
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 397 place count 576 transition count 1189
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 399 place count 575 transition count 1188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 400 place count 574 transition count 1188
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 75 Pre rules applied. Total rules applied 400 place count 574 transition count 1113
Deduced a syphon composed of 75 places in 11 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 550 place count 499 transition count 1113
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 588 place count 461 transition count 933
Iterating global reduction 5 with 38 rules applied. Total rules applied 626 place count 461 transition count 933
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 630 place count 461 transition count 929
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 630 place count 461 transition count 927
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 634 place count 459 transition count 927
Performed 167 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 167 places in 1 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 6 with 334 rules applied. Total rules applied 968 place count 292 transition count 757
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 973 place count 292 transition count 752
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 988 place count 277 transition count 644
Iterating global reduction 7 with 15 rules applied. Total rules applied 1003 place count 277 transition count 644
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1016 place count 277 transition count 631
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 8 with 2 rules applied. Total rules applied 1018 place count 276 transition count 630
Performed 18 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1054 place count 258 transition count 733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1055 place count 258 transition count 732
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1059 place count 254 transition count 688
Iterating global reduction 9 with 4 rules applied. Total rules applied 1063 place count 254 transition count 688
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1084 place count 254 transition count 667
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 10 with 24 rules applied. Total rules applied 1108 place count 254 transition count 643
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1116 place count 246 transition count 627
Iterating global reduction 10 with 8 rules applied. Total rules applied 1124 place count 246 transition count 627
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1132 place count 238 transition count 559
Iterating global reduction 10 with 8 rules applied. Total rules applied 1140 place count 238 transition count 559
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1148 place count 238 transition count 551
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1149 place count 238 transition count 551
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1150 place count 237 transition count 550
Applied a total of 1150 rules in 363 ms. Remains 237 /1027 variables (removed 790) and now considering 550/1672 (removed 1122) transitions.
[2024-06-01 06:01:38] [INFO ] Flow matrix only has 530 transitions (discarded 20 similar events)
// Phase 1: matrix 530 rows 237 cols
[2024-06-01 06:01:38] [INFO ] Computed 69 invariants in 4 ms
[2024-06-01 06:01:38] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 06:01:38] [INFO ] Flow matrix only has 530 transitions (discarded 20 similar events)
[2024-06-01 06:01:38] [INFO ] Invariant cache hit.
[2024-06-01 06:01:38] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 06:01:38] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2024-06-01 06:01:38] [INFO ] Redundant transitions in 22 ms returned []
Running 501 sub problems to find dead transitions.
[2024-06-01 06:01:38] [INFO ] Flow matrix only has 530 transitions (discarded 20 similar events)
[2024-06-01 06:01:38] [INFO ] Invariant cache hit.
[2024-06-01 06:01:39] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 2/237 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (OVERLAPS) 529/766 variables, 237/306 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 41/347 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/767 variables, and 347 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 237/237 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 2/237 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (OVERLAPS) 529/766 variables, 237/306 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 41/347 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 501/848 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/767 variables, and 848 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 237/237 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
After SMT, in 60482ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60490ms
Starting structural reductions in SI_LTL mode, iteration 1 : 237/1027 places, 550/1672 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61729 ms. Remains : 237/1027 places, 550/1672 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : DLCround-PT-04b-LTLCardinality-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLCardinality-10 finished in 62088 ms.
All properties solved by simple procedures.
Total runtime 193050 ms.
ITS solved all properties within timeout

BK_STOP 1717221759966

--------------------
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="DLCround-PT-04b"
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 DLCround-PT-04b, 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 r484-smll-171624275400139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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