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

About the Execution of Smart+red for FlexibleBarrier-PT-18b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1009.388 132647.00 160834.00 507.70 FFF?TT???F?T???? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r171-tall-167838858800567.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is FlexibleBarrier-PT-18b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858800567
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 12:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:07 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 1.2M 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 FlexibleBarrier-PT-18b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679482142980

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 10:49:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 10:49:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:49:04] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2023-03-22 10:49:04] [INFO ] Transformed 4370 places.
[2023-03-22 10:49:04] [INFO ] Transformed 5037 transitions.
[2023-03-22 10:49:04] [INFO ] Found NUPN structural information;
[2023-03-22 10:49:04] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 81 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 16) seen :2
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 5037 rows 4370 cols
[2023-03-22 10:49:06] [INFO ] Computed 20 place invariants in 151 ms
[2023-03-22 10:49:08] [INFO ] After 2050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 10:49:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 46 ms returned sat
[2023-03-22 10:49:18] [INFO ] After 7917ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2023-03-22 10:49:22] [INFO ] Deduced a trap composed of 176 places in 2013 ms of which 10 ms to minimize.
[2023-03-22 10:49:24] [INFO ] Deduced a trap composed of 1500 places in 1648 ms of which 2 ms to minimize.
[2023-03-22 10:49:26] [INFO ] Deduced a trap composed of 1540 places in 1612 ms of which 2 ms to minimize.
[2023-03-22 10:49:27] [INFO ] Deduced a trap composed of 1496 places in 1365 ms of which 2 ms to minimize.
[2023-03-22 10:49:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7596 ms
[2023-03-22 10:49:28] [INFO ] Deduced a trap composed of 261 places in 230 ms of which 1 ms to minimize.
[2023-03-22 10:49:28] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 0 ms to minimize.
[2023-03-22 10:49:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 895 ms
[2023-03-22 10:49:34] [INFO ] Deduced a trap composed of 1535 places in 1791 ms of which 2 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-22 10:49:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 10:49:34] [INFO ] After 26354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 11 different solutions.
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 125 ms.
Support contains 153 out of 4370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 3247 edges and 4370 vertex of which 48 / 4370 are part of one of the 8 SCC in 24 ms
Free SCC test removed 40 places
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 726 transitions
Trivial Post-agglo rules discarded 726 transitions
Performed 726 trivial Post agglomeration. Transition count delta: 726
Iterating post reduction 0 with 726 rules applied. Total rules applied 727 place count 4330 transition count 4263
Reduce places removed 726 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 751 rules applied. Total rules applied 1478 place count 3604 transition count 4238
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 1503 place count 3579 transition count 4238
Performed 566 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 566 Pre rules applied. Total rules applied 1503 place count 3579 transition count 3672
Deduced a syphon composed of 566 places in 18 ms
Reduce places removed 566 places and 0 transitions.
Iterating global reduction 3 with 1132 rules applied. Total rules applied 2635 place count 3013 transition count 3672
Discarding 1696 places :
Symmetric choice reduction at 3 with 1696 rule applications. Total rules 4331 place count 1317 transition count 1976
Iterating global reduction 3 with 1696 rules applied. Total rules applied 6027 place count 1317 transition count 1976
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 6029 place count 1317 transition count 1974
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6030 place count 1316 transition count 1974
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 6030 place count 1316 transition count 1970
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 6038 place count 1312 transition count 1970
Discarding 233 places :
Symmetric choice reduction at 5 with 233 rule applications. Total rules 6271 place count 1079 transition count 1737
Iterating global reduction 5 with 233 rules applied. Total rules applied 6504 place count 1079 transition count 1737
Ensure Unique test removed 217 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 5 with 217 rules applied. Total rules applied 6721 place count 1079 transition count 1520
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 1 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 6 with 248 rules applied. Total rules applied 6969 place count 955 transition count 1396
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 6983 place count 948 transition count 1396
Free-agglomeration rule applied 187 times.
Iterating global reduction 6 with 187 rules applied. Total rules applied 7170 place count 948 transition count 1209
Reduce places removed 187 places and 0 transitions.
Iterating post reduction 6 with 187 rules applied. Total rules applied 7357 place count 761 transition count 1209
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 7361 place count 757 transition count 1205
Iterating global reduction 7 with 4 rules applied. Total rules applied 7365 place count 757 transition count 1205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 7369 place count 757 transition count 1201
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 7386 place count 757 transition count 1184
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 7396 place count 757 transition count 1184
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 7397 place count 757 transition count 1184
Applied a total of 7397 rules in 1075 ms. Remains 757 /4370 variables (removed 3613) and now considering 1184/5037 (removed 3853) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1076 ms. Remains : 757/4370 places, 1184/5037 transitions.
Incomplete random walk after 10000 steps, including 246 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 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 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 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 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 195026 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 195026 steps, saw 93530 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-22 10:49:39] [INFO ] Flow matrix only has 1162 transitions (discarded 22 similar events)
// Phase 1: matrix 1162 rows 757 cols
[2023-03-22 10:49:39] [INFO ] Computed 20 place invariants in 22 ms
[2023-03-22 10:49:39] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 10:49:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-22 10:49:41] [INFO ] After 1028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 10:49:41] [INFO ] State equation strengthened by 176 read => feed constraints.
[2023-03-22 10:49:42] [INFO ] After 870ms SMT Verify possible using 176 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 10:49:43] [INFO ] Deduced a trap composed of 327 places in 190 ms of which 0 ms to minimize.
[2023-03-22 10:49:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-22 10:49:43] [INFO ] After 2311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 775 ms.
[2023-03-22 10:49:44] [INFO ] After 4409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 25 ms.
Support contains 153 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 1184/1184 transitions.
Applied a total of 0 rules in 24 ms. Remains 757 /757 variables (removed 0) and now considering 1184/1184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 757/757 places, 1184/1184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 1184/1184 transitions.
Applied a total of 0 rules in 21 ms. Remains 757 /757 variables (removed 0) and now considering 1184/1184 (removed 0) transitions.
[2023-03-22 10:49:44] [INFO ] Flow matrix only has 1162 transitions (discarded 22 similar events)
[2023-03-22 10:49:44] [INFO ] Invariant cache hit.
[2023-03-22 10:49:44] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-22 10:49:44] [INFO ] Flow matrix only has 1162 transitions (discarded 22 similar events)
[2023-03-22 10:49:44] [INFO ] Invariant cache hit.
[2023-03-22 10:49:44] [INFO ] State equation strengthened by 176 read => feed constraints.
[2023-03-22 10:49:45] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
[2023-03-22 10:49:45] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-22 10:49:45] [INFO ] Flow matrix only has 1162 transitions (discarded 22 similar events)
[2023-03-22 10:49:45] [INFO ] Invariant cache hit.
[2023-03-22 10:49:46] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1835 ms. Remains : 757/757 places, 1184/1184 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 757 transition count 1147
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 66 place count 742 transition count 1133
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 141 place count 667 transition count 1058
Iterating global reduction 2 with 75 rules applied. Total rules applied 216 place count 667 transition count 1058
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 2 with 59 rules applied. Total rules applied 275 place count 667 transition count 999
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 276 place count 667 transition count 998
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 278 place count 667 transition count 998
Applied a total of 278 rules in 81 ms. Remains 667 /757 variables (removed 90) and now considering 998/1184 (removed 186) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 998 rows 667 cols
[2023-03-22 10:49:46] [INFO ] Computed 20 place invariants in 17 ms
[2023-03-22 10:49:46] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 10:49:46] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-22 10:49:47] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 10:49:48] [INFO ] After 1634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 625 ms.
[2023-03-22 10:49:48] [INFO ] After 2513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-22 10:49:49] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-22 10:49:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 757 places, 1184 transitions and 4115 arcs took 6 ms.
[2023-03-22 10:49:49] [INFO ] Flatten gal took : 115 ms
Total runtime 44950 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FlexibleBarrier (PT), instance 18b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 757 places, 1184 transitions, 4115 arcs.
Final Score: 66442.772
Took : 85 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679482275627

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 6063:
syntax error

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="FlexibleBarrier-PT-18b"
export BK_EXAMINATION="ReachabilityFireability"
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 FlexibleBarrier-PT-18b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r171-tall-167838858800567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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