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.r158-smll-171636266300190.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 EisenbergMcGuire-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300190
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K 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 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-01
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2023-06
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-12
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-13
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2023-14
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716546707984

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-24 10:31:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 10:31:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 10:31:51] [INFO ] Load time of PNML (sax parser for PT used): 525 ms
[2024-05-24 10:31:51] [INFO ] Transformed 712 places.
[2024-05-24 10:31:51] [INFO ] Transformed 2816 transitions.
[2024-05-24 10:31:51] [INFO ] Found NUPN structural information;
[2024-05-24 10:31:51] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 964 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3515 ms. (11 steps per ms) remains 9/16 properties
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 455 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 9/9 properties
[2024-05-24 10:31:53] [INFO ] Flatten gal took : 705 ms
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1109 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 9/9 properties
[2024-05-24 10:31:54] [INFO ] Flatten gal took : 476 ms
[2024-05-24 10:31:54] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2024-05-24 10:31:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17414009479498009258.gal : 119 ms
[2024-05-24 10:31:54] [INFO ] Computed 25 invariants in 88 ms
[2024-05-24 10:31:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6654123590628021575.prop : 3 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/ReachabilityCardinality17414009479498009258.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6654123590628021575.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
[2024-05-24 10:31:54] [INFO ] State equation strengthened by 676 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality6654123590628021575.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 615/696 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/696 variables, 615/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/696 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 16/712 variables, 8/721 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 16/737 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/712 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1368/2080 variables, 712/1449 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2080 variables, 676/2125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2080 variables, 0/2125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
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 8
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :11 after 15
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :15 after 19
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :19 after 21
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :21 after 105
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :105 after 207
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :207 after 310
At refinement iteration 11 (OVERLAPS) 0/2080 variables, 0/2125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2080/2080 variables, and 2125 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3632 ms.
Refiners :[Domain max(s): 712/712 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 712/712 constraints, ReadFeed: 676/676 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :310 after 1665
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 615/696 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/696 variables, 615/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/696 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 16/712 variables, 8/721 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 16/737 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :1665 after 4094
[2024-05-24 10:32:00] [INFO ] Deduced a trap composed of 66 places in 808 ms of which 71 ms to minimize.
[2024-05-24 10:32:00] [INFO ] Deduced a trap composed of 3 places in 415 ms of which 5 ms to minimize.
[2024-05-24 10:32:01] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 4 ms to minimize.
[2024-05-24 10:32:01] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 5 ms to minimize.
[2024-05-24 10:32:01] [INFO ] Deduced a trap composed of 83 places in 346 ms of which 5 ms to minimize.
[2024-05-24 10:32:02] [INFO ] Deduced a trap composed of 96 places in 273 ms of which 4 ms to minimize.
[2024-05-24 10:32:02] [INFO ] Deduced a trap composed of 3 places in 608 ms of which 7 ms to minimize.
[2024-05-24 10:32:03] [INFO ] Deduced a trap composed of 17 places in 675 ms of which 7 ms to minimize.
SMT process timed out in 9340ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 16 place count 704 transition count 2654
Deduced a syphon composed of 154 places in 5 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 324 place count 550 transition count 2654
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 376 place count 498 transition count 2238
Iterating global reduction 2 with 52 rules applied. Total rules applied 428 place count 498 transition count 2238
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 510 place count 457 transition count 2197
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :4094 after 26729
Applied a total of 510 rules in 447 ms. Remains 457 /712 variables (removed 255) and now considering 2197/2816 (removed 619) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 457/712 places, 2197/2816 transitions.
RANDOM walk for 40000 steps (8 resets) in 1037 ms. (38 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 149157 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :6 out of 9
Probabilistic random walk after 149157 steps, saw 97787 distinct states, run finished after 3012 ms. (steps per millisecond=49 ) properties seen :6
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2023-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-24 10:32:07] [INFO ] Flow matrix only has 749 transitions (discarded 1448 similar events)
// Phase 1: matrix 749 rows 457 cols
[2024-05-24 10:32:07] [INFO ] Computed 25 invariants in 19 ms
[2024-05-24 10:32:07] [INFO ] State equation strengthened by 312 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 386/441 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/457 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 749/1206 variables, 457/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 312/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1206 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1206 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 794 constraints, problems are : Problem set: 0 solved, 3 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 457/457 constraints, ReadFeed: 312/312 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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 386/441 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/457 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 10:32:09] [INFO ] Deduced a trap composed of 3 places in 762 ms of which 8 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :26729 after 55494
[2024-05-24 10:32:10] [INFO ] Deduced a trap composed of 3 places in 687 ms of which 8 ms to minimize.
[2024-05-24 10:32:11] [INFO ] Deduced a trap composed of 20 places in 622 ms of which 6 ms to minimize.
[2024-05-24 10:32:11] [INFO ] Deduced a trap composed of 76 places in 579 ms of which 6 ms to minimize.
[2024-05-24 10:32:12] [INFO ] Deduced a trap composed of 24 places in 554 ms of which 6 ms to minimize.
[2024-05-24 10:32:12] [INFO ] Deduced a trap composed of 26 places in 483 ms of which 5 ms to minimize.
[2024-05-24 10:32:13] [INFO ] Deduced a trap composed of 66 places in 395 ms of which 5 ms to minimize.
[2024-05-24 10:32:13] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 3 ms to minimize.
[2024-05-24 10:32:13] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-05-24 10:32:14] [INFO ] Deduced a trap composed of 43 places in 588 ms of which 6 ms to minimize.
[2024-05-24 10:32:14] [INFO ] Deduced a trap composed of 3 places in 515 ms of which 4 ms to minimize.
[2024-05-24 10:32:14] [INFO ] Deduced a trap composed of 15 places in 444 ms of which 7 ms to minimize.
[2024-05-24 10:32:15] [INFO ] Deduced a trap composed of 34 places in 360 ms of which 3 ms to minimize.
[2024-05-24 10:32:15] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 2 ms to minimize.
[2024-05-24 10:32:15] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 2 ms to minimize.
[2024-05-24 10:32:16] [INFO ] Deduced a trap composed of 34 places in 383 ms of which 4 ms to minimize.
[2024-05-24 10:32:16] [INFO ] Deduced a trap composed of 55 places in 338 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 749/1206 variables, 457/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1206 variables, 312/811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1206 variables, 3/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 10:32:17] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1206 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1206 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 10:32:18] [INFO ] Deduced a trap composed of 102 places in 488 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/1206 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1206 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1206 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 816 constraints, problems are : Problem set: 0 solved, 3 unsolved in 10710 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 457/457 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 19/19 constraints]
After SMT, in 11651ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 909 ms.
Support contains 55 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 2197/2197 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 457 transition count 2181
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 441 transition count 2181
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 439 transition count 2179
Applied a total of 36 rules in 147 ms. Remains 439 /457 variables (removed 18) and now considering 2179/2197 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 439/457 places, 2179/2197 transitions.
RANDOM walk for 40000 steps (8 resets) in 264 ms. (150 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 183015 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 3
Probabilistic random walk after 183015 steps, saw 116479 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-24 10:32:23] [INFO ] Flow matrix only has 731 transitions (discarded 1448 similar events)
// Phase 1: matrix 731 rows 439 cols
[2024-05-24 10:32:23] [INFO ] Computed 25 invariants in 9 ms
[2024-05-24 10:32:23] [INFO ] State equation strengthened by 312 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 368/423 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 731/1170 variables, 439/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1170 variables, 312/776 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :55494 after 136542
At refinement iteration 7 (INCLUDED_ONLY) 0/1170 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1170 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 776 constraints, problems are : Problem set: 0 solved, 3 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 312/312 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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 368/423 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 10:32:25] [INFO ] Deduced a trap composed of 15 places in 507 ms of which 5 ms to minimize.
[2024-05-24 10:32:25] [INFO ] Deduced a trap composed of 3 places in 487 ms of which 6 ms to minimize.
[2024-05-24 10:32:26] [INFO ] Deduced a trap composed of 25 places in 535 ms of which 6 ms to minimize.
[2024-05-24 10:32:26] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-24 10:32:27] [INFO ] Deduced a trap composed of 3 places in 597 ms of which 6 ms to minimize.
[2024-05-24 10:32:27] [INFO ] Deduced a trap composed of 49 places in 505 ms of which 6 ms to minimize.
[2024-05-24 10:32:28] [INFO ] Deduced a trap composed of 3 places in 660 ms of which 7 ms to minimize.
[2024-05-24 10:32:28] [INFO ] Deduced a trap composed of 117 places in 636 ms of which 12 ms to minimize.
[2024-05-24 10:32:29] [INFO ] Deduced a trap composed of 86 places in 630 ms of which 7 ms to minimize.
[2024-05-24 10:32:30] [INFO ] Deduced a trap composed of 3 places in 643 ms of which 7 ms to minimize.
[2024-05-24 10:32:30] [INFO ] Deduced a trap composed of 82 places in 429 ms of which 5 ms to minimize.
[2024-05-24 10:32:31] [INFO ] Deduced a trap composed of 41 places in 655 ms of which 7 ms to minimize.
[2024-05-24 10:32:31] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 3 ms to minimize.
[2024-05-24 10:32:32] [INFO ] Deduced a trap composed of 54 places in 620 ms of which 6 ms to minimize.
[2024-05-24 10:32:32] [INFO ] Deduced a trap composed of 119 places in 624 ms of which 7 ms to minimize.
[2024-05-24 10:32:33] [INFO ] Deduced a trap composed of 49 places in 367 ms of which 4 ms to minimize.
[2024-05-24 10:32:33] [INFO ] Deduced a trap composed of 94 places in 612 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 10:32:34] [INFO ] Deduced a trap composed of 30 places in 629 ms of which 7 ms to minimize.
[2024-05-24 10:32:35] [INFO ] Deduced a trap composed of 100 places in 659 ms of which 7 ms to minimize.
[2024-05-24 10:32:35] [INFO ] Deduced a trap composed of 100 places in 630 ms of which 7 ms to minimize.
[2024-05-24 10:32:36] [INFO ] Deduced a trap composed of 88 places in 625 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 10:32:37] [INFO ] Deduced a trap composed of 34 places in 479 ms of which 5 ms to minimize.
[2024-05-24 10:32:37] [INFO ] Deduced a trap composed of 92 places in 425 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 731/1170 variables, 439/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1170 variables, 312/799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1170 variables, 3/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1170 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1170 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1170/1170 variables, and 802 constraints, problems are : Problem set: 0 solved, 3 unsolved in 14175 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
After SMT, in 15102ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 781 ms.
Support contains 55 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2179/2179 transitions.
Applied a total of 0 rules in 131 ms. Remains 439 /439 variables (removed 0) and now considering 2179/2179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 439/439 places, 2179/2179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2179/2179 transitions.
Applied a total of 0 rules in 133 ms. Remains 439 /439 variables (removed 0) and now considering 2179/2179 (removed 0) transitions.
[2024-05-24 10:32:39] [INFO ] Flow matrix only has 731 transitions (discarded 1448 similar events)
[2024-05-24 10:32:39] [INFO ] Invariant cache hit.
[2024-05-24 10:32:40] [INFO ] Implicit Places using invariants in 765 ms returned []
[2024-05-24 10:32:40] [INFO ] Flow matrix only has 731 transitions (discarded 1448 similar events)
[2024-05-24 10:32:40] [INFO ] Invariant cache hit.
[2024-05-24 10:32:41] [INFO ] State equation strengthened by 312 read => feed constraints.
[2024-05-24 10:32:44] [INFO ] Implicit Places using invariants and state equation in 3683 ms returned []
Implicit Place search using SMT with State Equation took 4482 ms to find 0 implicit places.
[2024-05-24 10:32:44] [INFO ] Redundant transitions in 242 ms returned []
Running 2171 sub problems to find dead transitions.
[2024-05-24 10:32:44] [INFO ] Flow matrix only has 731 transitions (discarded 1448 similar events)
[2024-05-24 10:32:44] [INFO ] Invariant cache hit.
[2024-05-24 10:32:44] [INFO ] State equation strengthened by 312 read => feed constraints.
SDD proceeding with computation,9 properties remain. new max is 65536
SDD size :136542 after 854672
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2171 unsolved
[2024-05-24 10:33:13] [INFO ] Deduced a trap composed of 6 places in 350 ms of which 6 ms to minimize.
[2024-05-24 10:33:14] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 4 ms to minimize.
[2024-05-24 10:33:14] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 3 ms to minimize.
[2024-05-24 10:33:14] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 2 ms to minimize.
[2024-05-24 10:33:14] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 2 ms to minimize.
[2024-05-24 10:33:14] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1170 variables, and 31 constraints, problems are : Problem set: 0 solved, 2171 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/312 constraints, PredecessorRefiner: 2171/2171 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 2171 unsolved
[2024-05-24 10:33:20] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2024-05-24 10:33:20] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 2 ms to minimize.
[2024-05-24 10:33:20] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-05-24 10:33:22] [INFO ] Deduced a trap composed of 79 places in 484 ms of which 6 ms to minimize.
[2024-05-24 10:33:23] [INFO ] Deduced a trap composed of 69 places in 412 ms of which 5 ms to minimize.
[2024-05-24 10:33:23] [INFO ] Deduced a trap composed of 74 places in 428 ms of which 6 ms to minimize.
[2024-05-24 10:33:24] [INFO ] Deduced a trap composed of 61 places in 531 ms of which 6 ms to minimize.
[2024-05-24 10:33:25] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 3 ms to minimize.
[2024-05-24 10:33:25] [INFO ] Deduced a trap composed of 27 places in 703 ms of which 6 ms to minimize.
[2024-05-24 10:33:26] [INFO ] Deduced a trap composed of 94 places in 621 ms of which 6 ms to minimize.
[2024-05-24 10:33:27] [INFO ] Deduced a trap composed of 94 places in 647 ms of which 6 ms to minimize.
[2024-05-24 10:33:27] [INFO ] Deduced a trap composed of 116 places in 534 ms of which 5 ms to minimize.
[2024-05-24 10:33:28] [INFO ] Deduced a trap composed of 113 places in 647 ms of which 4 ms to minimize.
[2024-05-24 10:33:29] [INFO ] Deduced a trap composed of 140 places in 590 ms of which 6 ms to minimize.
[2024-05-24 10:33:29] [INFO ] Deduced a trap composed of 25 places in 652 ms of which 6 ms to minimize.
[2024-05-24 10:33:30] [INFO ] Deduced a trap composed of 78 places in 644 ms of which 7 ms to minimize.
[2024-05-24 10:33:31] [INFO ] Deduced a trap composed of 82 places in 693 ms of which 7 ms to minimize.
[2024-05-24 10:33:31] [INFO ] Deduced a trap composed of 83 places in 673 ms of which 7 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 131072
SDD size :854672 after 1.95396e+06
[2024-05-24 10:33:32] [INFO ] Deduced a trap composed of 72 places in 507 ms of which 5 ms to minimize.
[2024-05-24 10:33:33] [INFO ] Deduced a trap composed of 85 places in 660 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2171 unsolved
[2024-05-24 10:33:36] [INFO ] Deduced a trap composed of 89 places in 435 ms of which 3 ms to minimize.
[2024-05-24 10:33:36] [INFO ] Deduced a trap composed of 81 places in 310 ms of which 4 ms to minimize.
[2024-05-24 10:33:37] [INFO ] Deduced a trap composed of 94 places in 434 ms of which 6 ms to minimize.
[2024-05-24 10:33:37] [INFO ] Deduced a trap composed of 89 places in 456 ms of which 5 ms to minimize.
[2024-05-24 10:33:37] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-24 10:33:38] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 3 ms to minimize.
[2024-05-24 10:33:38] [INFO ] Deduced a trap composed of 82 places in 390 ms of which 5 ms to minimize.
[2024-05-24 10:33:39] [INFO ] Deduced a trap composed of 75 places in 486 ms of which 5 ms to minimize.
[2024-05-24 10:33:39] [INFO ] Deduced a trap composed of 82 places in 462 ms of which 5 ms to minimize.
[2024-05-24 10:33:40] [INFO ] Deduced a trap composed of 80 places in 419 ms of which 5 ms to minimize.
[2024-05-24 10:33:40] [INFO ] Deduced a trap composed of 68 places in 408 ms of which 5 ms to minimize.
[2024-05-24 10:33:40] [INFO ] Deduced a trap composed of 74 places in 392 ms of which 4 ms to minimize.
[2024-05-24 10:33:41] [INFO ] Deduced a trap composed of 79 places in 511 ms of which 6 ms to minimize.
[2024-05-24 10:33:42] [INFO ] Deduced a trap composed of 110 places in 557 ms of which 5 ms to minimize.
[2024-05-24 10:33:42] [INFO ] Deduced a trap composed of 73 places in 500 ms of which 5 ms to minimize.
[2024-05-24 10:33:43] [INFO ] Deduced a trap composed of 104 places in 500 ms of which 5 ms to minimize.
[2024-05-24 10:33:43] [INFO ] Deduced a trap composed of 95 places in 523 ms of which 7 ms to minimize.
[2024-05-24 10:33:44] [INFO ] Deduced a trap composed of 17 places in 650 ms of which 7 ms to minimize.
[2024-05-24 10:33:44] [INFO ] Deduced a trap composed of 82 places in 666 ms of which 7 ms to minimize.
[2024-05-24 10:33:45] [INFO ] Deduced a trap composed of 80 places in 635 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 2171 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1170 variables, and 71 constraints, problems are : Problem set: 0 solved, 2171 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/312 constraints, PredecessorRefiner: 0/2171 constraints, Known Traps: 46/46 constraints]
After SMT, in 62189ms problems are : Problem set: 0 solved, 2171 unsolved
Search for dead transitions found 0 dead transitions in 62248ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67148 ms. Remains : 439/439 places, 2179/2179 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1624 edges and 439 vertex of which 53 / 439 are part of one of the 8 SCC in 6 ms
Free SCC test removed 45 places
Drop transitions (Empty/Sink Transition effects.) removed 160 transitions
Ensure Unique test removed 1433 transitions
Reduce isomorphic transitions removed 1593 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 394 transition count 528
Reduce places removed 58 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 71 rules applied. Total rules applied 130 place count 336 transition count 515
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 143 place count 323 transition count 515
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 143 place count 323 transition count 505
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 165 place count 311 transition count 505
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 170 place count 306 transition count 500
Iterating global reduction 3 with 5 rules applied. Total rules applied 175 place count 306 transition count 500
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 353 place count 217 transition count 411
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 390 place count 217 transition count 374
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 396 place count 214 transition count 380
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 398 place count 214 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 427 place count 214 transition count 349
Free-agglomeration rule applied 54 times.
Iterating global reduction 5 with 54 rules applied. Total rules applied 481 place count 214 transition count 295
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 5 with 54 rules applied. Total rules applied 535 place count 160 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 538 place count 160 transition count 292
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 543 place count 160 transition count 292
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 544 place count 160 transition count 292
Applied a total of 544 rules in 168 ms. Remains 160 /439 variables (removed 279) and now considering 292/2179 (removed 1887) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 292 rows 160 cols
[2024-05-24 10:33:46] [INFO ] Computed 23 invariants in 3 ms
[2024-05-24 10:33:47] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 10:33:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-24 10:33:47] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 10:33:47] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 10:33:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 10:33:47] [INFO ] After 68ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 10:33:47] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-24 10:33:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-24 10:33:47] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-24 10:33:47] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-24 10:33:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
TRAPS : Iteration 1
[2024-05-24 10:33:47] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-24 10:33:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
TRAPS : Iteration 2
[2024-05-24 10:33:47] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 10:33:48] [INFO ] After 926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-24 10:33:48] [INFO ] Flatten gal took : 28 ms
[2024-05-24 10:33:48] [INFO ] Flatten gal took : 15 ms
[2024-05-24 10:33:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13664246896845692655.gal : 8 ms
[2024-05-24 10:33:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10073436992999417466.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/ReachabilityCardinality13664246896845692655.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10073436992999417466.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 ...330
Loading property file /tmp/ReachabilityCardinality10073436992999417466.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 39
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :39 after 70
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :70 after 719
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :719 after 980
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :980 after 422700
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :422700 after 3.60455e+06
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.60455e+06 after 3.90005e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3.90005e+06 after 5.46034e+06
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :5.46034e+06 after 1.42574e+07
Invariant property EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-10 does not hold.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.42574e+07 after 4.02681e+07
Detected timeout of ITS tools.
[2024-05-24 10:34:03] [INFO ] Flatten gal took : 14 ms
[2024-05-24 10:34:03] [INFO ] Applying decomposition
[2024-05-24 10:34:03] [INFO ] Flatten gal took : 12 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/graph3589096961424501675.txt' '-o' '/tmp/graph3589096961424501675.bin' '-w' '/tmp/graph3589096961424501675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3589096961424501675.bin' '-l' '-1' '-v' '-w' '/tmp/graph3589096961424501675.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:34:03] [INFO ] Decomposing Gal with order
[2024-05-24 10:34:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:34:03] [INFO ] Removed a total of 312 redundant transitions.
[2024-05-24 10:34:03] [INFO ] Flatten gal took : 147 ms
[2024-05-24 10:34:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 50 ms.
[2024-05-24 10:34:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11120009795038406824.gal : 18 ms
[2024-05-24 10:34:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1915385069468143918.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/ReachabilityCardinality11120009795038406824.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1915385069468143918.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 ...308
Loading property file /tmp/ReachabilityCardinality1915385069468143918.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 65
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :65 after 1680
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1680 after 2.6208e+06
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,4.53419e+10,0.126289,6200,279,49,3966,473,775,4256,117,853,0
Total reachable state count : 45341856000

Verifying 2 reachability properties.
Reachability property EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-07,468,0.13541,6200,81,27,3966,473,828,4256,125,853,1104
Invariant property EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-13 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-13,3.68233e+08,0.145608,6200,518,57,3966,473,856,4256,126,853,2232
Over-approximation ignoring read arcs solved 0 properties in 17224 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 10:34:04] [INFO ] Flatten gal took : 134 ms
[2024-05-24 10:34:04] [INFO ] Applying decomposition
[2024-05-24 10:34:04] [INFO ] Flatten gal took : 133 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/graph3495278539058780862.txt' '-o' '/tmp/graph3495278539058780862.bin' '-w' '/tmp/graph3495278539058780862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3495278539058780862.bin' '-l' '-1' '-v' '-w' '/tmp/graph3495278539058780862.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:34:04] [INFO ] Decomposing Gal with order
[2024-05-24 10:34:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:34:05] [INFO ] Removed a total of 5465 redundant transitions.
[2024-05-24 10:34:05] [INFO ] Flatten gal took : 369 ms
[2024-05-24 10:34:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 365 labels/synchronizations in 133 ms.
[2024-05-24 10:34:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5634069286588668693.gal : 30 ms
[2024-05-24 10:34:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8188121470605774901.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/ReachabilityCardinality5634069286588668693.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8188121470605774901.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/ReachabilityCardinality8188121470605774901.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1 after 7
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :7 after 32
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :32 after 792
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :792 after 24241
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :24241 after 360756
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :360756 after 2.69572e+06
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :2.69572e+06 after 3.56294e+07
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :3.56294e+07 after 8.34053e+07
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :8.34053e+07 after 1.0902e+08
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :1.0902e+08 after 4.32453e+08
Detected timeout of ITS tools.
[2024-05-24 11:04:06] [INFO ] Flatten gal took : 78 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16785633093503706245
[2024-05-24 11:04:06] [INFO ] Too many transitions (2179) to apply POR reductions. Disabling POR matrices.
[2024-05-24 11:04:06] [INFO ] Applying decomposition
[2024-05-24 11:04:06] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16785633093503706245
[2024-05-24 11:04:06] [INFO ] Flatten gal took : 100 ms
Running compilation step : cd /tmp/ltsmin16785633093503706245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph934148476520573348.txt' '-o' '/tmp/graph934148476520573348.bin' '-w' '/tmp/graph934148476520573348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph934148476520573348.bin' '-l' '-1' '-v' '-w' '/tmp/graph934148476520573348.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:04:07] [INFO ] Decomposing Gal with order
[2024-05-24 11:04:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:04:07] [INFO ] Removed a total of 4373 redundant transitions.
[2024-05-24 11:04:07] [INFO ] Flatten gal took : 356 ms
[2024-05-24 11:04:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 779 labels/synchronizations in 136 ms.
[2024-05-24 11:04:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12545996097829567535.gal : 35 ms
[2024-05-24 11:04:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5626236462062316983.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/ReachabilityCardinality12545996097829567535.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5626236462062316983.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 ...308
Loading property file /tmp/ReachabilityCardinality5626236462062316983.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 26
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :26 after 3364
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :3364 after 44326
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :44326 after 137759
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :137759 after 334529
Compilation finished in 10296 ms.
Running link step : cd /tmp/ltsmin16785633093503706245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin16785633093503706245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT08ReachabilityCardinality202407==true'
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :334529 after 2.68695e+06
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin16785633093503706245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT08ReachabilityCardinality202407==true'
Running LTSmin : cd /tmp/ltsmin16785633093503706245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT08ReachabilityCardinality202410==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin16785633093503706245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT08ReachabilityCardinality202410==true'
Running LTSmin : cd /tmp/ltsmin16785633093503706245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT08ReachabilityCardinality202413==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin16785633093503706245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT08ReachabilityCardinality202413==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin16785633093503706245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT08ReachabilityCardinality202407==true'

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -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="EisenbergMcGuire-PT-08"
export BK_EXAMINATION="ReachabilityCardinality"
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 EisenbergMcGuire-PT-08, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-smll-171636266300190"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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