About the Execution of ITS-Tools for ServersAndClients-PT-100020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1688.544 | 137267.00 | 171657.00 | 696.80 | FTTFFFTFFFFTFFFT | 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.r311-tall-162132107800125.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 ServersAndClients-PT-100020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132107800125
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 19K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 12 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 12 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.8K May 11 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 11 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 11 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.1M May 12 08:13 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 ServersAndClients-PT-100020-00
FORMULA_NAME ServersAndClients-PT-100020-01
FORMULA_NAME ServersAndClients-PT-100020-02
FORMULA_NAME ServersAndClients-PT-100020-03
FORMULA_NAME ServersAndClients-PT-100020-04
FORMULA_NAME ServersAndClients-PT-100020-05
FORMULA_NAME ServersAndClients-PT-100020-06
FORMULA_NAME ServersAndClients-PT-100020-07
FORMULA_NAME ServersAndClients-PT-100020-08
FORMULA_NAME ServersAndClients-PT-100020-09
FORMULA_NAME ServersAndClients-PT-100020-10
FORMULA_NAME ServersAndClients-PT-100020-11
FORMULA_NAME ServersAndClients-PT-100020-12
FORMULA_NAME ServersAndClients-PT-100020-13
FORMULA_NAME ServersAndClients-PT-100020-14
FORMULA_NAME ServersAndClients-PT-100020-15
=== Now, execution of the tool begins
BK_START 1621437113068
Running Version 0
[2021-05-19 15:11:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-19 15:11:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 15:11:54] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2021-05-19 15:11:54] [INFO ] Transformed 2421 places.
[2021-05-19 15:11:54] [INFO ] Transformed 4200 transitions.
[2021-05-19 15:11:54] [INFO ] Found NUPN structural information;
[2021-05-19 15:11:54] [INFO ] Parsed PT model containing 2421 places and 4200 transitions in 290 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 15:11:54] [INFO ] Initial state test concluded for 1 properties.
Support contains 49 out of 2421 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 330 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2421 cols
[2021-05-19 15:11:55] [INFO ] Computed 221 place invariants in 101 ms
[2021-05-19 15:11:56] [INFO ] Implicit Places using invariants in 937 ms returned []
// Phase 1: matrix 4200 rows 2421 cols
[2021-05-19 15:11:56] [INFO ] Computed 221 place invariants in 40 ms
[2021-05-19 15:11:57] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned [1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 145, 147, 149, 151, 153, 155, 157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181, 183, 185, 187, 189, 191, 193, 195, 197, 199]
Discarding 100 places :
Implicit Place search using SMT with State Equation took 2226 ms to find 100 implicit places.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:11:57] [INFO ] Computed 121 place invariants in 53 ms
[2021-05-19 15:11:59] [INFO ] Dead Transitions using invariants and state equation in 2079 ms returned []
Starting structural reductions, iteration 1 : 2321/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 309 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:12:00] [INFO ] Computed 121 place invariants in 54 ms
[2021-05-19 15:12:02] [INFO ] Dead Transitions using invariants and state equation in 2240 ms returned []
Finished structural reductions, in 2 iterations. Remains : 2321/2421 places, 4200/4200 transitions.
[2021-05-19 15:12:02] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-19 15:12:02] [INFO ] Flatten gal took : 287 ms
FORMULA ServersAndClients-PT-100020-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 15:12:02] [INFO ] Flatten gal took : 189 ms
[2021-05-19 15:12:03] [INFO ] Input system was already deterministic with 4200 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1659 ms. (steps per millisecond=60 ) properties (out of 28) seen :27
Running SMT prover for 1 properties.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:12:05] [INFO ] Computed 121 place invariants in 45 ms
[2021-05-19 15:12:05] [INFO ] [Real]Absence check using 121 positive place invariants in 76 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2021-05-19 15:12:05] [INFO ] Initial state test concluded for 1 properties.
FORMULA ServersAndClients-PT-100020-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 110 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:12:05] [INFO ] Computed 121 place invariants in 50 ms
[2021-05-19 15:12:06] [INFO ] Implicit Places using invariants in 636 ms returned []
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:12:06] [INFO ] Computed 121 place invariants in 59 ms
[2021-05-19 15:12:07] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:12:07] [INFO ] Computed 121 place invariants in 43 ms
[2021-05-19 15:12:09] [INFO ] Dead Transitions using invariants and state equation in 2221 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2321/2321 places, 4200/4200 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2105 0), p1:(AND (EQ s277 1) (EQ s1513 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1446 steps with 0 reset in 45 ms.
FORMULA ServersAndClients-PT-100020-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-00 finished in 4618 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U X(p1))&&(p2 U (p3||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 124 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:12:10] [INFO ] Computed 121 place invariants in 49 ms
[2021-05-19 15:12:11] [INFO ] Implicit Places using invariants in 677 ms returned []
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:12:11] [INFO ] Computed 121 place invariants in 45 ms
[2021-05-19 15:12:12] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:12:12] [INFO ] Computed 121 place invariants in 43 ms
[2021-05-19 15:12:14] [INFO ] Dead Transitions using invariants and state equation in 2136 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2321/2321 places, 4200/4200 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p3) (NOT p2)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100020-02 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (OR (NEQ s155 1) (NEQ s402 1)) (NEQ s441 1)), p2:(NEQ s441 1), p0:(OR (EQ s441 1) (EQ s917 1)), p1:(NEQ s317 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2666 ms.
Product exploration explored 100000 steps with 50000 reset in 2601 ms.
Knowledge obtained : [p3, p2, (NOT p0), p1]
Adopting property with smaller alphabet thanks to knowledge :p3
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p1) p3), (NOT p1), (NOT p1)]
Support contains 5 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 98 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:12:20] [INFO ] Computed 121 place invariants in 46 ms
[2021-05-19 15:12:20] [INFO ] Implicit Places using invariants in 664 ms returned []
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:12:20] [INFO ] Computed 121 place invariants in 45 ms
[2021-05-19 15:12:21] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:12:21] [INFO ] Computed 121 place invariants in 48 ms
[2021-05-19 15:12:24] [INFO ] Dead Transitions using invariants and state equation in 2103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2321/2321 places, 4200/4200 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (AND (NOT p1) p3), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 2484 ms.
Product exploration explored 100000 steps with 50000 reset in 2514 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p1) p3), (NOT p1), (NOT p1)]
Support contains 5 out of 2321 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Performed 1898 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1898 rules applied. Total rules applied 1898 place count 2321 transition count 4200
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 1914 place count 2305 transition count 2600
Deduced a syphon composed of 1898 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 1930 place count 2305 transition count 2600
Discarding 1600 places :
Symmetric choice reduction at 1 with 1600 rule applications. Total rules 3530 place count 705 transition count 1000
Deduced a syphon composed of 298 places in 0 ms
Iterating global reduction 1 with 1600 rules applied. Total rules applied 5130 place count 705 transition count 1000
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 398 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 5230 place count 705 transition count 1000
Deduced a syphon composed of 398 places in 0 ms
Applied a total of 5230 rules in 819 ms. Remains 705 /2321 variables (removed 1616) and now considering 1000/4200 (removed 3200) transitions.
[2021-05-19 15:12:30] [INFO ] Redundant transitions in 59 ms returned []
[2021-05-19 15:12:30] [INFO ] Flow matrix only has 802 transitions (discarded 198 similar events)
// Phase 1: matrix 802 rows 705 cols
[2021-05-19 15:12:30] [INFO ] Computed 105 place invariants in 8 ms
[2021-05-19 15:12:30] [INFO ] Dead Transitions using invariants and state equation in 502 ms returned []
Finished structural reductions, in 1 iterations. Remains : 705/2321 places, 1000/4200 transitions.
Product exploration explored 100000 steps with 50000 reset in 6018 ms.
Product exploration explored 100000 steps with 50000 reset in 5917 ms.
[2021-05-19 15:12:43] [INFO ] Flatten gal took : 151 ms
[2021-05-19 15:12:43] [INFO ] Flatten gal took : 146 ms
[2021-05-19 15:12:43] [INFO ] Time to serialize gal into /tmp/LTL5693937788696382587.gal : 74 ms
[2021-05-19 15:12:43] [INFO ] Time to serialize properties into /tmp/LTL364596929731578908.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/LTL5693937788696382587.gal, -t, CGAL, -LTL, /tmp/LTL364596929731578908.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/LTL5693937788696382587.gal -t CGAL -LTL /tmp/LTL364596929731578908.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((sv1_c38==1)||(sv6_c9==1))")U(X("(sv0_c15==0)")))&&(("(sv1_c38==0)")U(("(((sys_req27==0)||(sv1==0))&&(sv1_c38==0))")||(G("(sv1_c38==0)"))))))
Formula 0 simplified : !(("((sv1_c38==1)||(sv6_c9==1))" U X"(sv0_c15==0)") & ("(sv1_c38==0)" U ("(((sys_req27==0)||(sv1==0))&&(sv1_c38==0))" | G"(sv1_c38==0)")))
Detected timeout of ITS tools.
[2021-05-19 15:12:58] [INFO ] Flatten gal took : 142 ms
[2021-05-19 15:12:58] [INFO ] Applying decomposition
[2021-05-19 15:12:58] [INFO ] Flatten gal took : 136 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/graph13335454001857247077.txt, -o, /tmp/graph13335454001857247077.bin, -w, /tmp/graph13335454001857247077.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/graph13335454001857247077.bin, -l, -1, -v, -w, /tmp/graph13335454001857247077.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 15:12:59] [INFO ] Decomposing Gal with order
[2021-05-19 15:12:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 15:12:59] [INFO ] Removed a total of 4138 redundant transitions.
[2021-05-19 15:12:59] [INFO ] Flatten gal took : 687 ms
[2021-05-19 15:13:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 64 ms.
[2021-05-19 15:13:00] [INFO ] Time to serialize gal into /tmp/LTL7105444571919927385.gal : 36 ms
[2021-05-19 15:13:00] [INFO ] Time to serialize properties into /tmp/LTL8768895722226986378.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/LTL7105444571919927385.gal, -t, CGAL, -LTL, /tmp/LTL8768895722226986378.ltl, -c, -stutter-deadlock], 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/LTL7105444571919927385.gal -t CGAL -LTL /tmp/LTL8768895722226986378.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((("((u25.sv1_c38==1)||(i92.u5.sv6_c9==1))")U(X("(u72.sv0_c15==0)")))&&(("(u25.sv1_c38==0)")U(("(((i84.u17.sys_req27==0)||(i84.u101.sv1==0))&&(u25.sv1_c38==0))")||(G("(u25.sv1_c38==0)"))))))
Formula 0 simplified : !(("((u25.sv1_c38==1)||(i92.u5.sv6_c9==1))" U X"(u72.sv0_c15==0)") & ("(u25.sv1_c38==0)" U ("(((i84.u17.sys_req27==0)||(i84.u101.sv1==0))&&(u25.sv1_c38==0))" | G"(u25.sv1_c38==0)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
500 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.42383,72716,1,0,25520,12023,30437,20237,647,32756,368196
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ServersAndClients-PT-100020-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ServersAndClients-PT-100020-02 finished in 55593 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((p0&&F(p1)))&&G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 156 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:13:05] [INFO ] Computed 121 place invariants in 41 ms
[2021-05-19 15:13:06] [INFO ] Implicit Places using invariants in 635 ms returned []
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:13:06] [INFO ] Computed 121 place invariants in 43 ms
[2021-05-19 15:13:07] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:13:07] [INFO ] Computed 121 place invariants in 57 ms
[2021-05-19 15:13:09] [INFO ] Dead Transitions using invariants and state equation in 2137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2321/2321 places, 4200/4200 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true]
Running random walk in product with property : ServersAndClients-PT-100020-04 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(AND p2 p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(OR (EQ s117 0) (EQ s806 0)), p0:(EQ s2299 0), p1:(EQ s2045 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 269 steps with 0 reset in 4 ms.
FORMULA ServersAndClients-PT-100020-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-04 finished in 4335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1880 transitions
Trivial Post-agglo rules discarded 1880 transitions
Performed 1880 trivial Post agglomeration. Transition count delta: 1880
Iterating post reduction 0 with 1880 rules applied. Total rules applied 1880 place count 2321 transition count 2320
Reduce places removed 1880 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1899 rules applied. Total rules applied 3779 place count 441 transition count 2301
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 2 with 1737 rules applied. Total rules applied 5516 place count 404 transition count 601
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 5716 place count 304 transition count 501
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 3 with 98 rules applied. Total rules applied 5814 place count 304 transition count 403
Applied a total of 5814 rules in 72 ms. Remains 304 /2321 variables (removed 2017) and now considering 403/4200 (removed 3797) transitions.
[2021-05-19 15:13:10] [INFO ] Flow matrix only has 402 transitions (discarded 1 similar events)
// Phase 1: matrix 402 rows 304 cols
[2021-05-19 15:13:10] [INFO ] Computed 103 place invariants in 2 ms
[2021-05-19 15:13:10] [INFO ] Implicit Places using invariants in 160 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 302]
Discarding 101 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT only with invariants took 162 ms to find 101 implicit places.
[2021-05-19 15:13:10] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 402 rows 203 cols
[2021-05-19 15:13:10] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-19 15:13:10] [INFO ] Dead Transitions using invariants and state equation in 181 ms returned []
Starting structural reductions, iteration 1 : 203/2321 places, 402/4200 transitions.
Graph (trivial) has 198 edges and 203 vertex of which 100 / 203 are part of one of the 1 SCC in 4 ms
Free SCC test removed 99 places
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 100 place count 5 transition count 106
Iterating global reduction 0 with 99 rules applied. Total rules applied 199 place count 5 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 297 place count 5 transition count 8
Applied a total of 297 rules in 11 ms. Remains 5 /203 variables (removed 198) and now considering 8/402 (removed 394) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-19 15:13:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:13:10] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-19 15:13:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:13:10] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/2321 places, 8/4200 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100020-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s0 1) (NEQ s2 1)), p0:(EQ s4 1)], 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 4473 reset in 134 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 7 in 1 ms.
FORMULA ServersAndClients-PT-100020-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-05 finished in 678 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X((!p0 U (p1||G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 113 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:13:10] [INFO ] Computed 121 place invariants in 44 ms
[2021-05-19 15:13:11] [INFO ] Implicit Places using invariants in 685 ms returned []
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:13:11] [INFO ] Computed 121 place invariants in 47 ms
[2021-05-19 15:13:12] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1771 ms to find 0 implicit places.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:13:12] [INFO ] Computed 121 place invariants in 48 ms
[2021-05-19 15:13:14] [INFO ] Dead Transitions using invariants and state equation in 2005 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2321/2321 places, 4200/4200 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, false, (AND p0 (NOT p1)), (NOT p0), false, (AND p0 (NOT p1)), false]
Running random walk in product with property : ServersAndClients-PT-100020-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 2}]], initial=4, aps=[p0:(AND (EQ s261 1) (EQ s1614 1)), p1:(AND (OR (NEQ s109 1) (NEQ s604 1)) (OR (NEQ s261 1) (NEQ s1614 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1951 ms.
Product exploration explored 100000 steps with 33333 reset in 1921 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 155 ms :[true, false, (AND p0 (NOT p1)), (NOT p0), false, (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 33333 reset in 1897 ms.
Product exploration explored 100000 steps with 33333 reset in 1956 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 169 ms :[true, false, (AND p0 (NOT p1)), (NOT p0), false, (AND p0 (NOT p1)), false]
Support contains 4 out of 2321 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Performed 1800 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1800 rules applied. Total rules applied 1800 place count 2321 transition count 4200
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 1817 place count 2304 transition count 2500
Deduced a syphon composed of 1800 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 1834 place count 2304 transition count 2500
Discarding 1700 places :
Symmetric choice reduction at 1 with 1700 rule applications. Total rules 3534 place count 604 transition count 800
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 1700 rules applied. Total rules applied 5234 place count 604 transition count 800
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 5334 place count 604 transition count 800
Deduced a syphon composed of 200 places in 0 ms
Applied a total of 5334 rules in 461 ms. Remains 604 /2321 variables (removed 1717) and now considering 800/4200 (removed 3400) transitions.
[2021-05-19 15:13:23] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 800 rows 604 cols
[2021-05-19 15:13:23] [INFO ] Computed 104 place invariants in 15 ms
[2021-05-19 15:13:23] [INFO ] Dead Transitions using invariants and state equation in 416 ms returned []
Finished structural reductions, in 1 iterations. Remains : 604/2321 places, 800/4200 transitions.
Product exploration explored 100000 steps with 33333 reset in 5132 ms.
Product exploration explored 100000 steps with 33333 reset in 5156 ms.
[2021-05-19 15:13:34] [INFO ] Flatten gal took : 129 ms
[2021-05-19 15:13:34] [INFO ] Flatten gal took : 133 ms
[2021-05-19 15:13:34] [INFO ] Time to serialize gal into /tmp/LTL3256345280393764334.gal : 15 ms
[2021-05-19 15:13:34] [INFO ] Time to serialize properties into /tmp/LTL8756484231301939614.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/LTL3256345280393764334.gal, -t, CGAL, -LTL, /tmp/LTL8756484231301939614.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/LTL3256345280393764334.gal -t CGAL -LTL /tmp/LTL8756484231301939614.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((sys_req80==1)&&(sv13==1))"))||(X(X(("((sys_req80==0)||(sv13==0))")U(("(((sys_req4==0)||(sv3==0))&&((sys_req80==0)||(sv13==0)))")||(G("((sys_req80==0)||(sv13==0))"))))))))
Formula 0 simplified : !(G"((sys_req80==1)&&(sv13==1))" | XX("((sys_req80==0)||(sv13==0))" U ("(((sys_req4==0)||(sv3==0))&&((sys_req80==0)||(sv13==0)))" | G"((sys_req80==0)||(sv13==0))")))
Detected timeout of ITS tools.
[2021-05-19 15:13:49] [INFO ] Flatten gal took : 113 ms
[2021-05-19 15:13:49] [INFO ] Applying decomposition
[2021-05-19 15:13:49] [INFO ] Flatten gal took : 116 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/graph14591360206643593945.txt, -o, /tmp/graph14591360206643593945.bin, -w, /tmp/graph14591360206643593945.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/graph14591360206643593945.bin, -l, -1, -v, -w, /tmp/graph14591360206643593945.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 15:13:50] [INFO ] Decomposing Gal with order
[2021-05-19 15:13:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 15:13:50] [INFO ] Removed a total of 4150 redundant transitions.
[2021-05-19 15:13:50] [INFO ] Flatten gal took : 352 ms
[2021-05-19 15:13:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2021-05-19 15:13:50] [INFO ] Time to serialize gal into /tmp/LTL6661311028673056636.gal : 27 ms
[2021-05-19 15:13:50] [INFO ] Time to serialize properties into /tmp/LTL16708430588413812553.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/LTL6661311028673056636.gal, -t, CGAL, -LTL, /tmp/LTL16708430588413812553.ltl, -c, -stutter-deadlock], 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/LTL6661311028673056636.gal -t CGAL -LTL /tmp/LTL16708430588413812553.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((u51.sys_req80==1)&&(i91.u112.sv13==1))"))||(X(X(("((u51.sys_req80==0)||(i91.u112.sv13==0))")U(("(((i92.u3.sys_req4==0)||(i83.u103.sv3==0))&&((u51.sys_req80==0)||(i91.u112.sv13==0)))")||(G("((u51.sys_req80==0)||(i91.u112.sv13==0))"))))))))
Formula 0 simplified : !(G"((u51.sys_req80==1)&&(i91.u112.sv13==1))" | XX("((u51.sys_req80==0)||(i91.u112.sv13==0))" U ("(((i92.u3.sys_req4==0)||(i83.u103.sv3==0))&&((u51.sys_req80==0)||(i91.u112.sv13==0)))" | G"((u51.sys_req80==0)||(i91.u112.sv13==0))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
515 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.56694,72828,1,0,22024,12192,30925,17510,538,32402,350779
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ServersAndClients-PT-100020-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ServersAndClients-PT-100020-06 finished in 45606 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1999 transitions
Trivial Post-agglo rules discarded 1999 transitions
Performed 1999 trivial Post agglomeration. Transition count delta: 1999
Iterating post reduction 0 with 1999 rules applied. Total rules applied 1999 place count 2321 transition count 2201
Reduce places removed 2018 places and 0 transitions.
Ensure Unique test removed 1800 transitions
Reduce isomorphic transitions removed 1800 transitions.
Iterating post reduction 1 with 3818 rules applied. Total rules applied 5817 place count 303 transition count 401
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 6017 place count 203 transition count 301
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 6116 place count 203 transition count 202
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 2 with 99 rules applied. Total rules applied 6215 place count 203 transition count 103
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 296 rules applied. Total rules applied 6511 place count 5 transition count 5
Applied a total of 6511 rules in 34 ms. Remains 5 /2321 variables (removed 2316) and now considering 5/4200 (removed 4195) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-19 15:13:56] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 15:13:56] [INFO ] Implicit Places using invariants in 13 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
[2021-05-19 15:13:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-19 15:13:56] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 15:13:56] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Starting structural reductions, iteration 1 : 3/2321 places, 5/4200 transitions.
Graph (trivial) has 3 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-19 15:13:56] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:13:56] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-19 15:13:56] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:13:56] [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 : 2/2321 places, 3/4200 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-07 finished in 113 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(p1)||G(p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1879 transitions
Trivial Post-agglo rules discarded 1879 transitions
Performed 1879 trivial Post agglomeration. Transition count delta: 1879
Iterating post reduction 0 with 1879 rules applied. Total rules applied 1879 place count 2321 transition count 2321
Reduce places removed 1879 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1898 rules applied. Total rules applied 3777 place count 442 transition count 2302
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1600 transitions
Reduce isomorphic transitions removed 1600 transitions.
Iterating post reduction 2 with 1636 rules applied. Total rules applied 5413 place count 406 transition count 702
Drop transitions removed 196 transitions
Redundant transition composition rules discarded 196 transitions
Iterating global reduction 3 with 196 rules applied. Total rules applied 5609 place count 406 transition count 506
Applied a total of 5609 rules in 43 ms. Remains 406 /2321 variables (removed 1915) and now considering 506/4200 (removed 3694) transitions.
[2021-05-19 15:13:56] [INFO ] Flow matrix only has 504 transitions (discarded 2 similar events)
// Phase 1: matrix 504 rows 406 cols
[2021-05-19 15:13:56] [INFO ] Computed 104 place invariants in 2 ms
[2021-05-19 15:13:56] [INFO ] Implicit Places using invariants in 186 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 301, 404]
Discarding 101 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 187 ms to find 101 implicit places.
[2021-05-19 15:13:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 504 rows 305 cols
[2021-05-19 15:13:56] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-19 15:13:56] [INFO ] Dead Transitions using invariants and state equation in 217 ms returned []
Starting structural reductions, iteration 1 : 305/2321 places, 504/4200 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 207 transition count 406
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 207 transition count 406
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 294 place count 109 transition count 308
Iterating global reduction 0 with 98 rules applied. Total rules applied 392 place count 109 transition count 308
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 487 place count 14 transition count 118
Iterating global reduction 0 with 95 rules applied. Total rules applied 582 place count 14 transition count 118
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 0 with 95 rules applied. Total rules applied 677 place count 14 transition count 23
Applied a total of 677 rules in 7 ms. Remains 14 /305 variables (removed 291) and now considering 23/504 (removed 481) transitions.
// Phase 1: matrix 23 rows 14 cols
[2021-05-19 15:13:56] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 15:13:56] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 23 rows 14 cols
[2021-05-19 15:13:56] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 15:13:56] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/2321 places, 23/4200 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100020-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=3, aps=[p2:(EQ s9 1), p1:(EQ s13 1), p0:(OR (AND (EQ s0 1) (EQ s1 1)) (EQ s7 0) (EQ s10 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-08 finished in 769 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&X(X(F(p1)))) U p2))], workingDir=/home/mcc/execution]
Support contains 5 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 126 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:13:57] [INFO ] Computed 121 place invariants in 41 ms
[2021-05-19 15:13:58] [INFO ] Implicit Places using invariants in 661 ms returned []
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:13:58] [INFO ] Computed 121 place invariants in 43 ms
[2021-05-19 15:13:59] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:13:59] [INFO ] Computed 121 place invariants in 44 ms
[2021-05-19 15:14:01] [INFO ] Dead Transitions using invariants and state equation in 2112 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2321/2321 places, 4200/4200 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p2), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100020-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s920 1) (AND (EQ s111 1) (EQ s604 1))), p2:(AND (EQ s920 0) (EQ s1496 1)), p0:(OR (EQ s135 0) (EQ s604 0))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 483 steps with 1 reset in 8 ms.
FORMULA ServersAndClients-PT-100020-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-09 finished in 4246 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1880 transitions
Trivial Post-agglo rules discarded 1880 transitions
Performed 1880 trivial Post agglomeration. Transition count delta: 1880
Iterating post reduction 0 with 1880 rules applied. Total rules applied 1880 place count 2321 transition count 2320
Reduce places removed 1880 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1899 rules applied. Total rules applied 3779 place count 441 transition count 2301
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 2 with 1737 rules applied. Total rules applied 5516 place count 404 transition count 601
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 5716 place count 304 transition count 501
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 3 with 98 rules applied. Total rules applied 5814 place count 304 transition count 403
Applied a total of 5814 rules in 57 ms. Remains 304 /2321 variables (removed 2017) and now considering 403/4200 (removed 3797) transitions.
[2021-05-19 15:14:01] [INFO ] Flow matrix only has 402 transitions (discarded 1 similar events)
// Phase 1: matrix 402 rows 304 cols
[2021-05-19 15:14:01] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-19 15:14:01] [INFO ] Implicit Places using invariants in 155 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 201]
Discarding 101 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT only with invariants took 174 ms to find 101 implicit places.
[2021-05-19 15:14:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 402 rows 203 cols
[2021-05-19 15:14:01] [INFO ] Computed 2 place invariants in 10 ms
[2021-05-19 15:14:01] [INFO ] Dead Transitions using invariants and state equation in 190 ms returned []
Starting structural reductions, iteration 1 : 203/2321 places, 402/4200 transitions.
Graph (trivial) has 198 edges and 203 vertex of which 100 / 203 are part of one of the 1 SCC in 0 ms
Free SCC test removed 99 places
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 100 place count 5 transition count 106
Iterating global reduction 0 with 99 rules applied. Total rules applied 199 place count 5 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 297 place count 5 transition count 8
Applied a total of 297 rules in 3 ms. Remains 5 /203 variables (removed 198) and now considering 8/402 (removed 394) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-19 15:14:01] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:14:01] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-19 15:14:01] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:14:01] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/2321 places, 8/4200 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 1) (AND (EQ s0 1) (EQ s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-10 finished in 523 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1881 transitions
Trivial Post-agglo rules discarded 1881 transitions
Performed 1881 trivial Post agglomeration. Transition count delta: 1881
Iterating post reduction 0 with 1881 rules applied. Total rules applied 1881 place count 2321 transition count 2319
Reduce places removed 1881 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1900 rules applied. Total rules applied 3781 place count 440 transition count 2300
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1800 transitions
Reduce isomorphic transitions removed 1800 transitions.
Iterating post reduction 2 with 1838 rules applied. Total rules applied 5619 place count 402 transition count 500
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 5819 place count 302 transition count 400
Applied a total of 5819 rules in 42 ms. Remains 302 /2321 variables (removed 2019) and now considering 400/4200 (removed 3800) transitions.
// Phase 1: matrix 400 rows 302 cols
[2021-05-19 15:14:02] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-19 15:14:02] [INFO ] Implicit Places using invariants in 145 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 146 ms to find 100 implicit places.
[2021-05-19 15:14:02] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 400 rows 202 cols
[2021-05-19 15:14:02] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-19 15:14:02] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Starting structural reductions, iteration 1 : 202/2321 places, 400/4200 transitions.
Graph (trivial) has 198 edges and 202 vertex of which 100 / 202 are part of one of the 1 SCC in 0 ms
Free SCC test removed 99 places
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 100 place count 4 transition count 104
Iterating global reduction 0 with 99 rules applied. Total rules applied 199 place count 4 transition count 104
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 297 place count 4 transition count 6
Applied a total of 297 rules in 3 ms. Remains 4 /202 variables (removed 198) and now considering 6/400 (removed 394) transitions.
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 15:14:02] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:14:02] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 15:14:02] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:14:02] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/2321 places, 6/4200 transitions.
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s0 0) (EQ s2 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-13 finished in 458 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((G(p1)&&F(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 113 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:14:02] [INFO ] Computed 121 place invariants in 41 ms
[2021-05-19 15:14:03] [INFO ] Implicit Places using invariants in 672 ms returned []
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:14:03] [INFO ] Computed 121 place invariants in 46 ms
[2021-05-19 15:14:04] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
// Phase 1: matrix 4200 rows 2321 cols
[2021-05-19 15:14:04] [INFO ] Computed 121 place invariants in 48 ms
[2021-05-19 15:14:06] [INFO ] Dead Transitions using invariants and state equation in 2153 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2321/2321 places, 4200/4200 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s942 1), p1:(NEQ s718 1), p2:(OR (NEQ s109 1) (NEQ s1917 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1400 ms.
Stack based approach found an accepted trace after 2338 steps with 0 reset with depth 2339 and stack size 911 in 34 ms.
FORMULA ServersAndClients-PT-100020-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-14 finished in 5786 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1881 transitions
Trivial Post-agglo rules discarded 1881 transitions
Performed 1881 trivial Post agglomeration. Transition count delta: 1881
Iterating post reduction 0 with 1881 rules applied. Total rules applied 1881 place count 2321 transition count 2319
Reduce places removed 1881 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1900 rules applied. Total rules applied 3781 place count 440 transition count 2300
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1800 transitions
Reduce isomorphic transitions removed 1800 transitions.
Iterating post reduction 2 with 1838 rules applied. Total rules applied 5619 place count 402 transition count 500
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 5819 place count 302 transition count 400
Applied a total of 5819 rules in 51 ms. Remains 302 /2321 variables (removed 2019) and now considering 400/4200 (removed 3800) transitions.
// Phase 1: matrix 400 rows 302 cols
[2021-05-19 15:14:08] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-19 15:14:08] [INFO ] Implicit Places using invariants in 141 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 143 ms to find 100 implicit places.
[2021-05-19 15:14:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 400 rows 202 cols
[2021-05-19 15:14:08] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-19 15:14:08] [INFO ] Dead Transitions using invariants and state equation in 183 ms returned []
Starting structural reductions, iteration 1 : 202/2321 places, 400/4200 transitions.
Graph (trivial) has 198 edges and 202 vertex of which 100 / 202 are part of one of the 1 SCC in 0 ms
Free SCC test removed 99 places
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 100 place count 4 transition count 104
Iterating global reduction 0 with 99 rules applied. Total rules applied 199 place count 4 transition count 104
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 297 place count 4 transition count 6
Applied a total of 297 rules in 2 ms. Remains 4 /202 variables (removed 198) and now considering 6/400 (removed 394) transitions.
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 15:14:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:14:08] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 15:14:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:14:08] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/2321 places, 6/4200 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-15 automaton TGBA [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:(OR (NEQ s0 1) (NEQ s2 1))], 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 8707 reset in 170 ms.
Product exploration explored 100000 steps with 8594 reset in 207 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8836 reset in 67 ms.
Product exploration explored 100000 steps with 8783 reset in 78 ms.
[2021-05-19 15:14:09] [INFO ] Flatten gal took : 1 ms
[2021-05-19 15:14:09] [INFO ] Flatten gal took : 0 ms
[2021-05-19 15:14:09] [INFO ] Time to serialize gal into /tmp/LTL1346626736944992306.gal : 0 ms
[2021-05-19 15:14:09] [INFO ] Time to serialize properties into /tmp/LTL6549001738271687198.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/LTL1346626736944992306.gal, -t, CGAL, -LTL, /tmp/LTL6549001738271687198.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/LTL1346626736944992306.gal -t CGAL -LTL /tmp/LTL6549001738271687198.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((sys_req47!=1)||(sv3!=1))"))))
Formula 0 simplified : !GF"((sys_req47!=1)||(sv3!=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.010083,16360,1,0,7,50,24,0,99,35,19
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ServersAndClients-PT-100020-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ServersAndClients-PT-100020-15 finished in 1214 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621437250335
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ServersAndClients-PT-100020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ServersAndClients-PT-100020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-162132107800125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-100020.tgz
mv ServersAndClients-PT-100020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;