fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r354-tall-178024402900222
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for SupplyChain-PT-00500

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2406.995 63589.00 158616.00 159.10 TTFFTTTTFFTFTTFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r354-tall-178024402900222.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is SupplyChain-PT-00500, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402900222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 7.0K May 27 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 27 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 07:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 07:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 07:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 27 07:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 07:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 27 07:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 2.1M May 26 18:17 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-00
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-01
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-02
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-03
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-04
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-05
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-06
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-07
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-08
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-09
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-10
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-11
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-12
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-13
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-14
FORMULA_NAME SupplyChain-PT-00500-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780259282441

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-31 20:28:04] [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]
[2026-05-31 20:28:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:28:04] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2026-05-31 20:28:04] [INFO ] Transformed 6504 places.
[2026-05-31 20:28:04] [INFO ] Transformed 4003 transitions.
[2026-05-31 20:28:04] [INFO ] Parsed PT model containing 6504 places and 4003 transitions and 18006 arcs in 491 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2026-05-31 20:28:05] [INFO ] Flatten gal took : 857 ms
[2026-05-31 20:28:06] [INFO ] Flatten gal took : 732 ms
[2026-05-31 20:28:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1117575057224784153.gal : 128 ms
RANDOM walk for 40000 steps (16 resets) in 7898 ms. (5 steps per ms) remains 8/16 properties
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-31 20:28:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3286638771947101997.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1117575057224784153.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3286638771947101997.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (8 resets) in 1024 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1026 ms. (38 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 938 ms. (42 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1417 ms. (28 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality3286638771947101997.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 800 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 850 ms. (47 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 760 ms. (52 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 766 ms. (52 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17008398852836773304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13470141081283847947.kers'
[2026-05-31 20:28:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17008398852836773304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13470141081283847947.kers]
Normalized transition count is 4002 out of 4003 initially.
Culling duplicate invariants (modulo rational): removing 1590 columns.
Culled 1590 columns in 7 ms.
// Phase 1: matrix 4002 rows 4914 cols 13004 entries
Finished phase 1 with 2912 SingleSign rule and 500 generalized
[2026-05-31 20:28:09] [INFO ] Computed 3092 invariants in 35 ms
Computed 3092 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-13470141081283847947.kers
Total runtime 40 ms.
[2026-05-31 20:28:09] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1147/1371 variables, 194/195 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1371 variables, 22/217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1371 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2847/4218 variables, 808/1025 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4218 variables, 38/1063 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4218 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2286/6504 variables, 2029/3092 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6504 variables, 0/3092 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem SupplyChain-PT-00500-ReachabilityCardinality-2024-00 is UNSAT
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem SupplyChain-PT-00500-ReachabilityCardinality-2024-01 is UNSAT
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem SupplyChain-PT-00500-ReachabilityCardinality-2024-04 is UNSAT
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem SupplyChain-PT-00500-ReachabilityCardinality-2024-07 is UNSAT
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem SupplyChain-PT-00500-ReachabilityCardinality-2024-12 is UNSAT
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 4002/10506 variables, 6504/9596 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10506/10507 variables, and 9596 constraints, problems are : Problem set: 5 solved, 3 unsolved in 5054 ms.
Refiners :[Positive P Invariants (semi-flows): 1002/1002 constraints, Generalized P Invariants (flows): 2090/2090 constraints, State Equation: 6504/6504 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 968/1125 variables, 138/138 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1125 variables, 11/149 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1125 variables, 1/150 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1125 variables, 0/150 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3072/4197 variables, 864/1014 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4197 variables, 34/1048 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4197 variables, 0/1048 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2307/6504 variables, 2045/3093 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6504 variables, 0/3093 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4002/10506 variables, 6504/9597 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10506/10507 variables, and 9598 constraints, problems are : Problem set: 5 solved, 3 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 1002/1002 constraints, Generalized P Invariants (flows): 2090/2090 constraints, State Equation: 6504/6504 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10318ms problems are : Problem set: 5 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 157 out of 6504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6504/6504 places, 4003/4003 transitions.
Graph (complete) has 17362 edges and 6504 vertex of which 6502 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1590 places
Iterating post reduction 0 with 1590 rules applied. Total rules applied 1591 place count 4912 transition count 4001
Performed 482 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 482 Pre rules applied. Total rules applied 1591 place count 4912 transition count 3519
Deduced a syphon composed of 482 places in 19 ms
Ensure Unique test removed 482 places
Reduce places removed 964 places and 0 transitions.
Iterating global reduction 1 with 1446 rules applied. Total rules applied 3037 place count 3948 transition count 3519
Free-agglomeration rule applied 842 times.
Iterating global reduction 1 with 842 rules applied. Total rules applied 3879 place count 3948 transition count 2677
Ensure Unique test removed 471 places
Reduce places removed 1313 places and 0 transitions.
Ensure Unique test removed 471 transitions
Reduce isomorphic transitions removed 471 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 1 with 2204 rules applied. Total rules applied 6083 place count 2635 transition count 1786
Reduce places removed 420 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 444 rules applied. Total rules applied 6527 place count 2215 transition count 1762
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 6551 place count 2191 transition count 1762
Performed 427 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 427 Pre rules applied. Total rules applied 6551 place count 2191 transition count 1335
Deduced a syphon composed of 427 places in 2 ms
Reduce places removed 427 places and 0 transitions.
Iterating global reduction 4 with 854 rules applied. Total rules applied 7405 place count 1764 transition count 1335
Free-agglomeration rule (complex) applied 89 times.
Iterating global reduction 4 with 89 rules applied. Total rules applied 7494 place count 1764 transition count 1246
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 4 with 89 rules applied. Total rules applied 7583 place count 1675 transition count 1246
Reduce places removed 20 places and 20 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 7603 place count 1655 transition count 1226
Applied a total of 7603 rules in 2537 ms. Remains 1655 /6504 variables (removed 4849) and now considering 1226/4003 (removed 2777) transitions.
Running 690 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11134584637256976708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10640560924653918334.kers'
[2026-05-31 20:28:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11134584637256976708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10640560924653918334.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1226 rows 1655 cols 4072 entries
Finished phase 1 with 1106 SingleSign rule and 1 generalized
[2026-05-31 20:28:22] [INFO ] Computed 548 invariants in 11 ms
Computed 548 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-10640560924653918334.kers
Total runtime 14 ms.
[2026-05-31 20:28:22] [INFO ] State equation strengthened by 80 read => feed constraints.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/1545 variables, 1/1 constraints. Problems are: Problem set: 410 solved, 280 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1545 variables, 1/2 constraints. Problems are: Problem set: 500 solved, 190 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :9 after 21
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :21 after 57
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :57 after 165
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :165 after 489
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :489 after 1473
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1473 after 4545
At refinement iteration 2 (INCLUDED_ONLY) 0/1545 variables, 0/2 constraints. Problems are: Problem set: 500 solved, 190 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 110/1655 variables, 547/549 constraints. Problems are: Problem set: 500 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1655/2881 variables, and 549 constraints, problems are : Problem set: 500 solved, 190 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 547/547 constraints, State Equation: 0/1655 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 690/689 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 500 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/705 variables, 0/0 constraints. Problems are: Problem set: 500 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 420/1125 variables, 1/1 constraints. Problems are: Problem set: 500 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1125 variables, 1/2 constraints. Problems are: Problem set: 500 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1125 variables, 0/2 constraints. Problems are: Problem set: 500 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 530/1655 variables, 547/549 constraints. Problems are: Problem set: 500 solved, 190 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :4545 after 14733
At refinement iteration 5 (INCLUDED_ONLY) 0/1655 variables, 0/549 constraints. Problems are: Problem set: 500 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 1226/2881 variables, 1655/2204 constraints. Problems are: Problem set: 500 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2881 variables, 80/2284 constraints. Problems are: Problem set: 500 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2881 variables, 189/2473 constraints. Problems are: Problem set: 500 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2881/2881 variables, and 2473 constraints, problems are : Problem set: 500 solved, 190 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 547/547 constraints, State Equation: 1655/1655 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 190/689 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41107ms problems are : Problem set: 500 solved, 190 unsolved
Search for dead transitions found 500 dead transitions in 41113ms
Found 500 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 500 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1655/6504 places, 726/4003 transitions.
Graph (complete) has 1316 edges and 1655 vertex of which 1243 are kept as prefixes of interest. Removing 412 places using SCC suffix rule.1 ms
Discarding 412 places :
Also discarding 0 output transitions
Deduced a syphon composed of 13 places in 0 ms
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 0 with 27 rules applied. Total rules applied 28 place count 1243 transition count 726
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 28 rules in 145 ms. Remains 1243 /1655 variables (removed 412) and now considering 726/726 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43867 ms. Remains : 1243/6504 places, 726/4003 transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
RANDOM walk for 40000 steps (176 resets) in 2224 ms. (17 steps per ms) remains 1/3 properties
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15310956087669460633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13175066077344062072.kers'
[2026-05-31 20:29:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15310956087669460633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13175066077344062072.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 726 rows 1230 cols 2056 entries
Finished phase 1 with 688 SingleSign rule and 9 generalized
[2026-05-31 20:29:04] [INFO ] Computed 533 invariants in 5 ms
Computed 533 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13175066077344062072.kers
Total runtime 6 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1120/1190 variables, 527/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1190 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/1192 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1192 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 702/1894 variables, 1192/1720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1894 variables, 0/1720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/1919 variables, 17/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1919 variables, 0/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/1948 variables, 13/1750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1948 variables, 0/1750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/1953 variables, 5/1755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1953 variables, 5/1760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1953 variables, 0/1760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/1956 variables, 3/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1956 variables, 0/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1956 variables, 0/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 1763 constraints, problems are : Problem set: 0 solved, 1 unsolved in 682 ms.
Refiners :[Generalized P Invariants (flows): 533/533 constraints, State Equation: 1230/1230 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1120/1190 variables, 527/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1190 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/1192 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1192 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 702/1894 variables, 1192/1720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1894 variables, 0/1720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/1919 variables, 17/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1919 variables, 0/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/1948 variables, 13/1750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1948 variables, 0/1750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/1953 variables, 5/1755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1953 variables, 5/1760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1953 variables, 0/1760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/1956 variables, 3/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1956 variables, 0/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1956 variables, 0/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1956/1956 variables, and 1763 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1005 ms.
Refiners :[Generalized P Invariants (flows): 533/533 constraints, State Equation: 1230/1230 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1708ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 205 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=18 )
FORMULA SupplyChain-PT-00500-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 22 ms.
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 61978 ms.

BK_STOP 1780259346030

--------------------
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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="SupplyChain-PT-00500"
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-5973"
echo " Executing tool itstools"
echo " Input is SupplyChain-PT-00500, 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 r354-tall-178024402900222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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