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-178024402800204.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-00100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 7.4K May 27 07:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 27 07:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 27 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 27 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 27 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 27 07:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:58 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 405K 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-00100-LTLFireability-00
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-01
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-02
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-03
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-04
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-05
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-06
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-07
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-08
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-09
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-10
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-11
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-12
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-13
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-14
FORMULA_NAME SupplyChain-PT-00100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780254432923

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-31 19:07:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 19:07:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 19:07:14] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2026-05-31 19:07:14] [INFO ] Transformed 1304 places.
[2026-05-31 19:07:14] [INFO ] Transformed 803 transitions.
[2026-05-31 19:07:14] [INFO ] Parsed PT model containing 1304 places and 803 transitions and 3606 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA SupplyChain-PT-00100-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00100-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00100-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA SupplyChain-PT-00100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 1304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1304/1304 places, 803/803 transitions.
Ensure Unique test removed 385 places
Iterating post reduction 0 with 385 rules applied. Total rules applied 385 place count 919 transition count 803
Applied a total of 385 rules in 98 ms. Remains 919 /1304 variables (removed 385) and now considering 803/803 (removed 0) transitions.
Running 703 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-3253520989688510036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11492893864712736527.kers'
[2026-05-31 19:07:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3253520989688510036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11492893864712736527.kers]
Normalized transition count is 802 out of 803 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 802 rows 914 cols 2604 entries
Finished phase 1 with 512 SingleSign rule and 100 generalized
[2026-05-31 19:07:14] [INFO ] Computed 307 invariants in 7 ms
Computed 307 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11492893864712736527.kers
Total runtime 9 ms.
[2026-05-31 19:07:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem TDEAD734 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD776 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/817 variables, 103/105 constraints. Problems are: Problem set: 10 solved, 693 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/1722 variables, and 105 constraints, problems are : Problem set: 10 solved, 693 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 2/202 constraints, Generalized P Invariants (flows): 103/105 constraints, State Equation: 0/919 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 703/702 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/807 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/807 variables, 103/104 constraints. Problems are: Problem set: 10 solved, 693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/807 variables, 0/104 constraints. Problems are: Problem set: 10 solved, 693 unsolved
At refinement iteration 3 (OVERLAPS) 110/917 variables, 201/305 constraints. Problems are: Problem set: 10 solved, 693 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 917/1722 variables, and 307 constraints, problems are : Problem set: 10 solved, 693 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, Generalized P Invariants (flows): 103/105 constraints, State Equation: 0/919 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/702 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40636ms problems are : Problem set: 10 solved, 693 unsolved
Search for dead transitions found 10 dead transitions in 40662ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4487884830077938709.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9820587180371328394.kers'
[2026-05-31 19:07:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4487884830077938709.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9820587180371328394.kers]
Normalized transition count is 792 out of 793 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 792 rows 914 cols 2574 entries
Finished phase 1 with 512 SingleSign rule and 100 generalized
[2026-05-31 19:07:55] [INFO ] Computed 307 invariants in 5 ms
Computed 307 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9820587180371328394.kers
Total runtime 8 ms.
[2026-05-31 19:07:56] [INFO ] Implicit Places using invariants in 823 ms returned [0, 2, 16, 257, 258, 259, 260, 261, 262, 263, 264, 266, 267, 268, 269, 270, 272, 273, 274, 275, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 310, 311, 312, 313, 316, 317, 318, 319, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 332, 333, 334, 335, 336, 337, 338, 339, 340, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 354, 355, 356, 357, 358, 359, 360, 361, 363, 366, 813, 814, 815, 816, 818, 819, 821, 822, 824, 825, 826, 827, 828, 829, 830, 832, 833, 834, 835, 836, 837, 839, 840, 843, 844, 845, 846, 847, 848, 849, 850, 852, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 865, 866, 867, 868, 869, 870, 871, 872, 874, 876, 877, 878, 879, 880, 881, 882, 883, 884, 885, 887, 889, 890, 891, 892, 893, 894, 895, 896, 898, 899, 900, 901, 902, 903, 904, 905, 906, 907, 909, 910, 911, 912, 913, 914, 915, 916, 917, 918]
Discarding 187 places :
Implicit Place search using SMT only with invariants took 833 ms to find 187 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 732/1304 places, 793/803 transitions.
Reduce places removed 19 places and 10 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 713 transition count 783
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 28 place count 704 transition count 783
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 28 rules in 33 ms. Remains 704 /732 variables (removed 28) and now considering 783/793 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15626286298072343925.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12971698123925293222.kers'
[2026-05-31 19:07:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15626286298072343925.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12971698123925293222.kers]
Normalized transition count is 782 out of 783 initially.
Culling trivial invariants: removing 1 columns.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 6 columns in 1 ms.
// Phase 1: matrix 782 rows 698 cols 1862 entries
Finished phase 1 with 589 SingleSign rule and 13 generalized
[2026-05-31 19:07:56] [INFO ] Computed 102 invariants in 6 ms
Computed 102 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12971698123925293222.kers
Total runtime 7 ms.
[2026-05-31 19:07:56] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-31 19:07:56] [INFO ] Invariant cache hit.
[2026-05-31 19:07:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:07:57] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 704/1304 places, 783/803 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42582 ms. Remains : 704/1304 places, 783/803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 783/783 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 12 ms. Remains 704 /704 variables (removed 0) and now considering 783/783 (removed 0) transitions.
Running 683 sub problems to find dead transitions.
[2026-05-31 19:07:57] [INFO ] Invariant cache hit.
[2026-05-31 19:07:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 82/681 variables, 90/96 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 681/1487 variables, and 96 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 90/91 constraints, Generalized P Invariants (flows): 6/11 constraints, State Equation: 0/704 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 683/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 683 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 82/681 variables, 90/96 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/1487 variables, and 96 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 90/91 constraints, Generalized P Invariants (flows): 6/11 constraints, State Equation: 0/704 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40252ms problems are : Problem set: 0 solved, 683 unsolved
Search for dead transitions found 0 dead transitions in 40254ms
[2026-05-31 19:08:37] [INFO ] Invariant cache hit.
[2026-05-31 19:08:37] [INFO ] Implicit Places using invariants in 309 ms returned []
[2026-05-31 19:08:37] [INFO ] Invariant cache hit.
[2026-05-31 19:08:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:08:38] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 41127 ms. Remains : 704/704 places, 783/783 transitions.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Support contains 49 out of 703 places after structural reductions.
[2026-05-31 19:08:38] [INFO ] Flatten gal took : 83 ms
[2026-05-31 19:08:38] [INFO ] Flatten gal took : 38 ms
[2026-05-31 19:08:38] [INFO ] Input system was already deterministic with 783 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 32911 steps (83 resets) in 2024 ms. (16 steps per ms) remains 0/30 properties
Computed a total of 703 stabilizing places and 782 stable transitions
Graph (complete) has 1278 edges and 703 vertex of which 701 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)&&G(p2)))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 783/783 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 700 transition count 783
Applied a total of 3 rules in 15 ms. Remains 700 /703 variables (removed 3) and now considering 783/783 (removed 0) transitions.
Running 683 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-4269523041179693720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6949672605013228557.kers'
[2026-05-31 19:08:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4269523041179693720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6949672605013228557.kers]
Normalized transition count is 782 out of 783 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 782 rows 697 cols 1861 entries
Finished phase 1 with 589 SingleSign rule and 13 generalized
[2026-05-31 19:08:39] [INFO ] Computed 98 invariants in 3 ms
Computed 98 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6949672605013228557.kers
Total runtime 4 ms.
[2026-05-31 19:08:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 80/679 variables, 89/95 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 679/1483 variables, and 95 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 6/9 constraints, State Equation: 0/700 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 683/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 683 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 80/679 variables, 89/95 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 679/1483 variables, and 95 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 6/9 constraints, State Equation: 0/700 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40225ms problems are : Problem set: 0 solved, 683 unsolved
Search for dead transitions found 0 dead transitions in 40226ms
[2026-05-31 19:09:20] [INFO ] Invariant cache hit.
[2026-05-31 19:09:20] [INFO ] Implicit Places using invariants in 340 ms returned [0, 243, 248, 249, 252, 255, 258, 684, 686, 689, 691, 694, 697]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 343 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 687/703 places, 783/783 transitions.
Applied a total of 0 rules in 25 ms. Remains 687 /687 variables (removed 0) and now considering 783/783 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40612 ms. Remains : 687/703 places, 783/783 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)&&p2))))'
Stuttering acceptance computed with spot in 411 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : SupplyChain-PT-00100-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA SupplyChain-PT-00100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00100-LTLFireability-01 finished in 41119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 783/783 transitions.
Graph (complete) has 1278 edges and 703 vertex of which 701 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 4 places
Reduce places removed 102 places and 98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 172 place count 599 transition count 514
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 1 with 429 rules applied. Total rules applied 601 place count 428 transition count 256
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 2 with 87 rules applied. Total rules applied 688 place count 341 transition count 256
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 688 place count 341 transition count 157
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 892 place count 236 transition count 157
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 892 place count 236 transition count 151
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 904 place count 230 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 905 place count 230 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 905 place count 230 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 907 place count 229 transition count 149
Applied a total of 907 rules in 74 ms. Remains 229 /703 variables (removed 474) and now considering 149/783 (removed 634) transitions.
Running 23 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-18034493338236623998.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6383969129725145219.kers'
[2026-05-31 19:09:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18034493338236623998.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6383969129725145219.kers]
Normalized transition count is 148 out of 149 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 229 cols 401 entries
Finished phase 1 with 129 SingleSign rule and 11 generalized
[2026-05-31 19:09:21] [INFO ] Computed 89 invariants in 0 ms
Computed 89 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6383969129725145219.kers
Total runtime 2 ms.
[2026-05-31 19:09:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 80/209 variables, 80/86 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 11/220 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 139/359 variables, 220/309 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 18/377 variables, 9/318 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 1/378 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/378 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 319 constraints, problems are : Problem set: 0 solved, 23 unsolved in 2130 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 229/229 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 80/209 variables, 80/86 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 11/220 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 139/359 variables, 220/309 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 22/331 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 18/377 variables, 9/340 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 1/378 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 0/378 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 341 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1697 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 229/229 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3838ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 3838ms
[2026-05-31 19:09:24] [INFO ] Invariant cache hit.
[2026-05-31 19:09:25] [INFO ] Implicit Places using invariants in 247 ms returned [0, 213, 215, 217, 218, 220, 223, 226]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 248 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 221/703 places, 149/783 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 221 transition count 141
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 24 place count 213 transition count 133
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 24 place count 213 transition count 125
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 40 place count 205 transition count 125
Applied a total of 40 rules in 22 ms. Remains 205 /221 variables (removed 16) and now considering 125/149 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-761126611915708113.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12521420616812335840.kers'
[2026-05-31 19:09:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-761126611915708113.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12521420616812335840.kers]
Normalized transition count is 124 out of 125 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 124 rows 205 cols 337 entries
Finished phase 1 with 114 SingleSign rule and 10 generalized
[2026-05-31 19:09:25] [INFO ] Computed 81 invariants in 0 ms
Computed 81 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12521420616812335840.kers
Total runtime 1 ms.
[2026-05-31 19:09:25] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-31 19:09:25] [INFO ] Invariant cache hit.
[2026-05-31 19:09:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:09:25] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 205/703 places, 125/783 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4708 ms. Remains : 205/703 places, 125/783 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : SupplyChain-PT-00100-LTLFireability-03
Product exploration explored 100000 steps with 6134 reset in 718 ms.
Product exploration explored 100000 steps with 6153 reset in 693 ms.
Computed a total of 205 stabilizing places and 124 stable transitions
Computed a total of 205 stabilizing places and 124 stable transitions
Detected a total of 205/205 stabilizing places and 124/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 57 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2026-05-31 19:09:27] [INFO ] Invariant cache hit.
[2026-05-31 19:09:27] [INFO ] [Real]Absence check using 80 positive place invariants in 17 ms returned sat
[2026-05-31 19:09:27] [INFO ] [Real]Absence check using 80 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-31 19:09:27] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2026-05-31 19:09:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 19:09:27] [INFO ] [Nat]Absence check using 80 positive place invariants in 15 ms returned sat
[2026-05-31 19:09:27] [INFO ] [Nat]Absence check using 80 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-31 19:09:27] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2026-05-31 19:09:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:09:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-31 19:09:27] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 1 transitions) in 7 ms.
[2026-05-31 19:09:28] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 860 ms.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2026-05-31 19:09:28] [INFO ] Invariant cache hit.
[2026-05-31 19:09:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 80/185 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/195 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 114/309 variables, 195/276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 20/329 variables, 10/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/330 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 287 constraints, problems are : Problem set: 0 solved, 5 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 80/185 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/195 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 114/309 variables, 195/276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 20/329 variables, 10/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/330 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/330 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 291 constraints, problems are : Problem set: 0 solved, 5 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 993ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 993ms
[2026-05-31 19:09:29] [INFO ] Invariant cache hit.
[2026-05-31 19:09:29] [INFO ] Implicit Places using invariants in 244 ms returned []
[2026-05-31 19:09:29] [INFO ] Invariant cache hit.
[2026-05-31 19:09:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:09:29] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2026-05-31 19:09:29] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1571 ms. Remains : 205/205 places, 125/125 transitions.
Computed a total of 205 stabilizing places and 124 stable transitions
Computed a total of 205 stabilizing places and 124 stable transitions
Detected a total of 205/205 stabilizing places and 124/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 66 steps (0 resets) in 6 ms. (9 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2026-05-31 19:09:29] [INFO ] Invariant cache hit.
[2026-05-31 19:09:30] [INFO ] [Real]Absence check using 80 positive place invariants in 16 ms returned sat
[2026-05-31 19:09:30] [INFO ] [Real]Absence check using 80 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-31 19:09:30] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2026-05-31 19:09:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 19:09:30] [INFO ] [Nat]Absence check using 80 positive place invariants in 15 ms returned sat
[2026-05-31 19:09:30] [INFO ] [Nat]Absence check using 80 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-31 19:09:30] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2026-05-31 19:09:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:09:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-31 19:09:30] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 1 transitions) in 7 ms.
[2026-05-31 19:09:30] [INFO ] Added : 0 causal constraints over 0 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 848 ms.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6136 reset in 629 ms.
Product exploration explored 100000 steps with 6132 reset in 707 ms.
Built C files in :
/tmp/ltsmin7548199105951912858
[2026-05-31 19:09:32] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2026-05-31 19:09:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:09:32] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2026-05-31 19:09:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:09:32] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2026-05-31 19:09:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:09:32] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7548199105951912858
Running compilation step : cd /tmp/ltsmin7548199105951912858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 414 ms.
Running link step : cd /tmp/ltsmin7548199105951912858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin7548199105951912858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15588256175588619237.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 125/125 transitions.
Applied a total of 0 rules in 13 ms. Remains 205 /205 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 19:09:47] [INFO ] Invariant cache hit.
[2026-05-31 19:09:47] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-31 19:09:47] [INFO ] Invariant cache hit.
[2026-05-31 19:09:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:09:47] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2026-05-31 19:09:47] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 592 ms. Remains : 205/205 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin10371900438870005193
[2026-05-31 19:09:47] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2026-05-31 19:09:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:09:47] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2026-05-31 19:09:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:09:47] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2026-05-31 19:09:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:09:47] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10371900438870005193
Running compilation step : cd /tmp/ltsmin10371900438870005193;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 281 ms.
Running link step : cd /tmp/ltsmin10371900438870005193;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10371900438870005193;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18037897921182572188.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 19:10:02] [INFO ] Flatten gal took : 9 ms
[2026-05-31 19:10:02] [INFO ] Flatten gal took : 9 ms
[2026-05-31 19:10:02] [INFO ] Time to serialize gal into /tmp/LTL2426735691268712221.gal : 2 ms
[2026-05-31 19:10:02] [INFO ] Time to serialize properties into /tmp/LTL5669875703108288358.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2426735691268712221.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3814215883161549598.hoa' '-atoms' '/tmp/LTL5669875703108288358.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5669875703108288358.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3814215883161549598.hoa
Detected timeout of ITS tools.
[2026-05-31 19:10:17] [INFO ] Flatten gal took : 9 ms
[2026-05-31 19:10:17] [INFO ] Flatten gal took : 8 ms
[2026-05-31 19:10:17] [INFO ] Time to serialize gal into /tmp/LTL15685016679534499064.gal : 1 ms
[2026-05-31 19:10:17] [INFO ] Time to serialize properties into /tmp/LTL12265485383061222906.ltl : 2 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15685016679534499064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12265485383061222906.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F("(p714>=1)")))
Formula 0 simplified : G!"(p714>=1)"
Detected timeout of ITS tools.
[2026-05-31 19:10:32] [INFO ] Flatten gal took : 11 ms
[2026-05-31 19:10:32] [INFO ] Applying decomposition
[2026-05-31 19:10:32] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10271017127836602139.txt' '-o' '/tmp/graph10271017127836602139.bin' '-w' '/tmp/graph10271017127836602139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10271017127836602139.bin' '-l' '-1' '-v' '-w' '/tmp/graph10271017127836602139.weights' '-q' '0' '-e' '0.001'
[2026-05-31 19:10:39] [INFO ] Decomposing Gal with order
[2026-05-31 19:10:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 19:10:39] [INFO ] Removed a total of 107 redundant transitions.
[2026-05-31 19:10:39] [INFO ] Flatten gal took : 70 ms
[2026-05-31 19:10:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2026-05-31 19:10:39] [INFO ] Time to serialize gal into /tmp/LTL4825866623212776430.gal : 4 ms
[2026-05-31 19:10:39] [INFO ] Time to serialize properties into /tmp/LTL15575658995917526584.ltl : 0 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4825866623212776430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15575658995917526584.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F("(u43.p714>=1)")))
Formula 0 simplified : G!"(u43.p714>=1)"
Reverse transition relation is NOT exact ! Due to transitions t762, t760_t128_t383, t777_t727_t228_t370, t778_t733_t229_t372, t779_t736_t230_t375, t780_t73...575
Computing Next relation with stutter on 6.33825e+30 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
46 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.490736,40492,1,0,67408,313,2285,54714,125,252,136861
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SupplyChain-PT-00100-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property SupplyChain-PT-00100-LTLFireability-03 finished in 78822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p1)||X(G(!p2)))) U X(p3)))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 783/783 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 697 transition count 783
Applied a total of 6 rules in 13 ms. Remains 697 /703 variables (removed 6) and now considering 783/783 (removed 0) transitions.
Running 683 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-1785450092473620546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17517720905009871401.kers'
[2026-05-31 19:10:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1785450092473620546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17517720905009871401.kers]
Normalized transition count is 782 out of 783 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 782 rows 697 cols 1861 entries
Finished phase 1 with 589 SingleSign rule and 13 generalized
[2026-05-31 19:10:39] [INFO ] Computed 95 invariants in 3 ms
Computed 95 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17517720905009871401.kers
Total runtime 5 ms.
[2026-05-31 19:10:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 80/677 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/1480 variables, and 93 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 4/6 constraints, State Equation: 0/697 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 683/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 683 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 80/677 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/1480 variables, and 93 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 4/6 constraints, State Equation: 0/697 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40259ms problems are : Problem set: 0 solved, 683 unsolved
Search for dead transitions found 0 dead transitions in 40261ms
[2026-05-31 19:11:20] [INFO ] Invariant cache hit.
[2026-05-31 19:11:20] [INFO ] Implicit Places using invariants in 700 ms returned [0, 240, 245, 246, 249, 252, 681, 683, 685, 686, 688, 694]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 704 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 685/703 places, 783/783 transitions.
Applied a total of 0 rules in 8 ms. Remains 685 /685 variables (removed 0) and now considering 783/783 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40988 ms. Remains : 685/703 places, 783/783 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p1)||X(G(!p2)))) U X(p3)))'
Stuttering acceptance computed with spot in 451 ms :[(NOT p3), (AND p2 (NOT p3)), (NOT p3), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p1) (NOT p3)), true, p2, (AND (NOT p1) p2), (AND p2 (NOT p1)), (NOT p1)]
Running random walk in product with property : SupplyChain-PT-00100-LTLFireability-04
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 2 ms.
FORMULA SupplyChain-PT-00100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00100-LTLFireability-04 finished in 41506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F((X(p1)&&p0))||p1)) U p2))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 783/783 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 698 transition count 783
Applied a total of 5 rules in 16 ms. Remains 698 /703 variables (removed 5) and now considering 783/783 (removed 0) transitions.
Running 683 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-10158360581926787769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3076195751727719642.kers'
[2026-05-31 19:11:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10158360581926787769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3076195751727719642.kers]
Normalized transition count is 782 out of 783 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 782 rows 697 cols 1861 entries
Finished phase 1 with 589 SingleSign rule and 13 generalized
[2026-05-31 19:11:21] [INFO ] Computed 96 invariants in 6 ms
Computed 96 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-3076195751727719642.kers
Total runtime 8 ms.
[2026-05-31 19:11:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 80/677 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/1481 variables, and 93 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 4/7 constraints, State Equation: 0/698 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 683/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 683 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 80/677 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/1481 variables, and 93 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 4/7 constraints, State Equation: 0/698 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40249ms problems are : Problem set: 0 solved, 683 unsolved
Search for dead transitions found 0 dead transitions in 40251ms
[2026-05-31 19:12:01] [INFO ] Invariant cache hit.
[2026-05-31 19:12:01] [INFO ] Implicit Places using invariants in 331 ms returned [0, 241, 246, 247, 250, 253, 256, 682, 684, 686, 687, 689, 692, 695]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 332 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 684/703 places, 783/783 transitions.
Applied a total of 0 rules in 10 ms. Remains 684 /684 variables (removed 0) and now considering 783/783 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40611 ms. Remains : 684/703 places, 783/783 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F((X(p1)&&p0))||p1)) U p2))'
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SupplyChain-PT-00100-LTLFireability-06
Stuttering criterion allowed to conclude after 444 steps with 1 reset in 5 ms.
FORMULA SupplyChain-PT-00100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00100-LTLFireability-06 finished in 40801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 783/783 transitions.
Graph (complete) has 1278 edges and 703 vertex of which 701 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 4 places
Reduce places removed 101 places and 97 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 600 transition count 595
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 1 with 270 rules applied. Total rules applied 362 place count 509 transition count 416
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 450 place count 421 transition count 416
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 450 place count 421 transition count 317
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 653 place count 317 transition count 317
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 653 place count 317 transition count 312
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 663 place count 312 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 664 place count 312 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 664 place count 312 transition count 310
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 666 place count 311 transition count 310
Applied a total of 666 rules in 66 ms. Remains 311 /703 variables (removed 392) and now considering 310/783 (removed 473) transitions.
Running 112 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-10152001325999594260.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13711271713473104435.kers'
[2026-05-31 19:12:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10152001325999594260.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13711271713473104435.kers]
Normalized transition count is 309 out of 310 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 311 cols 887 entries
Finished phase 1 with 210 SingleSign rule and 11 generalized
[2026-05-31 19:12:02] [INFO ] Computed 90 invariants in 1 ms
Computed 90 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13711271713473104435.kers
Total runtime 3 ms.
[2026-05-31 19:12:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 80/291 variables, 82/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 11/302 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 300/602 variables, 302/392 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 18/620 variables, 9/401 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/620 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 1/621 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (OVERLAPS) 0/621 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 621/621 variables, and 402 constraints, problems are : Problem set: 0 solved, 112 unsolved in 15239 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 311/311 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 112/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 80/291 variables, 82/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 11/302 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 300/602 variables, 302/392 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 111/503 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 18/620 variables, 9/512 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/620 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 1/621 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/621 variables, and 513 constraints, problems are : Problem set: 0 solved, 112 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 311/311 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 112/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35283ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 35284ms
[2026-05-31 19:12:37] [INFO ] Invariant cache hit.
[2026-05-31 19:12:37] [INFO ] Implicit Places using invariants in 267 ms returned [0, 295, 299, 300, 302, 305, 308]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 268 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 304/703 places, 310/783 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 304 transition count 303
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 21 place count 297 transition count 296
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 21 place count 297 transition count 289
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 35 place count 290 transition count 289
Applied a total of 35 rules in 23 ms. Remains 290 /304 variables (removed 14) and now considering 289/310 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6658904661473371746.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7091453620056484757.kers'
[2026-05-31 19:12:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6658904661473371746.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7091453620056484757.kers]
Normalized transition count is 288 out of 289 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 290 cols 831 entries
Finished phase 1 with 197 SingleSign rule and 10 generalized
[2026-05-31 19:12:37] [INFO ] Computed 83 invariants in 1 ms
Computed 83 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7091453620056484757.kers
Total runtime 2 ms.
[2026-05-31 19:12:38] [INFO ] Implicit Places using invariants in 250 ms returned []
[2026-05-31 19:12:38] [INFO ] Invariant cache hit.
[2026-05-31 19:12:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:12:38] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 290/703 places, 289/783 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36290 ms. Remains : 290/703 places, 289/783 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SupplyChain-PT-00100-LTLFireability-07
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00100-LTLFireability-07 finished in 36397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U p1)))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 783/783 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 697 transition count 783
Applied a total of 6 rules in 14 ms. Remains 697 /703 variables (removed 6) and now considering 783/783 (removed 0) transitions.
Running 683 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-4812751649073031882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18235301205346632007.kers'
[2026-05-31 19:12:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4812751649073031882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18235301205346632007.kers]
Normalized transition count is 782 out of 783 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 782 rows 697 cols 1861 entries
Finished phase 1 with 589 SingleSign rule and 13 generalized
[2026-05-31 19:12:38] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18235301205346632007.kers
Total runtime 3 ms.
[2026-05-31 19:12:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 80/677 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/1480 variables, and 93 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 4/6 constraints, State Equation: 0/697 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 683/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 683 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 80/677 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/1480 variables, and 93 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 4/6 constraints, State Equation: 0/697 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40222ms problems are : Problem set: 0 solved, 683 unsolved
Search for dead transitions found 0 dead transitions in 40224ms
[2026-05-31 19:13:18] [INFO ] Invariant cache hit.
[2026-05-31 19:13:19] [INFO ] Implicit Places using invariants in 343 ms returned [0, 240, 245, 246, 249, 252, 255, 681, 683, 685, 688, 691, 694]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 345 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 684/703 places, 783/783 transitions.
Applied a total of 0 rules in 10 ms. Remains 684 /684 variables (removed 0) and now considering 783/783 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40595 ms. Remains : 684/703 places, 783/783 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U p1)))'
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SupplyChain-PT-00100-LTLFireability-09
Stuttering criterion allowed to conclude after 598 steps with 1 reset in 8 ms.
FORMULA SupplyChain-PT-00100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00100-LTLFireability-09 finished in 40775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(!p0) U X(X(X(p1)))))))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 783/783 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 697 transition count 783
Applied a total of 6 rules in 15 ms. Remains 697 /703 variables (removed 6) and now considering 783/783 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 19:13:19] [INFO ] Invariant cache hit.
[2026-05-31 19:13:19] [INFO ] Implicit Places using invariants in 320 ms returned [0, 240, 245, 249, 252, 255, 681, 683, 685, 686, 688, 691, 694]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 321 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 684/703 places, 783/783 transitions.
Applied a total of 0 rules in 9 ms. Remains 684 /684 variables (removed 0) and now considering 783/783 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 345 ms. Remains : 684/703 places, 783/783 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(!p0) U X(X(X(p1)))))))'
Stuttering acceptance computed with spot in 372 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : SupplyChain-PT-00100-LTLFireability-10
Product exploration explored 100000 steps with 547 reset in 900 ms.
Product exploration explored 100000 steps with 542 reset in 993 ms.
Computed a total of 684 stabilizing places and 782 stable transitions
Computed a total of 684 stabilizing places and 782 stable transitions
Detected a total of 684/684 stabilizing places and 782/783 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 12 states, 17 edges and 2 AP (stutter sensitive).
RANDOM walk for 1382 steps (1 resets) in 33 ms. (40 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 12 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 475 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13241784701546357687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12321076867506622080.kers'
[2026-05-31 19:13:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13241784701546357687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12321076867506622080.kers]
Normalized transition count is 782 out of 783 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 782 rows 684 cols 1817 entries
Finished phase 1 with 592 SingleSign rule and 10 generalized
[2026-05-31 19:13:22] [INFO ] Computed 82 invariants in 2 ms
Computed 82 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12321076867506622080.kers
Total runtime 3 ms.
[2026-05-31 19:13:23] [INFO ] [Real]Absence check using 81 positive place invariants in 26 ms returned sat
[2026-05-31 19:13:23] [INFO ] [Real]Absence check using 81 positive and 1 generalized place invariants in 17 ms returned sat
[2026-05-31 19:13:24] [INFO ] [Real]Absence check using state equation in 1963 ms returned sat
[2026-05-31 19:13:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 19:13:25] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2026-05-31 19:13:25] [INFO ] [Nat]Absence check using 81 positive and 1 generalized place invariants in 5 ms returned sat
[2026-05-31 19:13:28] [INFO ] [Nat]Absence check using state equation in 2931 ms returned sat
[2026-05-31 19:13:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:13:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2026-05-31 19:13:28] [INFO ] Computed and/alt/rep : 682/786/682 causal constraints (skipped 1 transitions) in 39 ms.
[2026-05-31 19:13:33] [INFO ] Added : 314 causal constraints over 63 iterations in 4987 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 11351 ms.
Stuttering acceptance computed with spot in 401 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Support contains 4 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 783/783 transitions.
Applied a total of 0 rules in 16 ms. Remains 684 /684 variables (removed 0) and now considering 783/783 (removed 0) transitions.
Running 683 sub problems to find dead transitions.
[2026-05-31 19:13:33] [INFO ] Invariant cache hit.
[2026-05-31 19:13:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (OVERLAPS) 80/664 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/1467 variables, and 81 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/684 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 683/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 683 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (OVERLAPS) 80/664 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/1467 variables, and 81 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/684 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40235ms problems are : Problem set: 0 solved, 683 unsolved
Search for dead transitions found 0 dead transitions in 40236ms
[2026-05-31 19:14:13] [INFO ] Invariant cache hit.
[2026-05-31 19:14:14] [INFO ] Implicit Places using invariants in 289 ms returned []
[2026-05-31 19:14:14] [INFO ] Invariant cache hit.
[2026-05-31 19:14:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:14:14] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 41185 ms. Remains : 684/684 places, 783/783 transitions.
Computed a total of 684 stabilizing places and 782 stable transitions
Computed a total of 684 stabilizing places and 782 stable transitions
Detected a total of 684/684 stabilizing places and 782/783 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 12 states, 17 edges and 2 AP (stutter sensitive).
RANDOM walk for 2381 steps (4 resets) in 53 ms. (44 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 12 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 521 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
[2026-05-31 19:14:15] [INFO ] Invariant cache hit.
[2026-05-31 19:14:16] [INFO ] [Real]Absence check using 81 positive place invariants in 29 ms returned sat
[2026-05-31 19:14:16] [INFO ] [Real]Absence check using 81 positive and 1 generalized place invariants in 19 ms returned sat
[2026-05-31 19:14:18] [INFO ] [Real]Absence check using state equation in 2081 ms returned sat
[2026-05-31 19:14:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 19:14:18] [INFO ] [Nat]Absence check using 81 positive place invariants in 20 ms returned sat
[2026-05-31 19:14:18] [INFO ] [Nat]Absence check using 81 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-31 19:14:21] [INFO ] [Nat]Absence check using state equation in 3118 ms returned sat
[2026-05-31 19:14:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:14:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2026-05-31 19:14:21] [INFO ] Computed and/alt/rep : 682/786/682 causal constraints (skipped 1 transitions) in 45 ms.
[2026-05-31 19:14:26] [INFO ] Added : 314 causal constraints over 63 iterations in 5081 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 11884 ms.
Stuttering acceptance computed with spot in 484 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 508 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 558 reset in 935 ms.
Product exploration explored 100000 steps with 541 reset in 984 ms.
Spot run failed in 86 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin12130824802543957634
[2026-05-31 19:14:29] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12130824802543957634
Running compilation step : cd /tmp/ltsmin12130824802543957634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1242 ms.
Running link step : cd /tmp/ltsmin12130824802543957634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12130824802543957634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7922652289527949444.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 783/783 transitions.
Applied a total of 0 rules in 8 ms. Remains 684 /684 variables (removed 0) and now considering 783/783 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 19:14:44] [INFO ] Invariant cache hit.
[2026-05-31 19:14:45] [INFO ] Implicit Places using invariants in 319 ms returned []
[2026-05-31 19:14:45] [INFO ] Invariant cache hit.
[2026-05-31 19:14:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:14:45] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 955 ms. Remains : 684/684 places, 783/783 transitions.
Built C files in :
/tmp/ltsmin11933569139662506697
[2026-05-31 19:14:45] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11933569139662506697
Running compilation step : cd /tmp/ltsmin11933569139662506697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1148 ms.
Running link step : cd /tmp/ltsmin11933569139662506697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11933569139662506697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10778354834374039149.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 19:15:00] [INFO ] Flatten gal took : 27 ms
[2026-05-31 19:15:00] [INFO ] Flatten gal took : 31 ms
[2026-05-31 19:15:00] [INFO ] Time to serialize gal into /tmp/LTL601284218561652190.gal : 5 ms
[2026-05-31 19:15:00] [INFO ] Time to serialize properties into /tmp/LTL893681124489617716.prop : 0 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL601284218561652190.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12029106430622072006.hoa' '-atoms' '/tmp/LTL893681124489617716.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL893681124489617716.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12029106430622072006.hoa
Detected timeout of ITS tools.
[2026-05-31 19:15:15] [INFO ] Flatten gal took : 20 ms
[2026-05-31 19:15:16] [INFO ] Flatten gal took : 16 ms
[2026-05-31 19:15:16] [INFO ] Time to serialize gal into /tmp/LTL18008601141886729.gal : 10 ms
[2026-05-31 19:15:16] [INFO ] Time to serialize properties into /tmp/LTL4950744744261403607.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18008601141886729.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4950744744261403607.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((X(G((F(!("(((p101>=1)&&(p455>=1))&&(p560>=1))")))U(X(X(X("(p713>=1)"))))))))
Formula 0 simplified : XF(G"(((p101>=1)&&(p455>=1))&&(p560>=1))" R XXX!"(p713>=1)")
Detected timeout of ITS tools.
[2026-05-31 19:15:31] [INFO ] Flatten gal took : 16 ms
[2026-05-31 19:15:31] [INFO ] Applying decomposition
[2026-05-31 19:15:31] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7945146324010418430.txt' '-o' '/tmp/graph7945146324010418430.bin' '-w' '/tmp/graph7945146324010418430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7945146324010418430.bin' '-l' '-1' '-v' '-w' '/tmp/graph7945146324010418430.weights' '-q' '0' '-e' '0.001'
[2026-05-31 19:15:31] [INFO ] Decomposing Gal with order
[2026-05-31 19:15:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 19:15:31] [INFO ] Removed a total of 125 redundant transitions.
[2026-05-31 19:15:31] [INFO ] Flatten gal took : 57 ms
[2026-05-31 19:15:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 10 ms.
[2026-05-31 19:15:31] [INFO ] Time to serialize gal into /tmp/LTL463899891200037444.gal : 6 ms
[2026-05-31 19:15:31] [INFO ] Time to serialize properties into /tmp/LTL6955054780311540489.ltl : 0 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL463899891200037444.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6955054780311540489.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(G((F(!("(((u0.p101>=1)&&(i14.u15.p455>=1))&&(i14.u76.p560>=1))")))U(X(X(X("(i27.u28.p713>=1)"))))))))
Formula 0 simplified : XF(G"(((u0.p101>=1)&&(i14.u15.p455>=1))&&(i14.u76.p560>=1))" R XXX!"(i27.u28.p713>=1)")
Detected timeout of ITS tools.
Treatment of property SupplyChain-PT-00100-LTLFireability-10 finished in 147058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X((p1 U X(p2)))||G(p3))))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 783/783 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 697 transition count 783
Applied a total of 6 rules in 16 ms. Remains 697 /703 variables (removed 6) and now considering 783/783 (removed 0) transitions.
Running 683 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-15583804668730179273.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16990074902244623813.kers'
[2026-05-31 19:15:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15583804668730179273.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16990074902244623813.kers]
Normalized transition count is 782 out of 783 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 782 rows 697 cols 1861 entries
Finished phase 1 with 589 SingleSign rule and 13 generalized
[2026-05-31 19:15:46] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16990074902244623813.kers
Total runtime 3 ms.
[2026-05-31 19:15:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 80/677 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/1480 variables, and 93 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 4/6 constraints, State Equation: 0/697 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 683/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 683 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 80/677 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/1480 variables, and 93 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 4/6 constraints, State Equation: 0/697 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40214ms problems are : Problem set: 0 solved, 683 unsolved
Search for dead transitions found 0 dead transitions in 40216ms
[2026-05-31 19:16:26] [INFO ] Invariant cache hit.
[2026-05-31 19:16:26] [INFO ] Implicit Places using invariants in 333 ms returned [0, 240, 245, 246, 249, 252, 255, 681, 683, 685, 686, 688, 691, 694]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 334 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 683/703 places, 783/783 transitions.
Applied a total of 0 rules in 8 ms. Remains 683 /683 variables (removed 0) and now considering 783/783 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40577 ms. Remains : 683/703 places, 783/783 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X((p1 U X(p2)))||G(p3))))'
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : SupplyChain-PT-00100-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00100-LTLFireability-11 finished in 40988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X((X(p1)||G(p2)))))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 783/783 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 697 transition count 783
Applied a total of 6 rules in 13 ms. Remains 697 /703 variables (removed 6) and now considering 783/783 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 19:16:27] [INFO ] Invariant cache hit.
[2026-05-31 19:16:27] [INFO ] Implicit Places using invariants in 329 ms returned [240, 245, 246, 249, 252, 255, 681, 683, 685, 686, 688, 691]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 330 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 685/703 places, 783/783 transitions.
Applied a total of 0 rules in 9 ms. Remains 685 /685 variables (removed 0) and now considering 783/783 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 353 ms. Remains : 685/703 places, 783/783 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X((X(p1)||G(p2)))))))'
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SupplyChain-PT-00100-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00100-LTLFireability-12 finished in 660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(X(p0)))&&(p1 U (p2||G(p1)))))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 783/783 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 697 transition count 783
Applied a total of 6 rules in 14 ms. Remains 697 /703 variables (removed 6) and now considering 783/783 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 19:16:28] [INFO ] Invariant cache hit.
[2026-05-31 19:16:28] [INFO ] Implicit Places using invariants in 317 ms returned [0, 240, 245, 246, 249, 252, 255, 683, 685, 686, 691, 694]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 323 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 685/703 places, 783/783 transitions.
Applied a total of 0 rules in 8 ms. Remains 685 /685 variables (removed 0) and now considering 783/783 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 346 ms. Remains : 685/703 places, 783/783 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(X(p0)))&&(p1 U (p2||G(p1)))))))'
Stuttering acceptance computed with spot in 481 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : SupplyChain-PT-00100-LTLFireability-13
Stuttering criterion allowed to conclude after 5375 steps with 22 reset in 57 ms.
FORMULA SupplyChain-PT-00100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00100-LTLFireability-13 finished in 936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 783/783 transitions.
Graph (complete) has 1278 edges and 703 vertex of which 701 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 4 places
Reduce places removed 102 places and 98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 599 transition count 594
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 1 with 270 rules applied. Total rules applied 362 place count 508 transition count 415
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 450 place count 420 transition count 415
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 450 place count 420 transition count 316
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 653 place count 316 transition count 316
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 653 place count 316 transition count 311
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 663 place count 311 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 664 place count 311 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 664 place count 311 transition count 309
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 666 place count 310 transition count 309
Applied a total of 666 rules in 44 ms. Remains 310 /703 variables (removed 393) and now considering 309/783 (removed 474) transitions.
Running 110 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-15478964338181363140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2611517534453155568.kers'
[2026-05-31 19:16:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15478964338181363140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2611517534453155568.kers]
Normalized transition count is 308 out of 309 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 310 cols 884 entries
Finished phase 1 with 209 SingleSign rule and 11 generalized
[2026-05-31 19:16:29] [INFO ] Computed 90 invariants in 1 ms
Computed 90 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2611517534453155568.kers
Total runtime 2 ms.
[2026-05-31 19:16:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 80/290 variables, 81/87 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 11/301 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 299/600 variables, 301/391 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 18/618 variables, 9/400 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/618 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 1/619 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/619 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/619 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 619/619 variables, and 401 constraints, problems are : Problem set: 0 solved, 110 unsolved in 14643 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 310/310 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 80/290 variables, 81/87 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 11/301 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 299/600 variables, 301/391 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 109/500 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 18/618 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/618 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 1/619 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/619 variables, and 510 constraints, problems are : Problem set: 0 solved, 110 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 310/310 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34676ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 34677ms
[2026-05-31 19:17:03] [INFO ] Invariant cache hit.
[2026-05-31 19:17:03] [INFO ] Implicit Places using invariants in 247 ms returned [0, 294, 296, 298, 299, 301, 304, 307]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 249 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/703 places, 309/783 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 302 transition count 301
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 24 place count 294 transition count 293
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 24 place count 294 transition count 285
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 40 place count 286 transition count 285
Applied a total of 40 rules in 14 ms. Remains 286 /302 variables (removed 16) and now considering 285/309 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5220193120147366412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11886542312477806054.kers'
[2026-05-31 19:17:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5220193120147366412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11886542312477806054.kers]
Normalized transition count is 284 out of 285 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 284 rows 286 cols 820 entries
Finished phase 1 with 194 SingleSign rule and 10 generalized
[2026-05-31 19:17:03] [INFO ] Computed 82 invariants in 1 ms
Computed 82 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11886542312477806054.kers
Total runtime 1 ms.
[2026-05-31 19:17:04] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-31 19:17:04] [INFO ] Invariant cache hit.
[2026-05-31 19:17:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:17:04] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/703 places, 285/783 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35577 ms. Remains : 286/703 places, 285/783 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : SupplyChain-PT-00100-LTLFireability-14
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 2 ms.
FORMULA SupplyChain-PT-00100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00100-LTLFireability-14 finished in 35641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p1&&(p1 U (!p2||G(p1))))))||p0)))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 783/783 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 697 transition count 783
Applied a total of 6 rules in 14 ms. Remains 697 /703 variables (removed 6) and now considering 783/783 (removed 0) transitions.
Running 683 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-79865271317394954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6533284914360726609.kers'
[2026-05-31 19:17:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-79865271317394954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6533284914360726609.kers]
Normalized transition count is 782 out of 783 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 782 rows 697 cols 1861 entries
Finished phase 1 with 589 SingleSign rule and 13 generalized
[2026-05-31 19:17:04] [INFO ] Computed 95 invariants in 5 ms
Computed 95 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6533284914360726609.kers
Total runtime 6 ms.
[2026-05-31 19:17:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 80/677 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/1480 variables, and 93 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 4/6 constraints, State Equation: 0/697 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 683/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 683 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 80/677 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/1480 variables, and 93 constraints, problems are : Problem set: 0 solved, 683 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 4/6 constraints, State Equation: 0/697 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40204ms problems are : Problem set: 0 solved, 683 unsolved
Search for dead transitions found 0 dead transitions in 40205ms
[2026-05-31 19:17:44] [INFO ] Invariant cache hit.
[2026-05-31 19:17:45] [INFO ] Implicit Places using invariants in 326 ms returned [0, 240, 245, 246, 255, 681, 683, 685, 686, 688, 691, 694]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 329 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 685/703 places, 783/783 transitions.
Applied a total of 0 rules in 11 ms. Remains 685 /685 variables (removed 0) and now considering 783/783 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40560 ms. Remains : 685/703 places, 783/783 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p1&&(p1 U (!p2||G(p1))))))||p0)))'
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SupplyChain-PT-00100-LTLFireability-15
Product exploration explored 100000 steps with 259 reset in 814 ms.
Product exploration explored 100000 steps with 260 reset in 842 ms.
Computed a total of 685 stabilizing places and 782 stable transitions
Computed a total of 685 stabilizing places and 782 stable transitions
Detected a total of 685/685 stabilizing places and 782/783 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 820 steps (0 resets) in 20 ms. (39 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Knowledge-based reduction took 204 ms.
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Support contains 1 out of 685 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 685/685 places, 783/783 transitions.
Reduce places removed 100 places and 100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 585 transition count 585
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 1 with 294 rules applied. Total rules applied 392 place count 487 transition count 389
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 2 with 98 rules applied. Total rules applied 490 place count 389 transition count 389
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 490 place count 389 transition count 291
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 686 place count 291 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 688 place count 291 transition count 289
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 688 place count 291 transition count 287
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 692 place count 289 transition count 287
Applied a total of 692 rules in 32 ms. Remains 289 /685 variables (removed 396) and now considering 287/783 (removed 496) transitions.
Running 89 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-16054537855893377043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1527756123957335650.kers'
[2026-05-31 19:17:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16054537855893377043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1527756123957335650.kers]
Normalized transition count is 286 out of 287 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 286 rows 289 cols 827 entries
Finished phase 1 with 195 SingleSign rule and 11 generalized
[2026-05-31 19:17:47] [INFO ] Computed 83 invariants in 1 ms
Computed 83 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1527756123957335650.kers
Total runtime 2 ms.
[2026-05-31 19:17:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 80/269 variables, 80/81 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 10/279 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 277/556 variables, 279/362 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 19/575 variables, 10/372 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 1/576 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/576 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 373 constraints, problems are : Problem set: 0 solved, 89 unsolved in 11495 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 289/289 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 80/269 variables, 80/81 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 10/279 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 277/556 variables, 279/362 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 88/450 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 19/575 variables, 10/460 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 1/576 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 461 constraints, problems are : Problem set: 0 solved, 89 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 289/289 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31527ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 31527ms
[2026-05-31 19:18:18] [INFO ] Invariant cache hit.
[2026-05-31 19:18:18] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-31 19:18:18] [INFO ] Invariant cache hit.
[2026-05-31 19:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:18:19] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2026-05-31 19:18:19] [INFO ] Redundant transitions in 14 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/685 places, 287/783 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32207 ms. Remains : 289/685 places, 287/783 transitions.
Computed a total of 289 stabilizing places and 286 stable transitions
Computed a total of 289 stabilizing places and 286 stable transitions
Detected a total of 289/289 stabilizing places and 286/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 54 steps (0 resets) in 7 ms. (6 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Knowledge-based reduction took 234 ms.
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2560 reset in 1009 ms.
Product exploration explored 100000 steps with 2533 reset in 1066 ms.
Built C files in :
/tmp/ltsmin933728543557301742
[2026-05-31 19:18:21] [INFO ] Computing symmetric may disable matrix : 287 transitions.
[2026-05-31 19:18:21] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:18:21] [INFO ] Computing symmetric may enable matrix : 287 transitions.
[2026-05-31 19:18:21] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:18:21] [INFO ] Computing Do-Not-Accords matrix : 287 transitions.
[2026-05-31 19:18:21] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:18:21] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin933728543557301742
Running compilation step : cd /tmp/ltsmin933728543557301742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 615 ms.
Running link step : cd /tmp/ltsmin933728543557301742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin933728543557301742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5787990036086879687.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 287/287 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 288 transition count 206
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 240 place count 208 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 240 place count 208 transition count 125
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 243 place count 206 transition count 125
Applied a total of 243 rules in 7 ms. Remains 206 /289 variables (removed 83) and now considering 125/287 (removed 162) transitions.
Running 6 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-17968290389469890648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12655630495870089400.kers'
[2026-05-31 19:18:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17968290389469890648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12655630495870089400.kers]
Normalized transition count is 124 out of 125 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 124 rows 206 cols 340 entries
Finished phase 1 with 114 SingleSign rule and 10 generalized
[2026-05-31 19:18:36] [INFO ] Computed 82 invariants in 0 ms
Computed 82 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12655630495870089400.kers
Total runtime 0 ms.
[2026-05-31 19:18:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 80/186 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/196 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 114/310 variables, 196/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 20/330 variables, 10/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/331 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/331 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 289 constraints, problems are : Problem set: 0 solved, 6 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 80/186 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/196 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 114/310 variables, 196/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 5/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 20/330 variables, 10/293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/331 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/331 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 294 constraints, problems are : Problem set: 0 solved, 6 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1051ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 1051ms
[2026-05-31 19:18:37] [INFO ] Invariant cache hit.
[2026-05-31 19:18:38] [INFO ] Implicit Places using invariants in 238 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 239 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/289 places, 125/287 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1301 ms. Remains : 205/289 places, 125/287 transitions.
Built C files in :
/tmp/ltsmin14020967833971841618
[2026-05-31 19:18:38] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2026-05-31 19:18:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:18:38] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2026-05-31 19:18:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:18:38] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2026-05-31 19:18:38] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:18:38] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14020967833971841618
Running compilation step : cd /tmp/ltsmin14020967833971841618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 274 ms.
Running link step : cd /tmp/ltsmin14020967833971841618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14020967833971841618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6975632033883030411.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 19:18:53] [INFO ] Flatten gal took : 4 ms
[2026-05-31 19:18:53] [INFO ] Flatten gal took : 3 ms
[2026-05-31 19:18:53] [INFO ] Time to serialize gal into /tmp/LTL5538309379003763557.gal : 1 ms
[2026-05-31 19:18:53] [INFO ] Time to serialize properties into /tmp/LTL3569056263911074352.prop : 0 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5538309379003763557.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18372524448430069645.hoa' '-atoms' '/tmp/LTL3569056263911074352.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3569056263911074352.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18372524448430069645.hoa
Detected timeout of ITS tools.
[2026-05-31 19:19:08] [INFO ] Flatten gal took : 7 ms
[2026-05-31 19:19:08] [INFO ] Flatten gal took : 6 ms
[2026-05-31 19:19:08] [INFO ] Time to serialize gal into /tmp/LTL2014645330073568244.gal : 2 ms
[2026-05-31 19:19:08] [INFO ] Time to serialize properties into /tmp/LTL4442933134958925405.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2014645330073568244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4442933134958925405.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(((F(G(("(p704<1)")&&(("(p704<1)")U((!("(((p101>=1)&&(p498>=1))&&(p503>=1))"))||(G("(p704<1)")))))))||("((p479>=1)&&(p502>=1))"))|...198
Formula 0 simplified : X(!"(((p101>=1)&&(p498>=1))&&(p503>=1))" & !"((p479>=1)&&(p502>=1))" & GF(!"(p704<1)" | (!"(p704<1)" M "(((p101>=1)&&(p498>=1))&&(p5...166
Detected timeout of ITS tools.
[2026-05-31 19:19:23] [INFO ] Flatten gal took : 8 ms
[2026-05-31 19:19:23] [INFO ] Applying decomposition
[2026-05-31 19:19:23] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18088180483716840825.txt' '-o' '/tmp/graph18088180483716840825.bin' '-w' '/tmp/graph18088180483716840825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18088180483716840825.bin' '-l' '-1' '-v' '-w' '/tmp/graph18088180483716840825.weights' '-q' '0' '-e' '0.001'
[2026-05-31 19:19:23] [INFO ] Decomposing Gal with order
[2026-05-31 19:19:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 19:19:23] [INFO ] Removed a total of 260 redundant transitions.
[2026-05-31 19:19:23] [INFO ] Flatten gal took : 15 ms
[2026-05-31 19:19:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-31 19:19:23] [INFO ] Time to serialize gal into /tmp/LTL6437341965099997822.gal : 2 ms
[2026-05-31 19:19:23] [INFO ] Time to serialize properties into /tmp/LTL11186886739298066912.ltl : 0 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6437341965099997822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11186886739298066912.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(((F(G(("(i20.u24.p704<1)")&&(("(i20.u24.p704<1)")U((!("(((i0.u0.p101>=1)&&(i20.u42.p498>=1))&&(i20.u24.p503>=1))"))||(G("(i20.u24...282
Formula 0 simplified : X(!"(((i0.u0.p101>=1)&&(i20.u42.p498>=1))&&(i20.u24.p503>=1))" & !"((i34.u41.p479>=1)&&(i34.u34.p502>=1))" & GF(!"(i20.u24.p704<1)" ...242
Reverse transition relation is NOT exact ! Due to transitions t381, t762, t755_t127_t382, t760_t128_t383, t777_t727_t228_t370, t778_t733_t229_t372, t779_t7...554
Computing Next relation with stutter on 6.33825e+30 deadlock states
Detected timeout of ITS tools.
Treatment of property SupplyChain-PT-00100-LTLFireability-15 finished in 153803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(!p0) U X(X(X(p1)))))))'
Spot run failed in 40 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p1&&(p1 U (!p2||G(p1))))))||p0)))'
Spot run failed in 43 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-31 19:19:38] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5762229529644891199
[2026-05-31 19:19:38] [INFO ] Applying decomposition
[2026-05-31 19:19:38] [INFO ] Computing symmetric may disable matrix : 783 transitions.
[2026-05-31 19:19:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 19:19:38] [INFO ] Computing symmetric may enable matrix : 783 transitions.
[2026-05-31 19:19:38] [INFO ] Flatten gal took : 12 ms
[2026-05-31 19:19:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3933880837705157624.txt' '-o' '/tmp/graph3933880837705157624.bin' '-w' '/tmp/graph3933880837705157624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3933880837705157624.bin' '-l' '-1' '-v' '-w' '/tmp/graph3933880837705157624.weights' '-q' '0' '-e' '0.001'
[2026-05-31 19:19:38] [INFO ] Decomposing Gal with order
[2026-05-31 19:19:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 19:19:38] [INFO ] Removed a total of 146 redundant transitions.
[2026-05-31 19:19:38] [INFO ] Flatten gal took : 32 ms
[2026-05-31 19:19:38] [INFO ] Computing Do-Not-Accords matrix : 783 transitions.
[2026-05-31 19:19:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 312 labels/synchronizations in 14 ms.
[2026-05-31 19:19:38] [INFO ] Time to serialize gal into /tmp/LTLFireability13183865274648631348.gal : 4 ms
[2026-05-31 19:19:38] [INFO ] Time to serialize properties into /tmp/LTLFireability6992377457575784475.ltl : 0 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13183865274648631348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6992377457575784475.ltl' '-c' '-stutter-deadlock'
[2026-05-31 19:19:38] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
[2026-05-31 19:19:38] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5762229529644891199
Running compilation step : cd /tmp/ltsmin5762229529644891199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((X(G((F(!("(((i58.u0.p101>=1)&&(i53.u49.p455>=1))&&(i53.u67.p560>=1))")))U(X(X(X("(u33.p713>=1)"))))))))
Formula 0 simplified : XF(G"(((i58.u0.p101>=1)&&(i53.u49.p455>=1))&&(i53.u67.p560>=1))" R XXX!"(u33.p713>=1)")
Compilation finished in 2079 ms.
Running link step : cd /tmp/ltsmin5762229529644891199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5762229529644891199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([]((<>(!(LTLAPp0==true)) U X(X(X((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5762229529644891199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([]((<>(!(LTLAPp0==true)) U X(X(X((LTLAPp1==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5762229529644891199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X((<>([](((LTLAPp3==true)&&((LTLAPp3==true) U (!(LTLAPp4==true)||[]((LTLAPp3==true)))))))||(LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-31 19:43:53] [INFO ] Flatten gal took : 287 ms
[2026-05-31 19:43:53] [INFO ] Time to serialize gal into /tmp/LTLFireability11336095417423416513.gal : 50 ms
[2026-05-31 19:43:53] [INFO ] Time to serialize properties into /tmp/LTLFireability5104776384330208742.ltl : 18 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11336095417423416513.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5104776384330208742.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((X(G((F(!("(((p101>=1)&&(p455>=1))&&(p560>=1))")))U(X(X(X("(p713>=1)"))))))))
Formula 0 simplified : XF(G"(((p101>=1)&&(p455>=1))&&(p560>=1))" R XXX!"(p713>=1)")
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5762229529644891199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X((<>([](((LTLAPp3==true)&&((LTLAPp3==true) U (!(LTLAPp4==true)||[]((LTLAPp3==true)))))))||(LTLAPp2==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin5762229529644891199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([]((<>(!(LTLAPp0==true)) U X(X(X((LTLAPp1==true)))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-00100"
export BK_EXAMINATION="LTLFireability"
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-00100, examination is LTLFireability"
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-178024402800204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SupplyChain-PT-00100.tgz
mv SupplyChain-PT-00100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;