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.r400-tall-171690531900238.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 StigmergyCommit-PT-11a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531900238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 465M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 464M May 18 16:43 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 StigmergyCommit-PT-11a-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2023-06
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2023-08
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2023-11
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717004149987

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 17:35:51] [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-29 17:35:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:36:06] [INFO ] Load time of PNML (sax parser for PT used): 15297 ms
[2024-05-29 17:36:07] [INFO ] Transformed 436 places.
[2024-05-29 17:36:08] [INFO ] Transformed 373236 transitions.
[2024-05-29 17:36:08] [INFO ] Found NUPN structural information;
[2024-05-29 17:36:08] [INFO ] Parsed PT model containing 436 places and 373236 transitions and 8944506 arcs in 17567 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 364478 transitions
Reduce redundant transitions removed 364478 transitions.
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 17:36:14] [INFO ] Flatten gal took : 2557 ms
[2024-05-29 17:36:15] [INFO ] Flatten gal took : 896 ms
[2024-05-29 17:36:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17352574534722048093.gal : 402 ms
[2024-05-29 17:36:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1121232269856312154.prop : 13 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/ReachabilityCardinality17352574534722048093.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1121232269856312154.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1121232269856312154.prop.
RANDOM walk for 40000 steps (8 resets) in 67812 ms. (0 steps per ms) remains 8/12 properties
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2023-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 690 ms. (57 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 360 ms. (110 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1054 ms. (37 steps per ms) remains 7/8 properties
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2023-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 7/7 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :5 after 9
[2024-05-29 17:36:30] [INFO ] Flow matrix only has 8722 transitions (discarded 36 similar events)
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :9 after 17
// Phase 1: matrix 8722 rows 436 cols
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :17 after 225
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :225 after 305
[2024-05-29 17:36:31] [INFO ] Computed 13 invariants in 126 ms
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :305 after 1169
Reachability property StigmergyCommit-PT-11a-ReachabilityCardinality-2024-05 is true.
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :1169 after 3377
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :3377 after 6909
[2024-05-29 17:36:32] [INFO ] State equation strengthened by 8357 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :6909 after 22849
At refinement iteration 2 (OVERLAPS) 313/436 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 313/449 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8721/9157 variables, 436/885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9157 variables, 8356/9241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/9157 variables, 0/9241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/9158 variables, 1/9242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9158/9158 variables, and 9242 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5046 ms.
Refiners :[Domain max(s): 436/436 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 436/436 constraints, ReadFeed: 8357/8357 constraints, PredecessorRefiner: 7/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 313/436 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 313/449 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 17:36:41] [INFO ] Deduced a trap composed of 17 places in 3546 ms of which 38 ms to minimize.
[2024-05-29 17:36:45] [INFO ] Deduced a trap composed of 16 places in 3449 ms of which 6 ms to minimize.
SMT process timed out in 14153ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 123 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 8758/8758 transitions.
Graph (complete) has 1119 edges and 436 vertex of which 427 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.71 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 427 transition count 8693
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 99 place count 402 transition count 8676
Reduce places removed 2 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 21 rules applied. Total rules applied 120 place count 400 transition count 8657
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 147 place count 381 transition count 8649
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 147 place count 381 transition count 8599
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 247 place count 331 transition count 8599
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 289 place count 289 transition count 8557
Iterating global reduction 4 with 42 rules applied. Total rules applied 331 place count 289 transition count 8557
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 334 place count 289 transition count 8554
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 353 place count 270 transition count 8533
Iterating global reduction 5 with 19 rules applied. Total rules applied 372 place count 270 transition count 8533
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 374 place count 270 transition count 8531
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 377 place count 267 transition count 8528
Iterating global reduction 6 with 3 rules applied. Total rules applied 380 place count 267 transition count 8528
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 382 place count 267 transition count 8526
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 400 place count 258 transition count 8517
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 407 place count 251 transition count 8510
Iterating global reduction 7 with 7 rules applied. Total rules applied 414 place count 251 transition count 8510
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 416 place count 249 transition count 8508
Iterating global reduction 7 with 2 rules applied. Total rules applied 418 place count 249 transition count 8508
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 436 place count 249 transition count 8490
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 437 place count 249 transition count 8489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 438 place count 248 transition count 8489
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 442 place count 246 transition count 8487
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 443 place count 245 transition count 8486
Iterating global reduction 9 with 1 rules applied. Total rules applied 444 place count 245 transition count 8486
Free-agglomeration rule applied 13 times.
Iterating global reduction 9 with 13 rules applied. Total rules applied 457 place count 245 transition count 8473
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 470 place count 232 transition count 8473
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 473 place count 232 transition count 8473
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 476 place count 232 transition count 8470
Applied a total of 476 rules in 45660 ms. Remains 232 /436 variables (removed 204) and now considering 8470/8758 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45687 ms. Remains : 232/436 places, 8470/8758 transitions.
RANDOM walk for 40000 steps (8 resets) in 60885 ms. (0 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 525 ms. (76 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 464 ms. (86 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 2840236 steps, run timeout after 48001 ms. (steps per millisecond=59 ) properties seen :4 out of 7
Probabilistic random walk after 2840236 steps, saw 384264 distinct states, run finished after 48011 ms. (steps per millisecond=59 ) properties seen :4
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2023-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 8470 rows 232 cols
[2024-05-29 17:38:35] [INFO ] Computed 7 invariants in 41 ms
[2024-05-29 17:38:36] [INFO ] State equation strengthened by 8320 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) 87/142 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/143 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8257/8400 variables, 143/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8400 variables, 204/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8400 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 235/8635 variables, 48/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8635 variables, 8104/8506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8635 variables, 0/8506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 52/8687 variables, 30/8536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8687 variables, 8/8544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8687 variables, 0/8544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 14/8701 variables, 10/8554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8701 variables, 4/8558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8701 variables, 0/8558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/8702 variables, 1/8559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/8702 variables, 0/8559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/8702 variables, 0/8559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8702/8702 variables, and 8559 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5789 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 232/232 constraints, ReadFeed: 8320/8320 constraints, PredecessorRefiner: 3/1 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) 87/142 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 17:38:44] [INFO ] Deduced a trap composed of 10 places in 1487 ms of which 1 ms to minimize.
[2024-05-29 17:38:45] [INFO ] Deduced a trap composed of 12 places in 1320 ms of which 3 ms to minimize.
[2024-05-29 17:38:46] [INFO ] Deduced a trap composed of 13 places in 1315 ms of which 4 ms to minimize.
[2024-05-29 17:38:47] [INFO ] Deduced a trap composed of 11 places in 1058 ms of which 1 ms to minimize.
[2024-05-29 17:38:48] [INFO ] Deduced a trap composed of 14 places in 1134 ms of which 1 ms to minimize.
[2024-05-29 17:38:50] [INFO ] Deduced a trap composed of 13 places in 1133 ms of which 13 ms to minimize.
[2024-05-29 17:38:51] [INFO ] Deduced a trap composed of 15 places in 1139 ms of which 1 ms to minimize.
[2024-05-29 17:38:52] [INFO ] Deduced a trap composed of 8 places in 900 ms of which 2 ms to minimize.
[2024-05-29 17:38:53] [INFO ] Deduced a trap composed of 11 places in 912 ms of which 1 ms to minimize.
[2024-05-29 17:38:53] [INFO ] Deduced a trap composed of 14 places in 673 ms of which 0 ms to minimize.
[2024-05-29 17:38:54] [INFO ] Deduced a trap composed of 10 places in 919 ms of which 1 ms to minimize.
[2024-05-29 17:38:55] [INFO ] Deduced a trap composed of 14 places in 889 ms of which 0 ms to minimize.
[2024-05-29 17:38:56] [INFO ] Deduced a trap composed of 12 places in 667 ms of which 1 ms to minimize.
[2024-05-29 17:38:56] [INFO ] Deduced a trap composed of 11 places in 624 ms of which 1 ms to minimize.
[2024-05-29 17:38:57] [INFO ] Deduced a trap composed of 12 places in 627 ms of which 1 ms to minimize.
[2024-05-29 17:38:58] [INFO ] Deduced a trap composed of 13 places in 630 ms of which 0 ms to minimize.
[2024-05-29 17:38:58] [INFO ] Deduced a trap composed of 12 places in 462 ms of which 1 ms to minimize.
[2024-05-29 17:38:59] [INFO ] Deduced a trap composed of 13 places in 1082 ms of which 1 ms to minimize.
[2024-05-29 17:39:00] [INFO ] Deduced a trap composed of 11 places in 899 ms of which 1 ms to minimize.
[2024-05-29 17:39:01] [INFO ] Deduced a trap composed of 11 places in 747 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 17:39:02] [INFO ] Deduced a trap composed of 8 places in 671 ms of which 1 ms to minimize.
[2024-05-29 17:39:02] [INFO ] Deduced a trap composed of 11 places in 428 ms of which 1 ms to minimize.
[2024-05-29 17:39:02] [INFO ] Deduced a trap composed of 11 places in 428 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/143 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8257/8400 variables, 143/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8400 variables, 204/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 17:39:05] [INFO ] Deduced a trap composed of 12 places in 434 ms of which 0 ms to minimize.
[2024-05-29 17:39:05] [INFO ] Deduced a trap composed of 10 places in 681 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/8400 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8400 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 235/8635 variables, 48/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8635 variables, 8104/8531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8635 variables, 1/8532 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 17:39:13] [INFO ] Deduced a trap composed of 12 places in 1414 ms of which 1 ms to minimize.
[2024-05-29 17:39:14] [INFO ] Deduced a trap composed of 12 places in 1249 ms of which 0 ms to minimize.
[2024-05-29 17:39:15] [INFO ] Deduced a trap composed of 12 places in 1045 ms of which 0 ms to minimize.
[2024-05-29 17:39:17] [INFO ] Deduced a trap composed of 12 places in 890 ms of which 1 ms to minimize.
[2024-05-29 17:39:17] [INFO ] Deduced a trap composed of 12 places in 658 ms of which 0 ms to minimize.
[2024-05-29 17:39:18] [INFO ] Deduced a trap composed of 12 places in 446 ms of which 1 ms to minimize.
[2024-05-29 17:39:20] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/8635 variables, 7/8539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8635 variables, 0/8539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem StigmergyCommit-PT-11a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 16 (OVERLAPS) 52/8687 variables, 30/8569 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/8687 variables, 8/8577 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-29 17:39:26] [INFO ] Deduced a trap composed of 11 places in 1352 ms of which 1 ms to minimize.
[2024-05-29 17:39:28] [INFO ] Deduced a trap composed of 12 places in 1075 ms of which 1 ms to minimize.
SMT process timed out in 52687ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 559 ms.
Support contains 33 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 8470/8470 transitions.
Graph (complete) has 798 edges and 232 vertex of which 229 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 229 transition count 8449
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 37 place count 216 transition count 8447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 215 transition count 8447
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 38 place count 215 transition count 8429
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 74 place count 197 transition count 8429
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 100 place count 171 transition count 8403
Iterating global reduction 3 with 26 rules applied. Total rules applied 126 place count 171 transition count 8403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 171 transition count 8402
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 140 place count 158 transition count 8389
Iterating global reduction 4 with 13 rules applied. Total rules applied 153 place count 158 transition count 8389
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 181 place count 158 transition count 8361
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 185 place count 154 transition count 8357
Iterating global reduction 5 with 4 rules applied. Total rules applied 189 place count 154 transition count 8357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 190 place count 154 transition count 8356
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 230 place count 134 transition count 8336
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 234 place count 134 transition count 8332
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 250 place count 118 transition count 8316
Iterating global reduction 7 with 16 rules applied. Total rules applied 266 place count 118 transition count 8316
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 7 with 101 rules applied. Total rules applied 367 place count 118 transition count 8215
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 373 place count 112 transition count 8209
Iterating global reduction 8 with 6 rules applied. Total rules applied 379 place count 112 transition count 8209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 380 place count 112 transition count 8208
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 382 place count 110 transition count 8206
Iterating global reduction 9 with 2 rules applied. Total rules applied 384 place count 110 transition count 8206
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 395 place count 110 transition count 8195
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 398 place count 110 transition count 8192
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 402 place count 107 transition count 8191
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 411 place count 107 transition count 8191
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 418 place count 107 transition count 8184
Applied a total of 418 rules in 43996 ms. Remains 107 /232 variables (removed 125) and now considering 8184/8470 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43996 ms. Remains : 107/232 places, 8184/8470 transitions.
RANDOM walk for 40000 steps (8 resets) in 94331 ms. (0 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 4362845 steps, run timeout after 72001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 4362845 steps, saw 561777 distinct states, run finished after 72001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 8184 rows 107 cols
[2024-05-29 17:41:48] [INFO ] Computed 12 invariants in 24 ms
[2024-05-29 17:41:49] [INFO ] State equation strengthened by 8136 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 60/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/103 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:41:51] [INFO ] Deduced a trap composed of 6 places in 1862 ms of which 1 ms to minimize.
[2024-05-29 17:41:53] [INFO ] Deduced a trap composed of 6 places in 2134 ms of which 1 ms to minimize.
[2024-05-29 17:41:55] [INFO ] Deduced a trap composed of 7 places in 1826 ms of which 1 ms to minimize.
[2024-05-29 17:41:57] [INFO ] Deduced a trap composed of 7 places in 1809 ms of which 3 ms to minimize.
[2024-05-29 17:41:58] [INFO ] Deduced a trap composed of 7 places in 1547 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:42:00] [INFO ] Deduced a trap composed of 9 places in 1575 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8181/8284 variables, 103/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8284 variables, 4096/4217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8284 variables, 0/4217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/8290 variables, 3/4220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8290 variables, 4040/8260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8290 variables, 0/8260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/8291 variables, 1/8261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8291 variables, 0/8261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/8291 variables, 0/8261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8291/8291 variables, and 8261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 14456 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 107/107 constraints, ReadFeed: 8136/8136 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 60/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:42:05] [INFO ] Deduced a trap composed of 6 places in 1659 ms of which 20 ms to minimize.
[2024-05-29 17:42:07] [INFO ] Deduced a trap composed of 9 places in 1435 ms of which 1 ms to minimize.
[2024-05-29 17:42:08] [INFO ] Deduced a trap composed of 7 places in 1756 ms of which 1 ms to minimize.
[2024-05-29 17:42:10] [INFO ] Deduced a trap composed of 8 places in 1578 ms of which 1 ms to minimize.
[2024-05-29 17:42:11] [INFO ] Deduced a trap composed of 7 places in 1344 ms of which 1 ms to minimize.
[2024-05-29 17:42:13] [INFO ] Deduced a trap composed of 8 places in 1751 ms of which 1 ms to minimize.
[2024-05-29 17:42:15] [INFO ] Deduced a trap composed of 11 places in 1756 ms of which 1 ms to minimize.
[2024-05-29 17:42:17] [INFO ] Deduced a trap composed of 11 places in 1610 ms of which 1 ms to minimize.
[2024-05-29 17:42:18] [INFO ] Deduced a trap composed of 9 places in 1528 ms of which 2 ms to minimize.
Problem StigmergyCommit-PT-11a-ReachabilityCardinality-2024-10 is UNSAT
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 17:42:20] [INFO ] Deduced a trap composed of 8 places in 1564 ms of which 1 ms to minimize.
[2024-05-29 17:42:21] [INFO ] Deduced a trap composed of 6 places in 1491 ms of which 0 ms to minimize.
[2024-05-29 17:42:23] [INFO ] Deduced a trap composed of 9 places in 1551 ms of which 0 ms to minimize.
[2024-05-29 17:42:24] [INFO ] Deduced a trap composed of 10 places in 1480 ms of which 1 ms to minimize.
[2024-05-29 17:42:25] [INFO ] Deduced a trap composed of 9 places in 1132 ms of which 8 ms to minimize.
Problem StigmergyCommit-PT-11a-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 93/8291 variables, and 29 constraints, problems are : Problem set: 2 solved, 0 unsolved in 21735 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, State Equation: 0/107 constraints, ReadFeed: 0/8136 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 20/20 constraints]
After SMT, in 37142ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 394599 ms.

BK_STOP 1717004546028

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="StigmergyCommit-PT-11a"
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 StigmergyCommit-PT-11a, 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 r400-tall-171690531900238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-11a.tgz
mv StigmergyCommit-PT-11a 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 ;