fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r180-tall-171640602600063
Last Updated
July 7, 2024

About the Execution of ITS-Tools for FlexibleBarrier-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2402.260 1920479.00 2100907.00 3489.60 TTTTFTTTTTTTTFFT 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.r180-tall-171640602600063.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 FlexibleBarrier-PT-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602600063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 07:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 07:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 374K 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 FlexibleBarrier-PT-10b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716420299241

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 23:25:00] [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-22 23:25:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:25:00] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-22 23:25:00] [INFO ] Transformed 1402 places.
[2024-05-22 23:25:00] [INFO ] Transformed 1613 transitions.
[2024-05-22 23:25:00] [INFO ] Found NUPN structural information;
[2024-05-22 23:25:00] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (534 resets) in 2427 ms. (16 steps per ms) remains 11/16 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 23:25:01] [INFO ] Flatten gal took : 335 ms
[2024-05-22 23:25:01] [INFO ] Flatten gal took : 181 ms
BEST_FIRST walk for 40003 steps (58 resets) in 771 ms. (51 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (56 resets) in 192 ms. (207 steps per ms) remains 11/11 properties
[2024-05-22 23:25:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7211414954055917857.gal : 82 ms
BEST_FIRST walk for 40004 steps (60 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (52 resets) in 193 ms. (206 steps per ms) remains 10/11 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (59 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
[2024-05-22 23:25:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12673272083742038856.prop : 10 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/ReachabilityCardinality7211414954055917857.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12673272083742038856.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...329
BEST_FIRST walk for 40004 steps (9 resets) in 898 ms. (44 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (56 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality12673272083742038856.prop.
BEST_FIRST walk for 40004 steps (59 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (60 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
// Phase 1: matrix 1613 rows 1402 cols
[2024-05-22 23:25:02] [INFO ] Computed 12 invariants in 32 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 37
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :37 after 38
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :38 after 794
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :794 after 153875
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :153875 after 4.82528e+08
At refinement iteration 2 (OVERLAPS) 1190/1402 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :4.82528e+08 after 3.28366e+14
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 1190/1414 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1402 variables, 0/1414 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1613/3015 variables, 1402/2816 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3015 variables, 0/2816 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/3015 variables, 0/2816 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3015/3015 variables, and 2816 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2393 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FlexibleBarrier-PT-10b-ReachabilityFireability-2024-06 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1190/1402 variables, 12/224 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 1190/1414 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-22 23:25:06] [INFO ] Deduced a trap composed of 469 places in 794 ms of which 73 ms to minimize.
[2024-05-22 23:25:07] [INFO ] Deduced a trap composed of 482 places in 735 ms of which 11 ms to minimize.
[2024-05-22 23:25:07] [INFO ] Deduced a trap composed of 514 places in 505 ms of which 7 ms to minimize.
[2024-05-22 23:25:08] [INFO ] Deduced a trap composed of 481 places in 530 ms of which 7 ms to minimize.
[2024-05-22 23:25:09] [INFO ] Deduced a trap composed of 449 places in 645 ms of which 6 ms to minimize.
[2024-05-22 23:25:09] [INFO ] Deduced a trap composed of 444 places in 489 ms of which 11 ms to minimize.
Problem FlexibleBarrier-PT-10b-ReachabilityFireability-2024-04 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-22 23:25:10] [INFO ] Deduced a trap composed of 442 places in 374 ms of which 5 ms to minimize.
SMT process timed out in 7890ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 186 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 1402 transition count 1411
Reduce places removed 202 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 1 with 236 rules applied. Total rules applied 438 place count 1200 transition count 1377
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 472 place count 1166 transition count 1377
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 472 place count 1166 transition count 1247
Deduced a syphon composed of 130 places in 3 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 732 place count 1036 transition count 1247
Discarding 419 places :
Symmetric choice reduction at 3 with 419 rule applications. Total rules 1151 place count 617 transition count 828
Iterating global reduction 3 with 419 rules applied. Total rules applied 1570 place count 617 transition count 828
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1571 place count 617 transition count 827
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1571 place count 617 transition count 824
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1577 place count 614 transition count 824
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 1614 place count 577 transition count 787
Iterating global reduction 4 with 37 rules applied. Total rules applied 1651 place count 577 transition count 787
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1673 place count 577 transition count 765
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 1803 place count 512 transition count 700
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1817 place count 505 transition count 700
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1819 place count 505 transition count 698
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1821 place count 503 transition count 698
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1822 place count 503 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1823 place count 502 transition count 697
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 1830 place count 502 transition count 697
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1831 place count 502 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1832 place count 501 transition count 696
Applied a total of 1832 rules in 638 ms. Remains 501 /1402 variables (removed 901) and now considering 696/1613 (removed 917) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 647 ms. Remains : 501/1402 places, 696/1613 transitions.
RANDOM walk for 40000 steps (1131 resets) in 905 ms. (44 steps per ms) remains 6/8 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (93 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (90 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (91 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (55 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (82 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (90 resets) in 278 ms. (143 steps per ms) remains 6/6 properties
[2024-05-22 23:25:11] [INFO ] Flow matrix only has 692 transitions (discarded 4 similar events)
// Phase 1: matrix 692 rows 501 cols
[2024-05-22 23:25:11] [INFO ] Computed 12 invariants in 17 ms
[2024-05-22 23:25:11] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 328/501 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 692/1193 variables, 501/513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1193 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1193 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/1193 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1193/1193 variables, and 514 constraints, problems are : Problem set: 0 solved, 6 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 501/501 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 328/501 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:25:12] [INFO ] Deduced a trap composed of 161 places in 124 ms of which 2 ms to minimize.
[2024-05-22 23:25:13] [INFO ] Deduced a trap composed of 159 places in 183 ms of which 2 ms to minimize.
Problem FlexibleBarrier-PT-10b-ReachabilityFireability-2024-07 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-22 23:25:13] [INFO ] Deduced a trap composed of 30 places in 566 ms of which 3 ms to minimize.
[2024-05-22 23:25:13] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 2 ms to minimize.
[2024-05-22 23:25:14] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2024-05-22 23:25:14] [INFO ] Deduced a trap composed of 159 places in 184 ms of which 5 ms to minimize.
[2024-05-22 23:25:14] [INFO ] Deduced a trap composed of 171 places in 372 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 7/19 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 23:25:14] [INFO ] Deduced a trap composed of 175 places in 277 ms of which 3 ms to minimize.
[2024-05-22 23:25:15] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 23:25:15] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 23:25:15] [INFO ] Deduced a trap composed of 152 places in 153 ms of which 2 ms to minimize.
[2024-05-22 23:25:15] [INFO ] Deduced a trap composed of 156 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 692/1193 variables, 501/525 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1193 variables, 1/526 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1193 variables, 5/531 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1193 variables, 0/531 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1193 variables, 0/531 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1193/1193 variables, and 531 constraints, problems are : Problem set: 1 solved, 5 unsolved in 4730 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 501/501 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 12/12 constraints]
After SMT, in 5671ms problems are : Problem set: 1 solved, 5 unsolved
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1275 ms.
Support contains 102 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 696/696 transitions.
Graph (trivial) has 167 edges and 501 vertex of which 14 / 501 are part of one of the 4 SCC in 3 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 491 transition count 668
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 477 transition count 666
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 475 transition count 666
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 33 place count 475 transition count 659
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 47 place count 468 transition count 659
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 82 place count 433 transition count 624
Iterating global reduction 3 with 35 rules applied. Total rules applied 117 place count 433 transition count 624
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 433 transition count 622
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 119 place count 433 transition count 621
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 432 transition count 621
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 123 place count 430 transition count 619
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 430 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 127 place count 430 transition count 617
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 171 place count 408 transition count 595
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 186 place count 393 transition count 580
Iterating global reduction 5 with 15 rules applied. Total rules applied 201 place count 393 transition count 580
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 216 place count 393 transition count 565
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 393 transition count 563
Free-agglomeration rule applied 60 times.
Iterating global reduction 6 with 60 rules applied. Total rules applied 278 place count 393 transition count 503
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 338 place count 333 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 345 place count 333 transition count 496
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 347 place count 333 transition count 496
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 349 place count 331 transition count 494
Applied a total of 349 rules in 194 ms. Remains 331 /501 variables (removed 170) and now considering 494/696 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 331/501 places, 494/696 transitions.
RANDOM walk for 40000 steps (1171 resets) in 389 ms. (102 steps per ms) remains 2/3 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (108 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (106 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
[2024-05-22 23:25:19] [INFO ] Flow matrix only has 485 transitions (discarded 9 similar events)
// Phase 1: matrix 485 rows 331 cols
[2024-05-22 23:25:19] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 23:25:19] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/331 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 485/816 variables, 331/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/816 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/816 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/816 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/816 variables, and 351 constraints, problems are : Problem set: 0 solved, 2 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 331/331 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/331 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 23:25:19] [INFO ] Deduced a trap composed of 136 places in 81 ms of which 2 ms to minimize.
[2024-05-22 23:25:19] [INFO ] Deduced a trap composed of 130 places in 93 ms of which 2 ms to minimize.
[2024-05-22 23:25:19] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 2 ms to minimize.
[2024-05-22 23:25:19] [INFO ] Deduced a trap composed of 132 places in 97 ms of which 2 ms to minimize.
[2024-05-22 23:25:19] [INFO ] Deduced a trap composed of 117 places in 104 ms of which 2 ms to minimize.
[2024-05-22 23:25:20] [INFO ] Deduced a trap composed of 118 places in 104 ms of which 3 ms to minimize.
[2024-05-22 23:25:20] [INFO ] Deduced a trap composed of 130 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 485/816 variables, 331/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/816 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/816 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/816 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 816/816 variables, and 360 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1418 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 331/331 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1708ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 101 out of 331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 494/494 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 0 with 1 rules applied. Total rules applied 1 place count 331 transition count 493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 330 transition count 493
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 329 transition count 492
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 329 transition count 491
Applied a total of 5 rules in 38 ms. Remains 329 /331 variables (removed 2) and now considering 491/494 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 329/331 places, 491/494 transitions.
RANDOM walk for 40000 steps (1162 resets) in 415 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (106 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (105 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 789194 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 2
Probabilistic random walk after 789194 steps, saw 171073 distinct states, run finished after 3004 ms. (steps per millisecond=262 ) properties seen :0
[2024-05-22 23:25:24] [INFO ] Flow matrix only has 482 transitions (discarded 9 similar events)
// Phase 1: matrix 482 rows 329 cols
[2024-05-22 23:25:24] [INFO ] Computed 12 invariants in 4 ms
[2024-05-22 23:25:24] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 228/329 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 482/811 variables, 329/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/811 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 811/811 variables, and 349 constraints, problems are : Problem set: 0 solved, 2 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 329/329 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 228/329 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 23:25:24] [INFO ] Deduced a trap composed of 135 places in 96 ms of which 2 ms to minimize.
[2024-05-22 23:25:24] [INFO ] Deduced a trap composed of 130 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 482/811 variables, 329/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/811 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 811/811 variables, and 353 constraints, problems are : Problem set: 0 solved, 2 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 329/329 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1176ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 145 ms.
Support contains 101 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 491/491 transitions.
Applied a total of 0 rules in 9 ms. Remains 329 /329 variables (removed 0) and now considering 491/491 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 329/329 places, 491/491 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 491/491 transitions.
Applied a total of 0 rules in 8 ms. Remains 329 /329 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2024-05-22 23:25:25] [INFO ] Flow matrix only has 482 transitions (discarded 9 similar events)
[2024-05-22 23:25:25] [INFO ] Invariant cache hit.
[2024-05-22 23:25:25] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 23:25:25] [INFO ] Flow matrix only has 482 transitions (discarded 9 similar events)
[2024-05-22 23:25:25] [INFO ] Invariant cache hit.
[2024-05-22 23:25:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 23:25:25] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-05-22 23:25:25] [INFO ] Redundant transitions in 22 ms returned []
Running 480 sub problems to find dead transitions.
[2024-05-22 23:25:25] [INFO ] Flow matrix only has 482 transitions (discarded 9 similar events)
[2024-05-22 23:25:25] [INFO ] Invariant cache hit.
[2024-05-22 23:25:25] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 4/329 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-22 23:25:32] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-22 23:25:33] [INFO ] Deduced a trap composed of 125 places in 102 ms of which 2 ms to minimize.
[2024-05-22 23:25:33] [INFO ] Deduced a trap composed of 123 places in 95 ms of which 2 ms to minimize.
[2024-05-22 23:25:33] [INFO ] Deduced a trap composed of 133 places in 91 ms of which 2 ms to minimize.
[2024-05-22 23:25:33] [INFO ] Deduced a trap composed of 130 places in 95 ms of which 2 ms to minimize.
[2024-05-22 23:25:33] [INFO ] Deduced a trap composed of 120 places in 97 ms of which 2 ms to minimize.
[2024-05-22 23:25:34] [INFO ] Deduced a trap composed of 120 places in 88 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 482/811 variables, 329/348 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-22 23:25:50] [INFO ] Deduced a trap composed of 136 places in 115 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/811 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 357 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 329/329 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (OVERLAPS) 4/329 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (OVERLAPS) 482/811 variables, 329/349 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 8/357 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/811 variables, 480/837 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/811 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 10 (OVERLAPS) 0/811 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 480 unsolved
No progress, stopping.
After SMT solving in domain Int declared 811/811 variables, and 837 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 329/329 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 8/8 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60879 ms. Remains : 329/329 places, 491/491 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 329 transition count 482
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 23 place count 315 transition count 468
Iterating global reduction 1 with 14 rules applied. Total rules applied 37 place count 315 transition count 468
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 44 place count 315 transition count 461
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 2 with 2 rules applied. Total rules applied 46 place count 314 transition count 460
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 313 transition count 459
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 313 transition count 459
Applied a total of 48 rules in 23 ms. Remains 313 /329 variables (removed 16) and now considering 459/491 (removed 32) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 459 rows 313 cols
[2024-05-22 23:26:26] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 23:26:26] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:26:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-22 23:26:26] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 23:26:27] [INFO ] Deduced a trap composed of 129 places in 647 ms of which 1 ms to minimize.
[2024-05-22 23:26:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 680 ms
[2024-05-22 23:26:27] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 1 ms to minimize.
[2024-05-22 23:26:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
TRAPS : Iteration 1
[2024-05-22 23:26:28] [INFO ] After 1445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 23:26:28] [INFO ] After 1756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 23:26:28] [INFO ] Flatten gal took : 52 ms
[2024-05-22 23:26:28] [INFO ] Flatten gal took : 36 ms
[2024-05-22 23:26:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7318851772305864749.gal : 3 ms
[2024-05-22 23:26:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18208555954466919524.prop : 1 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/ReachabilityCardinality7318851772305864749.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18208555954466919524.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...329
Loading property file /tmp/ReachabilityCardinality18208555954466919524.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :10 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 19
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :19 after 55
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :55 after 499
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :499 after 22232
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :22232 after 3.52464e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.52464e+08 after 3.57565e+08
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.57565e+08 after 3.7579e+08
Detected timeout of ITS tools.
[2024-05-22 23:26:43] [INFO ] Flatten gal took : 18 ms
[2024-05-22 23:26:43] [INFO ] Applying decomposition
[2024-05-22 23:26:43] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3737718276561526190.txt' '-o' '/tmp/graph3737718276561526190.bin' '-w' '/tmp/graph3737718276561526190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3737718276561526190.bin' '-l' '-1' '-v' '-w' '/tmp/graph3737718276561526190.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:26:43] [INFO ] Decomposing Gal with order
[2024-05-22 23:26:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:26:43] [INFO ] Removed a total of 217 redundant transitions.
[2024-05-22 23:26:43] [INFO ] Flatten gal took : 83 ms
[2024-05-22 23:26:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 16 ms.
[2024-05-22 23:26:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8221201280998611212.gal : 7 ms
[2024-05-22 23:26:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality244694884097811644.prop : 1 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/ReachabilityCardinality8221201280998611212.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality244694884097811644.prop' '--nowitness'

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 ...306
Loading property file /tmp/ReachabilityCardinality244694884097811644.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 19
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :19 after 704
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :704 after 5.29203e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5.29203e+06 after 1.44982e+07
Reachability property FlexibleBarrier-PT-10b-ReachabilityFireability-2024-00 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.44982e+07 after 4.21967e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.21967e+07 after 7.49937e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7.49937e+09 after 4.74175e+12
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32509 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 23:26:58] [INFO ] Flatten gal took : 44 ms
[2024-05-22 23:26:58] [INFO ] Applying decomposition
[2024-05-22 23:26:58] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11102204540751284504.txt' '-o' '/tmp/graph11102204540751284504.bin' '-w' '/tmp/graph11102204540751284504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11102204540751284504.bin' '-l' '-1' '-v' '-w' '/tmp/graph11102204540751284504.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:26:59] [INFO ] Decomposing Gal with order
[2024-05-22 23:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:26:59] [INFO ] Removed a total of 538 redundant transitions.
[2024-05-22 23:26:59] [INFO ] Flatten gal took : 176 ms
[2024-05-22 23:26:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 44 ms.
[2024-05-22 23:26:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9152772023838982565.gal : 44 ms
[2024-05-22 23:26:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1220958936963710108.prop : 1 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/ReachabilityCardinality9152772023838982565.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1220958936963710108.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality1220958936963710108.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 17
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :17 after 17
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :17 after 9.37798e+16
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :9.37798e+16 after 6.04712e+18
Reachability property FlexibleBarrier-PT-10b-ReachabilityFireability-2024-09 is true.
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property FlexibleBarrier-PT-10b-ReachabilityFireability-2024-00 is true.
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.17132e+19,1386.37,1634456,1.03661e+06,643,4.13406e+06,17081,2797,4.03224e+06,559,48006,0
Total reachable state count : 11713229355937049068

Verifying 2 reachability properties.
Reachability property FlexibleBarrier-PT-10b-ReachabilityFireability-2024-00 is true.

ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 1919336 ms.

BK_STOP 1716422219720

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="FlexibleBarrier-PT-10b"
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 FlexibleBarrier-PT-10b, 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 r180-tall-171640602600063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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