Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447300509.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-PT-S10J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447300509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 36K Apr 12 11:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 12 11:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 12 11:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.2M Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 180K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 160K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 714K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 401K Apr 12 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716934284114

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 22:11:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 22:11:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:11:26] [INFO ] Load time of PNML (sax parser for PT used): 683 ms
[2024-05-28 22:11:26] [INFO ] Transformed 1234 places.
[2024-05-28 22:11:26] [INFO ] Transformed 12920 transitions.
[2024-05-28 22:11:26] [INFO ] Parsed PT model containing 1234 places and 12920 transitions and 116879 arcs in 943 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 22:11:26] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2024-05-28 22:11:27] [INFO ] Computed 152 invariants in 166 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 1, 0, 0] Max Struct:[201, 10, 70, 201, 4, 1, 3, 10, 10, 1, 523, 64, 2, 4]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (560 resets) in 407 ms. (24 steps per ms)
FORMULA PolyORBNT-PT-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (932 resets) in 487 ms. (184 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 4, 1, 1, 0, 1, 2, 1, 3] Max Struct:[201, 10, 70, 201, 3, 10, 523, 64, 4]
[2024-05-28 22:11:28] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 22:11:28] [INFO ] Invariant cache hit.
[2024-05-28 22:11:28] [INFO ] [Real]Absence check using 121 positive place invariants in 34 ms returned sat
[2024-05-28 22:11:28] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 60 ms returned sat
[2024-05-28 22:11:30] [INFO ] [Real]Absence check using state equation in 1440 ms returned sat
[2024-05-28 22:11:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:11:30] [INFO ] [Nat]Absence check using 121 positive place invariants in 49 ms returned sat
[2024-05-28 22:11:30] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 45 ms returned sat
[2024-05-28 22:11:32] [INFO ] [Nat]Absence check using state equation in 1696 ms returned sat
[2024-05-28 22:11:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:11:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 290 ms returned sat
[2024-05-28 22:11:33] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 578 ms.
[2024-05-28 22:11:34] [INFO ] Added : 14 causal constraints over 6 iterations in 1894 ms. Result :sat
Minimization took 465 ms.
[2024-05-28 22:11:35] [INFO ] [Real]Absence check using 121 positive place invariants in 45 ms returned sat
[2024-05-28 22:11:35] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 49 ms returned sat
[2024-05-28 22:11:37] [INFO ] [Real]Absence check using state equation in 1634 ms returned sat
[2024-05-28 22:11:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:11:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 31 ms returned sat
[2024-05-28 22:11:37] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 37 ms returned sat
[2024-05-28 22:11:39] [INFO ] [Nat]Absence check using state equation in 2057 ms returned unknown
[2024-05-28 22:11:39] [INFO ] [Real]Absence check using 121 positive place invariants in 27 ms returned sat
[2024-05-28 22:11:39] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 18 ms returned unsat
[2024-05-28 22:11:39] [INFO ] [Real]Absence check using 121 positive place invariants in 41 ms returned sat
[2024-05-28 22:11:40] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 103 ms returned unsat
[2024-05-28 22:11:40] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2024-05-28 22:11:40] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 36 ms returned sat
[2024-05-28 22:11:41] [INFO ] [Real]Absence check using state equation in 1457 ms returned sat
[2024-05-28 22:11:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:11:42] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2024-05-28 22:11:42] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 48 ms returned sat
[2024-05-28 22:11:43] [INFO ] [Nat]Absence check using state equation in 1232 ms returned sat
[2024-05-28 22:11:43] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 22:11:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 603 ms returned sat
[2024-05-28 22:11:45] [INFO ] Deduced a trap composed of 555 places in 1142 ms of which 66 ms to minimize.
[2024-05-28 22:11:45] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1730 ms
[2024-05-28 22:11:45] [INFO ] [Real]Absence check using 121 positive place invariants in 61 ms returned sat
[2024-05-28 22:11:45] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 41 ms returned unsat
[2024-05-28 22:11:46] [INFO ] [Real]Absence check using 121 positive place invariants in 27 ms returned sat
[2024-05-28 22:11:46] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 40 ms returned sat
[2024-05-28 22:11:47] [INFO ] [Real]Absence check using state equation in 1069 ms returned sat
[2024-05-28 22:11:47] [INFO ] [Real]Added 1 Read/Feed constraints in 115 ms returned sat
[2024-05-28 22:11:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:11:47] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2024-05-28 22:11:47] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 49 ms returned sat
[2024-05-28 22:11:49] [INFO ] [Nat]Absence check using state equation in 1130 ms returned sat
[2024-05-28 22:11:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 22:11:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 1009 ms returned unknown
[2024-05-28 22:11:50] [INFO ] [Real]Absence check using 121 positive place invariants in 29 ms returned sat
[2024-05-28 22:11:50] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 9 ms returned unsat
[2024-05-28 22:11:50] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2024-05-28 22:11:50] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 46 ms returned sat
[2024-05-28 22:11:51] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2024-05-28 22:11:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:11:51] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2024-05-28 22:11:51] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 46 ms returned sat
[2024-05-28 22:11:53] [INFO ] [Nat]Absence check using state equation in 1462 ms returned sat
[2024-05-28 22:11:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 22:11:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 919 ms returned sat
[2024-05-28 22:11:55] [INFO ] Deduced a trap composed of 376 places in 1015 ms of which 7 ms to minimize.
[2024-05-28 22:11:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1337 ms
[2024-05-28 22:11:55] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 266 ms.
[2024-05-28 22:11:57] [INFO ] Deduced a trap composed of 3 places in 998 ms of which 20 ms to minimize.
[2024-05-28 22:11:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[3, 4, 1, 1, 0, 1, 2, 1, 3] Max Struct:[201, 10, 1, 1, 3, 1, 523, 1, 4]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4, 0, 2, 3] Max Struct:[201, 10, 3, 523, 4]
Support contains 65 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 1224 transition count 2745
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 141 place count 1159 transition count 2744
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 1158 transition count 2744
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 142 place count 1158 transition count 2680
Deduced a syphon composed of 64 places in 15 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 270 place count 1094 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 271 place count 1093 transition count 2679
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 1093 transition count 2679
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 276 place count 1091 transition count 2677
Applied a total of 276 rules in 708 ms. Remains 1091 /1234 variables (removed 143) and now considering 2677/2810 (removed 133) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 22:11:58] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
// Phase 1: matrix 2668 rows 1091 cols
[2024-05-28 22:11:58] [INFO ] Computed 142 invariants in 130 ms
[2024-05-28 22:11:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 41130ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 41233ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41986 ms. Remains : 1091/1234 places, 2677/2810 transitions.
[2024-05-28 22:12:39] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:12:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 4, 0, 2, 3] Max Struct:[201, 10, 3, 136, 4]
RANDOM walk for 1000000 steps (70331 resets) in 16496 ms. (60 steps per ms)
FORMULA PolyORBNT-PT-S10J60-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000004 steps (26462 resets) in 11083 ms. (360 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 3, 3] Max Struct:[201, 10, 136, 4]
[2024-05-28 22:13:07] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:13:07] [INFO ] Invariant cache hit.
[2024-05-28 22:13:07] [INFO ] [Real]Absence check using 122 positive place invariants in 31 ms returned sat
[2024-05-28 22:13:07] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 14 ms returned unsat
[2024-05-28 22:13:07] [INFO ] [Real]Absence check using 122 positive place invariants in 34 ms returned sat
[2024-05-28 22:13:07] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 34 ms returned sat
[2024-05-28 22:13:10] [INFO ] [Real]Absence check using state equation in 2404 ms returned sat
[2024-05-28 22:13:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:13:10] [INFO ] [Nat]Absence check using 122 positive place invariants in 28 ms returned sat
[2024-05-28 22:13:10] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 27 ms returned sat
[2024-05-28 22:13:12] [INFO ] [Nat]Absence check using state equation in 2550 ms returned unsat
[2024-05-28 22:13:13] [INFO ] [Real]Absence check using 122 positive place invariants in 24 ms returned sat
[2024-05-28 22:13:13] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 26 ms returned sat
[2024-05-28 22:13:13] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2024-05-28 22:13:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:13:14] [INFO ] [Nat]Absence check using 122 positive place invariants in 32 ms returned sat
[2024-05-28 22:13:14] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 32 ms returned sat
[2024-05-28 22:13:15] [INFO ] [Nat]Absence check using state equation in 1000 ms returned sat
[2024-05-28 22:13:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:13:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 736 ms returned sat
[2024-05-28 22:13:16] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 259 ms.
[2024-05-28 22:13:17] [INFO ] Added : 10 causal constraints over 3 iterations in 1742 ms. Result :sat
Minimization took 7421 ms.
[2024-05-28 22:13:25] [INFO ] [Real]Absence check using 122 positive place invariants in 31 ms returned sat
[2024-05-28 22:13:25] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 36 ms returned sat
[2024-05-28 22:13:27] [INFO ] [Real]Absence check using state equation in 1368 ms returned sat
[2024-05-28 22:13:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:13:27] [INFO ] [Nat]Absence check using 122 positive place invariants in 34 ms returned sat
[2024-05-28 22:13:27] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 53 ms returned sat
[2024-05-28 22:13:28] [INFO ] [Nat]Absence check using state equation in 1425 ms returned sat
[2024-05-28 22:13:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 799 ms returned sat
[2024-05-28 22:13:30] [INFO ] Deduced a trap composed of 451 places in 927 ms of which 5 ms to minimize.
[2024-05-28 22:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4152 ms
[2024-05-28 22:13:34] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 222 ms.
[2024-05-28 22:13:34] [INFO ] Added : 6 causal constraints over 2 iterations in 986 ms. Result :sat
Minimization took 5538 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 3, 3] Max Struct:[4, 4, 136, 4]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[136, 4]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 149 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 1091/1091 places, 2677/2677 transitions.
[2024-05-28 22:13:40] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:13:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[136, 4]
RANDOM walk for 1000000 steps (70276 resets) in 14835 ms. (67 steps per ms)
BEST_FIRST walk for 2000002 steps (14425 resets) in 5113 ms. (391 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[136, 4]
[2024-05-28 22:14:00] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:14:00] [INFO ] Invariant cache hit.
[2024-05-28 22:14:00] [INFO ] [Real]Absence check using 122 positive place invariants in 30 ms returned sat
[2024-05-28 22:14:00] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 48 ms returned sat
[2024-05-28 22:14:01] [INFO ] [Real]Absence check using state equation in 954 ms returned sat
[2024-05-28 22:14:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:14:02] [INFO ] [Nat]Absence check using 122 positive place invariants in 34 ms returned sat
[2024-05-28 22:14:02] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 33 ms returned sat
[2024-05-28 22:14:03] [INFO ] [Nat]Absence check using state equation in 1047 ms returned sat
[2024-05-28 22:14:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:14:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 631 ms returned sat
[2024-05-28 22:14:04] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 266 ms.
[2024-05-28 22:14:05] [INFO ] Added : 10 causal constraints over 3 iterations in 1756 ms. Result :sat
Minimization took 5385 ms.
[2024-05-28 22:14:11] [INFO ] [Real]Absence check using 122 positive place invariants in 30 ms returned sat
[2024-05-28 22:14:11] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 37 ms returned sat
[2024-05-28 22:14:12] [INFO ] [Real]Absence check using state equation in 1339 ms returned sat
[2024-05-28 22:14:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:14:12] [INFO ] [Nat]Absence check using 122 positive place invariants in 31 ms returned sat
[2024-05-28 22:14:12] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 34 ms returned sat
[2024-05-28 22:14:14] [INFO ] [Nat]Absence check using state equation in 1510 ms returned sat
[2024-05-28 22:14:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 792 ms returned sat
[2024-05-28 22:14:16] [INFO ] Deduced a trap composed of 451 places in 854 ms of which 6 ms to minimize.
[2024-05-28 22:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3771 ms
[2024-05-28 22:14:19] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 285 ms.
[2024-05-28 22:14:20] [INFO ] Added : 6 causal constraints over 2 iterations in 1042 ms. Result :sat
Minimization took 5397 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[136, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[136, 4]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 157 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 197 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 22:14:25] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:14:25] [INFO ] Invariant cache hit.
[2024-05-28 22:14:28] [INFO ] Implicit Places using invariants in 2545 ms returned []
[2024-05-28 22:14:28] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:14:28] [INFO ] Invariant cache hit.
[2024-05-28 22:14:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:14:59] [INFO ] Performed 1036/1091 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 22:15:01] [INFO ] Implicit Places using invariants and state equation in 33061 ms returned []
Implicit Place search using SMT with State Equation took 35614 ms to find 0 implicit places.
[2024-05-28 22:15:01] [INFO ] Redundant transitions in 223 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 22:15:01] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:15:01] [INFO ] Invariant cache hit.
[2024-05-28 22:15:01] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 4.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 4.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 1.0)
(s252 1.0)
(s253 0.0)
(s254 4.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 9.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 4.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 1.0)
(s406 1.0)
(s407 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 50275ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 50307ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86365 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2824 resets) in 2531 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (278 resets) in 412 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (280 resets) in 372 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (288 resets) in 311 ms. (128 steps per ms) remains 4/4 properties
[2024-05-28 22:15:53] [INFO ] Flatten gal took : 712 ms
BEST_FIRST walk for 40002 steps (294 resets) in 347 ms. (114 steps per ms) remains 4/4 properties
[2024-05-28 22:15:53] [INFO ] Flatten gal took : 277 ms
[2024-05-28 22:15:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality795962610812387207.gal : 74 ms
[2024-05-28 22:15:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6973988902379788768.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality795962610812387207.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6973988902379788768.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality6973988902379788768.prop.
Interrupted probabilistic random walk after 118035 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 4
Probabilistic random walk after 118035 steps, saw 21226 distinct states, run finished after 3004 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-28 22:15:56] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:15:56] [INFO ] Invariant cache hit.
[2024-05-28 22:15:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
At refinement iteration 3 (OVERLAPS) 317/327 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
At refinement iteration 5 (OVERLAPS) 732/1059 variables, 120/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 30/1089 variables, 18/141 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1090 variables, 1/142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 32
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3758/3759 variables, and 1232 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4967 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1090/1091 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 317/327 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 732/1059 variables, 120/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 30/1089 variables, 18/141 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 22:16:02] [INFO ] Deduced a trap composed of 198 places in 705 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 1/142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1089 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1090 variables, 1/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2668/3758 variables, 1090/1233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 1/1234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3758 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/3759 variables, 1/1235 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3759 variables, 3/1238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3759 variables, 0/1238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/3759 variables, 0/1238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1238 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4564 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 9581ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 293 ms.
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 177 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 22:16:06] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:16:06] [INFO ] Invariant cache hit.
[2024-05-28 22:16:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-28 22:16:43] [INFO ] Flatten gal took : 155 ms
[2024-05-28 22:16:43] [INFO ] Applying decomposition
[2024-05-28 22:16:44] [INFO ] Flatten gal took : 163 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1735865256156509456.txt' '-o' '/tmp/graph1735865256156509456.bin' '-w' '/tmp/graph1735865256156509456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1735865256156509456.bin' '-l' '-1' '-v' '-w' '/tmp/graph1735865256156509456.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:16:44] [INFO ] Decomposing Gal with order
[2024-05-28 22:16:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:16:45] [INFO ] Removed a total of 6815 redundant transitions.
[2024-05-28 22:16:45] [INFO ] Flatten gal took : 504 ms
[2024-05-28 22:16:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 635 labels/synchronizations in 163 ms.
[2024-05-28 22:16:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16857204689759339430.gal : 51 ms
[2024-05-28 22:16:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11700221858329196428.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16857204689759339430.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11700221858329196428.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11700221858329196428.prop.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 41813ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 41887ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42124 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2814 resets) in 1487 ms. (26 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (255 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (284 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (305 resets) in 350 ms. (113 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 133665 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 3
Probabilistic random walk after 133665 steps, saw 23634 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-28 22:16:52] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:16:52] [INFO ] Invariant cache hit.
[2024-05-28 22:16:52] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 317/327 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 732/1059 variables, 120/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 30/1089 variables, 18/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1090 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1693 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 317/327 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 732/1059 variables, 120/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 30/1089 variables, 18/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 22:16:54] [INFO ] Deduced a trap composed of 198 places in 674 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1089 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1090 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2668/3758 variables, 1090/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3758 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/3759 variables, 1/1235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3759 variables, 3/1238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3759 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/3759 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1238 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3948 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 5655ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 357 ms.
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 81 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 78 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 22:16:58] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:16:58] [INFO ] Invariant cache hit.
[2024-05-28 22:17:00] [INFO ] Implicit Places using invariants in 2411 ms returned []
[2024-05-28 22:17:00] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:17:00] [INFO ] Invariant cache hit.
[2024-05-28 22:17:02] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2048
[2024-05-28 22:17:32] [INFO ] Performed 1020/1091 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 22:17:34] [INFO ] Implicit Places using invariants and state equation in 33809 ms returned []
Implicit Place search using SMT with State Equation took 36243 ms to find 0 implicit places.
[2024-05-28 22:17:34] [INFO ] Redundant transitions in 280 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 22:17:34] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:17:34] [INFO ] Invariant cache hit.
[2024-05-28 22:17:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 52863ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 52895ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89516 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 3] Max Struct:[136, 4]
Starting property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[136]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[136]
[2024-05-28 22:18:27] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:18:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[136]
RANDOM walk for 10000 steps (720 resets) in 241 ms. (41 steps per ms)
BEST_FIRST walk for 10000 steps (57 resets) in 33 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-05-28 22:18:28] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:18:28] [INFO ] Invariant cache hit.
[2024-05-28 22:18:28] [INFO ] [Real]Absence check using 122 positive place invariants in 23 ms returned sat
[2024-05-28 22:18:28] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 26 ms returned sat
[2024-05-28 22:18:28] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2024-05-28 22:18:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:18:29] [INFO ] [Nat]Absence check using 122 positive place invariants in 23 ms returned sat
[2024-05-28 22:18:29] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 23 ms returned sat
[2024-05-28 22:18:30] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2024-05-28 22:18:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:18:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 22:18:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 719 ms returned sat
[2024-05-28 22:18:31] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 245 ms.
[2024-05-28 22:18:32] [INFO ] Added : 11 causal constraints over 3 iterations in 1135 ms. Result :sat
Minimization took 736 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 130 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 22:18:33] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:18:33] [INFO ] Invariant cache hit.
[2024-05-28 22:18:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 43052ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 43085ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43222 ms. Remains : 1091/1091 places, 2677/2677 transitions.
[2024-05-28 22:19:16] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:19:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[136]
RANDOM walk for 1000000 steps (70270 resets) in 15012 ms. (66 steps per ms)
BEST_FIRST walk for 1000001 steps (7201 resets) in 2578 ms. (387 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-05-28 22:19:33] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:19:33] [INFO ] Invariant cache hit.
[2024-05-28 22:19:33] [INFO ] [Real]Absence check using 122 positive place invariants in 26 ms returned sat
[2024-05-28 22:19:33] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 28 ms returned sat
[2024-05-28 22:19:34] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2024-05-28 22:19:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:19:35] [INFO ] [Nat]Absence check using 122 positive place invariants in 29 ms returned sat
[2024-05-28 22:19:35] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 31 ms returned sat
[2024-05-28 22:19:36] [INFO ] [Nat]Absence check using state equation in 1163 ms returned sat
[2024-05-28 22:19:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:19:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 806 ms returned sat
[2024-05-28 22:19:37] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 219 ms.
[2024-05-28 22:19:38] [INFO ] Added : 10 causal constraints over 3 iterations in 1603 ms. Result :sat

BK_STOP 1716934783996

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="PolyORBNT-PT-S10J60"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S10J60, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654447300509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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