fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075406600188
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for HouseConstruction-PT-00200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16246.323 3600000.00 3352510.00 237713.50 ?TFFFFFTTTTF??FT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406600188.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HouseConstruction-PT-00200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406600188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 21:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 21:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 13K May 5 16:51 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 HouseConstruction-PT-00200-00
FORMULA_NAME HouseConstruction-PT-00200-01
FORMULA_NAME HouseConstruction-PT-00200-02
FORMULA_NAME HouseConstruction-PT-00200-03
FORMULA_NAME HouseConstruction-PT-00200-04
FORMULA_NAME HouseConstruction-PT-00200-05
FORMULA_NAME HouseConstruction-PT-00200-06
FORMULA_NAME HouseConstruction-PT-00200-07
FORMULA_NAME HouseConstruction-PT-00200-08
FORMULA_NAME HouseConstruction-PT-00200-09
FORMULA_NAME HouseConstruction-PT-00200-10
FORMULA_NAME HouseConstruction-PT-00200-11
FORMULA_NAME HouseConstruction-PT-00200-12
FORMULA_NAME HouseConstruction-PT-00200-13
FORMULA_NAME HouseConstruction-PT-00200-14
FORMULA_NAME HouseConstruction-PT-00200-15

=== Now, execution of the tool begins

BK_START 1620800580247

