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.r043-tajo-167813697300758.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 smartxred
Input is CANInsertWithFailure-PT-070, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697300758
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 7.2K Feb 26 00:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K 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.0K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 00:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 00:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:46 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 30M 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-070-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678803892543

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-070
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 14:24:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 14:24:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:24:54] [INFO ] Load time of PNML (sax parser for PT used): 740 ms
[2023-03-14 14:24:54] [INFO ] Transformed 10644 places.
[2023-03-14 14:24:55] [INFO ] Transformed 29820 transitions.
[2023-03-14 14:24:55] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 891 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 767 ms. (steps per millisecond=13 ) properties (out of 16) seen :3
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 29820 rows 10644 cols
[2023-03-14 14:25:01] [INFO ] Computed 73 place invariants in 5425 ms
[2023-03-14 14:25:05] [INFO ] [Real]Absence check using 71 positive place invariants in 159 ms returned sat
[2023-03-14 14:25:06] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 270 ms returned sat
[2023-03-14 14:25:06] [INFO ] After 4413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-14 14:25:09] [INFO ] [Nat]Absence check using 71 positive place invariants in 156 ms returned sat
[2023-03-14 14:25:09] [INFO ] [Nat]Absence check using 71 positive and 2 generalized place invariants in 241 ms returned sat
[2023-03-14 14:25:31] [INFO ] After 19401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-14 14:25:31] [INFO ] State equation strengthened by 9730 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.Application.startNoEx(Application.java:902)
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-14 14:25:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:25:31] [INFO ] After 25147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 234 out of 10644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Graph (complete) has 40251 edges and 10644 vertex of which 10643 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.34 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 451 transitions
Trivial Post-agglo rules discarded 451 transitions
Performed 451 trivial Post agglomeration. Transition count delta: 451
Iterating post reduction 0 with 451 rules applied. Total rules applied 452 place count 10643 transition count 29369
Reduce places removed 451 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 462 rules applied. Total rules applied 914 place count 10192 transition count 29358
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 925 place count 10181 transition count 29358
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 925 place count 10181 transition count 29348
Deduced a syphon composed of 10 places in 17 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 945 place count 10171 transition count 29348
Performed 4123 Post agglomeration using F-continuation condition.Transition count delta: 4123
Deduced a syphon composed of 4123 places in 21 ms
Reduce places removed 4123 places and 0 transitions.
Iterating global reduction 3 with 8246 rules applied. Total rules applied 9191 place count 6048 transition count 25225
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9195 place count 6048 transition count 25221
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 9199 place count 6044 transition count 25221
Partial Free-agglomeration rule applied 5836 times.
Drop transitions removed 5836 transitions
Iterating global reduction 4 with 5836 rules applied. Total rules applied 15035 place count 6044 transition count 25221
Partial Free-agglomeration rule applied 843 times.
Drop transitions removed 843 transitions
Iterating global reduction 4 with 843 rules applied. Total rules applied 15878 place count 6044 transition count 25221
Applied a total of 15878 rules in 9135 ms. Remains 6044 /10644 variables (removed 4600) and now considering 25221/29820 (removed 4599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9141 ms. Remains : 6044/10644 places, 25221/29820 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 13) seen :2
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-14 14:25:41] [INFO ] Flow matrix only has 25141 transitions (discarded 80 similar events)
// Phase 1: matrix 25141 rows 6044 cols
[2023-03-14 14:25:43] [INFO ] Computed 72 place invariants in 1897 ms
[2023-03-14 14:25:45] [INFO ] [Real]Absence check using 70 positive place invariants in 94 ms returned sat
[2023-03-14 14:25:45] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 106 ms returned sat
[2023-03-14 14:25:45] [INFO ] After 2193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-14 14:25:47] [INFO ] [Nat]Absence check using 70 positive place invariants in 102 ms returned sat
[2023-03-14 14:25:47] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 109 ms returned sat
[2023-03-14 14:26:04] [INFO ] After 16035ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-14 14:26:04] [INFO ] State equation strengthened by 22129 read => feed constraints.
[2023-03-14 14:26:10] [INFO ] After 5729ms SMT Verify possible using 22129 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-14 14:26:10] [INFO ] After 5733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-14 14:26:10] [INFO ] After 25088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 100 ms.
Support contains 194 out of 6044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6044/6044 places, 25221/25221 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6044 transition count 25220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6043 transition count 25220
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 8 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 46 place count 6021 transition count 25198
Partial Free-agglomeration rule applied 297 times.
Drop transitions removed 297 transitions
Iterating global reduction 2 with 297 rules applied. Total rules applied 343 place count 6021 transition count 25198
Applied a total of 343 rules in 3229 ms. Remains 6021 /6044 variables (removed 23) and now considering 25198/25221 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3230 ms. Remains : 6021/6044 places, 25198/25221 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 11) seen :2
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-14 14:26:14] [INFO ] Flow matrix only has 25129 transitions (discarded 69 similar events)
// Phase 1: matrix 25129 rows 6021 cols
[2023-03-14 14:26:16] [INFO ] Computed 72 place invariants in 1712 ms
[2023-03-14 14:26:17] [INFO ] After 1190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 14:26:18] [INFO ] [Nat]Absence check using 70 positive place invariants in 64 ms returned sat
[2023-03-14 14:26:18] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 107 ms returned sat
[2023-03-14 14:26:37] [INFO ] After 17428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 14:26:37] [INFO ] State equation strengthened by 22701 read => feed constraints.
[2023-03-14 14:26:42] [INFO ] After 5015ms SMT Verify possible using 22701 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-14 14:26:42] [INFO ] After 5018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-14 14:26:42] [INFO ] After 25091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 58 ms.
Support contains 180 out of 6021 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6021/6021 places, 25198/25198 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 6014 transition count 25191
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 6014 transition count 25191
Applied a total of 21 rules in 3592 ms. Remains 6014 /6021 variables (removed 7) and now considering 25191/25198 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3593 ms. Remains : 6014/6021 places, 25191/25198 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 9) seen :1
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-14 14:26:47] [INFO ] Flow matrix only has 25127 transitions (discarded 64 similar events)
// Phase 1: matrix 25127 rows 6014 cols
[2023-03-14 14:26:48] [INFO ] Computed 72 place invariants in 1515 ms
[2023-03-14 14:26:50] [INFO ] After 1602ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 14:26:52] [INFO ] [Nat]Absence check using 70 positive place invariants in 98 ms returned sat
[2023-03-14 14:26:52] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 113 ms returned sat
[2023-03-14 14:27:10] [INFO ] After 16900ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-14 14:27:10] [INFO ] State equation strengthened by 22727 read => feed constraints.
[2023-03-14 14:27:15] [INFO ] After 5073ms SMT Verify possible using 22727 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-14 14:27:15] [INFO ] After 5073ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-14 14:27:15] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 141 out of 6014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6014/6014 places, 25191/25191 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 5989 transition count 25166
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 66 place count 5989 transition count 25166
Applied a total of 66 rules in 3063 ms. Remains 5989 /6014 variables (removed 25) and now considering 25166/25191 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3063 ms. Remains : 5989/6014 places, 25166/25191 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 102199 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102199 steps, saw 97452 distinct states, run finished after 3004 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-14 14:27:22] [INFO ] Flow matrix only has 25114 transitions (discarded 52 similar events)
// Phase 1: matrix 25114 rows 5989 cols
[2023-03-14 14:27:23] [INFO ] Computed 72 place invariants in 1688 ms
[2023-03-14 14:27:25] [INFO ] After 1461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 14:27:27] [INFO ] [Nat]Absence check using 70 positive place invariants in 99 ms returned sat
[2023-03-14 14:27:27] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 117 ms returned sat
[2023-03-14 14:27:43] [INFO ] After 15134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-14 14:27:43] [INFO ] State equation strengthened by 22954 read => feed constraints.
[2023-03-14 14:27:50] [INFO ] After 7157ms SMT Verify possible using 22954 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-14 14:27:50] [INFO ] After 7158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-14 14:27:50] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 141 out of 5989 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5989/5989 places, 25166/25166 transitions.
Applied a total of 0 rules in 1195 ms. Remains 5989 /5989 variables (removed 0) and now considering 25166/25166 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1196 ms. Remains : 5989/5989 places, 25166/25166 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5989/5989 places, 25166/25166 transitions.
Applied a total of 0 rules in 965 ms. Remains 5989 /5989 variables (removed 0) and now considering 25166/25166 (removed 0) transitions.
[2023-03-14 14:27:52] [INFO ] Flow matrix only has 25114 transitions (discarded 52 similar events)
[2023-03-14 14:27:52] [INFO ] Invariant cache hit.
[2023-03-14 14:27:57] [INFO ] Implicit Places using invariants in 4397 ms returned []
Implicit Place search using SMT only with invariants took 4399 ms to find 0 implicit places.
[2023-03-14 14:27:57] [INFO ] Flow matrix only has 25114 transitions (discarded 52 similar events)
[2023-03-14 14:27:57] [INFO ] Invariant cache hit.
[2023-03-14 14:28:10] [INFO ] Dead Transitions using invariants and state equation in 13143 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18514 ms. Remains : 5989/5989 places, 25166/25166 transitions.
Graph (trivial) has 22237 edges and 5989 vertex of which 4484 / 5989 are part of one of the 2 SCC in 8 ms
Free SCC test removed 4482 places
Drop transitions removed 15334 transitions
Ensure Unique test removed 4720 transitions
Reduce isomorphic transitions removed 20054 transitions.
Graph (complete) has 5720 edges and 1507 vertex of which 1311 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.2 ms
Discarding 196 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 861 transitions
Reduce isomorphic transitions removed 861 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 863 rules applied. Total rules applied 865 place count 1311 transition count 4190
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 869 place count 1309 transition count 4188
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 869 place count 1309 transition count 4181
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 883 place count 1302 transition count 4181
Discarding 724 places :
Symmetric choice reduction at 2 with 724 rule applications. Total rules 1607 place count 578 transition count 2198
Iterating global reduction 2 with 724 rules applied. Total rules applied 2331 place count 578 transition count 2198
Ensure Unique test removed 481 transitions
Reduce isomorphic transitions removed 481 transitions.
Iterating post reduction 2 with 481 rules applied. Total rules applied 2812 place count 578 transition count 1717
Discarding 164 places :
Symmetric choice reduction at 3 with 164 rule applications. Total rules 2976 place count 414 transition count 1389
Iterating global reduction 3 with 164 rules applied. Total rules applied 3140 place count 414 transition count 1389
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Iterating post reduction 3 with 164 rules applied. Total rules applied 3304 place count 414 transition count 1225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3306 place count 413 transition count 1224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3307 place count 413 transition count 1223
Drop transitions removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 5 with 91 rules applied. Total rules applied 3398 place count 413 transition count 1132
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 5 with 25 rules applied. Total rules applied 3423 place count 413 transition count 1107
Reduce places removed 25 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 6 with 32 rules applied. Total rules applied 3455 place count 388 transition count 1100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 3462 place count 381 transition count 1100
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 3467 place count 376 transition count 1093
Iterating global reduction 8 with 5 rules applied. Total rules applied 3472 place count 376 transition count 1093
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 3508 place count 358 transition count 1075
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 3526 place count 358 transition count 1057
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3530 place count 356 transition count 1056
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3532 place count 356 transition count 1054
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 3539 place count 356 transition count 1047
Free-agglomeration rule applied 144 times with reduction of 12 identical transitions.
Iterating global reduction 10 with 144 rules applied. Total rules applied 3683 place count 356 transition count 891
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 10 with 348 rules applied. Total rules applied 4031 place count 212 transition count 687
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 11 with 17 rules applied. Total rules applied 4048 place count 212 transition count 670
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 11 with 12 rules applied. Total rules applied 4060 place count 212 transition count 670
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 11 with 34 rules applied. Total rules applied 4094 place count 200 transition count 648
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 4097 place count 200 transition count 645
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 12 with 49 rules applied. Total rules applied 4146 place count 200 transition count 645
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 4147 place count 200 transition count 644
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 4148 place count 199 transition count 643
Iterating global reduction 13 with 1 rules applied. Total rules applied 4149 place count 199 transition count 643
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 4153 place count 195 transition count 639
Applied a total of 4153 rules in 1033 ms. Remains 195 /5989 variables (removed 5794) and now considering 639/25166 (removed 24527) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 639 rows 195 cols
[2023-03-14 14:28:11] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-14 14:28:11] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 14:28:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-14 14:28:11] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-14 14:28:11] [INFO ] After 533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-14 14:28:12] [INFO ] After 830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-14 14:28:12] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-14 14:28:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5989 places, 25166 transitions and 98442 arcs took 75 ms.
[2023-03-14 14:28:13] [INFO ] Flatten gal took : 884 ms
Total runtime 199469 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANInsertWithFailure (PT), instance 070
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 5989 places, 25166 transitions, 98442 arcs.
Final Score: 3.7689521445E7
Took : 338 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: CANInsertWithFailure-PT-070-ReachabilityCardinality-03 (reachable & potential(( ( ( (! ( (tk(P828)) <= (tk(P1938)) )) & ( (tk(P3107)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P591)) ) & ( ( 1 ) <= (tk(P3057)) ) ) ) & ( ( ( ( ( (tk(P2707)) <= (tk(P186)) ) | ( (tk(P104)) <= ( 0 ) ) ) | ( (! ( (tk(P2171)) <= ( 1 ) )) | (! ( (tk(P2939)) <= ( 1 ) )) ) ) & ( ( ( (tk(P4821)) <= ( 1 ) ) & ( ( ( 1 ) <= (tk(P1434)) ) | ( (! ( ( 1 ) <= (tk(P3433)) )) & ( (tk(P1359)) <= ( 1 ) ) ) ) ) | ( ( (tk(P2356)) <= ( 0 ) ) & ( (! ( (tk(P3877)) <= (tk(P2611)) )) & ( (tk(P4326)) <= ( 0 ) ) ) ) ) ) & ( ( ( (tk(P289)) <= (tk(P4311)) ) | ( (! ( (tk(P5442)) <= (tk(P5785)) )) & ( ( 1 ) <= (tk(P1577)) ) ) ) & ( ( (! ( (tk(P64)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P5351)) ) ) | ( ( ( (! ( (tk(P4187)) <= ( 0 ) )) & ( (! ( ( 1 ) <= (tk(P508)) )) & (! ( (tk(P4595)) <= ( 0 ) )) ) ) & ( (! ( (tk(P2022)) <= ( 0 ) )) & ( (! ( ( 1 ) <= (tk(P5527)) )) & ( (! ( (tk(P1111)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P2727)) )) ) ) ) ) | ( ( ( 1 ) <= (tk(P1445)) ) & ( ( (tk(P1007)) <= ( 0 ) ) & ( (! ( (tk(P3424)) <= ( 1 ) )) | (! ( (tk(P2216)) <= ( 0 ) )) ) ) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-070-ReachabilityCardinality-04 (reachable & potential(( (! ( (tk(P3279)) <= (tk(P2231)) )) & ( (! ( (tk(P3401)) <= (tk(P4155)) )) & (! ( ( 1 ) <= (tk(P3950)) )) ) )))
PROPERTY: CANInsertWithFailure-PT-070-ReachabilityCardinality-06 (reachable &!potential( ( (tk(P2217)) <= ( 1 ) )))
PROPERTY: CANInsertWithFailure-PT-070-ReachabilityCardinality-07 (reachable & potential(( (! ( ( 1 ) <= (tk(P1966)) )) & ( ( (tk(P3408)) <= (tk(P221)) ) & ( ( ( ( ( 1 ) <= (tk(P4796)) ) & (! ( (tk(P3213)) <= (tk(P1050)) )) ) & ( ( (tk(P1188)) <= ( 1 ) ) & ( (tk(P3557)) <= ( 1 ) ) ) ) | ( ( ( (! ( (tk(P5601)) <= (tk(P5256)) )) & ( ( 1 ) <= (tk(P2613)) ) ) & ( ( ( 1 ) <= (tk(P587)) ) & ( (tk(P5385)) <= ( 0 ) ) ) ) | ( (! ( (tk(P2582)) <= (tk(P4999)) )) & ( (! ( (tk(P5114)) <= ( 0 ) )) & ( (tk(P5143)) <= (tk(P851)) ) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-070-ReachabilityCardinality-08 (reachable & potential(( ( (tk(P2276)) <= (tk(P4271)) ) & ( ( ( 1 ) <= (tk(P2815)) ) & ( ( (tk(P3321)) <= (tk(P82)) ) | ( ( ( ( (tk(P4272)) <= (tk(P790)) ) & (! ( (tk(P225)) <= (tk(P895)) )) ) & ( (! ( (tk(P530)) <= (tk(P280)) )) & (! ( ( 1 ) <= (tk(P21)) )) ) ) & ( ( ( (tk(P4016)) <= ( 1 ) ) & (! ( ( 1 ) <= (tk(P3050)) )) ) & ( ( ( (tk(P2790)) <= (tk(P5333)) ) | ( ( ( (tk(P3661)) <= (tk(P373)) ) & ( (tk(P3823)) <= ( 1 ) ) ) | ( (! ( ( 1 ) <= (tk(P1335)) )) & ( ( (tk(P1580)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P3582)) ) ) ) ) ) & ( ( ( ( (tk(P4476)) <= (tk(P3567)) ) | ( ( 1 ) <= (tk(P1851)) ) ) | ( ( (tk(P511)) <= ( 0 ) ) | ( (tk(P1890)) <= (tk(P927)) ) ) ) & ( (! ( (tk(P2038)) <= (tk(P4844)) )) | (! ( (tk(P4796)) <= (tk(P3940)) )) ) ) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-070-ReachabilityCardinality-11 (reachable &!potential( ( (tk(P174)) <= ( 1 ) )))
PROPERTY: CANInsertWithFailure-PT-070-ReachabilityCardinality-13 (reachable & potential(( ( ( ( (tk(P1588)) <= (tk(P4014)) ) & ( ( 1 ) <= (tk(P1562)) ) ) & ( ( (tk(P1665)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P593)) ) ) ) & ( ( ( (tk(P230)) <= ( 0 ) ) & ( (! ( (tk(P402)) <= ( 1 ) )) | ( ( (! ( ( 1 ) <= (tk(P5563)) )) & (! ( ( 1 ) <= (tk(P5144)) )) ) | ( ( (! ( ( 1 ) <= (tk(P674)) )) & (! ( (tk(P1420)) <= ( 0 ) )) ) & ( ( (! ( ( 1 ) <= (tk(P2597)) )) | (! ( ( 1 ) <= (tk(P5949)) )) ) & ( ( (tk(P5046)) <= ( 0 ) ) | ( ( (tk(P3641)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1465)) ) ) ) ) ) ) ) ) & ( ( ( ( 1 ) <= (tk(P4228)) ) | ( ( (tk(P169)) <= (tk(P2572)) ) | ( (tk(P560)) <= ( 1 ) ) ) ) & ( ( ( (tk(P4691)) <= (tk(P4028)) ) | ( ( 1 ) <= (tk(P29)) ) ) | ( ( (tk(P38)) <= (tk(P1483)) ) | ( ( ( (! ( ( 1 ) <= (tk(P5819)) )) & ( ( 1 ) <= (tk(P2702)) ) ) & ( ( ( ( 1 ) <= (tk(P2353)) ) | ( ( (! ( ( 1 ) <= (tk(P879)) )) | (! ( ( 1 ) <= (tk(P3337)) )) ) & ( (! ( (tk(P5213)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P5541)) )) ) ) ) & ( ( (! ( (tk(P2718)) <= (tk(P4173)) )) | ( (! ( (tk(P5516)) <= (tk(P5627)) )) | (! ( (tk(P1284)) <= (tk(P3485)) )) ) ) & ( ( (tk(P3591)) <= (tk(P4072)) ) | ( ( ( 1 ) <= (tk(P1239)) ) | ( (tk(P2920)) <= ( 0 ) ) ) ) ) ) ) | ( (! ( ( 1 ) <= (tk(P5172)) )) & ( ( (tk(P283)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P3829)) ) | (! ( (tk(P418)) <= ( 0 ) )) ) ) ) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-070-ReachabilityCardinality-15 (reachable & potential(( (! ( (tk(P3170)) <= ( 1 ) )) & ( (tk(P1186)) <= (tk(P3610)) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 14969548 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16044612 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-070"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is CANInsertWithFailure-PT-070, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813697300758"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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