fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654446400131
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBLF-COL-S04J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15714.451 3600000.00 5949028.00 805.10 FFT?F?TFTFFFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446400131.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S04J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446400131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716908379176

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-28 14:59:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 14:59:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:59:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 14:59:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:59:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 732 ms
[2024-05-28 14:59:41] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 712 PT places and 4080.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 14:59:41] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 14:59:41] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40003 steps (13 resets) in 1929 ms. (20 steps per ms) remains 8/30 properties
BEST_FIRST walk for 40002 steps (11 resets) in 352 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (14 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (11 resets) in 280 ms. (142 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
[2024-05-28 14:59:42] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:59:42] [INFO ] Computed 26 invariants in 15 ms
[2024-05-28 14:59:42] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/50 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 5/55 variables, 3/10 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/56 variables, 1/11 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 26 constraints, problems are : Problem set: 8 solved, 0 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 413ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:59:43] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-28 14:59:43] [INFO ] Flatten gal took : 37 ms
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:59:43] [INFO ] Flatten gal took : 7 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:59:43] [INFO ] Unfolded HLPN to a Petri net with 712 places and 4012 transitions 27744 arcs in 91 ms.
[2024-05-28 14:59:43] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 332 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Applied a total of 4 rules in 58 ms. Remains 708 /712 variables (removed 4) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-28 14:59:43] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-05-28 14:59:43] [INFO ] Computed 50 invariants in 97 ms
[2024-05-28 14:59:43] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 15:00:08] [INFO ] Deduced a trap composed of 75 places in 284 ms of which 25 ms to minimize.
[2024-05-28 15:00:08] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:00:08] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:00:08] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:00:08] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 1 ms to minimize.
[2024-05-28 15:00:08] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 12 ms to minimize.
[2024-05-28 15:00:09] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:00:10] [INFO ] Deduced a trap composed of 403 places in 607 ms of which 21 ms to minimize.
[2024-05-28 15:00:10] [INFO ] Deduced a trap composed of 378 places in 428 ms of which 23 ms to minimize.
[2024-05-28 15:00:11] [INFO ] Deduced a trap composed of 191 places in 479 ms of which 7 ms to minimize.
[2024-05-28 15:00:12] [INFO ] Deduced a trap composed of 416 places in 528 ms of which 5 ms to minimize.
SMT process timed out in 29274ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 29330ms
[2024-05-28 15:00:12] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 15:00:12] [INFO ] Invariant cache hit.
[2024-05-28 15:00:13] [INFO ] Implicit Places using invariants in 606 ms returned [548, 549, 550, 551, 552, 553, 554, 555]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 618 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 700/712 places, 1844/1844 transitions.
Applied a total of 0 rules in 21 ms. Remains 700 /700 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30056 ms. Remains : 700/712 places, 1844/1844 transitions.
Support contains 332 out of 700 places after structural reductions.
[2024-05-28 15:00:13] [INFO ] Flatten gal took : 150 ms
[2024-05-28 15:00:13] [INFO ] Flatten gal took : 115 ms
[2024-05-28 15:00:14] [INFO ] Input system was already deterministic with 1844 transitions.
Support contains 284 out of 700 places (down from 332) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 510 ms. (78 steps per ms) remains 3/20 properties
BEST_FIRST walk for 40003 steps (8 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
[2024-05-28 15:00:14] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 700 cols
[2024-05-28 15:00:14] [INFO ] Computed 42 invariants in 66 ms
[2024-05-28 15:00:14] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 635/656 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/656 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 12/668 variables, 10/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 698/2512 variables, and 41 constraints, problems are : Problem set: 3 solved, 0 unsolved in 747 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 842ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 684 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 684 transition count 1828
Applied a total of 32 rules in 77 ms. Remains 684 /700 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 15:00:15] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-05-28 15:00:15] [INFO ] Computed 42 invariants in 35 ms
[2024-05-28 15:00:15] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:00:38] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:00:38] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-05-28 15:00:38] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 1 ms to minimize.
[2024-05-28 15:00:38] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-28 15:00:38] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:00:39] [INFO ] Deduced a trap composed of 200 places in 382 ms of which 5 ms to minimize.
[2024-05-28 15:00:40] [INFO ] Deduced a trap composed of 74 places in 329 ms of which 4 ms to minimize.
[2024-05-28 15:00:41] [INFO ] Deduced a trap composed of 427 places in 325 ms of which 4 ms to minimize.
[2024-05-28 15:00:43] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 47 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:00:50] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:00:54] [INFO ] Deduced a trap composed of 416 places in 307 ms of which 4 ms to minimize.
[2024-05-28 15:00:55] [INFO ] Deduced a trap composed of 410 places in 292 ms of which 3 ms to minimize.
[2024-05-28 15:00:59] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 13/13 constraints]
After SMT, in 48376ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48396ms
[2024-05-28 15:01:04] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:01:04] [INFO ] Invariant cache hit.
[2024-05-28 15:01:04] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-05-28 15:01:04] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:01:04] [INFO ] Invariant cache hit.
[2024-05-28 15:01:05] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:01:17] [INFO ] Implicit Places using invariants and state equation in 12864 ms returned []
Implicit Place search using SMT with State Equation took 13443 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 15:01:17] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:01:17] [INFO ] Invariant cache hit.
[2024-05-28 15:01:17] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:01:40] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-05-28 15:01:40] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:01:40] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:01:41] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 13 ms to minimize.
[2024-05-28 15:01:41] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:01:41] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:01:41] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:01:41] [INFO ] Deduced a trap composed of 377 places in 278 ms of which 4 ms to minimize.
[2024-05-28 15:01:42] [INFO ] Deduced a trap composed of 181 places in 265 ms of which 4 ms to minimize.
[2024-05-28 15:01:42] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2024-05-28 15:01:44] [INFO ] Deduced a trap composed of 383 places in 482 ms of which 6 ms to minimize.
[2024-05-28 15:01:44] [INFO ] Deduced a trap composed of 394 places in 440 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:01:58] [INFO ] Deduced a trap composed of 410 places in 365 ms of which 4 ms to minimize.
[2024-05-28 15:02:20] [INFO ] Deduced a trap composed of 366 places in 302 ms of which 4 ms to minimize.
[2024-05-28 15:02:20] [INFO ] Deduced a trap composed of 379 places in 314 ms of which 3 ms to minimize.
[2024-05-28 15:02:21] [INFO ] Deduced a trap composed of 380 places in 306 ms of which 4 ms to minimize.
[2024-05-28 15:02:22] [INFO ] Deduced a trap composed of 69 places in 179 ms of which 2 ms to minimize.
[2024-05-28 15:02:26] [INFO ] Deduced a trap composed of 392 places in 330 ms of which 3 ms to minimize.
SMT process timed out in 68609ms, After SMT, problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 68629ms
Starting structural reductions in LTL mode, iteration 1 : 684/700 places, 1828/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130556 ms. Remains : 684/700 places, 1828/1844 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 25000 reset in 801 ms.
Product exploration explored 100000 steps with 25000 reset in 647 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 265 steps (0 resets) in 6 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Applied a total of 0 rules in 21 ms. Remains 684 /684 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 15:02:28] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:02:28] [INFO ] Invariant cache hit.
[2024-05-28 15:02:28] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:02:50] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 1 ms to minimize.
[2024-05-28 15:02:50] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:02:50] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
[2024-05-28 15:02:50] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:02:50] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:02:50] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:02:50] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:02:51] [INFO ] Deduced a trap composed of 377 places in 331 ms of which 3 ms to minimize.
[2024-05-28 15:02:51] [INFO ] Deduced a trap composed of 181 places in 321 ms of which 3 ms to minimize.
[2024-05-28 15:02:52] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:02:54] [INFO ] Deduced a trap composed of 383 places in 337 ms of which 4 ms to minimize.
[2024-05-28 15:02:54] [INFO ] Deduced a trap composed of 394 places in 347 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:02:59] [INFO ] Deduced a trap composed of 410 places in 283 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 13/13 constraints]
After SMT, in 47930ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 47947ms
[2024-05-28 15:03:16] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:03:16] [INFO ] Invariant cache hit.
[2024-05-28 15:03:16] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-28 15:03:16] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:03:16] [INFO ] Invariant cache hit.
[2024-05-28 15:03:17] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:03:28] [INFO ] Implicit Places using invariants and state equation in 11575 ms returned []
Implicit Place search using SMT with State Equation took 12003 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 15:03:28] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:03:28] [INFO ] Invariant cache hit.
[2024-05-28 15:03:28] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:03:49] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:03:49] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 5 ms to minimize.
[2024-05-28 15:03:49] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:03:49] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:03:49] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:03:49] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:03:49] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:03:50] [INFO ] Deduced a trap composed of 377 places in 384 ms of which 5 ms to minimize.
[2024-05-28 15:03:51] [INFO ] Deduced a trap composed of 181 places in 278 ms of which 3 ms to minimize.
[2024-05-28 15:03:51] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:03:53] [INFO ] Deduced a trap composed of 383 places in 317 ms of which 4 ms to minimize.
[2024-05-28 15:03:53] [INFO ] Deduced a trap composed of 394 places in 359 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:04:09] [INFO ] Deduced a trap composed of 410 places in 377 ms of which 5 ms to minimize.
[2024-05-28 15:04:30] [INFO ] Deduced a trap composed of 366 places in 291 ms of which 4 ms to minimize.
[2024-05-28 15:04:30] [INFO ] Deduced a trap composed of 379 places in 303 ms of which 3 ms to minimize.
[2024-05-28 15:04:30] [INFO ] Deduced a trap composed of 380 places in 298 ms of which 3 ms to minimize.
[2024-05-28 15:04:32] [INFO ] Deduced a trap composed of 69 places in 269 ms of which 3 ms to minimize.
[2024-05-28 15:04:35] [INFO ] Deduced a trap composed of 392 places in 337 ms of which 4 ms to minimize.
[2024-05-28 15:04:36] [INFO ] Deduced a trap composed of 435 places in 302 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 57 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 19/19 constraints]
After SMT, in 67664ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 67681ms
Finished structural reductions in LTL mode , in 1 iterations and 127663 ms. Remains : 684/684 places, 1828/1828 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 256 steps (0 resets) in 4 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 570 ms.
Product exploration explored 100000 steps with 25000 reset in 580 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 684 transition count 1828
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 48 place count 684 transition count 1892
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 96 place count 684 transition count 1892
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 112 place count 668 transition count 1876
Deduced a syphon composed of 80 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 128 place count 668 transition count 1876
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 1 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 248 place count 668 transition count 1876
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 280 place count 636 transition count 1844
Deduced a syphon composed of 176 places in 2 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 312 place count 636 transition count 1844
Deduced a syphon composed of 176 places in 3 ms
Applied a total of 312 rules in 341 ms. Remains 636 /684 variables (removed 48) and now considering 1844/1828 (removed -16) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-28 15:04:38] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 636 cols
[2024-05-28 15:04:38] [INFO ] Computed 42 invariants in 31 ms
[2024-05-28 15:04:38] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 15:05:00] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:05:01] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 2 ms to minimize.
[2024-05-28 15:05:01] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 2 ms to minimize.
[2024-05-28 15:05:01] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:05:01] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:05:01] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 0 ms to minimize.
[2024-05-28 15:05:01] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:05:01] [INFO ] Deduced a trap composed of 46 places in 281 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
[2024-05-28 15:05:02] [INFO ] Deduced a trap composed of 211 places in 336 ms of which 3 ms to minimize.
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
[2024-05-28 15:05:04] [INFO ] Deduced a trap composed of 203 places in 306 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/2448 variables, and 48 constraints, problems are : Problem set: 64 solved, 1776 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/636 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 64 solved, 1776 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 12/12 constraints. Problems are: Problem set: 64 solved, 1776 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 24/36 constraints. Problems are: Problem set: 64 solved, 1776 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/600 variables, 10/46 constraints. Problems are: Problem set: 64 solved, 1776 unsolved
[2024-05-28 15:05:09] [INFO ] Deduced a trap composed of 182 places in 208 ms of which 2 ms to minimize.
[2024-05-28 15:05:09] [INFO ] Deduced a trap composed of 157 places in 210 ms of which 1 ms to minimize.
[2024-05-28 15:05:10] [INFO ] Deduced a trap composed of 26 places in 311 ms of which 3 ms to minimize.
[2024-05-28 15:05:10] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 4 ms to minimize.
[2024-05-28 15:05:14] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 2 ms to minimize.
[2024-05-28 15:05:20] [INFO ] Deduced a trap composed of 193 places in 198 ms of which 2 ms to minimize.
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
[2024-05-28 15:05:20] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:05:20] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:05:23] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
[2024-05-28 15:05:23] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
[2024-05-28 15:05:23] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/2448 variables, and 57 constraints, problems are : Problem set: 120 solved, 1720 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/636 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 21/21 constraints]
After SMT, in 49105ms problems are : Problem set: 120 solved, 1720 unsolved
Search for dead transitions found 120 dead transitions in 49129ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 120 transitions.
[2024-05-28 15:05:27] [INFO ] Redundant transitions in 97 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 636/684 places, 1724/1828 transitions.
Graph (complete) has 3646 edges and 636 vertex of which 548 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.19 ms
Discarding 88 places :
Also discarding 0 output transitions
Deduced a syphon composed of 88 places in 3 ms
Applied a total of 1 rules in 94 ms. Remains 548 /636 variables (removed 88) and now considering 1724/1724 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 548/684 places, 1724/1828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49689 ms. Remains : 548/684 places, 1724/1828 transitions.
Built C files in :
/tmp/ltsmin10037976115508211402
[2024-05-28 15:05:28] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10037976115508211402
Running compilation step : cd /tmp/ltsmin10037976115508211402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10037976115508211402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10037976115508211402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Applied a total of 0 rules in 48 ms. Remains 684 /684 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 15:05:31] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-05-28 15:05:31] [INFO ] Computed 42 invariants in 35 ms
[2024-05-28 15:05:31] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:05:53] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 2 ms to minimize.
[2024-05-28 15:05:53] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 1 ms to minimize.
[2024-05-28 15:05:53] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 1 ms to minimize.
[2024-05-28 15:05:54] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2024-05-28 15:05:54] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:05:54] [INFO ] Deduced a trap composed of 200 places in 295 ms of which 4 ms to minimize.
[2024-05-28 15:05:55] [INFO ] Deduced a trap composed of 74 places in 411 ms of which 4 ms to minimize.
[2024-05-28 15:05:56] [INFO ] Deduced a trap composed of 427 places in 326 ms of which 3 ms to minimize.
[2024-05-28 15:05:58] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:05:59] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 48 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:06:12] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 2 ms to minimize.
[2024-05-28 15:06:12] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 2 ms to minimize.
[2024-05-28 15:06:12] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 13/13 constraints]
After SMT, in 48178ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48202ms
[2024-05-28 15:06:19] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:06:19] [INFO ] Invariant cache hit.
[2024-05-28 15:06:20] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-28 15:06:20] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:06:20] [INFO ] Invariant cache hit.
[2024-05-28 15:06:20] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:06:32] [INFO ] Implicit Places using invariants and state equation in 11971 ms returned []
Implicit Place search using SMT with State Equation took 12443 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 15:06:32] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:06:32] [INFO ] Invariant cache hit.
[2024-05-28 15:06:32] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:06:54] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 14 ms to minimize.
[2024-05-28 15:06:54] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:06:54] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:06:54] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:06:54] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 0 ms to minimize.
[2024-05-28 15:06:54] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:06:54] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 0 ms to minimize.
[2024-05-28 15:06:55] [INFO ] Deduced a trap composed of 377 places in 299 ms of which 3 ms to minimize.
[2024-05-28 15:06:55] [INFO ] Deduced a trap composed of 181 places in 279 ms of which 3 ms to minimize.
[2024-05-28 15:06:55] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 0 ms to minimize.
[2024-05-28 15:06:57] [INFO ] Deduced a trap composed of 383 places in 339 ms of which 4 ms to minimize.
[2024-05-28 15:06:58] [INFO ] Deduced a trap composed of 394 places in 331 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:07:12] [INFO ] Deduced a trap composed of 410 places in 306 ms of which 3 ms to minimize.
[2024-05-28 15:07:32] [INFO ] Deduced a trap composed of 366 places in 350 ms of which 3 ms to minimize.
[2024-05-28 15:07:33] [INFO ] Deduced a trap composed of 379 places in 374 ms of which 5 ms to minimize.
[2024-05-28 15:07:33] [INFO ] Deduced a trap composed of 380 places in 361 ms of which 4 ms to minimize.
[2024-05-28 15:07:34] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 2 ms to minimize.
[2024-05-28 15:07:38] [INFO ] Deduced a trap composed of 392 places in 319 ms of which 4 ms to minimize.
[2024-05-28 15:07:38] [INFO ] Deduced a trap composed of 435 places in 315 ms of which 3 ms to minimize.
[2024-05-28 15:07:39] [INFO ] Deduced a trap composed of 404 places in 302 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 9)
(s163 0)
(s164 1)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 58 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 20/20 constraints]
After SMT, in 68115ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 68132ms
Finished structural reductions in LTL mode , in 1 iterations and 128834 ms. Remains : 684/684 places, 1828/1828 transitions.
Built C files in :
/tmp/ltsmin18028655627389742759
[2024-05-28 15:07:40] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18028655627389742759
Running compilation step : cd /tmp/ltsmin18028655627389742759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18028655627389742759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18028655627389742759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:07:43] [INFO ] Flatten gal took : 215 ms
[2024-05-28 15:07:43] [INFO ] Flatten gal took : 170 ms
[2024-05-28 15:07:44] [INFO ] Time to serialize gal into /tmp/LTL15743500460172017189.gal : 47 ms
[2024-05-28 15:07:44] [INFO ] Time to serialize properties into /tmp/LTL11193597511805052252.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15743500460172017189.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9817528185317708961.hoa' '-atoms' '/tmp/LTL11193597511805052252.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11193597511805052252.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9817528185317708961.hoa
Detected timeout of ITS tools.
[2024-05-28 15:07:59] [INFO ] Flatten gal took : 158 ms
[2024-05-28 15:07:59] [INFO ] Flatten gal took : 81 ms
[2024-05-28 15:07:59] [INFO ] Time to serialize gal into /tmp/LTL12094148365512882970.gal : 10 ms
[2024-05-28 15:07:59] [INFO ] Time to serialize properties into /tmp/LTL17608951219701776651.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12094148365512882970.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17608951219701776651.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(P_1716<=NoSigAbort)"))))))
Formula 0 simplified : XXXG!"(P_1716<=NoSigAbort)"
Detected timeout of ITS tools.
[2024-05-28 15:08:14] [INFO ] Flatten gal took : 108 ms
[2024-05-28 15:08:14] [INFO ] Applying decomposition
[2024-05-28 15:08:14] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5082750036968335219.txt' '-o' '/tmp/graph5082750036968335219.bin' '-w' '/tmp/graph5082750036968335219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5082750036968335219.bin' '-l' '-1' '-v' '-w' '/tmp/graph5082750036968335219.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:08:15] [INFO ] Decomposing Gal with order
[2024-05-28 15:08:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:08:15] [INFO ] Removed a total of 1425 redundant transitions.
[2024-05-28 15:08:15] [INFO ] Flatten gal took : 507 ms
[2024-05-28 15:08:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 36 ms.
[2024-05-28 15:08:16] [INFO ] Time to serialize gal into /tmp/LTL10495843383441504750.gal : 19 ms
[2024-05-28 15:08:16] [INFO ] Time to serialize properties into /tmp/LTL18163303693626750690.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10495843383441504750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18163303693626750690.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(gu58.P_1716<=gu58.NoSigAbort)"))))))
Formula 0 simplified : XXXG!"(gu58.P_1716<=gu58.NoSigAbort)"
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-02 finished in 495772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(((p1||F(G(p0))) U (p0&&(p1||F(G(p0))))))))))'
Support contains 32 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Applied a total of 16 rules in 23 ms. Remains 692 /700 variables (removed 8) and now considering 1836/1844 (removed 8) transitions.
Running 1832 sub problems to find dead transitions.
[2024-05-28 15:08:31] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
// Phase 1: matrix 1804 rows 692 cols
[2024-05-28 15:08:31] [INFO ] Computed 42 invariants in 25 ms
[2024-05-28 15:08:31] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 15:08:55] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-05-28 15:08:55] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:08:58] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 5 ms to minimize.
[2024-05-28 15:08:58] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:08:59] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:08:59] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 0 ms to minimize.
[2024-05-28 15:08:59] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:08:59] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 46 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 15:09:02] [INFO ] Deduced a trap composed of 165 places in 315 ms of which 3 ms to minimize.
[2024-05-28 15:09:03] [INFO ] Deduced a trap composed of 211 places in 295 ms of which 4 ms to minimize.
[2024-05-28 15:09:03] [INFO ] Deduced a trap composed of 343 places in 317 ms of which 4 ms to minimize.
[2024-05-28 15:09:04] [INFO ] Deduced a trap composed of 408 places in 317 ms of which 4 ms to minimize.
[2024-05-28 15:09:05] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 51 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 13/13 constraints]
After SMT, in 48128ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 48147ms
[2024-05-28 15:09:19] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 15:09:19] [INFO ] Invariant cache hit.
[2024-05-28 15:09:20] [INFO ] Implicit Places using invariants in 522 ms returned []
[2024-05-28 15:09:20] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 15:09:20] [INFO ] Invariant cache hit.
[2024-05-28 15:09:20] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:09:33] [INFO ] Implicit Places using invariants and state equation in 12966 ms returned []
Implicit Place search using SMT with State Equation took 13512 ms to find 0 implicit places.
Running 1832 sub problems to find dead transitions.
[2024-05-28 15:09:33] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 15:09:33] [INFO ] Invariant cache hit.
[2024-05-28 15:09:33] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 15:09:57] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-05-28 15:09:57] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:09:57] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 0 ms to minimize.
[2024-05-28 15:09:58] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:09:58] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 0 ms to minimize.
[2024-05-28 15:09:58] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:09:58] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 0 ms to minimize.
[2024-05-28 15:09:58] [INFO ] Deduced a trap composed of 399 places in 328 ms of which 4 ms to minimize.
[2024-05-28 15:09:59] [INFO ] Deduced a trap composed of 403 places in 318 ms of which 4 ms to minimize.
[2024-05-28 15:09:59] [INFO ] Deduced a trap composed of 209 places in 315 ms of which 4 ms to minimize.
[2024-05-28 15:09:59] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:10:01] [INFO ] Deduced a trap composed of 191 places in 204 ms of which 1 ms to minimize.
[2024-05-28 15:10:02] [INFO ] Deduced a trap composed of 395 places in 488 ms of which 6 ms to minimize.
[2024-05-28 15:10:02] [INFO ] Deduced a trap composed of 379 places in 415 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 52 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 15:10:15] [INFO ] Deduced a trap composed of 366 places in 392 ms of which 4 ms to minimize.
[2024-05-28 15:10:15] [INFO ] Deduced a trap composed of 411 places in 366 ms of which 4 ms to minimize.
[2024-05-28 15:10:25] [INFO ] Deduced a trap composed of 418 places in 401 ms of which 5 ms to minimize.
[2024-05-28 15:10:28] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 2 ms to minimize.
[2024-05-28 15:10:41] [INFO ] Deduced a trap composed of 397 places in 428 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 57 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 19/19 constraints]
After SMT, in 69703ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 69740ms
Starting structural reductions in LTL mode, iteration 1 : 692/700 places, 1836/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131431 ms. Remains : 692/700 places, 1836/1844 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-03
Product exploration explored 100000 steps with 545 reset in 319 ms.
Product exploration explored 100000 steps with 572 reset in 363 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 649 steps (0 resets) in 9 ms. (64 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 692/692 places, 1836/1836 transitions.
Applied a total of 0 rules in 15 ms. Remains 692 /692 variables (removed 0) and now considering 1836/1836 (removed 0) transitions.
Running 1832 sub problems to find dead transitions.
[2024-05-28 15:10:44] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 15:10:44] [INFO ] Invariant cache hit.
[2024-05-28 15:10:44] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 15:11:06] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:11:06] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:11:06] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:11:06] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:11:06] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:11:06] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 2 ms to minimize.
[2024-05-28 15:11:06] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:11:07] [INFO ] Deduced a trap composed of 399 places in 405 ms of which 6 ms to minimize.
[2024-05-28 15:11:07] [INFO ] Deduced a trap composed of 403 places in 321 ms of which 4 ms to minimize.
[2024-05-28 15:11:07] [INFO ] Deduced a trap composed of 209 places in 280 ms of which 3 ms to minimize.
[2024-05-28 15:11:08] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 2 ms to minimize.
[2024-05-28 15:11:09] [INFO ] Deduced a trap composed of 191 places in 193 ms of which 2 ms to minimize.
[2024-05-28 15:11:10] [INFO ] Deduced a trap composed of 395 places in 364 ms of which 3 ms to minimize.
[2024-05-28 15:11:10] [INFO ] Deduced a trap composed of 379 places in 324 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 52 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 15:11:15] [INFO ] Deduced a trap composed of 366 places in 286 ms of which 4 ms to minimize.
[2024-05-28 15:11:15] [INFO ] Deduced a trap composed of 411 places in 286 ms of which 3 ms to minimize.
[2024-05-28 15:11:22] [INFO ] Deduced a trap composed of 418 places in 308 ms of which 3 ms to minimize.
[2024-05-28 15:11:25] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 56 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 18/18 constraints]
After SMT, in 48308ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 48329ms
[2024-05-28 15:11:32] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 15:11:32] [INFO ] Invariant cache hit.
[2024-05-28 15:11:33] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-28 15:11:33] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 15:11:33] [INFO ] Invariant cache hit.
[2024-05-28 15:11:34] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:11:45] [INFO ] Implicit Places using invariants and state equation in 11625 ms returned []
Implicit Place search using SMT with State Equation took 12187 ms to find 0 implicit places.
Running 1832 sub problems to find dead transitions.
[2024-05-28 15:11:45] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 15:11:45] [INFO ] Invariant cache hit.
[2024-05-28 15:11:45] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 15:12:05] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:12:05] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:12:05] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:12:05] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 0 ms to minimize.
[2024-05-28 15:12:05] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:12:06] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:12:06] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:12:06] [INFO ] Deduced a trap composed of 399 places in 426 ms of which 5 ms to minimize.
[2024-05-28 15:12:07] [INFO ] Deduced a trap composed of 403 places in 321 ms of which 3 ms to minimize.
[2024-05-28 15:12:07] [INFO ] Deduced a trap composed of 209 places in 292 ms of which 3 ms to minimize.
[2024-05-28 15:12:07] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:12:08] [INFO ] Deduced a trap composed of 191 places in 176 ms of which 2 ms to minimize.
[2024-05-28 15:12:09] [INFO ] Deduced a trap composed of 395 places in 312 ms of which 4 ms to minimize.
[2024-05-28 15:12:10] [INFO ] Deduced a trap composed of 379 places in 323 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 52 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 15:12:25] [INFO ] Deduced a trap composed of 366 places in 288 ms of which 3 ms to minimize.
[2024-05-28 15:12:25] [INFO ] Deduced a trap composed of 411 places in 391 ms of which 5 ms to minimize.
[2024-05-28 15:12:32] [INFO ] Deduced a trap composed of 418 places in 276 ms of which 4 ms to minimize.
[2024-05-28 15:12:35] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:12:45] [INFO ] Deduced a trap composed of 397 places in 359 ms of which 3 ms to minimize.
[2024-05-28 15:12:47] [INFO ] Deduced a trap composed of 177 places in 467 ms of which 5 ms to minimize.
[2024-05-28 15:12:48] [INFO ] Deduced a trap composed of 208 places in 417 ms of which 5 ms to minimize.
[2024-05-28 15:12:51] [INFO ] Deduced a trap composed of 316 places in 252 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 60 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 22/22 constraints]
After SMT, in 67459ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 67475ms
Finished structural reductions in LTL mode , in 1 iterations and 128015 ms. Remains : 692/692 places, 1836/1836 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1188 steps (0 resets) in 14 ms. (79 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 566 reset in 342 ms.
Product exploration explored 100000 steps with 596 reset in 324 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 692/692 places, 1836/1836 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 692 transition count 1836
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 48 place count 692 transition count 1900
Deduced a syphon composed of 96 places in 2 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 96 place count 692 transition count 1900
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 120 place count 668 transition count 1876
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 144 place count 668 transition count 1876
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 192 places in 1 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 264 place count 668 transition count 1876
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 288 place count 644 transition count 1852
Deduced a syphon composed of 176 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 312 place count 644 transition count 1852
Deduced a syphon composed of 176 places in 1 ms
Applied a total of 312 rules in 145 ms. Remains 644 /692 variables (removed 48) and now considering 1852/1836 (removed -16) transitions.
Running 1848 sub problems to find dead transitions.
[2024-05-28 15:12:54] [INFO ] Flow matrix only has 1820 transitions (discarded 32 similar events)
// Phase 1: matrix 1820 rows 644 cols
[2024-05-28 15:12:54] [INFO ] Computed 42 invariants in 32 ms
[2024-05-28 15:12:54] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
[2024-05-28 15:13:17] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 3 ms to minimize.
[2024-05-28 15:13:17] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 2 ms to minimize.
[2024-05-28 15:13:18] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2024-05-28 15:13:18] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2024-05-28 15:13:18] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2024-05-28 15:13:18] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-05-28 15:13:18] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:13:18] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 0 ms to minimize.
[2024-05-28 15:13:18] [INFO ] Deduced a trap composed of 233 places in 289 ms of which 3 ms to minimize.
[2024-05-28 15:13:19] [INFO ] Deduced a trap composed of 220 places in 295 ms of which 3 ms to minimize.
[2024-05-28 15:13:19] [INFO ] Deduced a trap composed of 234 places in 305 ms of which 3 ms to minimize.
[2024-05-28 15:13:19] [INFO ] Deduced a trap composed of 183 places in 293 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-05-28 15:13:20] [INFO ] Deduced a trap composed of 214 places in 312 ms of which 3 ms to minimize.
[2024-05-28 15:13:20] [INFO ] Deduced a trap composed of 236 places in 321 ms of which 3 ms to minimize.
[2024-05-28 15:13:21] [INFO ] Deduced a trap composed of 227 places in 312 ms of which 3 ms to minimize.
[2024-05-28 15:13:21] [INFO ] Deduced a trap composed of 221 places in 321 ms of which 3 ms to minimize.
[2024-05-28 15:13:22] [INFO ] Deduced a trap composed of 217 places in 355 ms of which 3 ms to minimize.
[2024-05-28 15:13:22] [INFO ] Deduced a trap composed of 224 places in 353 ms of which 3 ms to minimize.
[2024-05-28 15:13:23] [INFO ] Deduced a trap composed of 208 places in 311 ms of which 3 ms to minimize.
[2024-05-28 15:13:23] [INFO ] Deduced a trap composed of 216 places in 321 ms of which 4 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/58 constraints. Problems are: Problem set: 64 solved, 1784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2464 variables, and 58 constraints, problems are : Problem set: 64 solved, 1784 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/644 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1848/1848 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 64 solved, 1784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 12/12 constraints. Problems are: Problem set: 64 solved, 1784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 24/36 constraints. Problems are: Problem set: 64 solved, 1784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 20/56 constraints. Problems are: Problem set: 64 solved, 1784 unsolved
[2024-05-28 15:13:28] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:13:29] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:13:29] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-28 15:13:31] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:13:31] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:13:31] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:13:42] [INFO ] Deduced a trap composed of 76 places in 248 ms of which 2 ms to minimize.
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
[2024-05-28 15:13:42] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2464 variables, and 64 constraints, problems are : Problem set: 80 solved, 1768 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/644 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 0/1848 constraints, Known Traps: 28/28 constraints]
After SMT, in 49271ms problems are : Problem set: 80 solved, 1768 unsolved
Search for dead transitions found 80 dead transitions in 49293ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 80 transitions.
[2024-05-28 15:13:43] [INFO ] Redundant transitions in 27 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 644/692 places, 1772/1836 transitions.
Graph (complete) has 3694 edges and 644 vertex of which 596 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.4 ms
Discarding 48 places :
Also discarding 0 output transitions
Deduced a syphon composed of 128 places in 1 ms
Applied a total of 1 rules in 41 ms. Remains 596 /644 variables (removed 48) and now considering 1772/1772 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 596/692 places, 1772/1836 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49523 ms. Remains : 596/692 places, 1772/1836 transitions.
Built C files in :
/tmp/ltsmin1352846714981627892
[2024-05-28 15:13:43] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1352846714981627892
Running compilation step : cd /tmp/ltsmin1352846714981627892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1352846714981627892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1352846714981627892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 32 out of 692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 692/692 places, 1836/1836 transitions.
Applied a total of 0 rules in 24 ms. Remains 692 /692 variables (removed 0) and now considering 1836/1836 (removed 0) transitions.
Running 1832 sub problems to find dead transitions.
[2024-05-28 15:13:46] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
// Phase 1: matrix 1804 rows 692 cols
[2024-05-28 15:13:46] [INFO ] Computed 42 invariants in 43 ms
[2024-05-28 15:13:46] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 15:14:12] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:14:12] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 2 ms to minimize.
[2024-05-28 15:14:15] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 2 ms to minimize.
[2024-05-28 15:14:15] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:14:15] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 43 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 15:14:18] [INFO ] Deduced a trap composed of 206 places in 398 ms of which 3 ms to minimize.
[2024-05-28 15:14:19] [INFO ] Deduced a trap composed of 351 places in 301 ms of which 8 ms to minimize.
[2024-05-28 15:14:19] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:14:19] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 1 ms to minimize.
[2024-05-28 15:14:22] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 4 ms to minimize.
[2024-05-28 15:14:22] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 1 ms to minimize.
[2024-05-28 15:14:25] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 50 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 12/12 constraints]
After SMT, in 48829ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 48858ms
[2024-05-28 15:14:35] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 15:14:35] [INFO ] Invariant cache hit.
[2024-05-28 15:14:36] [INFO ] Implicit Places using invariants in 771 ms returned []
[2024-05-28 15:14:36] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 15:14:36] [INFO ] Invariant cache hit.
[2024-05-28 15:14:38] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:14:49] [INFO ] Implicit Places using invariants and state equation in 12513 ms returned []
Implicit Place search using SMT with State Equation took 13286 ms to find 0 implicit places.
Running 1832 sub problems to find dead transitions.
[2024-05-28 15:14:49] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 15:14:49] [INFO ] Invariant cache hit.
[2024-05-28 15:14:49] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 15:15:13] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:15:13] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:15:13] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 0 ms to minimize.
[2024-05-28 15:15:14] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:15:14] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:15:14] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 0 ms to minimize.
[2024-05-28 15:15:14] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:15:14] [INFO ] Deduced a trap composed of 399 places in 298 ms of which 4 ms to minimize.
[2024-05-28 15:15:15] [INFO ] Deduced a trap composed of 403 places in 297 ms of which 3 ms to minimize.
[2024-05-28 15:15:15] [INFO ] Deduced a trap composed of 209 places in 383 ms of which 4 ms to minimize.
[2024-05-28 15:15:15] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:15:17] [INFO ] Deduced a trap composed of 191 places in 213 ms of which 2 ms to minimize.
[2024-05-28 15:15:18] [INFO ] Deduced a trap composed of 395 places in 318 ms of which 4 ms to minimize.
[2024-05-28 15:15:18] [INFO ] Deduced a trap composed of 379 places in 376 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 52 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 15:15:29] [INFO ] Deduced a trap composed of 366 places in 298 ms of which 3 ms to minimize.
[2024-05-28 15:15:30] [INFO ] Deduced a trap composed of 411 places in 305 ms of which 6 ms to minimize.
[2024-05-28 15:15:37] [INFO ] Deduced a trap composed of 418 places in 295 ms of which 4 ms to minimize.
[2024-05-28 15:15:41] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 4 ms to minimize.
[2024-05-28 15:15:53] [INFO ] Deduced a trap composed of 397 places in 343 ms of which 4 ms to minimize.
[2024-05-28 15:15:55] [INFO ] Deduced a trap composed of 177 places in 440 ms of which 4 ms to minimize.
[2024-05-28 15:15:56] [INFO ] Deduced a trap composed of 208 places in 420 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 59 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 21/21 constraints]
After SMT, in 68225ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 68243ms
Finished structural reductions in LTL mode , in 1 iterations and 130423 ms. Remains : 692/692 places, 1836/1836 transitions.
Built C files in :
/tmp/ltsmin8268856931171678493
[2024-05-28 15:15:57] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8268856931171678493
Running compilation step : cd /tmp/ltsmin8268856931171678493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8268856931171678493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8268856931171678493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:16:00] [INFO ] Flatten gal took : 145 ms
[2024-05-28 15:16:00] [INFO ] Flatten gal took : 128 ms
[2024-05-28 15:16:00] [INFO ] Time to serialize gal into /tmp/LTL12851010561922427108.gal : 17 ms
[2024-05-28 15:16:00] [INFO ] Time to serialize properties into /tmp/LTL16154963277040258666.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12851010561922427108.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10042421030933586817.hoa' '-atoms' '/tmp/LTL16154963277040258666.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16154963277040258666.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10042421030933586817.hoa
Detected timeout of ITS tools.
[2024-05-28 15:16:15] [INFO ] Flatten gal took : 62 ms
[2024-05-28 15:16:15] [INFO ] Flatten gal took : 64 ms
[2024-05-28 15:16:15] [INFO ] Time to serialize gal into /tmp/LTL10826392520725026879.gal : 10 ms
[2024-05-28 15:16:15] [INFO ] Time to serialize properties into /tmp/LTL16022561141418439794.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10826392520725026879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16022561141418439794.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((Abort_Check_Sources_B_0+Abort_Check_Sources_B_1)+(Abort_Check_Sources_B_2+Abort_Check_Sources_B_3))+((Abort_Check_Sources...2588
Formula 0 simplified : XF(!"((((Abort_Check_Sources_B_0+Abort_Check_Sources_B_1)+(Abort_Check_Sources_B_2+Abort_Check_Sources_B_3))+((Abort_Check_Sources_B...1783
Detected timeout of ITS tools.
[2024-05-28 15:16:31] [INFO ] Flatten gal took : 67 ms
[2024-05-28 15:16:31] [INFO ] Applying decomposition
[2024-05-28 15:16:31] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10294540712717226740.txt' '-o' '/tmp/graph10294540712717226740.bin' '-w' '/tmp/graph10294540712717226740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10294540712717226740.bin' '-l' '-1' '-v' '-w' '/tmp/graph10294540712717226740.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:16:31] [INFO ] Decomposing Gal with order
[2024-05-28 15:16:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:16:31] [INFO ] Removed a total of 1355 redundant transitions.
[2024-05-28 15:16:31] [INFO ] Flatten gal took : 257 ms
[2024-05-28 15:16:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 159 labels/synchronizations in 58 ms.
[2024-05-28 15:16:31] [INFO ] Time to serialize gal into /tmp/LTL11358980476294206335.gal : 43 ms
[2024-05-28 15:16:31] [INFO ] Time to serialize properties into /tmp/LTL16936952561150410143.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11358980476294206335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16936952561150410143.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((gu106.Abort_Check_Sources_B_0+gu106.Abort_Check_Sources_B_1)+(gu106.Abort_Check_Sources_B_2+gu106.Abort_Check_Sources_B_3...3132
Formula 0 simplified : XF(!"((((gu106.Abort_Check_Sources_B_0+gu106.Abort_Check_Sources_B_1)+(gu106.Abort_Check_Sources_B_2+gu106.Abort_Check_Sources_B_3))...2151
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-03 finished in 495671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U X(p1)))))'
Support contains 56 out of 700 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 700 transition count 1780
Reduce places removed 64 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 72 rules applied. Total rules applied 136 place count 636 transition count 1772
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 144 place count 628 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 144 place count 628 transition count 1692
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 304 place count 548 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 312 place count 540 transition count 1684
Iterating global reduction 3 with 8 rules applied. Total rules applied 320 place count 540 transition count 1684
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 464 place count 468 transition count 1612
Applied a total of 464 rules in 85 ms. Remains 468 /700 variables (removed 232) and now considering 1612/1844 (removed 232) transitions.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:16:47] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
// Phase 1: matrix 1580 rows 468 cols
[2024-05-28 15:16:47] [INFO ] Computed 42 invariants in 18 ms
[2024-05-28 15:16:47] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:17:05] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:17:05] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:17:05] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:17:05] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:17:05] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:17:05] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-05-28 15:17:05] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:17:05] [INFO ] Deduced a trap composed of 210 places in 278 ms of which 3 ms to minimize.
[2024-05-28 15:17:06] [INFO ] Deduced a trap composed of 205 places in 255 ms of which 2 ms to minimize.
[2024-05-28 15:17:06] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 2 ms to minimize.
[2024-05-28 15:17:06] [INFO ] Deduced a trap composed of 218 places in 332 ms of which 3 ms to minimize.
[2024-05-28 15:17:07] [INFO ] Deduced a trap composed of 211 places in 369 ms of which 4 ms to minimize.
[2024-05-28 15:17:07] [INFO ] Deduced a trap composed of 225 places in 325 ms of which 2 ms to minimize.
[2024-05-28 15:17:08] [INFO ] Deduced a trap composed of 209 places in 322 ms of which 3 ms to minimize.
[2024-05-28 15:17:08] [INFO ] Deduced a trap composed of 206 places in 252 ms of which 2 ms to minimize.
[2024-05-28 15:17:08] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 54 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:17:32] [INFO ] Deduced a trap composed of 158 places in 232 ms of which 3 ms to minimize.
[2024-05-28 15:17:33] [INFO ] Deduced a trap composed of 155 places in 351 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 56 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 18/18 constraints]
After SMT, in 47833ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 47848ms
[2024-05-28 15:17:35] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:17:35] [INFO ] Invariant cache hit.
[2024-05-28 15:17:35] [INFO ] Implicit Places using invariants in 685 ms returned []
[2024-05-28 15:17:35] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:17:35] [INFO ] Invariant cache hit.
[2024-05-28 15:17:36] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:17:46] [INFO ] Implicit Places using invariants and state equation in 10357 ms returned []
Implicit Place search using SMT with State Equation took 11044 ms to find 0 implicit places.
[2024-05-28 15:17:46] [INFO ] Redundant transitions in 116 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:17:46] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:17:46] [INFO ] Invariant cache hit.
[2024-05-28 15:17:46] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:18:03] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:18:03] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:18:03] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:18:03] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:18:03] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:18:04] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:18:04] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:18:04] [INFO ] Deduced a trap composed of 195 places in 386 ms of which 4 ms to minimize.
[2024-05-28 15:18:04] [INFO ] Deduced a trap composed of 199 places in 278 ms of which 2 ms to minimize.
[2024-05-28 15:18:04] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:18:19] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 2 ms to minimize.
[2024-05-28 15:18:20] [INFO ] Deduced a trap composed of 151 places in 315 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 50 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:18:28] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 2 ms to minimize.
[2024-05-28 15:18:28] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 2 ms to minimize.
[2024-05-28 15:18:44] [INFO ] Deduced a trap composed of 88 places in 262 ms of which 3 ms to minimize.
[2024-05-28 15:18:44] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 2 ms to minimize.
[2024-05-28 15:18:49] [INFO ] Deduced a trap composed of 270 places in 285 ms of which 2 ms to minimize.
[2024-05-28 15:18:50] [INFO ] Deduced a trap composed of 147 places in 208 ms of which 2 ms to minimize.
[2024-05-28 15:18:52] [INFO ] Deduced a trap composed of 40 places in 275 ms of which 2 ms to minimize.
[2024-05-28 15:18:52] [INFO ] Deduced a trap composed of 72 places in 291 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 58 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 20/20 constraints]
After SMT, in 68111ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 68126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 468/700 places, 1612/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127245 ms. Remains : 468/700 places, 1612/1844 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-05
Product exploration explored 100000 steps with 33404 reset in 654 ms.
Product exploration explored 100000 steps with 33331 reset in 629 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 107 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), false]
RANDOM walk for 40000 steps (8 resets) in 288 ms. (138 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
[2024-05-28 15:18:56] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:18:56] [INFO ] Invariant cache hit.
[2024-05-28 15:18:56] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/239 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/262 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 196/458 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/463 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/466 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1580/2046 variables, 466/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2046 variables, 160/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2046 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/2048 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2048 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2048 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2048 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2048/2048 variables, and 670 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 468/468 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/239 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/262 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 458/2048 variables, and 33 constraints, problems are : Problem set: 1 solved, 0 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 9/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1240ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Support contains 16 out of 468 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 : 468/468 places, 1612/1612 transitions.
Applied a total of 0 rules in 23 ms. Remains 468 /468 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:18:57] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:18:57] [INFO ] Invariant cache hit.
[2024-05-28 15:18:57] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:19:19] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:19:19] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:19:19] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:19:19] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-05-28 15:19:19] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:19:19] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:19:19] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2024-05-28 15:19:20] [INFO ] Deduced a trap composed of 195 places in 277 ms of which 2 ms to minimize.
[2024-05-28 15:19:20] [INFO ] Deduced a trap composed of 199 places in 274 ms of which 3 ms to minimize.
[2024-05-28 15:19:20] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 48 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:19:35] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 2 ms to minimize.
[2024-05-28 15:19:45] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 2 ms to minimize.
[2024-05-28 15:19:45] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-05-28 15:19:46] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 52 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 14/14 constraints]
After SMT, in 49038ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 49053ms
[2024-05-28 15:19:46] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:19:46] [INFO ] Invariant cache hit.
[2024-05-28 15:19:47] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-28 15:19:47] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:19:47] [INFO ] Invariant cache hit.
[2024-05-28 15:19:47] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:19:57] [INFO ] Implicit Places using invariants and state equation in 9892 ms returned []
Implicit Place search using SMT with State Equation took 10277 ms to find 0 implicit places.
[2024-05-28 15:19:57] [INFO ] Redundant transitions in 16 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:19:57] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:19:57] [INFO ] Invariant cache hit.
[2024-05-28 15:19:57] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:20:18] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:20:18] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:20:18] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:20:18] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:20:18] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:20:18] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-05-28 15:20:18] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2024-05-28 15:20:18] [INFO ] Deduced a trap composed of 195 places in 262 ms of which 2 ms to minimize.
[2024-05-28 15:20:19] [INFO ] Deduced a trap composed of 199 places in 293 ms of which 2 ms to minimize.
[2024-05-28 15:20:19] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:20:34] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 3 ms to minimize.
[2024-05-28 15:20:35] [INFO ] Deduced a trap composed of 151 places in 222 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 50 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:20:39] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2024-05-28 15:20:39] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2024-05-28 15:20:55] [INFO ] Deduced a trap composed of 88 places in 187 ms of which 2 ms to minimize.
[2024-05-28 15:20:55] [INFO ] Deduced a trap composed of 57 places in 194 ms of which 2 ms to minimize.
[2024-05-28 15:20:58] [INFO ] Deduced a trap composed of 270 places in 230 ms of which 3 ms to minimize.
[2024-05-28 15:20:59] [INFO ] Deduced a trap composed of 147 places in 227 ms of which 3 ms to minimize.
[2024-05-28 15:21:00] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 2 ms to minimize.
[2024-05-28 15:21:01] [INFO ] Deduced a trap composed of 72 places in 268 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 58 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 20/20 constraints]
After SMT, in 69331ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 69346ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 128735 ms. Remains : 468/468 places, 1612/1612 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 348 steps (0 resets) in 7 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 326 reset in 353 ms.
Product exploration explored 100000 steps with 275 reset in 432 ms.
Built C files in :
/tmp/ltsmin8139471771764832287
[2024-05-28 15:21:07] [INFO ] Too many transitions (1612) to apply POR reductions. Disabling POR matrices.
[2024-05-28 15:21:07] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8139471771764832287
Running compilation step : cd /tmp/ltsmin8139471771764832287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8139471771764832287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8139471771764832287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 16 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 1612/1612 transitions.
Applied a total of 0 rules in 33 ms. Remains 468 /468 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:21:10] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:21:10] [INFO ] Invariant cache hit.
[2024-05-28 15:21:10] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:21:30] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-05-28 15:21:30] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:21:30] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 0 ms to minimize.
[2024-05-28 15:21:30] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:21:30] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:21:30] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:21:30] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:21:31] [INFO ] Deduced a trap composed of 195 places in 267 ms of which 3 ms to minimize.
[2024-05-28 15:21:31] [INFO ] Deduced a trap composed of 199 places in 306 ms of which 2 ms to minimize.
[2024-05-28 15:21:31] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 48 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:21:48] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 49 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 11/11 constraints]
After SMT, in 49856ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 49879ms
[2024-05-28 15:22:00] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:22:00] [INFO ] Invariant cache hit.
[2024-05-28 15:22:01] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-28 15:22:01] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:22:01] [INFO ] Invariant cache hit.
[2024-05-28 15:22:01] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:22:11] [INFO ] Implicit Places using invariants and state equation in 10201 ms returned []
Implicit Place search using SMT with State Equation took 10601 ms to find 0 implicit places.
[2024-05-28 15:22:11] [INFO ] Redundant transitions in 16 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:22:11] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:22:11] [INFO ] Invariant cache hit.
[2024-05-28 15:22:11] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:22:30] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:22:30] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-05-28 15:22:30] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:22:30] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:22:30] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2024-05-28 15:22:30] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 8 ms to minimize.
[2024-05-28 15:22:30] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:22:30] [INFO ] Deduced a trap composed of 195 places in 280 ms of which 3 ms to minimize.
[2024-05-28 15:22:31] [INFO ] Deduced a trap composed of 199 places in 259 ms of which 2 ms to minimize.
[2024-05-28 15:22:31] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:22:45] [INFO ] Deduced a trap composed of 158 places in 273 ms of which 2 ms to minimize.
[2024-05-28 15:22:46] [INFO ] Deduced a trap composed of 151 places in 233 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 50 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:22:54] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2024-05-28 15:22:54] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2024-05-28 15:23:08] [INFO ] Deduced a trap composed of 88 places in 189 ms of which 2 ms to minimize.
[2024-05-28 15:23:08] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 1 ms to minimize.
[2024-05-28 15:23:12] [INFO ] Deduced a trap composed of 270 places in 418 ms of which 3 ms to minimize.
[2024-05-28 15:23:14] [INFO ] Deduced a trap composed of 147 places in 242 ms of which 3 ms to minimize.
[2024-05-28 15:23:15] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 3 ms to minimize.
[2024-05-28 15:23:16] [INFO ] Deduced a trap composed of 72 places in 260 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 9)
(s147 0)
(s148 1)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 0)
(s409 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 58 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 20/20 constraints]
After SMT, in 68701ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 68725ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 129293 ms. Remains : 468/468 places, 1612/1612 transitions.
Built C files in :
/tmp/ltsmin14687833050042508388
[2024-05-28 15:23:20] [INFO ] Too many transitions (1612) to apply POR reductions. Disabling POR matrices.
[2024-05-28 15:23:20] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14687833050042508388
Running compilation step : cd /tmp/ltsmin14687833050042508388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14687833050042508388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14687833050042508388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:23:23] [INFO ] Flatten gal took : 80 ms
[2024-05-28 15:23:23] [INFO ] Flatten gal took : 81 ms
[2024-05-28 15:23:23] [INFO ] Time to serialize gal into /tmp/LTL2056797017187288374.gal : 19 ms
[2024-05-28 15:23:23] [INFO ] Time to serialize properties into /tmp/LTL15614093360126164113.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2056797017187288374.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17026215968702506228.hoa' '-atoms' '/tmp/LTL15614093360126164113.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15614093360126164113.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17026215968702506228.hoa
Detected timeout of ITS tools.
[2024-05-28 15:23:38] [INFO ] Flatten gal took : 84 ms
[2024-05-28 15:23:38] [INFO ] Flatten gal took : 79 ms
[2024-05-28 15:23:38] [INFO ] Time to serialize gal into /tmp/LTL16561791138500388368.gal : 11 ms
[2024-05-28 15:23:38] [INFO ] Time to serialize properties into /tmp/LTL13741388979547057928.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16561791138500388368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13741388979547057928.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((F("((((TryAllocateOneTaskB_0+TryAllocateOneTaskB_1)+(TryAllocateOneTaskB_2+TryAllocateOneTaskB_3))+((TryAllocateOneTaskB_4+Try...785
Formula 0 simplified : GF(G!"((((TryAllocateOneTaskB_0+TryAllocateOneTaskB_1)+(TryAllocateOneTaskB_2+TryAllocateOneTaskB_3))+((TryAllocateOneTaskB_4+TryAll...776
Detected timeout of ITS tools.
[2024-05-28 15:23:53] [INFO ] Flatten gal took : 68 ms
[2024-05-28 15:23:53] [INFO ] Applying decomposition
[2024-05-28 15:23:53] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8311978397923156321.txt' '-o' '/tmp/graph8311978397923156321.bin' '-w' '/tmp/graph8311978397923156321.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8311978397923156321.bin' '-l' '-1' '-v' '-w' '/tmp/graph8311978397923156321.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:23:53] [INFO ] Decomposing Gal with order
[2024-05-28 15:23:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:23:54] [INFO ] Removed a total of 878 redundant transitions.
[2024-05-28 15:23:54] [INFO ] Flatten gal took : 633 ms
[2024-05-28 15:23:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 713 labels/synchronizations in 46 ms.
[2024-05-28 15:23:54] [INFO ] Time to serialize gal into /tmp/LTL15263626452354079266.gal : 14 ms
[2024-05-28 15:23:54] [INFO ] Time to serialize properties into /tmp/LTL214429734058650645.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15263626452354079266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL214429734058650645.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((F("((((gu6.TryAllocateOneTaskB_0+gu6.TryAllocateOneTaskB_1)+(gu6.TryAllocateOneTaskB_2+gu6.TryAllocateOneTaskB_3))+((gu6.TryAl...1009
Formula 0 simplified : GF(G!"((((gu6.TryAllocateOneTaskB_0+gu6.TryAllocateOneTaskB_1)+(gu6.TryAllocateOneTaskB_2+gu6.TryAllocateOneTaskB_3))+((gu6.TryAlloc...1000
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-05 finished in 442924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 684 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 684 transition count 1828
Applied a total of 32 rules in 39 ms. Remains 684 /700 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 15:24:10] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-05-28 15:24:10] [INFO ] Computed 42 invariants in 58 ms
[2024-05-28 15:24:10] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:24:35] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:24:35] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:24:35] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:24:35] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:24:35] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:24:36] [INFO ] Deduced a trap composed of 200 places in 407 ms of which 5 ms to minimize.
[2024-05-28 15:24:37] [INFO ] Deduced a trap composed of 74 places in 300 ms of which 5 ms to minimize.
[2024-05-28 15:24:37] [INFO ] Deduced a trap composed of 427 places in 344 ms of which 3 ms to minimize.
[2024-05-28 15:24:40] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 47 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:24:48] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:24:52] [INFO ] Deduced a trap composed of 416 places in 272 ms of which 4 ms to minimize.
[2024-05-28 15:24:52] [INFO ] Deduced a trap composed of 410 places in 405 ms of which 5 ms to minimize.
[2024-05-28 15:24:55] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 9)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 1)
(s395 1)
(s396 1)
(s397 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 13/13 constraints]
After SMT, in 50300ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 50324ms
[2024-05-28 15:25:00] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:25:00] [INFO ] Invariant cache hit.
[2024-05-28 15:25:00] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-28 15:25:00] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:25:00] [INFO ] Invariant cache hit.
[2024-05-28 15:25:01] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:25:11] [INFO ] Implicit Places using invariants and state equation in 10448 ms returned []
Implicit Place search using SMT with State Equation took 10842 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 15:25:11] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:25:11] [INFO ] Invariant cache hit.
[2024-05-28 15:25:11] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:25:36] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:25:36] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2024-05-28 15:25:36] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:25:36] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:25:36] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:25:36] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:25:36] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:25:37] [INFO ] Deduced a trap composed of 377 places in 447 ms of which 5 ms to minimize.
[2024-05-28 15:25:38] [INFO ] Deduced a trap composed of 181 places in 424 ms of which 5 ms to minimize.
[2024-05-28 15:25:38] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:25:41] [INFO ] Deduced a trap composed of 383 places in 545 ms of which 5 ms to minimize.
[2024-05-28 15:25:42] [INFO ] Deduced a trap composed of 394 places in 463 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:25:54] [INFO ] Deduced a trap composed of 410 places in 387 ms of which 5 ms to minimize.
[2024-05-28 15:26:18] [INFO ] Deduced a trap composed of 366 places in 292 ms of which 4 ms to minimize.
[2024-05-28 15:26:18] [INFO ] Deduced a trap composed of 379 places in 409 ms of which 5 ms to minimize.
[2024-05-28 15:26:19] [INFO ] Deduced a trap composed of 380 places in 404 ms of which 4 ms to minimize.
[2024-05-28 15:26:20] [INFO ] Deduced a trap composed of 69 places in 260 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 55 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 17/17 constraints]
After SMT, in 70701ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 70731ms
Starting structural reductions in LTL mode, iteration 1 : 684/700 places, 1828/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131949 ms. Remains : 684/700 places, 1828/1844 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 758 ms.
Product exploration explored 100000 steps with 50000 reset in 660 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-06 finished in 133515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&(p1||F(G(!p0))))))'
Support contains 8 out of 700 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 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 700 transition count 1788
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 644 transition count 1780
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 636 transition count 1780
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 128 place count 636 transition count 1700
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 288 place count 556 transition count 1700
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 448 place count 476 transition count 1620
Applied a total of 448 rules in 94 ms. Remains 476 /700 variables (removed 224) and now considering 1620/1844 (removed 224) transitions.
Running 1616 sub problems to find dead transitions.
[2024-05-28 15:26:23] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
// Phase 1: matrix 1588 rows 476 cols
[2024-05-28 15:26:23] [INFO ] Computed 42 invariants in 22 ms
[2024-05-28 15:26:23] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-05-28 15:26:42] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-05-28 15:26:42] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:26:42] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:26:42] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:26:42] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:26:43] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:26:43] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:26:43] [INFO ] Deduced a trap composed of 256 places in 387 ms of which 2 ms to minimize.
[2024-05-28 15:26:43] [INFO ] Deduced a trap composed of 221 places in 318 ms of which 3 ms to minimize.
[2024-05-28 15:26:44] [INFO ] Deduced a trap composed of 204 places in 298 ms of which 2 ms to minimize.
[2024-05-28 15:26:44] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:26:46] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2064 variables, and 50 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-05-28 15:26:54] [INFO ] Deduced a trap composed of 207 places in 300 ms of which 3 ms to minimize.
[2024-05-28 15:26:55] [INFO ] Deduced a trap composed of 59 places in 265 ms of which 2 ms to minimize.
[2024-05-28 15:26:58] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2064 variables, and 53 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 15/15 constraints]
After SMT, in 48763ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 48781ms
[2024-05-28 15:27:12] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-05-28 15:27:12] [INFO ] Invariant cache hit.
[2024-05-28 15:27:12] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-28 15:27:12] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-05-28 15:27:12] [INFO ] Invariant cache hit.
[2024-05-28 15:27:13] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:27:20] [INFO ] Implicit Places using invariants and state equation in 8068 ms returned []
Implicit Place search using SMT with State Equation took 8440 ms to find 0 implicit places.
[2024-05-28 15:27:20] [INFO ] Redundant transitions in 17 ms returned []
Running 1616 sub problems to find dead transitions.
[2024-05-28 15:27:20] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-05-28 15:27:20] [INFO ] Invariant cache hit.
[2024-05-28 15:27:20] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 0 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 207 places in 262 ms of which 3 ms to minimize.
[2024-05-28 15:27:43] [INFO ] Deduced a trap composed of 203 places in 281 ms of which 2 ms to minimize.
[2024-05-28 15:27:44] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 2 ms to minimize.
[2024-05-28 15:27:44] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:27:59] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 2 ms to minimize.
[2024-05-28 15:27:59] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 2 ms to minimize.
[2024-05-28 15:28:00] [INFO ] Deduced a trap composed of 229 places in 246 ms of which 3 ms to minimize.
[2024-05-28 15:28:00] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 3 ms to minimize.
[2024-05-28 15:28:00] [INFO ] Deduced a trap composed of 242 places in 264 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2064 variables, and 54 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-05-28 15:28:16] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2064 variables, and 55 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 17/17 constraints]
After SMT, in 70165ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 70181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 476/700 places, 1620/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127527 ms. Remains : 476/700 places, 1620/1844 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-08
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-08 TRUE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-08 finished in 127590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p1||X(G(p2)))&&p0)))))'
Support contains 65 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Applied a total of 0 rules in 10 ms. Remains 700 /700 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-28 15:28:31] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 700 cols
[2024-05-28 15:28:31] [INFO ] Computed 42 invariants in 24 ms
[2024-05-28 15:28:31] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 15:28:55] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 2 ms to minimize.
[2024-05-28 15:28:58] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:28:58] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 2 ms to minimize.
[2024-05-28 15:28:58] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:28:58] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:28:58] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:28:58] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 696/2512 variables, and 45 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/696 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 15:29:02] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 0 ms to minimize.
[2024-05-28 15:29:03] [INFO ] Deduced a trap composed of 401 places in 348 ms of which 3 ms to minimize.
[2024-05-28 15:29:03] [INFO ] Deduced a trap composed of 351 places in 336 ms of which 3 ms to minimize.
[2024-05-28 15:29:04] [INFO ] Deduced a trap composed of 418 places in 344 ms of which 4 ms to minimize.
[2024-05-28 15:29:06] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 2 ms to minimize.
[2024-05-28 15:29:07] [INFO ] Deduced a trap composed of 377 places in 380 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/2512 variables, and 51 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 13/13 constraints]
After SMT, in 48045ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 48062ms
[2024-05-28 15:29:19] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 15:29:19] [INFO ] Invariant cache hit.
[2024-05-28 15:29:19] [INFO ] Implicit Places using invariants in 802 ms returned []
[2024-05-28 15:29:19] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 15:29:19] [INFO ] Invariant cache hit.
[2024-05-28 15:29:21] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:29:33] [INFO ] Implicit Places using invariants and state equation in 13668 ms returned []
Implicit Place search using SMT with State Equation took 14475 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-28 15:29:33] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 15:29:33] [INFO ] Invariant cache hit.
[2024-05-28 15:29:33] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 15:29:58] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2024-05-28 15:29:58] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2024-05-28 15:29:58] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:29:58] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:29:58] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 0 ms to minimize.
[2024-05-28 15:29:58] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2024-05-28 15:29:58] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 0 ms to minimize.
[2024-05-28 15:29:59] [INFO ] Deduced a trap composed of 387 places in 298 ms of which 3 ms to minimize.
[2024-05-28 15:29:59] [INFO ] Deduced a trap composed of 197 places in 296 ms of which 3 ms to minimize.
[2024-05-28 15:29:59] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 0 ms to minimize.
[2024-05-28 15:30:01] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 1 ms to minimize.
[2024-05-28 15:30:02] [INFO ] Deduced a trap composed of 391 places in 346 ms of which 3 ms to minimize.
[2024-05-28 15:30:02] [INFO ] Deduced a trap composed of 449 places in 350 ms of which 3 ms to minimize.
[2024-05-28 15:30:02] [INFO ] Deduced a trap composed of 393 places in 330 ms of which 3 ms to minimize.
[2024-05-28 15:30:03] [INFO ] Deduced a trap composed of 397 places in 325 ms of which 3 ms to minimize.
[2024-05-28 15:30:03] [INFO ] Deduced a trap composed of 414 places in 353 ms of which 3 ms to minimize.
[2024-05-28 15:30:03] [INFO ] Deduced a trap composed of 422 places in 360 ms of which 3 ms to minimize.
[2024-05-28 15:30:04] [INFO ] Deduced a trap composed of 396 places in 369 ms of which 4 ms to minimize.
[2024-05-28 15:30:04] [INFO ] Deduced a trap composed of 430 places in 337 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 696/2512 variables, and 57 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/696 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 15:30:15] [INFO ] Deduced a trap composed of 364 places in 323 ms of which 3 ms to minimize.
[2024-05-28 15:30:16] [INFO ] Deduced a trap composed of 372 places in 351 ms of which 4 ms to minimize.
[2024-05-28 15:30:16] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2024-05-28 15:30:17] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:30:17] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:30:17] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2024-05-28 15:30:38] [INFO ] Deduced a trap composed of 368 places in 306 ms of which 4 ms to minimize.
[2024-05-28 15:30:38] [INFO ] Deduced a trap composed of 382 places in 318 ms of which 4 ms to minimize.
[2024-05-28 15:30:39] [INFO ] Deduced a trap composed of 362 places in 308 ms of which 4 ms to minimize.
[2024-05-28 15:30:40] [INFO ] Deduced a trap composed of 364 places in 350 ms of which 3 ms to minimize.
[2024-05-28 15:30:40] [INFO ] Deduced a trap composed of 379 places in 299 ms of which 4 ms to minimize.
[2024-05-28 15:30:41] [INFO ] Deduced a trap composed of 379 places in 296 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/2512 variables, and 69 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 31/31 constraints]
After SMT, in 68326ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 68343ms
Finished structural reductions in LTL mode , in 1 iterations and 130899 ms. Remains : 700/700 places, 1844/1844 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-11 finished in 131042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U ((!p1&&F(!p0)) U p2))))'
Support contains 102 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 684 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 684 transition count 1828
Applied a total of 32 rules in 26 ms. Remains 684 /700 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 15:30:42] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-05-28 15:30:42] [INFO ] Computed 42 invariants in 21 ms
[2024-05-28 15:30:42] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:31:06] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 1 ms to minimize.
[2024-05-28 15:31:06] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 1 ms to minimize.
[2024-05-28 15:31:06] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 1 ms to minimize.
[2024-05-28 15:31:06] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 1 ms to minimize.
[2024-05-28 15:31:07] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2024-05-28 15:31:07] [INFO ] Deduced a trap composed of 200 places in 332 ms of which 3 ms to minimize.
[2024-05-28 15:31:08] [INFO ] Deduced a trap composed of 74 places in 342 ms of which 4 ms to minimize.
[2024-05-28 15:31:09] [INFO ] Deduced a trap composed of 427 places in 338 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 46 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:31:13] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:31:15] [INFO ] Deduced a trap composed of 83 places in 218 ms of which 3 ms to minimize.
[2024-05-28 15:31:18] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:31:22] [INFO ] Deduced a trap composed of 410 places in 307 ms of which 4 ms to minimize.
[2024-05-28 15:31:27] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 13/13 constraints]
After SMT, in 48773ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48790ms
[2024-05-28 15:31:30] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:31:30] [INFO ] Invariant cache hit.
[2024-05-28 15:31:31] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-28 15:31:31] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:31:31] [INFO ] Invariant cache hit.
[2024-05-28 15:31:32] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:31:42] [INFO ] Implicit Places using invariants and state equation in 10806 ms returned []
Implicit Place search using SMT with State Equation took 11234 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 15:31:42] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 15:31:42] [INFO ] Invariant cache hit.
[2024-05-28 15:31:42] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:32:08] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 2 ms to minimize.
[2024-05-28 15:32:08] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:32:08] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:32:08] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:32:08] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:32:08] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:32:08] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:32:09] [INFO ] Deduced a trap composed of 377 places in 362 ms of which 4 ms to minimize.
[2024-05-28 15:32:09] [INFO ] Deduced a trap composed of 181 places in 356 ms of which 4 ms to minimize.
[2024-05-28 15:32:10] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:32:12] [INFO ] Deduced a trap composed of 383 places in 500 ms of which 5 ms to minimize.
[2024-05-28 15:32:13] [INFO ] Deduced a trap composed of 394 places in 361 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 15:32:25] [INFO ] Deduced a trap composed of 410 places in 342 ms of which 4 ms to minimize.
[2024-05-28 15:32:48] [INFO ] Deduced a trap composed of 366 places in 428 ms of which 5 ms to minimize.
[2024-05-28 15:32:48] [INFO ] Deduced a trap composed of 379 places in 340 ms of which 3 ms to minimize.
[2024-05-28 15:32:49] [INFO ] Deduced a trap composed of 380 places in 432 ms of which 5 ms to minimize.
[2024-05-28 15:32:51] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 55 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 17/17 constraints]
After SMT, in 70062ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 70081ms
Starting structural reductions in LTL mode, iteration 1 : 684/700 places, 1828/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130140 ms. Remains : 684/700 places, 1828/1844 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p2), p0]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 789 ms.
Product exploration explored 100000 steps with 50000 reset in 789 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 16 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-12 finished in 132004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 48 out of 700 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 700 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 628 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 144 place count 628 transition count 1692
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 304 place count 548 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 312 place count 540 transition count 1684
Iterating global reduction 2 with 8 rules applied. Total rules applied 320 place count 540 transition count 1684
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 480 place count 460 transition count 1604
Applied a total of 480 rules in 108 ms. Remains 460 /700 variables (removed 240) and now considering 1604/1844 (removed 240) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:32:54] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
// Phase 1: matrix 1572 rows 460 cols
[2024-05-28 15:32:54] [INFO ] Computed 42 invariants in 25 ms
[2024-05-28 15:32:54] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:33:12] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 2 ms to minimize.
[2024-05-28 15:33:12] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:33:12] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:33:12] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:33:12] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:33:12] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 0 ms to minimize.
[2024-05-28 15:33:13] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:33:13] [INFO ] Deduced a trap composed of 199 places in 362 ms of which 3 ms to minimize.
[2024-05-28 15:33:13] [INFO ] Deduced a trap composed of 202 places in 347 ms of which 4 ms to minimize.
[2024-05-28 15:33:14] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 48 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:33:28] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 2 ms to minimize.
[2024-05-28 15:33:41] [INFO ] Deduced a trap composed of 158 places in 332 ms of which 6 ms to minimize.
[2024-05-28 15:33:42] [INFO ] Deduced a trap composed of 150 places in 378 ms of which 3 ms to minimize.
[2024-05-28 15:33:42] [INFO ] Deduced a trap composed of 146 places in 264 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 52 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 14/14 constraints]
After SMT, in 48651ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 48670ms
[2024-05-28 15:33:42] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:33:42] [INFO ] Invariant cache hit.
[2024-05-28 15:33:43] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-28 15:33:43] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:33:43] [INFO ] Invariant cache hit.
[2024-05-28 15:33:44] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:33:49] [INFO ] Implicit Places using invariants and state equation in 6482 ms returned []
Implicit Place search using SMT with State Equation took 7008 ms to find 0 implicit places.
[2024-05-28 15:33:49] [INFO ] Redundant transitions in 24 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:33:49] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:33:49] [INFO ] Invariant cache hit.
[2024-05-28 15:33:49] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:34:08] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:34:08] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:34:08] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:34:09] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:34:09] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:34:09] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:34:09] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:34:09] [INFO ] Deduced a trap composed of 190 places in 409 ms of which 4 ms to minimize.
[2024-05-28 15:34:10] [INFO ] Deduced a trap composed of 191 places in 336 ms of which 3 ms to minimize.
[2024-05-28 15:34:11] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:34:25] [INFO ] Deduced a trap composed of 158 places in 254 ms of which 2 ms to minimize.
[2024-05-28 15:34:26] [INFO ] Deduced a trap composed of 170 places in 251 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:34:31] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:34:34] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 2 ms to minimize.
[2024-05-28 15:34:54] [INFO ] Deduced a trap composed of 71 places in 259 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 15/15 constraints]
After SMT, in 68434ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68453ms
Starting structural reductions in SI_LTL mode, iteration 1 : 460/700 places, 1604/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124274 ms. Remains : 460/700 places, 1604/1844 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-14
Stuttering criterion allowed to conclude after 30454 steps with 0 reset in 148 ms.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-14 finished in 124467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : PolyORBLF-COL-S04J04T08-LTLCardinality-02
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 700 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 700 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 628 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 144 place count 628 transition count 1692
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 304 place count 548 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 312 place count 540 transition count 1684
Iterating global reduction 2 with 8 rules applied. Total rules applied 320 place count 540 transition count 1684
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 480 place count 460 transition count 1604
Applied a total of 480 rules in 77 ms. Remains 460 /700 variables (removed 240) and now considering 1604/1844 (removed 240) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:34:58] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:34:58] [INFO ] Invariant cache hit.
[2024-05-28 15:34:58] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:35:18] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 3 ms to minimize.
[2024-05-28 15:35:18] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:35:18] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:35:18] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:35:18] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:35:18] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:35:18] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-05-28 15:35:19] [INFO ] Deduced a trap composed of 190 places in 358 ms of which 3 ms to minimize.
[2024-05-28 15:35:19] [INFO ] Deduced a trap composed of 191 places in 295 ms of which 2 ms to minimize.
[2024-05-28 15:35:20] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 48 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:35:30] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 1 ms to minimize.
[2024-05-28 15:35:33] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:35:46] [INFO ] Deduced a trap composed of 158 places in 328 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 51 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 13/13 constraints]
After SMT, in 48544ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 48559ms
[2024-05-28 15:35:47] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:35:47] [INFO ] Invariant cache hit.
[2024-05-28 15:35:48] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-05-28 15:35:48] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:35:48] [INFO ] Invariant cache hit.
[2024-05-28 15:35:48] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:35:56] [INFO ] Implicit Places using invariants and state equation in 8584 ms returned []
Implicit Place search using SMT with State Equation took 9145 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:35:56] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:35:56] [INFO ] Invariant cache hit.
[2024-05-28 15:35:56] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:36:17] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:36:17] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2024-05-28 15:36:17] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 2 ms to minimize.
[2024-05-28 15:36:17] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:36:17] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:36:17] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:36:17] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:36:18] [INFO ] Deduced a trap composed of 190 places in 324 ms of which 3 ms to minimize.
[2024-05-28 15:36:18] [INFO ] Deduced a trap composed of 191 places in 357 ms of which 4 ms to minimize.
[2024-05-28 15:36:19] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:36:35] [INFO ] Deduced a trap composed of 158 places in 298 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 49 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:36:43] [INFO ] Deduced a trap composed of 234 places in 291 ms of which 2 ms to minimize.
[2024-05-28 15:36:54] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 2 ms to minimize.
[2024-05-28 15:37:02] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 2 ms to minimize.
[2024-05-28 15:37:05] [INFO ] Deduced a trap composed of 73 places in 331 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 15/15 constraints]
After SMT, in 69916ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 69947ms
Starting structural reductions in LI_LTL mode, iteration 1 : 460/700 places, 1604/1844 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 127739 ms. Remains : 460/700 places, 1604/1844 transitions.
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 25000 reset in 573 ms.
Product exploration explored 100000 steps with 25000 reset in 717 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 275 steps (0 resets) in 5 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 1604/1604 transitions.
Applied a total of 0 rules in 11 ms. Remains 460 /460 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:37:08] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:37:08] [INFO ] Invariant cache hit.
[2024-05-28 15:37:08] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:37:26] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 2 ms to minimize.
[2024-05-28 15:37:27] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:37:27] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 1 ms to minimize.
[2024-05-28 15:37:27] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:37:27] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:37:27] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:37:27] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:37:27] [INFO ] Deduced a trap composed of 190 places in 340 ms of which 3 ms to minimize.
[2024-05-28 15:37:28] [INFO ] Deduced a trap composed of 191 places in 314 ms of which 3 ms to minimize.
[2024-05-28 15:37:29] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 48 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:37:39] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 3 ms to minimize.
[2024-05-28 15:37:41] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 2 ms to minimize.
[2024-05-28 15:37:54] [INFO ] Deduced a trap composed of 158 places in 344 ms of which 4 ms to minimize.
[2024-05-28 15:37:55] [INFO ] Deduced a trap composed of 165 places in 302 ms of which 3 ms to minimize.
[2024-05-28 15:37:56] [INFO ] Deduced a trap composed of 79 places in 335 ms of which 3 ms to minimize.
SMT process timed out in 48344ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 48368ms
[2024-05-28 15:37:56] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:37:56] [INFO ] Invariant cache hit.
[2024-05-28 15:37:57] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-28 15:37:57] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:37:57] [INFO ] Invariant cache hit.
[2024-05-28 15:37:58] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:38:05] [INFO ] Implicit Places using invariants and state equation in 8565 ms returned []
Implicit Place search using SMT with State Equation took 9063 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:38:06] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:38:06] [INFO ] Invariant cache hit.
[2024-05-28 15:38:06] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 0 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:38:26] [INFO ] Deduced a trap composed of 190 places in 271 ms of which 2 ms to minimize.
[2024-05-28 15:38:26] [INFO ] Deduced a trap composed of 191 places in 259 ms of which 2 ms to minimize.
[2024-05-28 15:38:27] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:38:42] [INFO ] Deduced a trap composed of 158 places in 259 ms of which 3 ms to minimize.
[2024-05-28 15:38:44] [INFO ] Deduced a trap composed of 170 places in 227 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 9.0)
(s139 0.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:38:48] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-05-28 15:38:53] [INFO ] Deduced a trap composed of 234 places in 325 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 52 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 14/14 constraints]
After SMT, in 68771ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68793ms
Finished structural reductions in LTL mode , in 1 iterations and 126250 ms. Remains : 460/460 places, 1604/1604 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 8 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 687 ms.
Product exploration explored 100000 steps with 25000 reset in 625 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 1604/1604 transitions.
Applied a total of 0 rules in 23 ms. Remains 460 /460 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:39:17] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:39:17] [INFO ] Invariant cache hit.
[2024-05-28 15:39:17] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:39:36] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 2 ms to minimize.
[2024-05-28 15:39:36] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 1 ms to minimize.
[2024-05-28 15:39:36] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-05-28 15:39:36] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-05-28 15:39:36] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2024-05-28 15:39:36] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:39:36] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:39:37] [INFO ] Deduced a trap composed of 190 places in 310 ms of which 2 ms to minimize.
[2024-05-28 15:39:37] [INFO ] Deduced a trap composed of 191 places in 291 ms of which 2 ms to minimize.
[2024-05-28 15:39:38] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 48 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:39:49] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 2 ms to minimize.
[2024-05-28 15:39:51] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 2 ms to minimize.
[2024-05-28 15:40:04] [INFO ] Deduced a trap composed of 158 places in 325 ms of which 3 ms to minimize.
[2024-05-28 15:40:06] [INFO ] Deduced a trap composed of 165 places in 316 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 52 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 14/14 constraints]
After SMT, in 49047ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 49065ms
[2024-05-28 15:40:06] [INFO ] Redundant transitions in 17 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:40:06] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:40:06] [INFO ] Invariant cache hit.
[2024-05-28 15:40:06] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:40:25] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:40:26] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-28 15:40:26] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 1 ms to minimize.
[2024-05-28 15:40:26] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-05-28 15:40:26] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 0 ms to minimize.
[2024-05-28 15:40:26] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 0 ms to minimize.
[2024-05-28 15:40:26] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:40:26] [INFO ] Deduced a trap composed of 190 places in 271 ms of which 3 ms to minimize.
[2024-05-28 15:40:27] [INFO ] Deduced a trap composed of 191 places in 284 ms of which 3 ms to minimize.
[2024-05-28 15:40:28] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2024-05-28 15:40:42] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 2 ms to minimize.
[2024-05-28 15:40:43] [INFO ] Deduced a trap composed of 170 places in 238 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:40:48] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-05-28 15:40:51] [INFO ] Deduced a trap composed of 234 places in 225 ms of which 2 ms to minimize.
[2024-05-28 15:41:10] [INFO ] Deduced a trap composed of 71 places in 243 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 15/15 constraints]
After SMT, in 68863ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68878ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 117999 ms. Remains : 460/460 places, 1604/1604 transitions.
Built C files in :
/tmp/ltsmin805327874580518725
[2024-05-28 15:41:15] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin805327874580518725
Running compilation step : cd /tmp/ltsmin805327874580518725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin805327874580518725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin805327874580518725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 1604/1604 transitions.
Applied a total of 0 rules in 5 ms. Remains 460 /460 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:41:18] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:41:18] [INFO ] Invariant cache hit.
[2024-05-28 15:41:18] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:41:37] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 3 ms to minimize.
[2024-05-28 15:41:38] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:41:38] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:41:38] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:41:38] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:41:38] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:41:38] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:41:39] [INFO ] Deduced a trap composed of 190 places in 519 ms of which 3 ms to minimize.
[2024-05-28 15:41:39] [INFO ] Deduced a trap composed of 191 places in 340 ms of which 3 ms to minimize.
[2024-05-28 15:41:40] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 48 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:41:50] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 2 ms to minimize.
[2024-05-28 15:41:52] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2024-05-28 15:42:04] [INFO ] Deduced a trap composed of 158 places in 325 ms of which 3 ms to minimize.
[2024-05-28 15:42:06] [INFO ] Deduced a trap composed of 165 places in 253 ms of which 2 ms to minimize.
[2024-05-28 15:42:07] [INFO ] Deduced a trap composed of 79 places in 248 ms of which 2 ms to minimize.
SMT process timed out in 48818ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 48833ms
[2024-05-28 15:42:07] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:42:07] [INFO ] Invariant cache hit.
[2024-05-28 15:42:07] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-28 15:42:07] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:42:07] [INFO ] Invariant cache hit.
[2024-05-28 15:42:07] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:42:16] [INFO ] Implicit Places using invariants and state equation in 8622 ms returned []
Implicit Place search using SMT with State Equation took 8948 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:42:16] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-05-28 15:42:16] [INFO ] Invariant cache hit.
[2024-05-28 15:42:16] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:42:35] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:42:35] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2024-05-28 15:42:35] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 3 ms to minimize.
[2024-05-28 15:42:35] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:42:35] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:42:35] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:42:35] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:42:36] [INFO ] Deduced a trap composed of 190 places in 335 ms of which 4 ms to minimize.
[2024-05-28 15:42:36] [INFO ] Deduced a trap composed of 191 places in 417 ms of which 4 ms to minimize.
[2024-05-28 15:42:37] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:42:51] [INFO ] Deduced a trap composed of 158 places in 313 ms of which 3 ms to minimize.
[2024-05-28 15:42:53] [INFO ] Deduced a trap composed of 170 places in 282 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 2 ms to minimize.
[2024-05-28 15:43:02] [INFO ] Deduced a trap composed of 234 places in 345 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 52 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 14/14 constraints]
After SMT, in 68418ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68443ms
Finished structural reductions in LTL mode , in 1 iterations and 126236 ms. Remains : 460/460 places, 1604/1604 transitions.
Built C files in :
/tmp/ltsmin18141562808122795795
[2024-05-28 15:43:24] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18141562808122795795
Running compilation step : cd /tmp/ltsmin18141562808122795795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18141562808122795795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18141562808122795795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:43:27] [INFO ] Flatten gal took : 54 ms
[2024-05-28 15:43:27] [INFO ] Flatten gal took : 57 ms
[2024-05-28 15:43:27] [INFO ] Time to serialize gal into /tmp/LTL4284532886209197707.gal : 8 ms
[2024-05-28 15:43:27] [INFO ] Time to serialize properties into /tmp/LTL5070906203370629095.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4284532886209197707.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2694230429946885408.hoa' '-atoms' '/tmp/LTL5070906203370629095.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5070906203370629095.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2694230429946885408.hoa
Detected timeout of ITS tools.
[2024-05-28 15:43:42] [INFO ] Flatten gal took : 54 ms
[2024-05-28 15:43:42] [INFO ] Flatten gal took : 56 ms
[2024-05-28 15:43:42] [INFO ] Time to serialize gal into /tmp/LTL8008633269681967294.gal : 7 ms
[2024-05-28 15:43:42] [INFO ] Time to serialize properties into /tmp/LTL13013399521315110912.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8008633269681967294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13013399521315110912.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(P_1716<=NoSigAbort)"))))))
Formula 0 simplified : XXXG!"(P_1716<=NoSigAbort)"
Detected timeout of ITS tools.
[2024-05-28 15:43:58] [INFO ] Flatten gal took : 77 ms
[2024-05-28 15:43:58] [INFO ] Applying decomposition
[2024-05-28 15:43:58] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8503218091772861792.txt' '-o' '/tmp/graph8503218091772861792.bin' '-w' '/tmp/graph8503218091772861792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8503218091772861792.bin' '-l' '-1' '-v' '-w' '/tmp/graph8503218091772861792.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:43:58] [INFO ] Decomposing Gal with order
[2024-05-28 15:43:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:43:58] [INFO ] Removed a total of 890 redundant transitions.
[2024-05-28 15:43:58] [INFO ] Flatten gal took : 162 ms
[2024-05-28 15:43:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 8 ms.
[2024-05-28 15:43:58] [INFO ] Time to serialize gal into /tmp/LTL8677043460856935993.gal : 23 ms
[2024-05-28 15:43:58] [INFO ] Time to serialize properties into /tmp/LTL2990816499320293566.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8677043460856935993.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2990816499320293566.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(gu10.P_1716<=gu10.NoSigAbort)"))))))
Formula 0 simplified : XXXG!"(gu10.P_1716<=gu10.NoSigAbort)"
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-02 finished in 555123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(((p1||F(G(p0))) U (p0&&(p1||F(G(p0))))))))))'
Found a Lengthening insensitive property : PolyORBLF-COL-S04J04T08-LTLCardinality-03
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 700 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 700 transition count 1780
Reduce places removed 64 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 72 rules applied. Total rules applied 136 place count 636 transition count 1772
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 144 place count 628 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 144 place count 628 transition count 1692
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 304 place count 548 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 312 place count 540 transition count 1684
Iterating global reduction 3 with 8 rules applied. Total rules applied 320 place count 540 transition count 1684
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 464 place count 468 transition count 1612
Applied a total of 464 rules in 87 ms. Remains 468 /700 variables (removed 232) and now considering 1612/1844 (removed 232) transitions.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:44:14] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
// Phase 1: matrix 1580 rows 468 cols
[2024-05-28 15:44:14] [INFO ] Computed 42 invariants in 31 ms
[2024-05-28 15:44:14] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:44:35] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 2 ms to minimize.
[2024-05-28 15:44:35] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-05-28 15:44:35] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 1 ms to minimize.
[2024-05-28 15:44:35] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:44:35] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2024-05-28 15:44:35] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:44:36] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:44:36] [INFO ] Deduced a trap composed of 198 places in 266 ms of which 4 ms to minimize.
[2024-05-28 15:44:36] [INFO ] Deduced a trap composed of 199 places in 284 ms of which 4 ms to minimize.
[2024-05-28 15:44:37] [INFO ] Deduced a trap composed of 205 places in 304 ms of which 3 ms to minimize.
[2024-05-28 15:44:37] [INFO ] Deduced a trap composed of 262 places in 351 ms of which 2 ms to minimize.
[2024-05-28 15:44:37] [INFO ] Deduced a trap composed of 218 places in 358 ms of which 4 ms to minimize.
[2024-05-28 15:44:38] [INFO ] Deduced a trap composed of 206 places in 326 ms of which 3 ms to minimize.
[2024-05-28 15:44:38] [INFO ] Deduced a trap composed of 222 places in 307 ms of which 3 ms to minimize.
[2024-05-28 15:44:38] [INFO ] Deduced a trap composed of 215 places in 248 ms of which 2 ms to minimize.
[2024-05-28 15:44:39] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 4 ms to minimize.
[2024-05-28 15:44:40] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 79 places in 306 ms of which 3 ms to minimize.
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 176 places in 235 ms of which 2 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 183 places in 420 ms of which 3 ms to minimize.
SMT process timed out in 30566ms, After SMT, problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 30588ms
[2024-05-28 15:44:44] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:44:44] [INFO ] Invariant cache hit.
[2024-05-28 15:44:45] [INFO ] Implicit Places using invariants in 500 ms returned []
[2024-05-28 15:44:45] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:44:45] [INFO ] Invariant cache hit.
[2024-05-28 15:44:45] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:44:53] [INFO ] Implicit Places using invariants and state equation in 8588 ms returned []
Implicit Place search using SMT with State Equation took 9093 ms to find 0 implicit places.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:44:53] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:44:53] [INFO ] Invariant cache hit.
[2024-05-28 15:44:53] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:45:14] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:45:14] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:45:14] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:45:15] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:45:15] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:45:15] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:45:15] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:45:15] [INFO ] Deduced a trap composed of 199 places in 290 ms of which 3 ms to minimize.
[2024-05-28 15:45:16] [INFO ] Deduced a trap composed of 195 places in 321 ms of which 4 ms to minimize.
[2024-05-28 15:45:16] [INFO ] Deduced a trap composed of 198 places in 373 ms of which 2 ms to minimize.
[2024-05-28 15:45:17] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:45:31] [INFO ] Deduced a trap composed of 159 places in 419 ms of which 3 ms to minimize.
[2024-05-28 15:45:32] [INFO ] Deduced a trap composed of 154 places in 274 ms of which 3 ms to minimize.
SMT process timed out in 39104ms, After SMT, problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 39130ms
Starting structural reductions in LI_LTL mode, iteration 1 : 468/700 places, 1612/1844 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 78904 ms. Remains : 468/700 places, 1612/1844 transitions.
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-03
Product exploration explored 100000 steps with 968 reset in 376 ms.
Product exploration explored 100000 steps with 863 reset in 381 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 333 steps (0 resets) in 7 ms. (41 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 1612/1612 transitions.
Applied a total of 0 rules in 14 ms. Remains 468 /468 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:45:34] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:45:34] [INFO ] Invariant cache hit.
[2024-05-28 15:45:34] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:45:53] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:45:53] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:45:54] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:45:54] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:45:54] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:45:54] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:45:54] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:45:54] [INFO ] Deduced a trap composed of 199 places in 344 ms of which 4 ms to minimize.
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 195 places in 348 ms of which 3 ms to minimize.
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 198 places in 352 ms of which 4 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 49 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:46:20] [INFO ] Deduced a trap composed of 178 places in 379 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 50 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 12/12 constraints]
After SMT, in 49174ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 49203ms
[2024-05-28 15:46:23] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:46:23] [INFO ] Invariant cache hit.
[2024-05-28 15:46:24] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-28 15:46:24] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:46:24] [INFO ] Invariant cache hit.
[2024-05-28 15:46:24] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:46:32] [INFO ] Implicit Places using invariants and state equation in 8237 ms returned []
Implicit Place search using SMT with State Equation took 8778 ms to find 0 implicit places.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:46:32] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:46:32] [INFO ] Invariant cache hit.
[2024-05-28 15:46:32] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:46:49] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 3 ms to minimize.
[2024-05-28 15:46:49] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:46:49] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 1 ms to minimize.
[2024-05-28 15:46:49] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:46:49] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2024-05-28 15:46:49] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2024-05-28 15:46:50] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:46:50] [INFO ] Deduced a trap composed of 199 places in 353 ms of which 3 ms to minimize.
[2024-05-28 15:46:50] [INFO ] Deduced a trap composed of 195 places in 339 ms of which 4 ms to minimize.
[2024-05-28 15:46:51] [INFO ] Deduced a trap composed of 198 places in 373 ms of which 3 ms to minimize.
[2024-05-28 15:46:52] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:47:04] [INFO ] Deduced a trap composed of 159 places in 283 ms of which 4 ms to minimize.
[2024-05-28 15:47:05] [INFO ] Deduced a trap composed of 154 places in 323 ms of which 4 ms to minimize.
[2024-05-28 15:47:08] [INFO ] Deduced a trap composed of 42 places in 350 ms of which 3 ms to minimize.
[2024-05-28 15:47:08] [INFO ] Deduced a trap composed of 135 places in 323 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 53 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:47:16] [INFO ] Deduced a trap composed of 235 places in 307 ms of which 3 ms to minimize.
[2024-05-28 15:47:17] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-05-28 15:47:31] [INFO ] Deduced a trap composed of 51 places in 267 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 56 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 18/18 constraints]
After SMT, in 67488ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 67501ms
Finished structural reductions in LTL mode , in 1 iterations and 125504 ms. Remains : 468/468 places, 1612/1612 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 436 steps (0 resets) in 7 ms. (54 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 909 reset in 492 ms.
Product exploration explored 100000 steps with 888 reset in 496 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 1612/1612 transitions.
Applied a total of 0 rules in 28 ms. Remains 468 /468 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:47:42] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:47:42] [INFO ] Invariant cache hit.
[2024-05-28 15:47:42] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:48:04] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:48:04] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2024-05-28 15:48:04] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:48:04] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2024-05-28 15:48:04] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:48:04] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:48:04] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:48:05] [INFO ] Deduced a trap composed of 199 places in 228 ms of which 2 ms to minimize.
[2024-05-28 15:48:05] [INFO ] Deduced a trap composed of 195 places in 324 ms of which 3 ms to minimize.
[2024-05-28 15:48:05] [INFO ] Deduced a trap composed of 198 places in 250 ms of which 3 ms to minimize.
[2024-05-28 15:48:06] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 49 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:48:29] [INFO ] Deduced a trap composed of 178 places in 353 ms of which 4 ms to minimize.
[2024-05-28 15:48:32] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 51 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 13/13 constraints]
After SMT, in 50628ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 50651ms
[2024-05-28 15:48:33] [INFO ] Redundant transitions in 15 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:48:33] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:48:33] [INFO ] Invariant cache hit.
[2024-05-28 15:48:33] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:48:51] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:48:51] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 1 ms to minimize.
[2024-05-28 15:48:51] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:48:51] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:48:51] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
[2024-05-28 15:48:51] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-05-28 15:48:52] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:48:52] [INFO ] Deduced a trap composed of 199 places in 234 ms of which 2 ms to minimize.
[2024-05-28 15:48:52] [INFO ] Deduced a trap composed of 195 places in 236 ms of which 3 ms to minimize.
[2024-05-28 15:48:52] [INFO ] Deduced a trap composed of 198 places in 286 ms of which 3 ms to minimize.
[2024-05-28 15:48:53] [INFO ] Deduced a trap composed of 47 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:49:08] [INFO ] Deduced a trap composed of 159 places in 260 ms of which 2 ms to minimize.
[2024-05-28 15:49:09] [INFO ] Deduced a trap composed of 154 places in 279 ms of which 3 ms to minimize.
[2024-05-28 15:49:10] [INFO ] Deduced a trap composed of 42 places in 292 ms of which 3 ms to minimize.
[2024-05-28 15:49:10] [INFO ] Deduced a trap composed of 135 places in 260 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 53 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:49:16] [INFO ] Deduced a trap composed of 235 places in 320 ms of which 4 ms to minimize.
[2024-05-28 15:49:17] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-05-28 15:49:34] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 56 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 18/18 constraints]
After SMT, in 67870ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 67884ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 118593 ms. Remains : 468/468 places, 1612/1612 transitions.
Built C files in :
/tmp/ltsmin15111017676045949805
[2024-05-28 15:49:40] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15111017676045949805
Running compilation step : cd /tmp/ltsmin15111017676045949805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15111017676045949805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15111017676045949805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 32 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 1612/1612 transitions.
Applied a total of 0 rules in 6 ms. Remains 468 /468 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:49:44] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:49:44] [INFO ] Invariant cache hit.
[2024-05-28 15:49:44] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:50:04] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 1 ms to minimize.
[2024-05-28 15:50:04] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2024-05-28 15:50:04] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:50:04] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:50:04] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:50:04] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-05-28 15:50:04] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 26 ms to minimize.
[2024-05-28 15:50:05] [INFO ] Deduced a trap composed of 199 places in 249 ms of which 2 ms to minimize.
[2024-05-28 15:50:05] [INFO ] Deduced a trap composed of 195 places in 279 ms of which 3 ms to minimize.
[2024-05-28 15:50:05] [INFO ] Deduced a trap composed of 198 places in 263 ms of which 3 ms to minimize.
[2024-05-28 15:50:06] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 49 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:50:30] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 50 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 12/12 constraints]
After SMT, in 48849ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 48865ms
[2024-05-28 15:50:32] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:50:32] [INFO ] Invariant cache hit.
[2024-05-28 15:50:33] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-28 15:50:33] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:50:33] [INFO ] Invariant cache hit.
[2024-05-28 15:50:33] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:50:42] [INFO ] Implicit Places using invariants and state equation in 8800 ms returned []
Implicit Place search using SMT with State Equation took 9195 ms to find 0 implicit places.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:50:42] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-05-28 15:50:42] [INFO ] Invariant cache hit.
[2024-05-28 15:50:42] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:51:01] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 1 ms to minimize.
[2024-05-28 15:51:01] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 1 ms to minimize.
[2024-05-28 15:51:01] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2024-05-28 15:51:01] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:51:01] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2024-05-28 15:51:01] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2024-05-28 15:51:01] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2024-05-28 15:51:02] [INFO ] Deduced a trap composed of 199 places in 257 ms of which 3 ms to minimize.
[2024-05-28 15:51:02] [INFO ] Deduced a trap composed of 195 places in 249 ms of which 2 ms to minimize.
[2024-05-28 15:51:02] [INFO ] Deduced a trap composed of 198 places in 261 ms of which 2 ms to minimize.
[2024-05-28 15:51:03] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2024-05-28 15:51:18] [INFO ] Deduced a trap composed of 159 places in 307 ms of which 4 ms to minimize.
[2024-05-28 15:51:19] [INFO ] Deduced a trap composed of 154 places in 301 ms of which 3 ms to minimize.
[2024-05-28 15:51:20] [INFO ] Deduced a trap composed of 42 places in 348 ms of which 4 ms to minimize.
[2024-05-28 15:51:21] [INFO ] Deduced a trap composed of 135 places in 300 ms of which 3 ms to minimize.
SMT process timed out in 39185ms, After SMT, problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 39201ms
Finished structural reductions in LTL mode , in 1 iterations and 97274 ms. Remains : 468/468 places, 1612/1612 transitions.
Built C files in :
/tmp/ltsmin17392307883203031336
[2024-05-28 15:51:21] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17392307883203031336
Running compilation step : cd /tmp/ltsmin17392307883203031336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17392307883203031336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17392307883203031336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:51:24] [INFO ] Flatten gal took : 49 ms
[2024-05-28 15:51:24] [INFO ] Flatten gal took : 51 ms
[2024-05-28 15:51:24] [INFO ] Time to serialize gal into /tmp/LTL16963676722347896702.gal : 8 ms
[2024-05-28 15:51:24] [INFO ] Time to serialize properties into /tmp/LTL667585131516308844.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16963676722347896702.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11508659252634067283.hoa' '-atoms' '/tmp/LTL667585131516308844.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL667585131516308844.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11508659252634067283.hoa
Detected timeout of ITS tools.
[2024-05-28 15:51:39] [INFO ] Flatten gal took : 52 ms
[2024-05-28 15:51:39] [INFO ] Flatten gal took : 51 ms
[2024-05-28 15:51:39] [INFO ] Time to serialize gal into /tmp/LTL9645437648997130026.gal : 9 ms
[2024-05-28 15:51:39] [INFO ] Time to serialize properties into /tmp/LTL9183451158359036662.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9645437648997130026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9183451158359036662.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((Abort_Check_Sources_B_0+Abort_Check_Sources_B_1)+(Abort_Check_Sources_B_2+Abort_Check_Sources_B_3))+((Abort_Check_Sources...2588
Formula 0 simplified : XF(!"((((Abort_Check_Sources_B_0+Abort_Check_Sources_B_1)+(Abort_Check_Sources_B_2+Abort_Check_Sources_B_3))+((Abort_Check_Sources_B...1783
Detected timeout of ITS tools.
[2024-05-28 15:51:54] [INFO ] Flatten gal took : 124 ms
[2024-05-28 15:51:54] [INFO ] Applying decomposition
[2024-05-28 15:51:54] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5921095897647175317.txt' '-o' '/tmp/graph5921095897647175317.bin' '-w' '/tmp/graph5921095897647175317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5921095897647175317.bin' '-l' '-1' '-v' '-w' '/tmp/graph5921095897647175317.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:51:55] [INFO ] Decomposing Gal with order
[2024-05-28 15:51:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:51:55] [INFO ] Removed a total of 1034 redundant transitions.
[2024-05-28 15:51:55] [INFO ] Flatten gal took : 149 ms
[2024-05-28 15:51:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 613 labels/synchronizations in 21 ms.
[2024-05-28 15:51:55] [INFO ] Time to serialize gal into /tmp/LTL15889400865919378975.gal : 14 ms
[2024-05-28 15:51:55] [INFO ] Time to serialize properties into /tmp/LTL1341403385687841460.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15889400865919378975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1341403385687841460.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((gu23.Abort_Check_Sources_B_0+gu23.Abort_Check_Sources_B_1)+(gu23.Abort_Check_Sources_B_2+gu23.Abort_Check_Sources_B_3))+(...3068
Formula 0 simplified : XF(!"((((gu23.Abort_Check_Sources_B_0+gu23.Abort_Check_Sources_B_1)+(gu23.Abort_Check_Sources_B_2+gu23.Abort_Check_Sources_B_3))+((g...2103
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-03 finished in 476776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U X(p1)))))'
[2024-05-28 15:52:10] [INFO ] Flatten gal took : 98 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11361722756207984938
[2024-05-28 15:52:10] [INFO ] Too many transitions (1844) to apply POR reductions. Disabling POR matrices.
[2024-05-28 15:52:10] [INFO ] Applying decomposition
[2024-05-28 15:52:10] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11361722756207984938
Running compilation step : cd /tmp/ltsmin11361722756207984938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 15:52:10] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4049301072585231907.txt' '-o' '/tmp/graph4049301072585231907.bin' '-w' '/tmp/graph4049301072585231907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4049301072585231907.bin' '-l' '-1' '-v' '-w' '/tmp/graph4049301072585231907.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:52:11] [INFO ] Decomposing Gal with order
[2024-05-28 15:52:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:52:11] [INFO ] Removed a total of 1481 redundant transitions.
[2024-05-28 15:52:11] [INFO ] Flatten gal took : 257 ms
[2024-05-28 15:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 805 labels/synchronizations in 51 ms.
[2024-05-28 15:52:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality9402734437620529301.gal : 17 ms
[2024-05-28 15:52:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality1243449865064240060.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9402734437620529301.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1243449865064240060.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((X(X(X(F("(gi2.gi1.gi3.gu53.P_1716<=gi2.gi1.gi3.gu53.NoSigAbort)"))))))
Formula 0 simplified : XXXG!"(gi2.gi1.gi3.gu53.P_1716<=gi2.gi1.gi3.gu53.NoSigAbort)"
Compilation finished in 4793 ms.
Running link step : cd /tmp/ltsmin11361722756207984938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 126 ms.
Running LTSmin : cd /tmp/ltsmin11361722756207984938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 1603 ms.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin11361722756207984938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp1==true)||X((((LTLAPp2==true)||<>([]((LTLAPp1==true)))) U ((LTLAPp1==true)&&((LTLAPp2==true)||<>([]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11361722756207984938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp1==true)||X((((LTLAPp2==true)||<>([]((LTLAPp1==true)))) U ((LTLAPp1==true)&&((LTLAPp2==true)||<>([]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11361722756207984938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp3==true)) U X((LTLAPp4==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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="PolyORBLF-COL-S04J04T08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S04J04T08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446400131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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