Running Version 0
[2021-05-12 06:23:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 06:23:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 06:23:08] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-12 06:23:08] [INFO ] Transformed 26 places.
[2021-05-12 06:23:08] [INFO ] Transformed 18 transitions.
[2021-05-12 06:23:08] [INFO ] Parsed PT model containing 26 places and 18 transitions in 60 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 06:23:08] [INFO ] Initial state test concluded for 2 properties.
FORMULA HouseConstruction-PT-00200-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00200-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00200-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00200-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 9 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 06:23:08] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-12 06:23:08] [INFO ] Implicit Places using invariants in 69 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 06:23:08] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-12 06:23:08] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 06:23:08] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 06:23:09] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/26 places, 18/18 transitions.
[2021-05-12 06:23:09] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-12 06:23:09] [INFO ] Flatten gal took : 24 ms
FORMULA HouseConstruction-PT-00200-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00200-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00200-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 06:23:09] [INFO ] Flatten gal took : 5 ms
[2021-05-12 06:23:09] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100126 steps, including 27 resets, run finished after 58 ms. (steps per millisecond=1726 ) properties (out of 22) seen :21
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 06:23:09] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 06:23:09] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-12 06:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:23:09] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 06:23:09] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 06:23:09] [INFO ] Added : 10 causal constraints over 2 iterations in 18 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||(F(p0)&&p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 21 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 18 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 18 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 23 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 10 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 27 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 8 transition count 6
Applied a total of 28 rules in 10 ms. Remains 8 /25 variables (removed 17) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-12 06:23:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 06:23:09] [INFO ] Implicit Places using invariants in 17 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
[2021-05-12 06:23:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 06:23:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 06:23:09] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 7/25 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-12 06:23:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 06:23:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 06:23:09] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-00 automaton TGBA [mat=[[{ cond=(NOT p1), 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=[p1:(AND (GT 1 s2) (GT s4 s0)), p0:(GT s4 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 99 reset in 199 ms.
Product exploration explored 100000 steps with 95 reset in 128 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
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 : [(F (G (NOT p1))), (F (G (NOT p0))), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 96 reset in 74 ms.
Product exploration explored 100000 steps with 97 reset in 215 ms.
[2021-05-12 06:23:10] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:23:10] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:23:10] [INFO ] Time to serialize gal into /tmp/LTL786507449651695892.gal : 0 ms
[2021-05-12 06:23:10] [INFO ] Time to serialize properties into /tmp/LTL16708813461000362534.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL786507449651695892.gal, -t, CGAL, -LTL, /tmp/LTL16708813461000362534.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL786507449651695892.gal -t CGAL -LTL /tmp/LTL16708813461000362534.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(p19>p1)")))||(("((p11<1)&&(p19>p1))")&&(F("(p19>p1)"))))))
Formula 0 simplified : !F(GF"(p19>p1)" | ("((p11<1)&&(p19>p1))" & F"(p19>p1)"))
Detected timeout of ITS tools.
[2021-05-12 06:23:25] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:23:25] [INFO ] Applying decomposition
[2021-05-12 06:23:25] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18243596457767348315.txt, -o, /tmp/graph18243596457767348315.bin, -w, /tmp/graph18243596457767348315.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18243596457767348315.bin, -l, -1, -v, -w, /tmp/graph18243596457767348315.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 06:23:26] [INFO ] Decomposing Gal with order
[2021-05-12 06:23:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 06:23:26] [INFO ] Flatten gal took : 37 ms
[2021-05-12 06:23:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 06:23:26] [INFO ] Time to serialize gal into /tmp/LTL510032497824658666.gal : 0 ms
[2021-05-12 06:23:26] [INFO ] Time to serialize properties into /tmp/LTL4894954336427738147.ltl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL510032497824658666.gal, -t, CGAL, -LTL, /tmp/LTL4894954336427738147.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL510032497824658666.gal -t CGAL -LTL /tmp/LTL4894954336427738147.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(gu1.p19>gu1.p1)")))||(("((gu0.p11<1)&&(gu1.p19>gu1.p1))")&&(F("(gu1.p19>gu1.p1)"))))))
Formula 0 simplified : !F(GF"(gu1.p19>gu1.p1)" | ("((gu0.p11<1)&&(gu1.p19>gu1.p1))" & F"(gu1.p19>gu1.p1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3405838864388260781
[2021-05-12 06:23:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3405838864388260781
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3405838864388260781]
Compilation finished in 247 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3405838864388260781]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3405838864388260781]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00200-00 finished in 51441 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0 U (p1||G(p0)))&&X(F(p2)))||G(p3)))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 06:24:02] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 06:24:02] [INFO ] Implicit Places using invariants in 40 ms returned [8, 12, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 06:24:02] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 06:24:02] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 06:24:02] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 06:24:02] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00200-02 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={} source=0 dest: 5}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(OR (LEQ s2 s8) (AND (GT s10 s9) (LEQ s2 s8))), p1:(AND (GT s10 s9) (LEQ s2 s8)), p0:(LEQ s2 s8), p2:(OR (GT 1 s9) (GT 3 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00200-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-02 finished in 1652 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 0 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 06:24:02] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 06:24:02] [INFO ] Implicit Places using invariants in 25 ms returned [8, 12, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 06:24:02] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 06:24:02] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 06:24:02] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 06:24:02] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : HouseConstruction-PT-00200-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s17 s9), p0:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 72 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00200-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-03 finished in 155 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 18 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 18 transition count 7
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 21 place count 12 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 23 place count 11 transition count 6
Applied a total of 23 rules in 7 ms. Remains 11 /25 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 11 cols
[2021-05-12 06:24:02] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 06:24:02] [INFO ] Implicit Places using invariants in 14 ms returned [2, 3, 4, 7, 9]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 15 ms to find 5 implicit places.
[2021-05-12 06:24:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-12 06:24:02] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 06:24:02] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 6/25 places, 6/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Applied a total of 2 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-12 06:24:02] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 06:24:02] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-12 06:24:02] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 06:24:02] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00200-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT s4 s2), p1:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1092 steps with 8 reset in 6 ms.
FORMULA HouseConstruction-PT-00200-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-04 finished in 126 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 06:24:02] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 06:24:02] [INFO ] Implicit Places using invariants in 14 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 06:24:02] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-12 06:24:02] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 06:24:02] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-12 06:24:02] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00200-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ s17 s22), p0:(LEQ s11 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00200-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-06 finished in 157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0)) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 0 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 06:24:02] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 06:24:02] [INFO ] Implicit Places using invariants in 28 ms returned [12, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 06:24:02] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 06:24:02] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 06:24:02] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 06:24:03] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s14), p0:(LEQ 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3600 steps with 0 reset in 6 ms.
FORMULA HouseConstruction-PT-00200-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-11 finished in 248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U (G((p0||G(p1)))||((p0||G(p1))&&(p2||X(X(F(p3))))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 06:24:03] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 06:24:03] [INFO ] Implicit Places using invariants in 17 ms returned [8, 12, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 17 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 06:24:03] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-12 06:24:03] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 06:24:03] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 06:24:03] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p3), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00200-12 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 8}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 8}]], initial=3, aps=[p0:(GT 1 s21), p2:(GT 1 s19), p1:(GT s2 s14), p3:(LEQ s13 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 123 ms.
Product exploration explored 100000 steps with 33333 reset in 106 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
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 : [(F (G p0)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1))), (F (OR (G p3) (G (NOT p3)))), p0, p2, (NOT p1), p3]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p3), (NOT p1), (AND (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 75 ms.
Product exploration explored 100000 steps with 33333 reset in 68 ms.
Applying partial POR strategy [false, false, true, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p3), (NOT p1), (AND (NOT p3) (NOT p1))]
Support contains 5 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 2 place count 22 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 22 transition count 18
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 20 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 20 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 11 rules in 3 ms. Remains 20 /22 variables (removed 2) and now considering 17/18 (removed 1) transitions.
[2021-05-12 06:24:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2021-05-12 06:24:04] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 06:24:04] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/22 places, 17/18 transitions.
Product exploration explored 100000 steps with 33333 reset in 100 ms.
Product exploration explored 100000 steps with 33333 reset in 105 ms.
[2021-05-12 06:24:04] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:24:04] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:24:04] [INFO ] Time to serialize gal into /tmp/LTL16470530802222485229.gal : 1 ms
[2021-05-12 06:24:04] [INFO ] Time to serialize properties into /tmp/LTL14207791878162739407.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16470530802222485229.gal, -t, CGAL, -LTL, /tmp/LTL14207791878162739407.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16470530802222485229.gal -t CGAL -LTL /tmp/LTL14207791878162739407.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p16<1)")U((G(("(p16<1)")||(G("(p3>p20)"))))||((("(p16<1)")||(G("(p3>p20)")))&&(("(p23<1)")||(X(X(F("(p19<=p16)")))))))))))
Formula 0 simplified : !XX("(p16<1)" U (G("(p16<1)" | G"(p3>p20)") | (("(p16<1)" | G"(p3>p20)") & ("(p23<1)" | XXF"(p19<=p16)"))))
Detected timeout of ITS tools.
[2021-05-12 06:24:19] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:24:19] [INFO ] Applying decomposition
[2021-05-12 06:24:19] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1966927858212223725.txt, -o, /tmp/graph1966927858212223725.bin, -w, /tmp/graph1966927858212223725.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1966927858212223725.bin, -l, -1, -v, -w, /tmp/graph1966927858212223725.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 06:24:20] [INFO ] Decomposing Gal with order
[2021-05-12 06:24:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 06:24:20] [INFO ] Flatten gal took : 3 ms
[2021-05-12 06:24:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 06:24:20] [INFO ] Time to serialize gal into /tmp/LTL9025751222001641167.gal : 1 ms
[2021-05-12 06:24:20] [INFO ] Time to serialize properties into /tmp/LTL10589666269508590581.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9025751222001641167.gal, -t, CGAL, -LTL, /tmp/LTL10589666269508590581.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9025751222001641167.gal -t CGAL -LTL /tmp/LTL10589666269508590581.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(gu8.p16<1)")U((G(("(gu8.p16<1)")||(G("(gu5.p3>gu5.p20)"))))||((("(gu8.p16<1)")||(G("(gu5.p3>gu5.p20)")))&&(("(gi1.gi1.gi2.gu7.p23<1)")||(X(X(F("(gu8.p19<=gu8.p16)")))))))))))
Formula 0 simplified : !XX("(gu8.p16<1)" U (G("(gu8.p16<1)" | G"(gu5.p3>gu5.p20)") | (("(gu8.p16<1)" | G"(gu5.p3>gu5.p20)") & ("(gi1.gi1.gi2.gu7.p23<1)" | XXF"(gu8.p19<=gu8.p16)"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15319459710132134426
[2021-05-12 06:24:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15319459710132134426
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15319459710132134426]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15319459710132134426] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15319459710132134426] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HouseConstruction-PT-00200-12 finished in 36292 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 20 transition count 14
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 20 transition count 8
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 21 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 26 place count 8 transition count 6
Applied a total of 26 rules in 4 ms. Remains 8 /25 variables (removed 17) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-12 06:24:39] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 06:24:39] [INFO ] Implicit Places using invariants in 26 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
[2021-05-12 06:24:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 06:24:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 06:24:39] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 7/25 places, 6/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-12 06:24:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 06:24:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 06:24:39] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-13 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 3 s1), p0:(GT s6 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 275 reset in 127 ms.
Product exploration explored 100000 steps with 285 reset in 139 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
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 : [(F (G p1)), (F (OR (G p0) (G (NOT p0)))), p1, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 301 reset in 92 ms.
Product exploration explored 100000 steps with 265 reset in 140 ms.
[2021-05-12 06:24:40] [INFO ] Flatten gal took : 0 ms
[2021-05-12 06:24:40] [INFO ] Flatten gal took : 0 ms
[2021-05-12 06:24:40] [INFO ] Time to serialize gal into /tmp/LTL6350030940412974556.gal : 0 ms
[2021-05-12 06:24:40] [INFO ] Time to serialize properties into /tmp/LTL13234622020854756663.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6350030940412974556.gal, -t, CGAL, -LTL, /tmp/LTL13234622020854756663.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6350030940412974556.gal -t CGAL -LTL /tmp/LTL13234622020854756663.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p25>p17)"))U(G("(p5<3)"))))
Formula 0 simplified : !(F"(p25>p17)" U G"(p5<3)")
Detected timeout of ITS tools.
[2021-05-12 06:24:55] [INFO ] Flatten gal took : 10 ms
[2021-05-12 06:24:55] [INFO ] Applying decomposition
[2021-05-12 06:24:55] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15994423488973589292.txt, -o, /tmp/graph15994423488973589292.bin, -w, /tmp/graph15994423488973589292.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15994423488973589292.bin, -l, -1, -v, -w, /tmp/graph15994423488973589292.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 06:24:57] [INFO ] Decomposing Gal with order
[2021-05-12 06:24:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 06:24:57] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:24:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 06:24:57] [INFO ] Time to serialize gal into /tmp/LTL10922568663643679053.gal : 0 ms
[2021-05-12 06:24:57] [INFO ] Time to serialize properties into /tmp/LTL1273853384108145775.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10922568663643679053.gal, -t, CGAL, -LTL, /tmp/LTL1273853384108145775.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10922568663643679053.gal -t CGAL -LTL /tmp/LTL1273853384108145775.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(gu2.p25>gu2.p17)"))U(G("(gi0.gu1.p5<3)"))))
Formula 0 simplified : !(F"(gu2.p25>gu2.p17)" U G"(gi0.gu1.p5<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10099107000194472055
[2021-05-12 06:25:12] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10099107000194472055
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10099107000194472055]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10099107000194472055] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10099107000194472055] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HouseConstruction-PT-00200-13 finished in 33800 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G((p0||F(p1)))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 19 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 23 place count 11 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 11 transition count 6
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 25 place count 10 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 8 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 7 transition count 4
Applied a total of 29 rules in 23 ms. Remains 7 /25 variables (removed 18) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 7 cols
[2021-05-12 06:25:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 06:25:13] [INFO ] Implicit Places using invariants in 18 ms returned [0, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
[2021-05-12 06:25:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 06:25:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 06:25:13] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 5/25 places, 4/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4 transition count 3
Applied a total of 2 rules in 0 ms. Remains 4 /5 variables (removed 1) and now considering 3/4 (removed 1) transitions.
// Phase 1: matrix 3 rows 4 cols
[2021-05-12 06:25:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 06:25:13] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2021-05-12 06:25:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 06:25:13] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/25 places, 3/18 transitions.
Stuttering acceptance computed with spot in 6474 ms :[(NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00200-15 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GT 3 s1), p0:(LEQ s2 s3), p1:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5302 reset in 74 ms.
Product exploration explored 100000 steps with 5248 reset in 84 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
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 : [(F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), p2, p0, (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5326 reset in 75 ms.
Product exploration explored 100000 steps with 5326 reset in 84 ms.
[2021-05-12 06:25:20] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:25:20] [INFO ] Flatten gal took : 0 ms
[2021-05-12 06:25:20] [INFO ] Time to serialize gal into /tmp/LTL10590238797700442152.gal : 0 ms
[2021-05-12 06:25:20] [INFO ] Time to serialize properties into /tmp/LTL1173542936281721839.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10590238797700442152.gal, -t, CGAL, -LTL, /tmp/LTL1173542936281721839.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10590238797700442152.gal -t CGAL -LTL /tmp/LTL1173542936281721839.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(G(("(p20<=p22)")||(F("(p20>=2)")))))U(G("(p19<3)"))))
Formula 0 simplified : !(FG("(p20<=p22)" | F"(p20>=2)") U G"(p19<3)")
Detected timeout of ITS tools.
[2021-05-12 06:25:35] [INFO ] Flatten gal took : 0 ms
[2021-05-12 06:25:35] [INFO ] Applying decomposition
[2021-05-12 06:25:35] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17410893968425006008.txt, -o, /tmp/graph17410893968425006008.bin, -w, /tmp/graph17410893968425006008.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17410893968425006008.bin, -l, -1, -v, -w, /tmp/graph17410893968425006008.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 06:25:35] [INFO ] Decomposing Gal with order
[2021-05-12 06:25:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 06:25:35] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:25:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 06:25:35] [INFO ] Time to serialize gal into /tmp/LTL7671544154472913121.gal : 0 ms
[2021-05-12 06:25:35] [INFO ] Time to serialize properties into /tmp/LTL12382253884360464001.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7671544154472913121.gal, -t, CGAL, -LTL, /tmp/LTL12382253884360464001.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7671544154472913121.gal -t CGAL -LTL /tmp/LTL12382253884360464001.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(G(("(gu1.p20<=gu1.p22)")||(F("(gu1.p20>=2)")))))U(G("(gu0.p19<3)"))))
Formula 0 simplified : !(FG("(gu1.p20<=gu1.p22)" | F"(gu1.p20>=2)") U G"(gu0.p19<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin434710766383304949
[2021-05-12 06:25:50] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin434710766383304949
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin434710766383304949]
Compilation finished in 82 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin434710766383304949]
Link finished in 33 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>([](((LTLAPp0==true)||<>((LTLAPp1==true))))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin434710766383304949]
LTSmin run took 8072 ms.
FORMULA HouseConstruction-PT-00200-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00200-15 finished in 45551 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-12 06:25:58] [INFO ] Applying decomposition
[2021-05-12 06:25:58] [INFO ] Flatten gal took : 2 ms
Built C files in :
/tmp/ltsmin14420083473583602435
[2021-05-12 06:25:58] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-12 06:25:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 06:25:58] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-12 06:25:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 06:25:58] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-12 06:25:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 06:25:58] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14420083473583602435
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14420083473583602435]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11575445565617775196.txt, -o, /tmp/graph11575445565617775196.bin, -w, /tmp/graph11575445565617775196.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11575445565617775196.bin, -l, -1, -v, -w, /tmp/graph11575445565617775196.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 06:25:58] [INFO ] Decomposing Gal with order
[2021-05-12 06:25:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 06:25:58] [INFO ] Flatten gal took : 3 ms
[2021-05-12 06:25:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 06:25:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality5845939620311324463.gal : 14 ms
[2021-05-12 06:25:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality1134680232527179684.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality5845939620311324463.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1134680232527179684.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality5845939620311324463.gal -t CGAL -LTL /tmp/LTLCardinality1134680232527179684.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !(((F("(gu0.p19>gu0.p1)"))U(((!("((gu3.p11>=1)||(gu0.p19<=gu0.p1))"))&&(F("(gu0.p19>gu0.p1)")))||(G(F("(gu0.p19>gu0.p1)"))))))
Formula 0 simplified : !(F"(gu0.p19>gu0.p1)" U ((!"((gu3.p11>=1)||(gu0.p19<=gu0.p1))" & F"(gu0.p19>gu0.p1)") | GF"(gu0.p19>gu0.p1)"))
Compilation finished in 329 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14420083473583602435]
Link finished in 59 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14420083473583602435]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: LTL layer: formula: <>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&(LTLAPp1==true))))
pins2lts-mc-linux64( 7/ 8), 0.001: "<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Initializing POR dependencies: labels 26, guards 18
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.011: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.015: There are 28 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.015: State length is 26, there are 21 groups
pins2lts-mc-linux64( 0/ 8), 0.015: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.015: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.015: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.015: Visible groups: 5 / 21, labels: 2 / 28
pins2lts-mc-linux64( 0/ 8), 0.015: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.015: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.236: [Blue] ~120 levels ~960 states ~1280 transitions
pins2lts-mc-linux64( 7/ 8), 0.259: [Blue] ~240 levels ~1920 states ~2480 transitions
pins2lts-mc-linux64( 7/ 8), 0.261: [Blue] ~480 levels ~3840 states ~4880 transitions
pins2lts-mc-linux64( 7/ 8), 0.265: [Blue] ~933 levels ~7680 states ~10200 transitions
pins2lts-mc-linux64( 3/ 8), 0.283: [Blue] ~1795 levels ~15360 states ~27032 transitions
pins2lts-mc-linux64( 0/ 8), 0.306: [Blue] ~2396 levels ~30720 states ~52000 transitions
pins2lts-mc-linux64( 0/ 8), 0.338: [Blue] ~2396 levels ~61440 states ~90368 transitions
pins2lts-mc-linux64( 2/ 8), 0.442: [Blue] ~3592 levels ~122880 states ~157008 transitions
pins2lts-mc-linux64( 2/ 8), 0.546: [Blue] ~3592 levels ~245760 states ~304464 transitions
pins2lts-mc-linux64( 2/ 8), 0.792: [Blue] ~3592 levels ~491520 states ~599376 transitions
pins2lts-mc-linux64( 2/ 8), 1.324: [Blue] ~3592 levels ~983040 states ~1243576 transitions
pins2lts-mc-linux64( 2/ 8), 2.447: [Blue] ~3592 levels ~1966080 states ~2627728 transitions
pins2lts-mc-linux64( 2/ 8), 4.686: [Blue] ~3592 levels ~3932160 states ~5173168 transitions
pins2lts-mc-linux64( 2/ 8), 9.293: [Blue] ~3592 levels ~7864320 states ~10320384 transitions
pins2lts-mc-linux64( 2/ 8), 18.905: [Blue] ~3592 levels ~15728640 states ~21060240 transitions
pins2lts-mc-linux64( 2/ 8), 40.449: [Blue] ~3592 levels ~31457280 states ~42786496 transitions
pins2lts-mc-linux64( 7/ 8), 77.475: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 77.519:
pins2lts-mc-linux64( 0/ 8), 77.519: Explored 53753325 states 78761069 transitions, fanout: 1.465
pins2lts-mc-linux64( 0/ 8), 77.519: Total exploration time 77.480 sec (77.400 sec minimum, 77.441 sec on average)
pins2lts-mc-linux64( 0/ 8), 77.519: States per second: 693770, Transitions per second: 1016534
pins2lts-mc-linux64( 0/ 8), 77.519:
pins2lts-mc-linux64( 0/ 8), 77.519: State space has 51806728 states, 51772795 are accepting
pins2lts-mc-linux64( 0/ 8), 77.519: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 77.519: blue states: 53753325 (103.76%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 77.519: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 77.519: all-red states: 51772795 (99.93%), bogus 1950904 (3.77%)
pins2lts-mc-linux64( 0/ 8), 77.519:
pins2lts-mc-linux64( 0/ 8), 77.519: Total memory used for local state coloring: 0.4MB
pins2lts-mc-linux64( 0/ 8), 77.519:
pins2lts-mc-linux64( 0/ 8), 77.519: Queue width: 8B, total height: 23945, memory: 0.18MB
pins2lts-mc-linux64( 0/ 8), 77.519: Tree memory: 651.3MB, 13.2 B/state, compr.: 12.4%
pins2lts-mc-linux64( 0/ 8), 77.519: Tree fill ratio (roots/leafs): 38.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 77.519: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 77.519: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 77.519: Est. total memory use: 651.4MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14420083473583602435]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14420083473583602435]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-12 06:46:55] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:46:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality9165276013020161500.gal : 1 ms
[2021-05-12 06:46:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality1038123841387679352.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality9165276013020161500.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1038123841387679352.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality9165276013020161500.gal -t CGAL -LTL /tmp/LTLCardinality1038123841387679352.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !(((F("(p19>p1)"))U(((!("((p11>=1)||(p19<=p1))"))&&(F("(p19>p1)")))||(G(F("(p19>p1)"))))))
Formula 0 simplified : !(F"(p19>p1)" U ((!"((p11>=1)||(p19<=p1))" & F"(p19>p1)") | GF"(p19>p1)"))
Detected timeout of ITS tools.
[2021-05-12 07:08:00] [INFO ] Flatten gal took : 149 ms
[2021-05-12 07:08:00] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-12 07:08:01] [INFO ] Transformed 25 places.
[2021-05-12 07:08:01] [INFO ] Transformed 18 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-12 07:08:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality10175597580674268216.gal : 19 ms
[2021-05-12 07:08:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality17366494567545796557.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality10175597580674268216.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17366494567545796557.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality10175597580674268216.gal -t CGAL -LTL /tmp/LTLCardinality17366494567545796557.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(p19>p1)"))U(((!("((p11>=1)||(p19<=p1))"))&&(F("(p19>p1)")))||(G(F("(p19>p1)"))))))
Formula 0 simplified : !(F"(p19>p1)" U ((!"((p11>=1)||(p19<=p1))" & F"(p19>p1)") | GF"(p19>p1)"))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="HouseConstruction-PT-00200"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HouseConstruction-PT-00200, 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 r121-tall-162075406600188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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