About the Execution of ITS-Tools for JoinFreeModules-PT-0500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6856.915 | 1800000.00 | 2560486.00 | 13840.70 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r243-tall-167856430600129.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is JoinFreeModules-PT-0500, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r243-tall-167856430600129
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME Liveness
=== Now, execution of the tool begins
BK_START 1678689997910
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=JoinFreeModules-PT-0500
Not applying reductions.
Model is PT
Liveness PT
Running Version 202303021504
[2023-03-13 06:46:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-13 06:46:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:46:39] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-13 06:46:39] [INFO ] Transformed 2501 places.
[2023-03-13 06:46:39] [INFO ] Transformed 4001 transitions.
[2023-03-13 06:46:39] [INFO ] Parsed PT model containing 2501 places and 4001 transitions and 11502 arcs in 264 ms.
Discarding 2000 transitions out of 4001. Remains 2001
Reduce places removed 1 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 10 ms.46590KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 336 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-13 06:46:40] [INFO ] Computed 500 place invariants in 45 ms
[2023-03-13 06:46:42] [INFO ] Dead Transitions using invariants and state equation in 2203 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 2710 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 242 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-13 06:46:42] [INFO ] Invariant cache hit.
[2023-03-13 06:46:43] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-13 06:46:43] [INFO ] Invariant cache hit.
[2023-03-13 06:46:45] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-13 06:46:45] [INFO ] Implicit Places using invariants and state equation in 1805 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
[2023-03-13 06:46:45] [INFO ] Redundant transitions in 251 ms returned []
[2023-03-13 06:46:45] [INFO ] Invariant cache hit.
[2023-03-13 06:46:47] [INFO ] Dead Transitions using invariants and state equation in 1890 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 4607 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Interrupted Random walk after 1063658 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=35 )
Interrupted Random directed walk after 400271 steps, including 0 resets, run timeout after 30033 ms. (steps per millisecond=13 )
[2023-03-13 06:47:47] [INFO ] Invariant cache hit.
[2023-03-13 06:47:47] [INFO ] [Real]Absence check using 500 positive place invariants in 3 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 2501/2501 places, 4001/4001 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2500 transition count 4001
Applied a total of 1 rules in 32 ms. Remains 2500 /2501 variables (removed 1) and now considering 4001/4001 (removed 0) transitions.
[2023-03-13 06:47:48] [INFO ] Invariant cache hit.
[2023-03-13 06:47:49] [INFO ] Dead Transitions using invariants and state equation in 1868 ms found 0 transitions.
[2023-03-13 06:47:49] [INFO ] Invariant cache hit.
[2023-03-13 06:47:50] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-13 06:47:50] [INFO ] Invariant cache hit.
[2023-03-13 06:47:51] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-13 06:47:51] [INFO ] Implicit Places using invariants and state equation in 1717 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2023-03-13 06:47:52] [INFO ] Invariant cache hit.
[2023-03-13 06:47:53] [INFO ] Dead Transitions using invariants and state equation in 1864 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 2500/2501 places, 4001/4001 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 5888 ms. Remains : 2500/2501 places, 4001/4001 transitions.
Discarding 2000 transitions out of 4001. Remains 2001
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10283 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 2000) seen :46
[2023-03-13 06:47:54] [INFO ] Flatten gal took : 321 ms
[2023-03-13 06:47:54] [INFO ] Flatten gal took : 295 ms
[2023-03-13 06:47:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9160120981648218672.gal : 62 ms
[2023-03-13 06:47:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12614490289037364453.prop : 32 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9160120981648218672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12614490289037364453.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12614490289037364453.prop.
Probabilistic random walk after 14035 steps, saw 14017 distinct states, run finished after 3248 ms. (steps per millisecond=4 ) properties seen :491
Running SMT prover for 1463 properties.
[2023-03-13 06:47:57] [INFO ] Invariant cache hit.
Reachability property qltransition_3 is true.
SDD proceeding with computation,1953 properties remain. new max is 2
SDD size :1 after 8
SDD proceeding with computation,1953 properties remain. new max is 4
SDD size :8 after 17
Reachability property qltransition_1 is true.
SDD proceeding with computation,1952 properties remain. new max is 4
SDD size :17 after 39
SDD proceeding with computation,1952 properties remain. new max is 8
SDD size :39 after 69
SDD proceeding with computation,1952 properties remain. new max is 16
SDD size :69 after 144
SDD proceeding with computation,1952 properties remain. new max is 32
SDD size :144 after 359
SDD proceeding with computation,1952 properties remain. new max is 64
SDD size :359 after 1052
SDD proceeding with computation,1952 properties remain. new max is 128
SDD size :1052 after 3479
SDD proceeding with computation,1952 properties remain. new max is 256
SDD size :3479 after 12466
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:399)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 06:48:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 06:48:24] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 1463 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1462 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 2495 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2495 transition count 3992
Applied a total of 2 rules in 139 ms. Remains 2495 /2500 variables (removed 5) and now considering 3992/4001 (removed 9) transitions.
// Phase 1: matrix 3992 rows 2495 cols
[2023-03-13 06:48:24] [INFO ] Computed 499 place invariants in 31 ms
[2023-03-13 06:48:26] [INFO ] Dead Transitions using invariants and state equation in 1867 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2009 ms. Remains : 2495/2500 places, 3992/4001 transitions.
SDD proceeding with computation,1952 properties remain. new max is 512
SDD size :12466 after 46708
Incomplete random walk after 1000172 steps, including 2 resets, run finished after 24245 ms. (steps per millisecond=41 ) properties (out of 1462) seen :1408
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2416 ms. (steps per millisecond=41 ) properties (out of 54) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2400 ms. (steps per millisecond=41 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2303 ms. (steps per millisecond=43 ) properties (out of 52) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2296 ms. (steps per millisecond=43 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2292 ms. (steps per millisecond=43 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2289 ms. (steps per millisecond=43 ) properties (out of 50) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2292 ms. (steps per millisecond=43 ) properties (out of 48) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2301 ms. (steps per millisecond=43 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2303 ms. (steps per millisecond=43 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2298 ms. (steps per millisecond=43 ) properties (out of 46) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2290 ms. (steps per millisecond=43 ) properties (out of 44) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2321 ms. (steps per millisecond=43 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2294 ms. (steps per millisecond=43 ) properties (out of 43) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2298 ms. (steps per millisecond=43 ) properties (out of 41) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2308 ms. (steps per millisecond=43 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2289 ms. (steps per millisecond=43 ) properties (out of 40) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2295 ms. (steps per millisecond=43 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2293 ms. (steps per millisecond=43 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2290 ms. (steps per millisecond=43 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2292 ms. (steps per millisecond=43 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2295 ms. (steps per millisecond=43 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2309 ms. (steps per millisecond=43 ) properties (out of 37) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2308 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2309 ms. (steps per millisecond=43 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2312 ms. (steps per millisecond=43 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2313 ms. (steps per millisecond=43 ) properties (out of 33) seen :2
SDD proceeding with computation,1952 properties remain. new max is 1024
SDD size :46708 after 108311
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2309 ms. (steps per millisecond=43 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2299 ms. (steps per millisecond=43 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2307 ms. (steps per millisecond=43 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2300 ms. (steps per millisecond=43 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2300 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2297 ms. (steps per millisecond=43 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2287 ms. (steps per millisecond=43 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2300 ms. (steps per millisecond=43 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2294 ms. (steps per millisecond=43 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2288 ms. (steps per millisecond=43 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2300 ms. (steps per millisecond=43 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2289 ms. (steps per millisecond=43 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2301 ms. (steps per millisecond=43 ) properties (out of 18) seen :2
Running SMT prover for 16 properties.
[2023-03-13 06:50:20] [INFO ] Invariant cache hit.
[2023-03-13 06:50:21] [INFO ] [Real]Absence check using 499 positive place invariants in 94 ms returned sat
[2023-03-13 06:50:25] [INFO ] After 5019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-13 06:50:26] [INFO ] [Nat]Absence check using 499 positive place invariants in 95 ms returned sat
[2023-03-13 06:50:40] [INFO ] After 13875ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-13 06:50:40] [INFO ] State equation strengthened by 499 read => feed constraints.
[2023-03-13 06:50:42] [INFO ] After 1809ms SMT Verify possible using 499 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-13 06:50:42] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 4 ms to minimize.
[2023-03-13 06:50:43] [INFO ] Deduced a trap composed of 3 places in 332 ms of which 1 ms to minimize.
[2023-03-13 06:50:43] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 1 ms to minimize.
[2023-03-13 06:50:44] [INFO ] Deduced a trap composed of 3 places in 295 ms of which 3 ms to minimize.
[2023-03-13 06:50:44] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 1 ms to minimize.
[2023-03-13 06:50:44] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 0 ms to minimize.
[2023-03-13 06:50:45] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 0 ms to minimize.
[2023-03-13 06:50:45] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 1 ms to minimize.
[2023-03-13 06:50:45] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 0 ms to minimize.
[2023-03-13 06:50:46] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 1 ms to minimize.
[2023-03-13 06:50:46] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 1 ms to minimize.
[2023-03-13 06:50:46] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4031 ms
[2023-03-13 06:50:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4032 ms
[2023-03-13 06:50:47] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 1 ms to minimize.
Reachability property qltransition_8 is true.
Reachability property qltransition_7 is true.
SDD proceeding with computation,1950 properties remain. new max is 1024
SDD size :108311 after 7.62497e+07
[2023-03-13 06:50:47] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 1 ms to minimize.
[2023-03-13 06:50:47] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 1 ms to minimize.
[2023-03-13 06:50:48] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 1 ms to minimize.
[2023-03-13 06:50:48] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 1 ms to minimize.
[2023-03-13 06:50:48] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 0 ms to minimize.
[2023-03-13 06:50:49] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 1 ms to minimize.
[2023-03-13 06:50:49] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 1 ms to minimize.
[2023-03-13 06:50:49] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 1 ms to minimize.
[2023-03-13 06:50:50] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 1 ms to minimize.
[2023-03-13 06:50:50] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 1 ms to minimize.
[2023-03-13 06:50:50] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3692 ms
[2023-03-13 06:50:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3693 ms
SDD proceeding with computation,1950 properties remain. new max is 2048
SDD size :7.62497e+07 after 7.65167e+07
[2023-03-13 06:50:50] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2023-03-13 06:50:51] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 1 ms to minimize.
[2023-03-13 06:50:51] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 0 ms to minimize.
[2023-03-13 06:50:51] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 1 ms to minimize.
[2023-03-13 06:50:52] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 0 ms to minimize.
[2023-03-13 06:50:52] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 0 ms to minimize.
[2023-03-13 06:50:52] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 0 ms to minimize.
[2023-03-13 06:50:53] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 0 ms to minimize.
[2023-03-13 06:50:53] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 1 ms to minimize.
[2023-03-13 06:50:53] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 0 ms to minimize.
[2023-03-13 06:50:53] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 1 ms to minimize.
[2023-03-13 06:50:54] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 1 ms to minimize.
[2023-03-13 06:50:54] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3777 ms
[2023-03-13 06:50:54] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3778 ms
[2023-03-13 06:50:54] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 5 ms to minimize.
[2023-03-13 06:50:54] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 1 ms to minimize.
[2023-03-13 06:50:55] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 1 ms to minimize.
[2023-03-13 06:50:55] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 1 ms to minimize.
[2023-03-13 06:50:55] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 1 ms to minimize.
[2023-03-13 06:50:56] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 1 ms to minimize.
[2023-03-13 06:50:56] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 0 ms to minimize.
[2023-03-13 06:50:56] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 0 ms to minimize.
[2023-03-13 06:50:57] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 1 ms to minimize.
SDD proceeding with computation,1950 properties remain. new max is 4096
SDD size :7.65167e+07 after 2.36664e+08
[2023-03-13 06:50:57] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 1 ms to minimize.
[2023-03-13 06:50:57] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 1 ms to minimize.
[2023-03-13 06:50:57] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3361 ms
[2023-03-13 06:50:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3364 ms
[2023-03-13 06:50:58] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 0 ms to minimize.
[2023-03-13 06:50:58] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 1 ms to minimize.
[2023-03-13 06:50:58] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 1 ms to minimize.
[2023-03-13 06:50:58] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 1 ms to minimize.
[2023-03-13 06:50:59] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 1 ms to minimize.
[2023-03-13 06:50:59] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 1 ms to minimize.
[2023-03-13 06:50:59] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 0 ms to minimize.
[2023-03-13 06:51:00] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 1 ms to minimize.
[2023-03-13 06:51:00] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 0 ms to minimize.
[2023-03-13 06:51:00] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 1 ms to minimize.
[2023-03-13 06:51:00] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 8 ms to minimize.
[2023-03-13 06:51:00] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3204 ms
[2023-03-13 06:51:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3204 ms
[2023-03-13 06:51:01] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 1 ms to minimize.
[2023-03-13 06:51:01] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 1 ms to minimize.
[2023-03-13 06:51:01] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 0 ms to minimize.
[2023-03-13 06:51:02] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 0 ms to minimize.
[2023-03-13 06:51:02] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 1 ms to minimize.
[2023-03-13 06:51:02] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 2 ms to minimize.
[2023-03-13 06:51:03] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 0 ms to minimize.
[2023-03-13 06:51:03] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 1 ms to minimize.
[2023-03-13 06:51:03] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 1 ms to minimize.
[2023-03-13 06:51:03] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 1 ms to minimize.
[2023-03-13 06:51:04] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 2 ms to minimize.
[2023-03-13 06:51:04] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3136 ms
[2023-03-13 06:51:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3137 ms
[2023-03-13 06:51:04] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 7 ms to minimize.
[2023-03-13 06:51:04] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 0 ms to minimize.
[2023-03-13 06:51:05] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 0 ms to minimize.
[2023-03-13 06:51:05] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 1 ms to minimize.
[2023-03-13 06:51:05] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 1 ms to minimize.
[2023-03-13 06:51:05] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 1 ms to minimize.
[2023-03-13 06:51:06] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 0 ms to minimize.
[2023-03-13 06:51:06] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2023-03-13 06:51:06] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2023-03-13 06:51:06] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 0 ms to minimize.
[2023-03-13 06:51:07] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 1 ms to minimize.
[2023-03-13 06:51:07] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2023-03-13 06:51:07] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 1 ms to minimize.
[2023-03-13 06:51:08] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 1 ms to minimize.
[2023-03-13 06:51:08] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 0 ms to minimize.
[2023-03-13 06:51:08] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 0 ms to minimize.
[2023-03-13 06:51:08] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 0 ms to minimize.
[2023-03-13 06:51:09] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 1 ms to minimize.
[2023-03-13 06:51:09] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 1 ms to minimize.
[2023-03-13 06:51:09] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5049 ms
[2023-03-13 06:51:09] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5049 ms
[2023-03-13 06:51:09] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 1 ms to minimize.
[2023-03-13 06:51:09] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 1 ms to minimize.
[2023-03-13 06:51:10] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 1 ms to minimize.
[2023-03-13 06:51:10] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 0 ms to minimize.
[2023-03-13 06:51:10] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 0 ms to minimize.
[2023-03-13 06:51:10] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 1 ms to minimize.
[2023-03-13 06:51:11] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2023-03-13 06:51:11] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 1 ms to minimize.
[2023-03-13 06:51:11] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 1 ms to minimize.
[2023-03-13 06:51:11] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 1 ms to minimize.
[2023-03-13 06:51:12] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2023-03-13 06:51:12] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2712 ms
[2023-03-13 06:51:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2712 ms
[2023-03-13 06:51:12] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 1 ms to minimize.
[2023-03-13 06:51:12] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 1 ms to minimize.
[2023-03-13 06:51:12] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 1 ms to minimize.
[2023-03-13 06:51:13] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 1 ms to minimize.
[2023-03-13 06:51:13] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 0 ms to minimize.
[2023-03-13 06:51:13] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 0 ms to minimize.
[2023-03-13 06:51:13] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2023-03-13 06:51:14] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 0 ms to minimize.
[2023-03-13 06:51:14] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2023-03-13 06:51:14] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2023-03-13 06:51:14] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-03-13 06:51:14] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2631 ms
[2023-03-13 06:51:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2631 ms
[2023-03-13 06:51:15] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 0 ms to minimize.
[2023-03-13 06:51:15] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 0 ms to minimize.
[2023-03-13 06:51:15] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-03-13 06:51:15] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-03-13 06:51:16] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2023-03-13 06:51:16] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2023-03-13 06:51:16] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 0 ms to minimize.
[2023-03-13 06:51:16] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 1 ms to minimize.
[2023-03-13 06:51:17] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 0 ms to minimize.
[2023-03-13 06:51:17] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 0 ms to minimize.
[2023-03-13 06:51:17] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 1 ms to minimize.
[2023-03-13 06:51:17] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2589 ms
[2023-03-13 06:51:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2590 ms
[2023-03-13 06:51:17] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2023-03-13 06:51:18] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 0 ms to minimize.
[2023-03-13 06:51:18] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2023-03-13 06:51:18] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 0 ms to minimize.
[2023-03-13 06:51:18] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-03-13 06:51:18] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2023-03-13 06:51:19] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-03-13 06:51:19] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 1 ms to minimize.
[2023-03-13 06:51:19] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 1 ms to minimize.
[2023-03-13 06:51:19] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2023-03-13 06:51:20] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 1 ms to minimize.
[2023-03-13 06:51:20] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2517 ms
[2023-03-13 06:51:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2517 ms
[2023-03-13 06:51:20] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2023-03-13 06:51:20] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 1 ms to minimize.
[2023-03-13 06:51:20] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2023-03-13 06:51:21] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 0 ms to minimize.
[2023-03-13 06:51:21] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 0 ms to minimize.
[2023-03-13 06:51:21] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 0 ms to minimize.
[2023-03-13 06:51:21] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2023-03-13 06:51:21] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 0 ms to minimize.
[2023-03-13 06:51:22] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 0 ms to minimize.
[2023-03-13 06:51:22] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-03-13 06:51:22] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-03-13 06:51:22] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2408 ms
[2023-03-13 06:51:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2408 ms
[2023-03-13 06:51:22] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2023-03-13 06:51:23] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2023-03-13 06:51:23] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2023-03-13 06:51:23] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2023-03-13 06:51:23] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2023-03-13 06:51:23] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-03-13 06:51:24] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-03-13 06:51:24] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 0 ms to minimize.
[2023-03-13 06:51:24] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-03-13 06:51:24] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2023-03-13 06:51:24] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2023-03-13 06:51:24] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2304 ms
[2023-03-13 06:51:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2304 ms
[2023-03-13 06:51:25] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2023-03-13 06:51:25] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2023-03-13 06:51:25] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 0 ms to minimize.
[2023-03-13 06:51:25] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2023-03-13 06:51:26] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-03-13 06:51:26] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-03-13 06:51:26] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2023-03-13 06:51:26] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-03-13 06:51:26] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2023-03-13 06:51:27] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2023-03-13 06:51:27] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2023-03-13 06:51:27] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 0 ms to minimize.
[2023-03-13 06:51:27] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2023-03-13 06:51:27] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2596 ms
[2023-03-13 06:51:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2596 ms
[2023-03-13 06:51:27] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-03-13 06:51:28] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-03-13 06:51:28] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2023-03-13 06:51:28] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-03-13 06:51:28] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-03-13 06:51:28] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-03-13 06:51:29] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2023-03-13 06:51:29] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-03-13 06:51:29] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2023-03-13 06:51:29] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-03-13 06:51:29] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-03-13 06:51:29] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2086 ms
[2023-03-13 06:51:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2086 ms
[2023-03-13 06:51:30] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-03-13 06:51:30] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-03-13 06:51:30] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-03-13 06:51:30] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2023-03-13 06:51:30] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-03-13 06:51:30] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2023-03-13 06:51:31] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-03-13 06:51:31] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2023-03-13 06:51:31] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-03-13 06:51:31] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-03-13 06:51:31] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2023-03-13 06:51:31] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2057 ms
[2023-03-13 06:51:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2058 ms
[2023-03-13 06:51:31] [INFO ] After 51408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1902 ms.
[2023-03-13 06:51:33] [INFO ] After 68656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 2 properties in 125020 ms.
Support contains 14 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 3992/3992 transitions.
Graph (complete) has 5988 edges and 2495 vertex of which 70 are kept as prefixes of interest. Removing 2425 places using SCC suffix rule.1 ms
Discarding 2425 places :
Also discarding 3880 output transitions
Drop transitions removed 3880 transitions
Applied a total of 1 rules in 11 ms. Remains 70 /2495 variables (removed 2425) and now considering 112/3992 (removed 3880) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 70/2495 places, 112/3992 transitions.
Finished random walk after 25057 steps, including 0 resets, run visited all 14 properties in 34 ms. (steps per millisecond=736 )
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
Able to resolve query QuasiLiveness after proving 2001 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 2501/2501 places, 4001/4001 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2500 transition count 4001
Applied a total of 1 rules in 25 ms. Remains 2500 /2501 variables (removed 1) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-13 06:53:39] [INFO ] Computed 500 place invariants in 15 ms
[2023-03-13 06:53:40] [INFO ] Dead Transitions using invariants and state equation in 1891 ms found 0 transitions.
[2023-03-13 06:53:40] [INFO ] Invariant cache hit.
[2023-03-13 06:53:41] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-13 06:53:41] [INFO ] Invariant cache hit.
[2023-03-13 06:53:43] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-13 06:53:43] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 2357 ms to find 0 implicit places.
[2023-03-13 06:53:43] [INFO ] Invariant cache hit.
[2023-03-13 06:53:45] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 2500/2501 places, 4001/4001 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 6091 ms. Remains : 2500/2501 places, 4001/4001 transitions.
Discarding 2000 transitions out of 4001. Remains 2001
[2023-03-13 06:53:45] [INFO ] Flatten gal took : 110 ms
[2023-03-13 06:53:45] [INFO ] Flatten gal took : 106 ms
[2023-03-13 06:53:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14080003061519588663.gal : 17 ms
[2023-03-13 06:53:45] [INFO ] Time to serialize properties into /tmp/CTLFireability15879698003732724070.ctl : 32 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14080003061519588663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15879698003732724070.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 2001 CTL formulae.
Detected timeout of ITS tools.
[2023-03-13 06:53:48] [INFO ] Flatten gal took : 94 ms
[2023-03-13 06:53:48] [INFO ] Applying decomposition
[2023-03-13 06:53:48] [INFO ] Flatten gal took : 96 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14074568217591139233.txt' '-o' '/tmp/graph14074568217591139233.bin' '-w' '/tmp/graph14074568217591139233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14074568217591139233.bin' '-l' '-1' '-v' '-w' '/tmp/graph14074568217591139233.weights' '-q' '0' '-e' '0.001'
[2023-03-13 06:53:49] [INFO ] Decomposing Gal with order
[2023-03-13 06:53:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 06:53:49] [INFO ] Flatten gal took : 150 ms
[2023-03-13 06:53:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 64 ms.
[2023-03-13 06:53:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13702045374553365036.gal : 18 ms
[2023-03-13 06:53:49] [INFO ] Time to serialize properties into /tmp/CTLFireability11190798403427185764.ctl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13702045374553365036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11190798403427185764.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 2001 CTL formulae.
Detected timeout of ITS tools.
[2023-03-13 06:53:53] [INFO ] Flatten gal took : 220 ms
[2023-03-13 06:53:53] [INFO ] Flatten gal took : 190 ms
[2023-03-13 06:53:53] [INFO ] Time to serialize gal into /tmp/CTLFireability6429864575670711909.gal : 13 ms
[2023-03-13 06:53:53] [INFO ] Time to serialize properties into /tmp/CTLFireability2408813088822061407.ctl : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6429864575670711909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2408813088822061407.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 2001 CTL formulae.
Reachability property qltransition_11 is true.
Reachability property qltransition_9 is true.
SDD proceeding with computation,1948 properties remain. new max is 4096
SDD size :2.36664e+08 after 3.42068e+14
Detected timeout of ITS tools.
[2023-03-13 06:54:23] [INFO ] Flatten gal took : 92 ms
[2023-03-13 06:54:23] [INFO ] Applying decomposition
[2023-03-13 06:54:23] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14114923992884182317.txt' '-o' '/tmp/graph14114923992884182317.bin' '-w' '/tmp/graph14114923992884182317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14114923992884182317.bin' '-l' '-1' '-v' '-w' '/tmp/graph14114923992884182317.weights' '-q' '0' '-e' '0.001'
[2023-03-13 06:54:23] [INFO ] Decomposing Gal with order
[2023-03-13 06:54:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 06:54:24] [INFO ] Flatten gal took : 98 ms
[2023-03-13 06:54:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 46 ms.
[2023-03-13 06:54:24] [INFO ] Time to serialize gal into /tmp/CTLFireability382421569542009825.gal : 16 ms
[2023-03-13 06:54:24] [INFO ] Time to serialize properties into /tmp/CTLFireability2789699473850069076.ctl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability382421569542009825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2789699473850069076.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 2001 CTL formulae.
Reachability property qltransition_16 is true.
Reachability property qltransition_15 is true.
SDD proceeding with computation,1946 properties remain. new max is 4096
SDD size :3.42068e+14 after 6.43998e+17
Detected timeout of ITS tools.
[2023-03-13 06:54:54] [INFO ] Flatten gal took : 161 ms
[2023-03-13 06:54:54] [INFO ] Flatten gal took : 190 ms
[2023-03-13 06:54:54] [INFO ] Time to serialize gal into /tmp/CTLFireability10041778879803231615.gal : 12 ms
[2023-03-13 06:54:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5009697234024903058.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10041778879803231615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5009697234024903058.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 2001 CTL formulae.
Reachability property qltransition_24 is true.
Reachability property qltransition_23 is true.
Reachability property qltransition_19 is true.
Reachability property qltransition_17 is true.
SDD proceeding with computation,1942 properties remain. new max is 4096
SDD size :6.43998e+17 after 5.64109e+26
SDD proceeding with computation,1942 properties remain. new max is 8192
SDD size :5.64109e+26 after 1.75251e+27
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-13 06:59:54] [INFO ] Flatten gal took : 81 ms
[2023-03-13 06:59:54] [INFO ] Applying decomposition
[2023-03-13 06:59:55] [INFO ] Flatten gal took : 86 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12498868585839426182.txt' '-o' '/tmp/graph12498868585839426182.bin' '-w' '/tmp/graph12498868585839426182.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12498868585839426182.bin' '-l' '-1' '-v' '-w' '/tmp/graph12498868585839426182.weights' '-q' '0' '-e' '0.001'
[2023-03-13 06:59:55] [INFO ] Decomposing Gal with order
[2023-03-13 06:59:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 06:59:55] [INFO ] Flatten gal took : 91 ms
[2023-03-13 06:59:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 49 ms.
[2023-03-13 06:59:55] [INFO ] Time to serialize gal into /tmp/CTLFireability16065404833831329082.gal : 14 ms
[2023-03-13 06:59:55] [INFO ] Time to serialize properties into /tmp/CTLFireability10202560680078713399.ctl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16065404833831329082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10202560680078713399.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 2001 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.15563e+4717,215.5,1700612,502,3519,2504,2.51885e+06,1543,503,75,3.13848e+06,0
Converting to forward existential form...Done !
original formula: AG(EF(((((((((((u0.p3>=500)&&(u1.p8>=500))&&((u2.p13>=500)&&(u3.p18>=500)))&&(((u4.p23>=500)&&(u5.p28>=500))&&((u6.p33>=500)&&(u7.p38>=50...10190
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((u0.p3>=500)&&(u1.p8>=500))&&((u2.p13>=500)&&(u3.p18>=500)))&&(((u4.p23>...10250
Reverse transition relation is NOT exact ! Due to transitions u0.t1, u0.t2, u0.t3, u0.t4, u0.t8, u1.t9, u1.t10, u1.t11, u1.t12, u1.t16, u2.t17, u2.t18, u2....28923
Detected timeout of ITS tools.
[2023-03-13 07:04:55] [INFO ] Flatten gal took : 90 ms
[2023-03-13 07:04:55] [INFO ] Flatten gal took : 95 ms
[2023-03-13 07:04:55] [INFO ] Time to serialize gal into /tmp/CTLFireability7102729539014456932.gal : 13 ms
[2023-03-13 07:04:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17907268369906126832.ctl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7102729539014456932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17907268369906126832.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 2001 CTL formulae.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 9697932 kB
After kill :
MemTotal: 16393216 kB
MemFree: 13455716 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="JoinFreeModules-PT-0500"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5348"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-0500, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r243-tall-167856430600129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0500.tgz
mv JoinFreeModules-PT-0500 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;