fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r042-tajo-167813696200737
Last Updated
May 14, 2023

About the Execution of Marcie+red for CANInsertWithFailure-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10017.823 3577683.00 3648286.00 402.90 T??????????????? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696200737.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANInsertWithFailure-PT-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696200737
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.8K Feb 26 00:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 00:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 00:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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

here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678746523699

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 22:28:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 22:28:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:28:46] [INFO ] Load time of PNML (sax parser for PT used): 483 ms
[2023-03-13 22:28:46] [INFO ] Transformed 5604 places.
[2023-03-13 22:28:46] [INFO ] Transformed 15300 transitions.
[2023-03-13 22:28:46] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 641 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 167 out of 5604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5603 transition count 15300
Applied a total of 1 rules in 827 ms. Remains 5603 /5604 variables (removed 1) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-13 22:28:48] [INFO ] Computed 52 place invariants in 1163 ms
[2023-03-13 22:28:49] [INFO ] Implicit Places using invariants in 2670 ms returned []
Implicit Place search using SMT only with invariants took 2697 ms to find 0 implicit places.
[2023-03-13 22:28:49] [INFO ] Invariant cache hit.
[2023-03-13 22:28:57] [INFO ] Dead Transitions using invariants and state equation in 7935 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5603/5604 places, 15300/15300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11464 ms. Remains : 5603/5604 places, 15300/15300 transitions.
Support contains 167 out of 5603 places after structural reductions.
[2023-03-13 22:28:58] [INFO ] Flatten gal took : 478 ms
[2023-03-13 22:28:58] [INFO ] Flatten gal took : 326 ms
[2023-03-13 22:28:59] [INFO ] Input system was already deterministic with 15300 transitions.
Support contains 164 out of 5603 places (down from 167) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 596 ms. (steps per millisecond=16 ) properties (out of 100) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 67) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Running SMT prover for 65 properties.
[2023-03-13 22:29:00] [INFO ] Invariant cache hit.
[2023-03-13 22:29:08] [INFO ] After 7874ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:65
[2023-03-13 22:29:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 112 ms returned sat
[2023-03-13 22:29:16] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 123 ms returned sat
[2023-03-13 22:29:33] [INFO ] After 9794ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :64
[2023-03-13 22:29:33] [INFO ] State equation strengthened by 4950 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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 22:29:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 22:29:33] [INFO ] After 25199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:65
Fused 65 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 360 ms.
Support contains 108 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 344 transitions
Trivial Post-agglo rules discarded 344 transitions
Performed 344 trivial Post agglomeration. Transition count delta: 344
Iterating post reduction 0 with 344 rules applied. Total rules applied 344 place count 5603 transition count 14956
Reduce places removed 344 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 346 rules applied. Total rules applied 690 place count 5259 transition count 14954
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 692 place count 5257 transition count 14954
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 692 place count 5257 transition count 14953
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 694 place count 5256 transition count 14953
Performed 2340 Post agglomeration using F-continuation condition.Transition count delta: 2340
Deduced a syphon composed of 2340 places in 14 ms
Reduce places removed 2340 places and 0 transitions.
Iterating global reduction 3 with 4680 rules applied. Total rules applied 5374 place count 2916 transition count 12613
Drop transitions removed 2248 transitions
Redundant transition composition rules discarded 2248 transitions
Iterating global reduction 3 with 2248 rules applied. Total rules applied 7622 place count 2916 transition count 10365
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7624 place count 2916 transition count 10363
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 7626 place count 2914 transition count 10363
Partial Free-agglomeration rule applied 2606 times.
Drop transitions removed 2606 transitions
Iterating global reduction 4 with 2606 rules applied. Total rules applied 10232 place count 2914 transition count 10363
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 4 with 99 rules applied. Total rules applied 10331 place count 2914 transition count 10363
Applied a total of 10331 rules in 4059 ms. Remains 2914 /5603 variables (removed 2689) and now considering 10363/15300 (removed 4937) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4060 ms. Remains : 2914/5603 places, 10363/15300 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 64) seen :22
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Running SMT prover for 42 properties.
// Phase 1: matrix 10363 rows 2914 cols
[2023-03-13 22:29:39] [INFO ] Computed 52 place invariants in 451 ms
[2023-03-13 22:29:41] [INFO ] [Real]Absence check using 50 positive place invariants in 30 ms returned sat
[2023-03-13 22:29:41] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-13 22:29:41] [INFO ] After 2173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:42
[2023-03-13 22:29:43] [INFO ] [Nat]Absence check using 50 positive place invariants in 22 ms returned sat
[2023-03-13 22:29:43] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-13 22:29:58] [INFO ] After 14304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :42
[2023-03-13 22:29:58] [INFO ] State equation strengthened by 9786 read => feed constraints.
[2023-03-13 22:30:06] [INFO ] After 8004ms SMT Verify possible using 9786 Read/Feed constraints in natural domain returned unsat :0 sat :42
[2023-03-13 22:30:06] [INFO ] After 8007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :42
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-13 22:30:06] [INFO ] After 25076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :42
Parikh walk visited 3 properties in 1246 ms.
Support contains 71 out of 2914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2914/2914 places, 10363/10363 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 2896 transition count 10345
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 55 place count 2896 transition count 10345
Applied a total of 55 rules in 1112 ms. Remains 2896 /2914 variables (removed 18) and now considering 10345/10363 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1113 ms. Remains : 2896/2914 places, 10345/10363 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 39) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
// Phase 1: matrix 10345 rows 2896 cols
[2023-03-13 22:30:09] [INFO ] Computed 52 place invariants in 347 ms
[2023-03-13 22:30:11] [INFO ] [Real]Absence check using 50 positive place invariants in 35 ms returned sat
[2023-03-13 22:30:11] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 43 ms returned sat
[2023-03-13 22:30:11] [INFO ] After 1680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-13 22:30:12] [INFO ] [Nat]Absence check using 50 positive place invariants in 53 ms returned sat
[2023-03-13 22:30:12] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 55 ms returned sat
[2023-03-13 22:30:26] [INFO ] After 12086ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-13 22:30:26] [INFO ] State equation strengthened by 9890 read => feed constraints.
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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 22:30:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 22:30:36] [INFO ] After 25055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:32
Parikh walk visited 3 properties in 1135 ms.
Support contains 54 out of 2896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2896/2896 places, 10345/10345 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 2886 transition count 10335
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 2886 transition count 10335
Applied a total of 27 rules in 1050 ms. Remains 2886 /2896 variables (removed 10) and now considering 10335/10345 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1051 ms. Remains : 2886/2896 places, 10335/10345 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 29) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 10335 rows 2886 cols
[2023-03-13 22:30:39] [INFO ] Computed 52 place invariants in 446 ms
[2023-03-13 22:30:41] [INFO ] [Real]Absence check using 50 positive place invariants in 31 ms returned sat
[2023-03-13 22:30:41] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 40 ms returned sat
[2023-03-13 22:30:41] [INFO ] After 1519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-13 22:30:42] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2023-03-13 22:30:42] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 66 ms returned sat
[2023-03-13 22:30:53] [INFO ] After 9824ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-13 22:30:53] [INFO ] State equation strengthened by 9917 read => feed constraints.
[2023-03-13 22:31:06] [INFO ] After 12845ms SMT Verify possible using 9917 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2023-03-13 22:31:06] [INFO ] After 12851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-13 22:31:06] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 2 properties in 1046 ms.
Support contains 41 out of 2886 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2886/2886 places, 10335/10335 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 2877 transition count 10326
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 2877 transition count 10326
Applied a total of 22 rules in 1073 ms. Remains 2877 /2886 variables (removed 9) and now considering 10326/10335 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1073 ms. Remains : 2877/2886 places, 10326/10335 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-13 22:31:08] [INFO ] Flatten gal took : 251 ms
[2023-03-13 22:31:09] [INFO ] Flatten gal took : 281 ms
[2023-03-13 22:31:09] [INFO ] Input system was already deterministic with 15300 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 800 place count 5203 transition count 14900
Applied a total of 800 rules in 1323 ms. Remains 5203 /5603 variables (removed 400) and now considering 14900/15300 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1326 ms. Remains : 5203/5603 places, 14900/15300 transitions.
[2023-03-13 22:31:11] [INFO ] Flatten gal took : 224 ms
[2023-03-13 22:31:11] [INFO ] Flatten gal took : 246 ms
[2023-03-13 22:31:12] [INFO ] Input system was already deterministic with 14900 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 163789 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163789 steps, saw 122299 distinct states, run finished after 3006 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14900 rows 5203 cols
[2023-03-13 22:31:16] [INFO ] Computed 52 place invariants in 1231 ms
[2023-03-13 22:31:17] [INFO ] [Real]Absence check using 50 positive place invariants in 75 ms returned sat
[2023-03-13 22:31:17] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 89 ms returned sat
[2023-03-13 22:31:22] [INFO ] After 4933ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 22:31:22] [INFO ] State equation strengthened by 5000 read => feed constraints.
[2023-03-13 22:31:24] [INFO ] After 1593ms SMT Verify possible using 5000 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 22:31:24] [INFO ] After 7552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 22:31:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 77 ms returned sat
[2023-03-13 22:31:25] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 127 ms returned sat
[2023-03-13 22:31:30] [INFO ] After 5766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 22:31:33] [INFO ] After 2513ms SMT Verify possible using 5000 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 22:31:34] [INFO ] After 3140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 516 ms.
[2023-03-13 22:31:34] [INFO ] After 10331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
FORMULA CANInsertWithFailure-PT-050-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 514 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 515 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:31:35] [INFO ] Flatten gal took : 311 ms
[2023-03-13 22:31:35] [INFO ] Flatten gal took : 350 ms
[2023-03-13 22:31:36] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 5 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 800 place count 5203 transition count 14900
Applied a total of 800 rules in 1408 ms. Remains 5203 /5603 variables (removed 400) and now considering 14900/15300 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1408 ms. Remains : 5203/5603 places, 14900/15300 transitions.
[2023-03-13 22:31:38] [INFO ] Flatten gal took : 259 ms
[2023-03-13 22:31:38] [INFO ] Flatten gal took : 303 ms
[2023-03-13 22:31:39] [INFO ] Input system was already deterministic with 14900 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 568 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:31:40] [INFO ] Flatten gal took : 323 ms
[2023-03-13 22:31:40] [INFO ] Flatten gal took : 371 ms
[2023-03-13 22:31:41] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 568 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 568 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:31:42] [INFO ] Flatten gal took : 276 ms
[2023-03-13 22:31:42] [INFO ] Flatten gal took : 348 ms
[2023-03-13 22:31:43] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 490 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:31:44] [INFO ] Flatten gal took : 210 ms
[2023-03-13 22:31:44] [INFO ] Flatten gal took : 248 ms
[2023-03-13 22:31:44] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 479 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:31:45] [INFO ] Flatten gal took : 276 ms
[2023-03-13 22:31:45] [INFO ] Flatten gal took : 285 ms
[2023-03-13 22:31:46] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 485 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:31:47] [INFO ] Flatten gal took : 240 ms
[2023-03-13 22:31:47] [INFO ] Flatten gal took : 236 ms
[2023-03-13 22:31:48] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 7 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 800 place count 5203 transition count 14900
Applied a total of 800 rules in 1464 ms. Remains 5203 /5603 variables (removed 400) and now considering 14900/15300 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1464 ms. Remains : 5203/5603 places, 14900/15300 transitions.
[2023-03-13 22:31:49] [INFO ] Flatten gal took : 205 ms
[2023-03-13 22:31:50] [INFO ] Flatten gal took : 247 ms
[2023-03-13 22:31:50] [INFO ] Input system was already deterministic with 14900 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 673 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:31:51] [INFO ] Flatten gal took : 267 ms
[2023-03-13 22:31:52] [INFO ] Flatten gal took : 250 ms
[2023-03-13 22:31:52] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 489 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 490 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:31:53] [INFO ] Flatten gal took : 215 ms
[2023-03-13 22:31:53] [INFO ] Flatten gal took : 301 ms
[2023-03-13 22:31:54] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 468 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 469 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:31:55] [INFO ] Flatten gal took : 218 ms
[2023-03-13 22:31:55] [INFO ] Flatten gal took : 307 ms
[2023-03-13 22:31:55] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 482 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:31:56] [INFO ] Flatten gal took : 293 ms
[2023-03-13 22:31:57] [INFO ] Flatten gal took : 243 ms
[2023-03-13 22:31:57] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 6 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 800 place count 5203 transition count 14900
Applied a total of 800 rules in 1447 ms. Remains 5203 /5603 variables (removed 400) and now considering 14900/15300 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1448 ms. Remains : 5203/5603 places, 14900/15300 transitions.
[2023-03-13 22:31:59] [INFO ] Flatten gal took : 336 ms
[2023-03-13 22:31:59] [INFO ] Flatten gal took : 378 ms
[2023-03-13 22:32:00] [INFO ] Input system was already deterministic with 14900 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 480 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:32:01] [INFO ] Flatten gal took : 243 ms
[2023-03-13 22:32:01] [INFO ] Flatten gal took : 319 ms
[2023-03-13 22:32:02] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 473 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:32:03] [INFO ] Flatten gal took : 293 ms
[2023-03-13 22:32:03] [INFO ] Flatten gal took : 348 ms
[2023-03-13 22:32:04] [INFO ] Input system was already deterministic with 15300 transitions.
[2023-03-13 22:32:04] [INFO ] Flatten gal took : 251 ms
[2023-03-13 22:32:04] [INFO ] Flatten gal took : 314 ms
[2023-03-13 22:32:04] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-13 22:32:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5603 places, 15300 transitions and 40900 arcs took 56 ms.
Total runtime 199284 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 5603 NrTr: 15300 NrArc: 40900)

parse formulas
formulas created successfully
place and transition orderings generation:0m 7.601sec

net check time: 0m 0.011sec

init dd package: 0m 3.305sec


before gc: list nodes free: 1457519

after gc: idd nodes used:46154071, unused:17845929; list nodes free:73182778

RS generation: 55m18.903sec


-> last computed set: #nodes 46149086 (4.6e+07) #states 62,652,558 (7)


CANNOT_COMPUTE


BK_STOP 1678750101382

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.639sec

idd.cc:820: DD Exception: No free nodes

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="CANInsertWithFailure-PT-050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is CANInsertWithFailure-PT-050, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696200737"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-050.tgz
mv CANInsertWithFailure-PT-050 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;