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

About the Execution of ITS-Tools for ASLink-PT-01b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
971.819 23765.00 67427.00 243.30 FTTFFTFTFFFTFTTF 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.r004-smll-171620117700023.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 itstools
Input is ASLink-PT-01b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117700023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 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 293K 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 ASLink-PT-01b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716216531218

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-20 14:48:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 14:48:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:48:54] [INFO ] Load time of PNML (sax parser for PT used): 461 ms
[2024-05-20 14:48:54] [INFO ] Transformed 846 places.
[2024-05-20 14:48:54] [INFO ] Transformed 1148 transitions.
[2024-05-20 14:48:54] [INFO ] Found NUPN structural information;
[2024-05-20 14:48:54] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 736 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (272 resets) in 3156 ms. (12 steps per ms) remains 9/16 properties
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (72 resets) in 847 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (67 resets) in 639 ms. (62 steps per ms) remains 9/9 properties
[2024-05-20 14:48:55] [INFO ] Flatten gal took : 573 ms
[2024-05-20 14:48:56] [INFO ] Flatten gal took : 251 ms
[2024-05-20 14:48:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12484732611743878601.gal : 148 ms
[2024-05-20 14:48:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17050747313271661371.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12484732611743878601.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17050747313271661371.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (56 resets) in 2254 ms. (17 steps per ms) remains 8/9 properties
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40002 steps (72 resets) in 609 ms. (65 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality17050747313271661371.prop.
BEST_FIRST walk for 40003 steps (69 resets) in 212 ms. (187 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (65 resets) in 313 ms. (127 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (67 resets) in 386 ms. (103 steps per ms) remains 7/8 properties
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1148 rows 846 cols
[2024-05-20 14:48:57] [INFO ] Computed 82 invariants in 73 ms
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :13 after 46
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :46 after 178
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :178 after 571
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :571 after 689
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :689 after 10045
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :10045 after 28954
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :28954 after 435646
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 214/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :435646 after 9.83056e+07
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 201/415 variables, 19/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 201/434 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem ASLink-PT-01b-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 428/843 variables, 60/496 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :9.83056e+07 after 1.00295e+08
At refinement iteration 7 (INCLUDED_ONLY) 0/843 variables, 428/924 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 0/924 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3/846 variables, 1/925 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/846 variables, 3/928 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/846 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :1.00295e+08 after 1.16726e+08
At refinement iteration 12 (OVERLAPS) 1148/1994 variables, 846/1774 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1994 variables, 0/1774 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1994 variables, 0/1774 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :1.16726e+08 after 1.59208e+08
After SMT solving in domain Real declared 1994/1994 variables, and 1774 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5045 ms.
Refiners :[Domain max(s): 846/846 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 846/846 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 186/186 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 206/392 variables, 19/205 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 206/411 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 2/413 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-20 14:49:03] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 30 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 1/414 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/414 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem ASLink-PT-01b-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01b-ReachabilityFireability-2024-14 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 451/843 variables, 60/474 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 451/925 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-20 14:49:04] [INFO ] Deduced a trap composed of 42 places in 544 ms of which 10 ms to minimize.
[2024-05-20 14:49:04] [INFO ] Deduced a trap composed of 74 places in 277 ms of which 7 ms to minimize.
[2024-05-20 14:49:05] [INFO ] Deduced a trap composed of 36 places in 417 ms of which 8 ms to minimize.
[2024-05-20 14:49:05] [INFO ] Deduced a trap composed of 214 places in 663 ms of which 11 ms to minimize.
[2024-05-20 14:49:06] [INFO ] Deduced a trap composed of 52 places in 565 ms of which 9 ms to minimize.
Problem ASLink-PT-01b-ReachabilityFireability-2024-05 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-20 14:49:06] [INFO ] Deduced a trap composed of 153 places in 335 ms of which 7 ms to minimize.
[2024-05-20 14:49:07] [INFO ] Deduced a trap composed of 58 places in 324 ms of which 4 ms to minimize.
[2024-05-20 14:49:07] [INFO ] Deduced a trap composed of 134 places in 335 ms of which 4 ms to minimize.
SMT process timed out in 10694ms, After SMT, problems are : Problem set: 3 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 78 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 846 transition count 1000
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 158 rules applied. Total rules applied 306 place count 698 transition count 990
Reduce places removed 3 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 12 rules applied. Total rules applied 318 place count 695 transition count 981
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 327 place count 686 transition count 981
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 174 Pre rules applied. Total rules applied 327 place count 686 transition count 807
Deduced a syphon composed of 174 places in 4 ms
Ensure Unique test removed 11 places
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 4 with 359 rules applied. Total rules applied 686 place count 501 transition count 807
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 690 place count 500 transition count 804
Reduce places removed 3 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 8 rules applied. Total rules applied 698 place count 497 transition count 799
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 703 place count 492 transition count 799
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 703 place count 492 transition count 795
Deduced a syphon composed of 4 places in 4 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 715 place count 484 transition count 795
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 715 place count 484 transition count 791
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 723 place count 480 transition count 791
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 744 place count 459 transition count 770
Iterating global reduction 7 with 21 rules applied. Total rules applied 765 place count 459 transition count 770
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 766 place count 459 transition count 769
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 766 place count 459 transition count 762
Deduced a syphon composed of 7 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 15 rules applied. Total rules applied 781 place count 451 transition count 762
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 781 place count 451 transition count 761
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 784 place count 449 transition count 761
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 785 place count 448 transition count 752
Iterating global reduction 8 with 1 rules applied. Total rules applied 786 place count 448 transition count 752
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 8 with 60 rules applied. Total rules applied 846 place count 418 transition count 722
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 847 place count 417 transition count 721
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 849 place count 416 transition count 721
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 850 place count 415 transition count 720
Iterating global reduction 8 with 1 rules applied. Total rules applied 851 place count 415 transition count 720
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 8 with 2 rules applied. Total rules applied 853 place count 415 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 854 place count 414 transition count 718
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 856 place count 413 transition count 727
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 859 place count 413 transition count 724
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 862 place count 410 transition count 724
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 864 place count 410 transition count 722
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 866 place count 408 transition count 722
SDD proceeding with computation,9 properties remain. new max is 65536
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 867 place count 408 transition count 722
SDD size :1.59208e+08 after 1.88343e+09
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 868 place count 407 transition count 721
Applied a total of 868 rules in 569 ms. Remains 407 /846 variables (removed 439) and now considering 721/1148 (removed 427) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 588 ms. Remains : 407/846 places, 721/1148 transitions.
RANDOM walk for 40000 steps (465 resets) in 417 ms. (95 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (170 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (144 resets) in 391 ms. (102 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (171 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 279195 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 3
Probabilistic random walk after 279195 steps, saw 86260 distinct states, run finished after 3007 ms. (steps per millisecond=92 ) properties seen :0
// Phase 1: matrix 721 rows 407 cols
[2024-05-20 14:49:11] [INFO ] Computed 63 invariants in 18 ms
[2024-05-20 14:49:11] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 126/204 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/205 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 201/406 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/407 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 721/1128 variables, 407/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1128 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1128 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1128 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1128/1128 variables, and 471 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 407/407 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 126/204 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 14:49:12] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 14:49:13] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 201/406 variables, 47/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 14:49:13] [INFO ] Deduced a trap composed of 32 places in 322 ms of which 6 ms to minimize.
[2024-05-20 14:49:13] [INFO ] Deduced a trap composed of 45 places in 244 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/407 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem ASLink-PT-01b-ReachabilityFireability-2024-04 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01b-ReachabilityFireability-2024-06 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01b-ReachabilityFireability-2024-08 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 1128/1128 variables, and 474 constraints, problems are : Problem set: 3 solved, 0 unsolved in 2085 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 407/407 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 3197ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 21478 ms.

BK_STOP 1716216554983

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ASLink-PT-01b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ASLink-PT-01b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r004-smll-171620117700023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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