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

About the Execution of 2023-gold for PolyORBLF-PT-S04J06T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16215.915 3600000.00 7134088.00 93815.80 FFFTF?TFFFTFFFTF 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.r307-tajo-171654460600183.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 gold2023
Input is PolyORBLF-PT-S04J06T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460600183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:07 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 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.6M 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-PT-S04J06T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717120094790

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 01:48:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 01:48:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 01:48:16] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2024-05-31 01:48:16] [INFO ] Transformed 618 places.
[2024-05-31 01:48:16] [INFO ] Transformed 3190 transitions.
[2024-05-31 01:48:16] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
[2024-05-31 01:48:16] [INFO ] Reduced 264 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 212 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1564
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 609 transition count 1559
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 609 transition count 1559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 604 transition count 1554
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 604 transition count 1554
Applied a total of 24 rules in 142 ms. Remains 604 /618 variables (removed 14) and now considering 1554/1564 (removed 10) transitions.
[2024-05-31 01:48:17] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
// Phase 1: matrix 1530 rows 604 cols
[2024-05-31 01:48:17] [INFO ] Computed 50 invariants in 87 ms
[2024-05-31 01:48:18] [INFO ] Dead Transitions using invariants and state equation in 1535 ms found 324 transitions.
Found 324 dead transitions using SMT.
Drop transitions removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions.
[2024-05-31 01:48:18] [INFO ] Flow matrix only has 1206 transitions (discarded 24 similar events)
// Phase 1: matrix 1206 rows 604 cols
[2024-05-31 01:48:18] [INFO ] Computed 50 invariants in 38 ms
[2024-05-31 01:48:19] [INFO ] Implicit Places using invariants in 384 ms returned [134, 199, 326, 360, 479, 546]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 388 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 598/618 places, 1230/1564 transitions.
Applied a total of 0 rules in 12 ms. Remains 598 /598 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2108 ms. Remains : 598/618 places, 1230/1564 transitions.
Support contains 212 out of 598 places after structural reductions.
[2024-05-31 01:48:19] [INFO ] Flatten gal took : 133 ms
[2024-05-31 01:48:19] [INFO ] Flatten gal took : 90 ms
[2024-05-31 01:48:19] [INFO ] Input system was already deterministic with 1230 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 25) seen :22
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 01:48:20] [INFO ] Flow matrix only has 1206 transitions (discarded 24 similar events)
// Phase 1: matrix 1206 rows 598 cols
[2024-05-31 01:48:20] [INFO ] Computed 44 invariants in 60 ms
[2024-05-31 01:48:20] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-31 01:48:21] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 34 ms returned sat
[2024-05-31 01:48:21] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 6 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1230/1230 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1229
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1228
Applied a total of 4 rules in 51 ms. Remains 596 /598 variables (removed 2) and now considering 1228/1230 (removed 2) transitions.
[2024-05-31 01:48:21] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2024-05-31 01:48:21] [INFO ] Computed 44 invariants in 34 ms
[2024-05-31 01:48:22] [INFO ] Dead Transitions using invariants and state equation in 1180 ms found 0 transitions.
[2024-05-31 01:48:22] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:48:22] [INFO ] Invariant cache hit.
[2024-05-31 01:48:23] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-31 01:48:23] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:48:23] [INFO ] Invariant cache hit.
[2024-05-31 01:48:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:48:28] [INFO ] Implicit Places using invariants and state equation in 5830 ms returned []
Implicit Place search using SMT with State Equation took 6344 ms to find 0 implicit places.
[2024-05-31 01:48:28] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:48:28] [INFO ] Invariant cache hit.
[2024-05-31 01:48:30] [INFO ] Dead Transitions using invariants and state equation in 1292 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1228/1230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8869 ms. Remains : 596/598 places, 1228/1230 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s193 1) (GEQ s462 1) (GEQ s55 1) (GEQ s322 1) (GEQ s377 1) (GEQ s545 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 34333 steps with 11 reset in 207 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-00 finished in 9338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(G(p1)&&(G(p2)||(X(p2)&&F(p3)))))))'
Support contains 56 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1230/1230 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1229
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1228
Applied a total of 4 rules in 60 ms. Remains 596 /598 variables (removed 2) and now considering 1228/1230 (removed 2) transitions.
[2024-05-31 01:48:30] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:48:30] [INFO ] Invariant cache hit.
[2024-05-31 01:48:31] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
[2024-05-31 01:48:31] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:48:31] [INFO ] Invariant cache hit.
[2024-05-31 01:48:32] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-31 01:48:32] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:48:32] [INFO ] Invariant cache hit.
[2024-05-31 01:48:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:48:42] [INFO ] Implicit Places using invariants and state equation in 10073 ms returned []
Implicit Place search using SMT with State Equation took 10494 ms to find 0 implicit places.
[2024-05-31 01:48:42] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:48:42] [INFO ] Invariant cache hit.
[2024-05-31 01:48:43] [INFO ] Dead Transitions using invariants and state equation in 1270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1228/1230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13049 ms. Remains : 596/598 places, 1228/1230 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p1), (AND p1 (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=1 dest: 7}, { cond=(AND p0 p1), acceptance={} source=1 dest: 8}, { cond=(AND p0 p1), acceptance={} source=1 dest: 9}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 10}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=1 dest: 11}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 4}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=9 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=10 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=11 dest: 10}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(OR (AND (GEQ s241 1) (GEQ s265 1) (GEQ s566 1)) (AND (GEQ s176 1) (GEQ s241 1) (GEQ s265 1)) (AND (GEQ s173 1) (GEQ s265 1) (GEQ s538 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-04 finished in 13464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p0) U X(p1)))&&F(p2))))'
Support contains 38 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1230/1230 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1229
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1228
Applied a total of 4 rules in 37 ms. Remains 596 /598 variables (removed 2) and now considering 1228/1230 (removed 2) transitions.
[2024-05-31 01:48:44] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:48:44] [INFO ] Invariant cache hit.
[2024-05-31 01:48:45] [INFO ] Dead Transitions using invariants and state equation in 1189 ms found 0 transitions.
[2024-05-31 01:48:45] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:48:45] [INFO ] Invariant cache hit.
[2024-05-31 01:48:45] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-05-31 01:48:45] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:48:45] [INFO ] Invariant cache hit.
[2024-05-31 01:48:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:48:56] [INFO ] Implicit Places using invariants and state equation in 10311 ms returned []
Implicit Place search using SMT with State Equation took 10859 ms to find 0 implicit places.
[2024-05-31 01:48:56] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:48:56] [INFO ] Invariant cache hit.
[2024-05-31 01:48:57] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1228/1230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13205 ms. Remains : 596/598 places, 1228/1230 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s493 1) (GEQ s552 2)) (AND (GEQ s326 1) (GEQ s552 2)) (AND (GEQ s373 1) (GEQ s552 2)) (AND (GEQ s51 1) (GEQ s552 2)) (AND (GEQ s114 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2806 reset in 665 ms.
Product exploration explored 100000 steps with 2826 reset in 535 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 131 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 261 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-31 01:49:00] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:49:00] [INFO ] Invariant cache hit.
[2024-05-31 01:49:00] [INFO ] [Real]Absence check using 18 positive place invariants in 21 ms returned sat
[2024-05-31 01:49:01] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 159 ms returned sat
[2024-05-31 01:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:49:03] [INFO ] [Real]Absence check using state equation in 2055 ms returned sat
[2024-05-31 01:49:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:49:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-31 01:49:03] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 58 ms returned sat
[2024-05-31 01:49:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:49:07] [INFO ] [Nat]Absence check using state equation in 3258 ms returned sat
[2024-05-31 01:49:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:49:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 01:49:11] [INFO ] [Nat]Added 120 Read/Feed constraints in 4765 ms returned sat
[2024-05-31 01:49:12] [INFO ] Computed and/alt/rep : 948/4627/930 causal constraints (skipped 270 transitions) in 112 ms.
[2024-05-31 01:49:18] [INFO ] Added : 160 causal constraints over 32 iterations in 6221 ms. Result :unknown
Could not prove EG (NOT p2)
[2024-05-31 01:49:18] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:49:18] [INFO ] Invariant cache hit.
[2024-05-31 01:49:18] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-31 01:49:18] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 118 ms returned sat
[2024-05-31 01:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:49:20] [INFO ] [Real]Absence check using state equation in 1438 ms returned sat
[2024-05-31 01:49:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:49:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-31 01:49:21] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 86 ms returned sat
[2024-05-31 01:49:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:49:25] [INFO ] [Nat]Absence check using state equation in 3909 ms returned sat
[2024-05-31 01:49:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:49:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 2256 ms returned sat
[2024-05-31 01:49:27] [INFO ] Deduced a trap composed of 125 places in 357 ms of which 4 ms to minimize.
[2024-05-31 01:49:28] [INFO ] Deduced a trap composed of 102 places in 376 ms of which 1 ms to minimize.
[2024-05-31 01:49:30] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-05-31 01:49:31] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-05-31 01:49:34] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 2 ms to minimize.
[2024-05-31 01:49:35] [INFO ] Deduced a trap composed of 2 places in 335 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 01:49:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 38 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1228/1228 transitions.
Applied a total of 0 rules in 10 ms. Remains 596 /596 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2024-05-31 01:49:35] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:49:35] [INFO ] Invariant cache hit.
[2024-05-31 01:49:36] [INFO ] Dead Transitions using invariants and state equation in 1128 ms found 0 transitions.
[2024-05-31 01:49:36] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:49:36] [INFO ] Invariant cache hit.
[2024-05-31 01:49:37] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-31 01:49:37] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:49:37] [INFO ] Invariant cache hit.
[2024-05-31 01:49:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:49:49] [INFO ] Implicit Places using invariants and state equation in 12500 ms returned []
Implicit Place search using SMT with State Equation took 13017 ms to find 0 implicit places.
[2024-05-31 01:49:49] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:49:49] [INFO ] Invariant cache hit.
[2024-05-31 01:49:51] [INFO ] Dead Transitions using invariants and state equation in 1354 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15512 ms. Remains : 596/596 places, 1228/1228 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 69 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 196 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-31 01:49:52] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:49:52] [INFO ] Invariant cache hit.
[2024-05-31 01:49:52] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-31 01:49:53] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 86 ms returned sat
[2024-05-31 01:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:49:54] [INFO ] [Real]Absence check using state equation in 1612 ms returned sat
[2024-05-31 01:49:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:49:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-31 01:49:55] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 79 ms returned sat
[2024-05-31 01:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:49:58] [INFO ] [Nat]Absence check using state equation in 3386 ms returned sat
[2024-05-31 01:49:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:50:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 01:50:04] [INFO ] [Nat]Added 120 Read/Feed constraints in 6018 ms returned unknown
Could not prove EG (NOT p2)
[2024-05-31 01:50:04] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:50:04] [INFO ] Invariant cache hit.
[2024-05-31 01:50:05] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-31 01:50:05] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 79 ms returned sat
[2024-05-31 01:50:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:50:07] [INFO ] [Real]Absence check using state equation in 1475 ms returned sat
[2024-05-31 01:50:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:50:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-31 01:50:07] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 68 ms returned sat
[2024-05-31 01:50:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:50:12] [INFO ] [Nat]Absence check using state equation in 4180 ms returned sat
[2024-05-31 01:50:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:50:14] [INFO ] [Nat]Added 120 Read/Feed constraints in 2506 ms returned sat
[2024-05-31 01:50:15] [INFO ] Deduced a trap composed of 125 places in 357 ms of which 1 ms to minimize.
[2024-05-31 01:50:15] [INFO ] Deduced a trap composed of 102 places in 344 ms of which 2 ms to minimize.
[2024-05-31 01:50:18] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 0 ms to minimize.
[2024-05-31 01:50:18] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 0 ms to minimize.
[2024-05-31 01:50:21] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 7258 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 2803 reset in 492 ms.
Product exploration explored 100000 steps with 2814 reset in 477 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 38 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1228/1228 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 596 transition count 1228
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 36 place count 596 transition count 1228
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 596 transition count 1228
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 584 transition count 1216
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 584 transition count 1216
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 168 place count 584 transition count 1216
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 189 place count 563 transition count 1195
Deduced a syphon composed of 114 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 210 place count 563 transition count 1195
Deduced a syphon composed of 114 places in 1 ms
Applied a total of 210 rules in 159 ms. Remains 563 /596 variables (removed 33) and now considering 1195/1228 (removed 33) transitions.
[2024-05-31 01:50:23] [INFO ] Flow matrix only has 1171 transitions (discarded 24 similar events)
// Phase 1: matrix 1171 rows 563 cols
[2024-05-31 01:50:23] [INFO ] Computed 44 invariants in 21 ms
[2024-05-31 01:50:24] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
[2024-05-31 01:50:24] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-31 01:50:24] [INFO ] Flow matrix only has 1171 transitions (discarded 24 similar events)
[2024-05-31 01:50:24] [INFO ] Invariant cache hit.
[2024-05-31 01:50:25] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 563/596 places, 1195/1228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2303 ms. Remains : 563/596 places, 1195/1228 transitions.
Built C files in :
/tmp/ltsmin17042225737534325013
[2024-05-31 01:50:25] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17042225737534325013
Running compilation step : cd /tmp/ltsmin17042225737534325013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2173 ms.
Running link step : cd /tmp/ltsmin17042225737534325013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin17042225737534325013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17655531278057448764.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 38 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1228/1228 transitions.
Applied a total of 0 rules in 29 ms. Remains 596 /596 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2024-05-31 01:50:41] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2024-05-31 01:50:41] [INFO ] Computed 44 invariants in 28 ms
[2024-05-31 01:50:42] [INFO ] Dead Transitions using invariants and state equation in 1072 ms found 0 transitions.
[2024-05-31 01:50:42] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:50:42] [INFO ] Invariant cache hit.
[2024-05-31 01:50:42] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-31 01:50:42] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:50:42] [INFO ] Invariant cache hit.
[2024-05-31 01:50:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:50:50] [INFO ] Implicit Places using invariants and state equation in 7446 ms returned []
Implicit Place search using SMT with State Equation took 7928 ms to find 0 implicit places.
[2024-05-31 01:50:50] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:50:50] [INFO ] Invariant cache hit.
[2024-05-31 01:50:51] [INFO ] Dead Transitions using invariants and state equation in 1296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10329 ms. Remains : 596/596 places, 1228/1228 transitions.
Built C files in :
/tmp/ltsmin16055811848749910949
[2024-05-31 01:50:51] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16055811848749910949
Running compilation step : cd /tmp/ltsmin16055811848749910949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2144 ms.
Running link step : cd /tmp/ltsmin16055811848749910949;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16055811848749910949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5850784948312358735.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 01:51:06] [INFO ] Flatten gal took : 60 ms
[2024-05-31 01:51:06] [INFO ] Flatten gal took : 53 ms
[2024-05-31 01:51:06] [INFO ] Time to serialize gal into /tmp/LTL14509323134019935807.gal : 13 ms
[2024-05-31 01:51:06] [INFO ] Time to serialize properties into /tmp/LTL18065570755498028301.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14509323134019935807.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12748391543546101624.hoa' '-atoms' '/tmp/LTL18065570755498028301.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18065570755498028301.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12748391543546101624.hoa
Detected timeout of ITS tools.
[2024-05-31 01:51:21] [INFO ] Flatten gal took : 74 ms
[2024-05-31 01:51:21] [INFO ] Flatten gal took : 56 ms
[2024-05-31 01:51:21] [INFO ] Time to serialize gal into /tmp/LTL647703591866253755.gal : 10 ms
[2024-05-31 01:51:21] [INFO ] Time to serialize properties into /tmp/LTL8400805114341678321.ltl : 6 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL647703591866253755.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8400805114341678321.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G((X((F("(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Sou...1990
Formula 0 simplified : F(X(G!"(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Source...1979
Detected timeout of ITS tools.
[2024-05-31 01:51:37] [INFO ] Flatten gal took : 36 ms
[2024-05-31 01:51:37] [INFO ] Applying decomposition
[2024-05-31 01:51:37] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7740345553056426060.txt' '-o' '/tmp/graph7740345553056426060.bin' '-w' '/tmp/graph7740345553056426060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7740345553056426060.bin' '-l' '-1' '-v' '-w' '/tmp/graph7740345553056426060.weights' '-q' '0' '-e' '0.001'
[2024-05-31 01:51:37] [INFO ] Decomposing Gal with order
[2024-05-31 01:51:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 01:51:37] [INFO ] Removed a total of 1191 redundant transitions.
[2024-05-31 01:51:37] [INFO ] Flatten gal took : 203 ms
[2024-05-31 01:51:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 32 ms.
[2024-05-31 01:51:37] [INFO ] Time to serialize gal into /tmp/LTL17028111525451793348.gal : 13 ms
[2024-05-31 01:51:37] [INFO ] Time to serialize properties into /tmp/LTL9127174762867512949.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17028111525451793348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9127174762867512949.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X((F("(((((((i4.i1.u25.NoSigAbort>=1)&&(i4.i1.u25.Abort_Check_Sources_B_3>=1))||((i4.i1.u25.NoSigAbort>=1)&&(i4.i1.u25.Abort_Che...2593
Formula 0 simplified : F(X(G!"(((((((i4.i1.u25.NoSigAbort>=1)&&(i4.i1.u25.Abort_Check_Sources_B_3>=1))||((i4.i1.u25.NoSigAbort>=1)&&(i4.i1.u25.Abort_Check_...2582
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5016866140977171724
[2024-05-31 01:51:52] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5016866140977171724
Running compilation step : cd /tmp/ltsmin5016866140977171724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2208 ms.
Running link step : cd /tmp/ltsmin5016866140977171724;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5016866140977171724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((<>((LTLAPp0==true)) U X((LTLAPp1==true))))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-05 finished in 203639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(!p1)) U (G((!p0&&X(!p1)))||(X(!p1)&&p2))))'
Support contains 90 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1230/1230 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1229
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1228
Applied a total of 4 rules in 38 ms. Remains 596 /598 variables (removed 2) and now considering 1228/1230 (removed 2) transitions.
[2024-05-31 01:52:07] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:52:07] [INFO ] Invariant cache hit.
[2024-05-31 01:52:08] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
[2024-05-31 01:52:08] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:52:08] [INFO ] Invariant cache hit.
[2024-05-31 01:52:09] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-31 01:52:09] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:52:09] [INFO ] Invariant cache hit.
[2024-05-31 01:52:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:52:16] [INFO ] Implicit Places using invariants and state equation in 6957 ms returned []
Implicit Place search using SMT with State Equation took 7472 ms to find 0 implicit places.
[2024-05-31 01:52:16] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:52:16] [INFO ] Invariant cache hit.
[2024-05-31 01:52:17] [INFO ] Dead Transitions using invariants and state equation in 1122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1228/1230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9795 ms. Remains : 596/598 places, 1228/1230 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR p1 (AND p0 (NOT p2))), true, p1]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}]], initial=0, aps=[p2:(AND (NOT (OR (GEQ s341 1) (GEQ s404 1) (GEQ s21 1) (GEQ s495 1) (GEQ s107 1) (GEQ s273 1))) (NOT (OR (AND (GEQ s330 1) (GEQ s382 1) (GEQ s558 1)) (AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1034 ms.
Product exploration explored 100000 steps with 50000 reset in 1046 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) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR p2 (NOT p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 22 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-06 finished in 12054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((p1&&G(F(p2)))))))'
Support contains 8 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1230/1230 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1229
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1228
Applied a total of 4 rules in 33 ms. Remains 596 /598 variables (removed 2) and now considering 1228/1230 (removed 2) transitions.
[2024-05-31 01:52:19] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:52:19] [INFO ] Invariant cache hit.
[2024-05-31 01:52:21] [INFO ] Dead Transitions using invariants and state equation in 1291 ms found 0 transitions.
[2024-05-31 01:52:21] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:52:21] [INFO ] Invariant cache hit.
[2024-05-31 01:52:21] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-31 01:52:21] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:52:21] [INFO ] Invariant cache hit.
[2024-05-31 01:52:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:52:32] [INFO ] Implicit Places using invariants and state equation in 10414 ms returned []
Implicit Place search using SMT with State Equation took 10897 ms to find 0 implicit places.
[2024-05-31 01:52:32] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:52:32] [INFO ] Invariant cache hit.
[2024-05-31 01:52:33] [INFO ] Dead Transitions using invariants and state equation in 1261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1228/1230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13484 ms. Remains : 596/598 places, 1228/1230 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s40 1) (GEQ s101 1) (GEQ s520 1)), p2:(AND (GEQ s372 1) (GEQ s547 1)), p1:(OR (LT s128 1) (LT s263 1) (LT s385 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14056 steps with 19 reset in 73 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-08 finished in 13935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 1230/1230 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 598 transition count 1188
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 556 transition count 1187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 555 transition count 1187
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 86 place count 555 transition count 1115
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 230 place count 483 transition count 1115
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 350 place count 423 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 353 place count 420 transition count 1052
Iterating global reduction 3 with 3 rules applied. Total rules applied 356 place count 420 transition count 1052
Applied a total of 356 rules in 91 ms. Remains 420 /598 variables (removed 178) and now considering 1052/1230 (removed 178) transitions.
[2024-05-31 01:52:33] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
// Phase 1: matrix 1028 rows 420 cols
[2024-05-31 01:52:33] [INFO ] Computed 44 invariants in 34 ms
[2024-05-31 01:52:34] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
[2024-05-31 01:52:34] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
[2024-05-31 01:52:34] [INFO ] Invariant cache hit.
[2024-05-31 01:52:35] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-31 01:52:35] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
[2024-05-31 01:52:35] [INFO ] Invariant cache hit.
[2024-05-31 01:52:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:52:46] [INFO ] Implicit Places using invariants and state equation in 10958 ms returned []
Implicit Place search using SMT with State Equation took 11500 ms to find 0 implicit places.
[2024-05-31 01:52:46] [INFO ] Redundant transitions in 47 ms returned []
[2024-05-31 01:52:46] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
[2024-05-31 01:52:46] [INFO ] Invariant cache hit.
[2024-05-31 01:52:47] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/598 places, 1052/1230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13294 ms. Remains : 420/598 places, 1052/1230 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s97 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9437 steps with 0 reset in 49 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-09 finished in 13396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p1&&G(p2)))))))'
Support contains 7 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1230/1230 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1229
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1228
Applied a total of 4 rules in 30 ms. Remains 596 /598 variables (removed 2) and now considering 1228/1230 (removed 2) transitions.
[2024-05-31 01:52:47] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2024-05-31 01:52:47] [INFO ] Computed 44 invariants in 52 ms
[2024-05-31 01:52:48] [INFO ] Dead Transitions using invariants and state equation in 1541 ms found 0 transitions.
[2024-05-31 01:52:48] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:52:48] [INFO ] Invariant cache hit.
[2024-05-31 01:52:49] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-05-31 01:52:49] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:52:49] [INFO ] Invariant cache hit.
[2024-05-31 01:52:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:52:57] [INFO ] Implicit Places using invariants and state equation in 8556 ms returned []
Implicit Place search using SMT with State Equation took 9079 ms to find 0 implicit places.
[2024-05-31 01:52:57] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:52:57] [INFO ] Invariant cache hit.
[2024-05-31 01:52:59] [INFO ] Dead Transitions using invariants and state equation in 1294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1228/1230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11946 ms. Remains : 596/598 places, 1228/1230 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s45 1) (GEQ s110 1) (GEQ s309 1)), p2:(AND (GEQ s441 1) (GEQ s491 1)), p1:(OR (AND (GEQ s329 1) (GEQ s569 1)) (AND (GEQ s441 1) (GEQ s491 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 23070 steps with 0 reset in 149 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-11 finished in 12297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(p1))))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1230/1230 transitions.
Applied a total of 0 rules in 11 ms. Remains 598 /598 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
[2024-05-31 01:52:59] [INFO ] Flow matrix only has 1206 transitions (discarded 24 similar events)
// Phase 1: matrix 1206 rows 598 cols
[2024-05-31 01:52:59] [INFO ] Computed 44 invariants in 45 ms
[2024-05-31 01:53:00] [INFO ] Dead Transitions using invariants and state equation in 1407 ms found 0 transitions.
[2024-05-31 01:53:00] [INFO ] Flow matrix only has 1206 transitions (discarded 24 similar events)
[2024-05-31 01:53:00] [INFO ] Invariant cache hit.
[2024-05-31 01:53:01] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-05-31 01:53:01] [INFO ] Flow matrix only has 1206 transitions (discarded 24 similar events)
[2024-05-31 01:53:01] [INFO ] Invariant cache hit.
[2024-05-31 01:53:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:53:17] [INFO ] Implicit Places using invariants and state equation in 15641 ms returned []
Implicit Place search using SMT with State Equation took 16268 ms to find 0 implicit places.
[2024-05-31 01:53:17] [INFO ] Flow matrix only has 1206 transitions (discarded 24 similar events)
[2024-05-31 01:53:17] [INFO ] Invariant cache hit.
[2024-05-31 01:53:18] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18808 ms. Remains : 598/598 places, 1230/1230 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s37 1) (GEQ s91 1)), p0:(LT s456 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1062 steps with 1 reset in 6 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-13 finished in 18957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1230/1230 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1229
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1228
Applied a total of 4 rules in 25 ms. Remains 596 /598 variables (removed 2) and now considering 1228/1230 (removed 2) transitions.
[2024-05-31 01:53:18] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2024-05-31 01:53:18] [INFO ] Computed 44 invariants in 39 ms
[2024-05-31 01:53:19] [INFO ] Dead Transitions using invariants and state equation in 1273 ms found 0 transitions.
[2024-05-31 01:53:19] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:53:19] [INFO ] Invariant cache hit.
[2024-05-31 01:53:20] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-31 01:53:20] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:53:20] [INFO ] Invariant cache hit.
[2024-05-31 01:53:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:53:29] [INFO ] Implicit Places using invariants and state equation in 8916 ms returned []
Implicit Place search using SMT with State Equation took 9430 ms to find 0 implicit places.
[2024-05-31 01:53:29] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-05-31 01:53:29] [INFO ] Invariant cache hit.
[2024-05-31 01:53:30] [INFO ] Dead Transitions using invariants and state equation in 1284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1228/1230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12014 ms. Remains : 596/598 places, 1228/1230 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s400 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 9385 steps with 42 reset in 35 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-15 finished in 12119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p0) U X(p1)))&&F(p2))))'
Found a Lengthening insensitive property : PolyORBLF-PT-S04J06T06-LTLFireability-05
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 38 out of 598 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 598/598 places, 1230/1230 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 598 transition count 1186
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 554 transition count 1186
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 88 place count 554 transition count 1138
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 184 place count 506 transition count 1138
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 292 place count 452 transition count 1084
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 295 place count 449 transition count 1081
Iterating global reduction 2 with 3 rules applied. Total rules applied 298 place count 449 transition count 1081
Applied a total of 298 rules in 54 ms. Remains 449 /598 variables (removed 149) and now considering 1081/1230 (removed 149) transitions.
[2024-05-31 01:53:31] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
// Phase 1: matrix 1057 rows 449 cols
[2024-05-31 01:53:31] [INFO ] Computed 44 invariants in 21 ms
[2024-05-31 01:53:31] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
[2024-05-31 01:53:31] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:53:31] [INFO ] Invariant cache hit.
[2024-05-31 01:53:32] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-31 01:53:32] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:53:32] [INFO ] Invariant cache hit.
[2024-05-31 01:53:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:53:49] [INFO ] Implicit Places using invariants and state equation in 17136 ms returned []
Implicit Place search using SMT with State Equation took 17572 ms to find 0 implicit places.
[2024-05-31 01:53:49] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:53:49] [INFO ] Invariant cache hit.
[2024-05-31 01:53:50] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 449/598 places, 1081/1230 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 19506 ms. Remains : 449/598 places, 1081/1230 transitions.
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s369 1) (GEQ s414 2)) (AND (GEQ s245 1) (GEQ s414 2)) (AND (GEQ s279 1) (GEQ s414 2)) (AND (GEQ s41 1) (GEQ s414 2)) (AND (GEQ s87 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3286 reset in 632 ms.
Product exploration explored 100000 steps with 3314 reset in 524 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 49 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-31 01:53:53] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:53:53] [INFO ] Invariant cache hit.
[2024-05-31 01:53:53] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2024-05-31 01:53:53] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 44 ms returned sat
[2024-05-31 01:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:53:55] [INFO ] [Real]Absence check using state equation in 1472 ms returned sat
[2024-05-31 01:53:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:53:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2024-05-31 01:53:55] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 63 ms returned sat
[2024-05-31 01:53:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:53:59] [INFO ] [Nat]Absence check using state equation in 4026 ms returned sat
[2024-05-31 01:53:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:54:02] [INFO ] [Nat]Added 120 Read/Feed constraints in 2189 ms returned sat
[2024-05-31 01:54:02] [INFO ] Deduced a trap composed of 57 places in 324 ms of which 1 ms to minimize.
[2024-05-31 01:54:05] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3367 ms
Could not prove EG (NOT p2)
[2024-05-31 01:54:05] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:54:05] [INFO ] Invariant cache hit.
[2024-05-31 01:54:05] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-31 01:54:05] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 41 ms returned sat
[2024-05-31 01:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:54:07] [INFO ] [Real]Absence check using state equation in 1213 ms returned sat
[2024-05-31 01:54:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:54:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 18 ms returned sat
[2024-05-31 01:54:07] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 50 ms returned sat
[2024-05-31 01:54:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:54:12] [INFO ] [Nat]Absence check using state equation in 4803 ms returned sat
[2024-05-31 01:54:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:54:13] [INFO ] [Nat]Added 120 Read/Feed constraints in 1024 ms returned sat
[2024-05-31 01:54:13] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 0 ms to minimize.
[2024-05-31 01:54:14] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 0 ms to minimize.
[2024-05-31 01:54:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 775 ms
[2024-05-31 01:54:14] [INFO ] Computed and/alt/rep : 795/4660/777 causal constraints (skipped 276 transitions) in 88 ms.
[2024-05-31 01:54:21] [INFO ] Added : 341 causal constraints over 69 iterations in 7709 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 38 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 1081/1081 transitions.
Applied a total of 0 rules in 12 ms. Remains 449 /449 variables (removed 0) and now considering 1081/1081 (removed 0) transitions.
[2024-05-31 01:54:21] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:54:21] [INFO ] Invariant cache hit.
[2024-05-31 01:54:22] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
[2024-05-31 01:54:22] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:54:22] [INFO ] Invariant cache hit.
[2024-05-31 01:54:23] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-31 01:54:23] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:54:23] [INFO ] Invariant cache hit.
[2024-05-31 01:54:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:54:37] [INFO ] Implicit Places using invariants and state equation in 14560 ms returned []
Implicit Place search using SMT with State Equation took 14977 ms to find 0 implicit places.
[2024-05-31 01:54:37] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:54:37] [INFO ] Invariant cache hit.
[2024-05-31 01:54:38] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16916 ms. Remains : 449/449 places, 1081/1081 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 71 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 202 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-31 01:54:39] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:54:39] [INFO ] Invariant cache hit.
[2024-05-31 01:54:40] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2024-05-31 01:54:40] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 74 ms returned sat
[2024-05-31 01:54:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:54:41] [INFO ] [Real]Absence check using state equation in 1397 ms returned sat
[2024-05-31 01:54:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:54:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-31 01:54:42] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 42 ms returned sat
[2024-05-31 01:54:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:54:46] [INFO ] [Nat]Absence check using state equation in 4151 ms returned sat
[2024-05-31 01:54:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:54:48] [INFO ] [Nat]Added 120 Read/Feed constraints in 2191 ms returned sat
[2024-05-31 01:54:49] [INFO ] Deduced a trap composed of 57 places in 301 ms of which 1 ms to minimize.
[2024-05-31 01:54:52] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3350 ms
Could not prove EG (NOT p2)
[2024-05-31 01:54:52] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:54:52] [INFO ] Invariant cache hit.
[2024-05-31 01:54:52] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2024-05-31 01:54:52] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 56 ms returned sat
[2024-05-31 01:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:54:54] [INFO ] [Real]Absence check using state equation in 1228 ms returned sat
[2024-05-31 01:54:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:54:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2024-05-31 01:54:54] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 66 ms returned sat
[2024-05-31 01:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:54:59] [INFO ] [Nat]Absence check using state equation in 4809 ms returned sat
[2024-05-31 01:54:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:55:00] [INFO ] [Nat]Added 120 Read/Feed constraints in 1020 ms returned sat
[2024-05-31 01:55:00] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 0 ms to minimize.
[2024-05-31 01:55:01] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 0 ms to minimize.
[2024-05-31 01:55:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 728 ms
[2024-05-31 01:55:01] [INFO ] Computed and/alt/rep : 795/4660/777 causal constraints (skipped 276 transitions) in 107 ms.
[2024-05-31 01:55:09] [INFO ] Deduced a trap composed of 2 places in 333 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 01:55:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 3312 reset in 625 ms.
Product exploration explored 100000 steps with 3257 reset in 533 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 38 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 1081/1081 transitions.
Applied a total of 0 rules in 34 ms. Remains 449 /449 variables (removed 0) and now considering 1081/1081 (removed 0) transitions.
[2024-05-31 01:55:11] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:55:11] [INFO ] Invariant cache hit.
[2024-05-31 01:55:12] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
[2024-05-31 01:55:12] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-31 01:55:12] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:55:12] [INFO ] Invariant cache hit.
[2024-05-31 01:55:13] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1700 ms. Remains : 449/449 places, 1081/1081 transitions.
Built C files in :
/tmp/ltsmin5354282329137257687
[2024-05-31 01:55:13] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5354282329137257687
Running compilation step : cd /tmp/ltsmin5354282329137257687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1908 ms.
Running link step : cd /tmp/ltsmin5354282329137257687;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin5354282329137257687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18034600463939495024.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 38 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 1081/1081 transitions.
Applied a total of 0 rules in 12 ms. Remains 449 /449 variables (removed 0) and now considering 1081/1081 (removed 0) transitions.
[2024-05-31 01:55:28] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:55:28] [INFO ] Invariant cache hit.
[2024-05-31 01:55:28] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
[2024-05-31 01:55:28] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:55:28] [INFO ] Invariant cache hit.
[2024-05-31 01:55:29] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-31 01:55:29] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:55:29] [INFO ] Invariant cache hit.
[2024-05-31 01:55:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:55:45] [INFO ] Implicit Places using invariants and state equation in 15609 ms returned []
Implicit Place search using SMT with State Equation took 16140 ms to find 0 implicit places.
[2024-05-31 01:55:45] [INFO ] Flow matrix only has 1057 transitions (discarded 24 similar events)
[2024-05-31 01:55:45] [INFO ] Invariant cache hit.
[2024-05-31 01:55:46] [INFO ] Dead Transitions using invariants and state equation in 937 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17828 ms. Remains : 449/449 places, 1081/1081 transitions.
Built C files in :
/tmp/ltsmin16664205659418384221
[2024-05-31 01:55:46] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16664205659418384221
Running compilation step : cd /tmp/ltsmin16664205659418384221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1953 ms.
Running link step : cd /tmp/ltsmin16664205659418384221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin16664205659418384221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16656798653152884934.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 01:56:01] [INFO ] Flatten gal took : 59 ms
[2024-05-31 01:56:01] [INFO ] Flatten gal took : 47 ms
[2024-05-31 01:56:01] [INFO ] Time to serialize gal into /tmp/LTL8040510827710472707.gal : 6 ms
[2024-05-31 01:56:01] [INFO ] Time to serialize properties into /tmp/LTL1092242693518651865.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8040510827710472707.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18051921471572709925.hoa' '-atoms' '/tmp/LTL1092242693518651865.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1092242693518651865.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18051921471572709925.hoa
Detected timeout of ITS tools.
[2024-05-31 01:56:16] [INFO ] Flatten gal took : 60 ms
[2024-05-31 01:56:16] [INFO ] Flatten gal took : 46 ms
[2024-05-31 01:56:16] [INFO ] Time to serialize gal into /tmp/LTL4232466915651785261.gal : 8 ms
[2024-05-31 01:56:16] [INFO ] Time to serialize properties into /tmp/LTL6339295628287852696.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4232466915651785261.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6339295628287852696.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X((F("(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Sou...1990
Formula 0 simplified : F(X(G!"(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Source...1979
Detected timeout of ITS tools.
[2024-05-31 01:56:31] [INFO ] Flatten gal took : 36 ms
[2024-05-31 01:56:31] [INFO ] Applying decomposition
[2024-05-31 01:56:31] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6683156496391624302.txt' '-o' '/tmp/graph6683156496391624302.bin' '-w' '/tmp/graph6683156496391624302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6683156496391624302.bin' '-l' '-1' '-v' '-w' '/tmp/graph6683156496391624302.weights' '-q' '0' '-e' '0.001'
[2024-05-31 01:56:31] [INFO ] Decomposing Gal with order
[2024-05-31 01:56:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 01:56:31] [INFO ] Removed a total of 975 redundant transitions.
[2024-05-31 01:56:32] [INFO ] Flatten gal took : 92 ms
[2024-05-31 01:56:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 8 ms.
[2024-05-31 01:56:32] [INFO ] Time to serialize gal into /tmp/LTL401984788337824992.gal : 8 ms
[2024-05-31 01:56:32] [INFO ] Time to serialize properties into /tmp/LTL4035578891746070158.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL401984788337824992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4035578891746070158.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G((X((F("(((((((i11.u56.NoSigAbort>=1)&&(i11.u56.Abort_Check_Sources_B_3>=1))||((i11.u56.NoSigAbort>=1)&&(i11.u56.Abort_Check_Sourc...2460
Formula 0 simplified : F(X(G!"(((((((i11.u56.NoSigAbort>=1)&&(i11.u56.Abort_Check_Sources_B_3>=1))||((i11.u56.NoSigAbort>=1)&&(i11.u56.Abort_Check_Sources_...2449
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12273650901968631081
[2024-05-31 01:56:47] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12273650901968631081
Running compilation step : cd /tmp/ltsmin12273650901968631081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2077 ms.
Running link step : cd /tmp/ltsmin12273650901968631081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin12273650901968631081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((<>((LTLAPp0==true)) U X((LTLAPp1==true))))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-05 finished in 211660 ms.
[2024-05-31 01:57:02] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6078963818849118921
[2024-05-31 01:57:02] [INFO ] Computing symmetric may disable matrix : 1230 transitions.
[2024-05-31 01:57:02] [INFO ] Applying decomposition
[2024-05-31 01:57:02] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 01:57:02] [INFO ] Computing symmetric may enable matrix : 1230 transitions.
[2024-05-31 01:57:02] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 01:57:02] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16282054261780698065.txt' '-o' '/tmp/graph16282054261780698065.bin' '-w' '/tmp/graph16282054261780698065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16282054261780698065.bin' '-l' '-1' '-v' '-w' '/tmp/graph16282054261780698065.weights' '-q' '0' '-e' '0.001'
[2024-05-31 01:57:02] [INFO ] Decomposing Gal with order
[2024-05-31 01:57:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 01:57:02] [INFO ] Computing Do-Not-Accords matrix : 1230 transitions.
[2024-05-31 01:57:02] [INFO ] Removed a total of 1160 redundant transitions.
[2024-05-31 01:57:02] [INFO ] Flatten gal took : 77 ms
[2024-05-31 01:57:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 13 ms.
[2024-05-31 01:57:02] [INFO ] Computation of Completed DNA matrix. took 78 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 01:57:02] [INFO ] Time to serialize gal into /tmp/LTLFireability15337047169835365739.gal : 9 ms
[2024-05-31 01:57:02] [INFO ] Time to serialize properties into /tmp/LTLFireability11955565898853807954.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15337047169835365739.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11955565898853807954.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
[2024-05-31 01:57:02] [INFO ] Built C files in 440ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6078963818849118921
Running compilation step : cd /tmp/ltsmin6078963818849118921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((G((X((F("(((((((i6.i3.u61.NoSigAbort>=1)&&(i6.i3.u61.Abort_Check_Sources_B_3>=1))||((i6.i3.u61.NoSigAbort>=1)&&(i6.i3.u61.Abort_Che...2592
Formula 0 simplified : F(X(G!"(((((((i6.i3.u61.NoSigAbort>=1)&&(i6.i3.u61.Abort_Check_Sources_B_3>=1))||((i6.i3.u61.NoSigAbort>=1)&&(i6.i3.u61.Abort_Check_...2581
Compilation finished in 4188 ms.
Running link step : cd /tmp/ltsmin6078963818849118921;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 100 ms.
Running LTSmin : cd /tmp/ltsmin6078963818849118921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((<>((LTLAPp0==true)) U X((LTLAPp1==true))))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.228: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.228: LTL layer: formula: []((X((<>((LTLAPp0==true)) U X((LTLAPp1==true))))&&<>((LTLAPp2==true))))
pins2lts-mc-linux64( 4/ 8), 0.228: "[]((X((<>((LTLAPp0==true)) U X((LTLAPp1==true))))&&<>((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.229: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.253: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.253: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.253: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.256: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.262: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.273: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.273: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.276: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.525: DFS-FIFO for weak LTL, using special progress label 1234
pins2lts-mc-linux64( 0/ 8), 0.525: There are 1235 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.525: State length is 599, there are 1240 groups
pins2lts-mc-linux64( 0/ 8), 0.525: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.525: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.525: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.525: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.569: ~22 levels ~960 states ~2080 transitions
pins2lts-mc-linux64( 0/ 8), 0.595: ~22 levels ~1920 states ~3616 transitions
pins2lts-mc-linux64( 0/ 8), 0.647: ~22 levels ~3840 states ~7096 transitions
pins2lts-mc-linux64( 0/ 8), 0.845: ~22 levels ~7680 states ~14008 transitions
pins2lts-mc-linux64( 0/ 8), 1.106: ~22 levels ~15360 states ~30672 transitions
pins2lts-mc-linux64( 0/ 8), 1.647: ~22 levels ~30720 states ~55352 transitions
pins2lts-mc-linux64( 0/ 8), 2.711: ~22 levels ~61440 states ~113488 transitions
pins2lts-mc-linux64( 0/ 8), 4.793: ~22 levels ~122880 states ~224904 transitions
pins2lts-mc-linux64( 2/ 8), 9.015: ~83 levels ~245760 states ~430824 transitions
pins2lts-mc-linux64( 4/ 8), 16.529: ~26 levels ~491520 states ~1033216 transitions
pins2lts-mc-linux64( 5/ 8), 30.980: ~71 levels ~983040 states ~1780992 transitions
pins2lts-mc-linux64( 5/ 8), 59.492: ~71 levels ~1966080 states ~3688672 transitions
pins2lts-mc-linux64( 5/ 8), 117.419: ~83 levels ~3932160 states ~7988488 transitions
pins2lts-mc-linux64( 5/ 8), 240.665: ~83 levels ~7864320 states ~17038352 transitions
pins2lts-mc-linux64( 5/ 8), 474.039: ~83 levels ~15728640 states ~35715968 transitions
pins2lts-mc-linux64( 5/ 8), 938.259: ~83 levels ~31457280 states ~73462448 transitions
pins2lts-mc-linux64( 5/ 8), 1100.709: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1100.775:
pins2lts-mc-linux64( 0/ 8), 1100.775: mean standard work distribution: 0.2% (states) 0.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 1100.775:
pins2lts-mc-linux64( 0/ 8), 1100.775: Explored 36583162 states 86758651 transitions, fanout: 2.372
pins2lts-mc-linux64( 0/ 8), 1100.775: Total exploration time 1100.240 sec (1100.170 sec minimum, 1100.199 sec on average)
pins2lts-mc-linux64( 0/ 8), 1100.775: States per second: 33250, Transitions per second: 78854
pins2lts-mc-linux64( 0/ 8), 1100.775:
pins2lts-mc-linux64( 0/ 8), 1100.775: Progress states detected: 8
pins2lts-mc-linux64( 0/ 8), 1100.775: Redundant explorations: 0.0136
pins2lts-mc-linux64( 0/ 8), 1100.775:
pins2lts-mc-linux64( 0/ 8), 1100.775: Queue width: 8B, total height: 680, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1100.775: Tree memory: 535.1MB, 15.3 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1100.775: Tree fill ratio (roots/leafs): 27.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1100.775: Stored 1537 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1100.775: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1100.775: Est. total memory use: 535.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6078963818849118921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((<>((LTLAPp0==true)) U X((LTLAPp1==true))))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6078963818849118921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((<>((LTLAPp0==true)) U X((LTLAPp1==true))))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 02:19:58] [INFO ] Flatten gal took : 118 ms
[2024-05-31 02:19:58] [INFO ] Time to serialize gal into /tmp/LTLFireability13118710346021711469.gal : 66 ms
[2024-05-31 02:19:58] [INFO ] Time to serialize properties into /tmp/LTLFireability12533523502250540502.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13118710346021711469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12533523502250540502.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G((X((F("(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Sou...1990
Formula 0 simplified : F(X(G!"(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Source...1979
Detected timeout of ITS tools.
[2024-05-31 02:42:57] [INFO ] Flatten gal took : 472 ms
[2024-05-31 02:42:58] [INFO ] Input system was already deterministic with 1230 transitions.
[2024-05-31 02:42:59] [INFO ] Transformed 598 places.
[2024-05-31 02:42:59] [INFO ] Transformed 1230 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 02:43:29] [INFO ] Time to serialize gal into /tmp/LTLFireability5026820152835999328.gal : 22 ms
[2024-05-31 02:43:29] [INFO ] Time to serialize properties into /tmp/LTLFireability9151989993515101254.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5026820152835999328.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9151989993515101254.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((X((F("(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Sou...1990
Formula 0 simplified : F(X(G!"(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Source...1979
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10691356 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16164236 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J06T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is PolyORBLF-PT-S04J06T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tajo-171654460600183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T06.tgz
mv PolyORBLF-PT-S04J06T06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;