Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422000112.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PermAdmissibility-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422000112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 9.9K Apr 12 09:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 09:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 68K Apr 12 09:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 361K Apr 12 09:16 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 5.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 09:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Apr 12 09:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 80K Apr 12 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 401K Apr 12 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 340K 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 PermAdmissibility-PT-10-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716863026736

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:23:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:23:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:23:50] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-05-28 02:23:50] [INFO ] Transformed 168 places.
[2024-05-28 02:23:50] [INFO ] Transformed 592 transitions.
[2024-05-28 02:23:50] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA PermAdmissibility-PT-10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 153 transition count 592
Applied a total of 15 rules in 35 ms. Remains 153 /168 variables (removed 15) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 153 cols
[2024-05-28 02:23:51] [INFO ] Computed 22 invariants in 43 ms
[2024-05-28 02:23:51] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-05-28 02:23:51] [INFO ] Invariant cache hit.
[2024-05-28 02:23:52] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2024-05-28 02:23:52] [INFO ] Invariant cache hit.
[2024-05-28 02:23:52] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1905 ms. Remains : 153/168 places, 592/592 transitions.
Support contains 88 out of 153 places after structural reductions.
[2024-05-28 02:23:53] [INFO ] Flatten gal took : 212 ms
[2024-05-28 02:23:53] [INFO ] Flatten gal took : 120 ms
[2024-05-28 02:23:53] [INFO ] Input system was already deterministic with 592 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:23:53] [INFO ] Invariant cache hit.
[2024-05-28 02:23:54] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:23:54] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 10 ms returned sat
[2024-05-28 02:23:54] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 153 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 153 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA PermAdmissibility-PT-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(F(p0)))'
Support contains 9 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 104 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.6 ms
Discarding 49 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 84 transition count 356
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 84 transition count 356
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 55 place count 70 transition count 230
Iterating global reduction 0 with 14 rules applied. Total rules applied 69 place count 70 transition count 230
Applied a total of 69 rules in 54 ms. Remains 70 /153 variables (removed 83) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 70 cols
[2024-05-28 02:23:54] [INFO ] Computed 16 invariants in 7 ms
[2024-05-28 02:23:54] [INFO ] Implicit Places using invariants in 116 ms returned [0, 11, 25, 36]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 118 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/153 places, 230/592 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 65 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 65 transition count 228
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 64 transition count 228
Applied a total of 4 rules in 30 ms. Remains 64 /66 variables (removed 2) and now considering 228/230 (removed 2) transitions.
// Phase 1: matrix 228 rows 64 cols
[2024-05-28 02:23:54] [INFO ] Computed 12 invariants in 2 ms
[2024-05-28 02:23:54] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-28 02:23:54] [INFO ] Invariant cache hit.
[2024-05-28 02:23:55] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/153 places, 228/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 639 ms. Remains : 64/153 places, 228/592 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 468 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s8) s60)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 770 reset in 920 ms.
Product exploration explored 100000 steps with 765 reset in 644 ms.
Computed a total of 64 stabilizing places and 228 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 228
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 100 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 9 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 228/228 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-05-28 02:23:57] [INFO ] Invariant cache hit.
[2024-05-28 02:23:57] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-28 02:23:57] [INFO ] Invariant cache hit.
[2024-05-28 02:23:58] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-28 02:23:58] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 02:23:58] [INFO ] Invariant cache hit.
[2024-05-28 02:23:58] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 594 ms. Remains : 64/64 places, 228/228 transitions.
Computed a total of 64 stabilizing places and 228 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 228
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Finished random walk after 100 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 757 reset in 499 ms.
Product exploration explored 100000 steps with 756 reset in 760 ms.
Built C files in :
/tmp/ltsmin15715494295343020149
[2024-05-28 02:24:00] [INFO ] Computing symmetric may disable matrix : 228 transitions.
[2024-05-28 02:24:00] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:24:00] [INFO ] Computing symmetric may enable matrix : 228 transitions.
[2024-05-28 02:24:00] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:24:00] [INFO ] Computing Do-Not-Accords matrix : 228 transitions.
[2024-05-28 02:24:00] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:24:00] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15715494295343020149
Running compilation step : cd /tmp/ltsmin15715494295343020149;'/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 1271 ms.
Running link step : cd /tmp/ltsmin15715494295343020149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin15715494295343020149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1087988952102578711.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 228/228 transitions.
Applied a total of 0 rules in 12 ms. Remains 64 /64 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-05-28 02:24:15] [INFO ] Invariant cache hit.
[2024-05-28 02:24:15] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 02:24:15] [INFO ] Invariant cache hit.
[2024-05-28 02:24:16] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-28 02:24:16] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 02:24:16] [INFO ] Invariant cache hit.
[2024-05-28 02:24:16] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 484 ms. Remains : 64/64 places, 228/228 transitions.
Built C files in :
/tmp/ltsmin1254713454188975820
[2024-05-28 02:24:16] [INFO ] Computing symmetric may disable matrix : 228 transitions.
[2024-05-28 02:24:16] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:24:16] [INFO ] Computing symmetric may enable matrix : 228 transitions.
[2024-05-28 02:24:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:24:16] [INFO ] Computing Do-Not-Accords matrix : 228 transitions.
[2024-05-28 02:24:16] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:24:16] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1254713454188975820
Running compilation step : cd /tmp/ltsmin1254713454188975820;'/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 1094 ms.
Running link step : cd /tmp/ltsmin1254713454188975820;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1254713454188975820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14713823778247715983.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:24:31] [INFO ] Flatten gal took : 21 ms
[2024-05-28 02:24:31] [INFO ] Flatten gal took : 20 ms
[2024-05-28 02:24:31] [INFO ] Time to serialize gal into /tmp/LTL12827561800950190176.gal : 5 ms
[2024-05-28 02:24:31] [INFO ] Time to serialize properties into /tmp/LTL13671350691740242303.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12827561800950190176.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10635385863778503708.hoa' '-atoms' '/tmp/LTL13671350691740242303.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/LTL13671350691740242303.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10635385863778503708.hoa
Detected timeout of ITS tools.
[2024-05-28 02:24:46] [INFO ] Flatten gal took : 21 ms
[2024-05-28 02:24:46] [INFO ] Flatten gal took : 27 ms
[2024-05-28 02:24:46] [INFO ] Time to serialize gal into /tmp/LTL15715909721948399795.gal : 3 ms
[2024-05-28 02:24:46] [INFO ] Time to serialize properties into /tmp/LTL17141445963883407308.ltl : 3 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/LTL15715909721948399795.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17141445963883407308.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((((aux14_0+aux14_1)+(aux14_2+aux14_3))+((aux14_4+aux14_6)+(aux14_5+aux14_7)))<=c5)"))))
Formula 0 simplified : FG!"((((aux14_0+aux14_1)+(aux14_2+aux14_3))+((aux14_4+aux14_6)+(aux14_5+aux14_7)))<=c5)"
Detected timeout of ITS tools.
[2024-05-28 02:25:01] [INFO ] Flatten gal took : 16 ms
[2024-05-28 02:25:01] [INFO ] Applying decomposition
[2024-05-28 02:25:01] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4318084130858535948.txt' '-o' '/tmp/graph4318084130858535948.bin' '-w' '/tmp/graph4318084130858535948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4318084130858535948.bin' '-l' '-1' '-v' '-w' '/tmp/graph4318084130858535948.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:25:01] [INFO ] Decomposing Gal with order
[2024-05-28 02:25:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:25:02] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-28 02:25:02] [INFO ] Flatten gal took : 148 ms
[2024-05-28 02:25:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 20 ms.
[2024-05-28 02:25:02] [INFO ] Time to serialize gal into /tmp/LTL353971869475038974.gal : 7 ms
[2024-05-28 02:25:02] [INFO ] Time to serialize properties into /tmp/LTL9464546656060313356.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/LTL353971869475038974.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9464546656060313356.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(F("((((gu3.aux14_0+gu3.aux14_1)+(gu3.aux14_2+gu3.aux14_3))+((gu3.aux14_4+gu3.aux14_6)+(gu3.aux14_5+gu3.aux14_7)))<=gu3.c5)"))))
Formula 0 simplified : FG!"((((gu3.aux14_0+gu3.aux14_1)+(gu3.aux14_2+gu3.aux14_3))+((gu3.aux14_4+gu3.aux14_6)+(gu3.aux14_5+gu3.aux14_7)))<=gu3.c5)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1654706319589901253
[2024-05-28 02:25:17] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1654706319589901253
Running compilation step : cd /tmp/ltsmin1654706319589901253;'/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 664 ms.
Running link step : cd /tmp/ltsmin1654706319589901253;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1654706319589901253;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-10-LTLCardinality-01 finished in 97998 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)||p1))&&(!X(p2) U p1)))'
Support contains 25 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 112 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 61 place count 92 transition count 356
Iterating global reduction 1 with 20 rules applied. Total rules applied 81 place count 92 transition count 356
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 88 place count 85 transition count 244
Iterating global reduction 1 with 7 rules applied. Total rules applied 95 place count 85 transition count 244
Applied a total of 95 rules in 20 ms. Remains 85 /153 variables (removed 68) and now considering 244/592 (removed 348) transitions.
// Phase 1: matrix 244 rows 85 cols
[2024-05-28 02:25:32] [INFO ] Computed 17 invariants in 3 ms
[2024-05-28 02:25:32] [INFO ] Implicit Places using invariants in 166 ms returned [0, 19, 51]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 167 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/153 places, 244/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 82/153 places, 244/592 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p2), (NOT p0), true]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT (ADD s9 s10 s11 s12 s13 s14 s15 s16) (ADD s74 s75)), p0:(GT (ADD s31 s32 s33 s34 s35 s36 s37 s46) (ADD s62 s63)), p2:(LEQ (ADD s47 s48 s56 s57) s73...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-04 finished in 433 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 U (F(G(p1))&&(p2 U p3)))))'
Support contains 33 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 128 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.4 ms
Discarding 25 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 121 transition count 480
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 121 transition count 480
Applied a total of 15 rules in 35 ms. Remains 121 /153 variables (removed 32) and now considering 480/592 (removed 112) transitions.
// Phase 1: matrix 480 rows 121 cols
[2024-05-28 02:25:32] [INFO ] Computed 19 invariants in 9 ms
[2024-05-28 02:25:33] [INFO ] Implicit Places using invariants in 217 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 221 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/153 places, 480/592 transitions.
Applied a total of 0 rules in 17 ms. Remains 120 /120 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 273 ms. Remains : 120/153 places, 480/592 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p3) (NOT p1)), true, (NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(OR p3 p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(OR p3 p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(GT 2 (ADD s43 s44 s45 s46 s48 s49 s50 s51)), p2:(LEQ s115 (ADD s8 s9 s10 s11 s12 s13 s14 s16)), p0:(LEQ 3 (ADD s17 s18 s19 s20 s21 s22 s23 s24)), p1:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 621 reset in 859 ms.
Product exploration explored 100000 steps with 621 reset in 885 ms.
Computed a total of 120 stabilizing places and 480 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 120 transition count 480
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p3 p2 (NOT p0) (NOT p1)), (X (OR p3 p2 p0)), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT p1)), (X (NOT (AND (NOT p3) p2))), (X (OR p3 p2)), (X (X (OR p3 p2 p0))), true, (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR p3 p2))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 6266 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 6 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p3) (NOT p1)), true, (NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10007 steps, including 56 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 10) seen :5
Finished Best-First random walk after 2610 steps, including 0 resets, run visited all 5 properties in 26 ms. (steps per millisecond=100 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 p2 (NOT p0) (NOT p1)), (X (OR p3 p2 p0)), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT p1)), (X (NOT (AND (NOT p3) p2))), (X (OR p3 p2)), (X (X (OR p3 p2 p0))), true, (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR p3 p2))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p0) p2 (NOT p3))), (F p1), (F (AND p0 p2 (NOT p3))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1))))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p2) (NOT p3))), (F (NOT (OR p2 p3)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2 p3)))
Knowledge based reduction with 26 factoid took 8389 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-10-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-10-LTLCardinality-06 finished in 17680 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(G(p1))))'
Support contains 17 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 120 transition count 592
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 45 place count 108 transition count 400
Iterating global reduction 1 with 12 rules applied. Total rules applied 57 place count 108 transition count 400
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 67 place count 98 transition count 290
Iterating global reduction 1 with 10 rules applied. Total rules applied 77 place count 98 transition count 290
Applied a total of 77 rules in 12 ms. Remains 98 /153 variables (removed 55) and now considering 290/592 (removed 302) transitions.
// Phase 1: matrix 290 rows 98 cols
[2024-05-28 02:25:50] [INFO ] Computed 18 invariants in 3 ms
[2024-05-28 02:25:50] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-28 02:25:50] [INFO ] Invariant cache hit.
[2024-05-28 02:25:51] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-05-28 02:25:51] [INFO ] Invariant cache hit.
[2024-05-28 02:25:51] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/153 places, 290/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 851 ms. Remains : 98/153 places, 290/592 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 2 (ADD s11 s12 s14 s15 s16 s17 s18 s19)), p1:(GT s64 (ADD s31 s33 s34 s35 s36 s37 s38 s39))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-07 finished in 1083 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 U p1))||G(p2))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 104 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.3 ms
Discarding 49 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 79 transition count 348
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 79 transition count 348
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 73 place count 57 transition count 118
Iterating global reduction 0 with 22 rules applied. Total rules applied 95 place count 57 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 55 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 55 transition count 102
Applied a total of 99 rules in 22 ms. Remains 55 /153 variables (removed 98) and now considering 102/592 (removed 490) transitions.
// Phase 1: matrix 102 rows 55 cols
[2024-05-28 02:25:51] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 02:25:51] [INFO ] Implicit Places using invariants in 120 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/153 places, 102/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 54/153 places, 102/592 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 1 s1), p1:(LEQ 1 s14), p0:(LEQ s45 s38)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 523 steps with 37 reset in 4 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-09 finished in 302 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(p0)||G(p1)))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 105 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.4 ms
Discarding 48 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 80 transition count 346
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 80 transition count 346
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 73 place count 58 transition count 124
Iterating global reduction 0 with 22 rules applied. Total rules applied 95 place count 58 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 56 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 56 transition count 108
Applied a total of 99 rules in 30 ms. Remains 56 /153 variables (removed 97) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 56 cols
[2024-05-28 02:25:51] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 02:25:52] [INFO ] Implicit Places using invariants in 112 ms returned [0, 7, 20, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 114 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/153 places, 108/592 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 51 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 50 transition count 106
Applied a total of 4 rules in 10 ms. Remains 50 /52 variables (removed 2) and now considering 106/108 (removed 2) transitions.
// Phase 1: matrix 106 rows 50 cols
[2024-05-28 02:25:52] [INFO ] Computed 12 invariants in 1 ms
[2024-05-28 02:25:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 02:25:52] [INFO ] Invariant cache hit.
[2024-05-28 02:25:52] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/153 places, 106/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 460 ms. Remains : 50/153 places, 106/592 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 3 s4), p1:(LEQ s28 s46)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 272 steps with 1 reset in 2 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-10 finished in 590 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 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 50 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.2 ms
Discarding 103 places :
Also discarding 384 output transitions
Drop transitions removed 384 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 37 transition count 84
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 37 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 33 place count 31 transition count 46
Iterating global reduction 0 with 6 rules applied. Total rules applied 39 place count 31 transition count 46
Applied a total of 39 rules in 15 ms. Remains 31 /153 variables (removed 122) and now considering 46/592 (removed 546) transitions.
// Phase 1: matrix 46 rows 31 cols
[2024-05-28 02:25:52] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 02:25:52] [INFO ] Implicit Places using invariants in 84 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/153 places, 46/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 30/153 places, 46/592 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s20 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 990 reset in 459 ms.
Product exploration explored 100000 steps with 990 reset in 312 ms.
Computed a total of 30 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 46
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 30 cols
[2024-05-28 02:25:53] [INFO ] Computed 9 invariants in 0 ms
[2024-05-28 02:25:53] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 02:25:53] [INFO ] Invariant cache hit.
[2024-05-28 02:25:54] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-28 02:25:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 02:25:54] [INFO ] Invariant cache hit.
[2024-05-28 02:25:54] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 30/30 places, 46/46 transitions.
Computed a total of 30 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 46
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 499 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=249 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 990 reset in 443 ms.
Product exploration explored 100000 steps with 990 reset in 467 ms.
Built C files in :
/tmp/ltsmin10560167987551219942
[2024-05-28 02:25:55] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2024-05-28 02:25:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:25:55] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2024-05-28 02:25:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:25:55] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2024-05-28 02:25:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:25:55] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10560167987551219942
Running compilation step : cd /tmp/ltsmin10560167987551219942;'/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 187 ms.
Running link step : cd /tmp/ltsmin10560167987551219942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10560167987551219942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17011177143605154099.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2024-05-28 02:26:10] [INFO ] Invariant cache hit.
[2024-05-28 02:26:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-28 02:26:10] [INFO ] Invariant cache hit.
[2024-05-28 02:26:10] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-28 02:26:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:26:10] [INFO ] Invariant cache hit.
[2024-05-28 02:26:10] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 30/30 places, 46/46 transitions.
Built C files in :
/tmp/ltsmin7978144584453109053
[2024-05-28 02:26:11] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2024-05-28 02:26:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:26:11] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2024-05-28 02:26:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:26:11] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2024-05-28 02:26:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:26:11] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7978144584453109053
Running compilation step : cd /tmp/ltsmin7978144584453109053;'/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 199 ms.
Running link step : cd /tmp/ltsmin7978144584453109053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7978144584453109053;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1221026233090991304.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:26:26] [INFO ] Flatten gal took : 15 ms
[2024-05-28 02:26:26] [INFO ] Flatten gal took : 4 ms
[2024-05-28 02:26:26] [INFO ] Time to serialize gal into /tmp/LTL13160947661903121227.gal : 1 ms
[2024-05-28 02:26:26] [INFO ] Time to serialize properties into /tmp/LTL2090004059668304375.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13160947661903121227.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17916680379856172974.hoa' '-atoms' '/tmp/LTL2090004059668304375.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...319
Loading property file /tmp/LTL2090004059668304375.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17916680379856172974.hoa
Detected timeout of ITS tools.
[2024-05-28 02:26:41] [INFO ] Flatten gal took : 4 ms
[2024-05-28 02:26:41] [INFO ] Flatten gal took : 4 ms
[2024-05-28 02:26:41] [INFO ] Time to serialize gal into /tmp/LTL1676867171980114326.gal : 1 ms
[2024-05-28 02:26:41] [INFO ] Time to serialize properties into /tmp/LTL4205557605147696005.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/LTL1676867171980114326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4205557605147696005.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 : !((F(G("(aux9_0<=c9)"))))
Formula 0 simplified : GF!"(aux9_0<=c9)"
Detected timeout of ITS tools.
[2024-05-28 02:26:56] [INFO ] Flatten gal took : 5 ms
[2024-05-28 02:26:56] [INFO ] Applying decomposition
[2024-05-28 02:26:56] [INFO ] Flatten gal took : 4 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/graph4553810972558434609.txt' '-o' '/tmp/graph4553810972558434609.bin' '-w' '/tmp/graph4553810972558434609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4553810972558434609.bin' '-l' '-1' '-v' '-w' '/tmp/graph4553810972558434609.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:26:56] [INFO ] Decomposing Gal with order
[2024-05-28 02:26:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:26:56] [INFO ] Removed a total of 6 redundant transitions.
[2024-05-28 02:26:56] [INFO ] Flatten gal took : 6 ms
[2024-05-28 02:26:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 1 ms.
[2024-05-28 02:26:56] [INFO ] Time to serialize gal into /tmp/LTL7891315177970184382.gal : 1 ms
[2024-05-28 02:26:56] [INFO ] Time to serialize properties into /tmp/LTL9144984063100202182.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7891315177970184382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9144984063100202182.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 : !((F(G("(gu1.aux9_0<=gu1.c9)"))))
Formula 0 simplified : GF!"(gu1.aux9_0<=gu1.c9)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12980727149043818943
[2024-05-28 02:27:11] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12980727149043818943
Running compilation step : cd /tmp/ltsmin12980727149043818943;'/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 267 ms.
Running link step : cd /tmp/ltsmin12980727149043818943;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12980727149043818943;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-10-LTLCardinality-12 finished in 93997 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((p0 U (p1||G(p0)))))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 106 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.2 ms
Discarding 47 places :
Also discarding 0 output transitions
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 84 transition count 360
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 84 transition count 360
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 61 place count 68 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 77 place count 68 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 78 place count 67 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 79 place count 67 transition count 164
Applied a total of 79 rules in 19 ms. Remains 67 /153 variables (removed 86) and now considering 164/592 (removed 428) transitions.
// Phase 1: matrix 164 rows 67 cols
[2024-05-28 02:27:26] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 02:27:26] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-28 02:27:26] [INFO ] Invariant cache hit.
[2024-05-28 02:27:26] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-28 02:27:26] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 02:27:26] [INFO ] Invariant cache hit.
[2024-05-28 02:27:27] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/153 places, 164/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 510 ms. Remains : 67/153 places, 164/592 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GT s9 s3) (LEQ s7 s57) (LEQ s14 s15)), p0:(AND (LEQ s7 s57) (LEQ s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 239 steps with 2 reset in 2 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-13 finished in 579 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 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 105 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 80 transition count 348
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 80 transition count 348
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 72 place count 59 transition count 122
Iterating global reduction 0 with 21 rules applied. Total rules applied 93 place count 59 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 57 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 57 transition count 106
Applied a total of 97 rules in 19 ms. Remains 57 /153 variables (removed 96) and now considering 106/592 (removed 486) transitions.
// Phase 1: matrix 106 rows 57 cols
[2024-05-28 02:27:27] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 02:27:27] [INFO ] Implicit Places using invariants in 94 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/153 places, 106/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 56/153 places, 106/592 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s5 s26)], 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 321 steps with 1 reset in 2 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-15 finished in 186 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(F(p0)))'
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)))'
[2024-05-28 02:27:27] [INFO ] Flatten gal took : 58 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9496266683602044685
[2024-05-28 02:27:27] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2024-05-28 02:27:27] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:27:27] [INFO ] Applying decomposition
[2024-05-28 02:27:27] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2024-05-28 02:27:27] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:27:27] [INFO ] Flatten gal took : 67 ms
[2024-05-28 02:27:27] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
[2024-05-28 02:27:27] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:27:27] [INFO ] Built C files in 219ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9496266683602044685
Running compilation step : cd /tmp/ltsmin9496266683602044685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
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/graph4440810666317388568.txt' '-o' '/tmp/graph4440810666317388568.bin' '-w' '/tmp/graph4440810666317388568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4440810666317388568.bin' '-l' '-1' '-v' '-w' '/tmp/graph4440810666317388568.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:27:27] [INFO ] Decomposing Gal with order
[2024-05-28 02:27:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:27:28] [INFO ] Removed a total of 562 redundant transitions.
[2024-05-28 02:27:28] [INFO ] Flatten gal took : 217 ms
[2024-05-28 02:27:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 573 labels/synchronizations in 38 ms.
[2024-05-28 02:27:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality3955635639585537852.gal : 23 ms
[2024-05-28 02:27:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality15625281231916941799.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/LTLCardinality3955635639585537852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15625281231916941799.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...298
Read 2 LTL properties
Checking formula 0 : !((G(F("((((gu6.aux14_0+gu6.aux14_1)+(gu6.aux14_2+gu6.aux14_3))+((gu6.aux14_4+gu6.aux14_6)+(gu6.aux14_5+gu6.aux14_7)))<=gu6.c5)"))))
Formula 0 simplified : FG!"((((gu6.aux14_0+gu6.aux14_1)+(gu6.aux14_2+gu6.aux14_3))+((gu6.aux14_4+gu6.aux14_6)+(gu6.aux14_5+gu6.aux14_7)))<=gu6.c5)"
Compilation finished in 2596 ms.
Running link step : cd /tmp/ltsmin9496266683602044685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9496266683602044685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 02:48:41] [INFO ] Flatten gal took : 106 ms
[2024-05-28 02:48:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality7326509685107440233.gal : 17 ms
[2024-05-28 02:48:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality13587104713748403004.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7326509685107440233.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13587104713748403004.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...298
Read 2 LTL properties
Checking formula 0 : !((G(F("((((aux14_0+aux14_1)+(aux14_2+aux14_3))+((aux14_4+aux14_6)+(aux14_5+aux14_7)))<=c5)"))))
Formula 0 simplified : FG!"((((aux14_0+aux14_1)+(aux14_2+aux14_3))+((aux14_4+aux14_6)+(aux14_5+aux14_7)))<=c5)"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin9496266683602044685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9496266683602044685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 03:09:55] [INFO ] Flatten gal took : 101 ms
[2024-05-28 03:09:55] [INFO ] Input system was already deterministic with 592 transitions.
[2024-05-28 03:09:55] [INFO ] Transformed 153 places.
[2024-05-28 03:09:55] [INFO ] Transformed 592 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-28 03:10:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality1247538564801388196.gal : 18 ms
[2024-05-28 03:10:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality18042721152601883948.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1247538564801388196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18042721152601883948.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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((((aux14_0+aux14_1)+(aux14_2+aux14_3))+((aux14_4+aux14_6)+(aux14_5+aux14_7)))<=c5)"))))
Formula 0 simplified : FG!"((((aux14_0+aux14_1)+(aux14_2+aux14_3))+((aux14_4+aux14_6)+(aux14_5+aux14_7)))<=c5)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8655584 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16038564 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-10"
export BK_EXAMINATION="LTLCardinality"
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 PermAdmissibility-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r285-smll-171654422000112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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