About the Execution of ITS-LoLa for PolyORBLF-COL-S02J04T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15755.600 | 3600000.00 | 3641698.00 | 13446.70 | ????T?????????F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871600282.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBLF-COL-S02J04T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871600282
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.8K Apr 12 05:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 05:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 04:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 11 04:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 10 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 9 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 9 17:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 154K Mar 24 05:37 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 PolyORBLF-COL-S02J04T10-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-15
=== Now, execution of the tool begins
BK_START 1591139678709
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:14:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 23:14:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:14:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 23:14:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 624 ms
[2020-06-02 23:14:40] [INFO ] sort/places :
D4->DisablePollingE,DisablePollingB,Insert_Source_B,P_1119,P_2579,
Threads->AwakeTasks,IdleTasks,NotifyEventJobQueuedE,QueueJobE,P_2321,TryAllocateOneTaskE,TryAllocateOneTaskB,P_2318,EnablePollingE,EnablePollingB,FetchJobB,ScheduleTaskE_Check,ScheduleTaskB,Abort_Check_Sources_E,Abort_Check_Sources_B,NotifyEventSourceAddedB,Insert_Source_E,NotifyEventSourceAddedE,P_1113,ProcessingEvt,P_1155,nyo,P_1158,P_1159,P_1160,NotifyEventEndOfCheckSourcesB,NotifyEventEndOfCheckSourcesE,Check_Sources_B,Check_Sources_E,Idle,NotifyEventJobCompletedE,NotifyEventJobCompletedB,RunE,RunB,Perform_Work_E,Try_Check_Sources_B,Try_Check_Sources_E,P_1617,ScheduleTaskE_Idle,
D6->CreatedJobs,
Jobs->P_1725,P_1724,P_1712,AvailableJobId,
Dot->cJobCnt,JobCnt,cBlockedTasks,PollingAbort,cPollingAbort,BlockedTasks,MarkerWrite,P_1727,P_1726,MarkerRead,P_1717,P_1716,CanInjectEvent,SigAbort,NoSigAbort,P_1093,P_1095,P_1097,P_1099,cSources,cIsMonitoring,IsMonitoring,cIdleTasks,ORB_Lock,
Sources->DataOnSrc,PlaceSources,ModifiedSrc,AbourtToModifySrc,
D1->NotifyEventJobQueuedB,QueueJobB,FetchJobE,ScheduleTaskE_Work,
[2020-06-02 23:14:40] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2020-06-02 23:14:40] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2020-06-02 23:14:40] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2020-06-02 23:14:40] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2020-06-02 23:14:40] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2020-06-02 23:14:40] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2020-06-02 23:14:40] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 24 ms.
[2020-06-02 23:14:40] [INFO ] Computed order based on color domains.
[2020-06-02 23:14:40] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1412 transitions in 30 ms.
[2020-06-02 23:14:40] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 68 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 25 resets, run finished after 1113 ms. (steps per millisecond=89 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
[2020-06-02 23:14:42] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2020-06-02 23:14:42] [INFO ] Computed 54 place invariants in 91 ms
[2020-06-02 23:14:42] [INFO ] [Real]Absence check using 15 positive place invariants in 48 ms returned sat
[2020-06-02 23:14:42] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 50 ms returned sat
[2020-06-02 23:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:14:45] [INFO ] [Real]Absence check using state equation in 2761 ms returned sat
[2020-06-02 23:14:45] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-02 23:14:45] [INFO ] [Real]Added 130 Read/Feed constraints in 62 ms returned sat
[2020-06-02 23:14:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:14:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 90 ms returned sat
[2020-06-02 23:14:45] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 69 ms returned sat
[2020-06-02 23:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:14:48] [INFO ] [Nat]Absence check using state equation in 2847 ms returned sat
[2020-06-02 23:14:49] [INFO ] [Nat]Added 130 Read/Feed constraints in 507 ms returned sat
[2020-06-02 23:14:49] [INFO ] Deduced a trap composed of 401 places in 520 ms
[2020-06-02 23:14:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:14:54] [INFO ] Deduced a trap composed of 395 places in 592 ms
[2020-06-02 23:14:54] [INFO ] Deduced a trap composed of 429 places in 534 ms
[2020-06-02 23:14:55] [INFO ] Deduced a trap composed of 65 places in 190 ms
[2020-06-02 23:14:56] [INFO ] Deduced a trap composed of 65 places in 133 ms
[2020-06-02 23:14:56] [INFO ] Deduced a trap composed of 65 places in 62 ms
[2020-06-02 23:14:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 7463 ms
[2020-06-02 23:14:56] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 154 ms.
[2020-06-02 23:15:05] [INFO ] Added : 275 causal constraints over 55 iterations in 8880 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-02 23:15:05] [INFO ] [Real]Absence check using 15 positive place invariants in 44 ms returned sat
[2020-06-02 23:15:05] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 65 ms returned unsat
[2020-06-02 23:15:05] [INFO ] [Real]Absence check using 15 positive place invariants in 37 ms returned sat
[2020-06-02 23:15:06] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 66 ms returned unsat
[2020-06-02 23:15:06] [INFO ] [Real]Absence check using 15 positive place invariants in 35 ms returned sat
[2020-06-02 23:15:06] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 52 ms returned sat
[2020-06-02 23:15:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:15:08] [INFO ] [Real]Absence check using state equation in 2422 ms returned sat
[2020-06-02 23:15:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:15:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 37 ms returned sat
[2020-06-02 23:15:08] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 53 ms returned sat
[2020-06-02 23:15:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:15:13] [INFO ] [Nat]Absence check using state equation in 4590 ms returned sat
[2020-06-02 23:15:14] [INFO ] [Nat]Added 130 Read/Feed constraints in 1090 ms returned sat
[2020-06-02 23:15:14] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 136 ms.
[2020-06-02 23:15:23] [INFO ] Added : 105 causal constraints over 21 iterations in 8916 ms. Result :unknown
[2020-06-02 23:15:23] [INFO ] [Real]Absence check using 15 positive place invariants in 31 ms returned sat
[2020-06-02 23:15:23] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 53 ms returned sat
[2020-06-02 23:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:15:26] [INFO ] [Real]Absence check using state equation in 2309 ms returned sat
[2020-06-02 23:15:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:15:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 34 ms returned sat
[2020-06-02 23:15:26] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 52 ms returned sat
[2020-06-02 23:15:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:15:31] [INFO ] [Nat]Absence check using state equation in 5067 ms returned sat
[2020-06-02 23:15:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:15:37] [INFO ] [Nat]Added 130 Read/Feed constraints in 6030 ms returned unknown
[2020-06-02 23:15:37] [INFO ] [Real]Absence check using 15 positive place invariants in 36 ms returned sat
[2020-06-02 23:15:37] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 47 ms returned sat
[2020-06-02 23:15:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:15:40] [INFO ] [Real]Absence check using state equation in 2693 ms returned sat
[2020-06-02 23:15:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:15:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 34 ms returned sat
[2020-06-02 23:15:40] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 48 ms returned sat
[2020-06-02 23:15:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:15:43] [INFO ] [Nat]Absence check using state equation in 3093 ms returned sat
[2020-06-02 23:15:44] [INFO ] [Nat]Added 130 Read/Feed constraints in 1207 ms returned sat
[2020-06-02 23:15:45] [INFO ] Deduced a trap composed of 49 places in 295 ms
[2020-06-02 23:15:45] [INFO ] Deduced a trap composed of 65 places in 76 ms
[2020-06-02 23:15:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:15:48] [INFO ] Deduced a trap composed of 65 places in 151 ms
[2020-06-02 23:15:49] [INFO ] Deduced a trap composed of 65 places in 155 ms
[2020-06-02 23:15:50] [INFO ] Deduced a trap composed of 66 places in 112 ms
[2020-06-02 23:15:50] [INFO ] Deduced a trap composed of 65 places in 60 ms
[2020-06-02 23:15:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5928 ms
[2020-06-02 23:15:50] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 110 ms.
[2020-06-02 23:15:59] [INFO ] Added : 100 causal constraints over 20 iterations in 9315 ms. Result :unknown
[2020-06-02 23:16:00] [INFO ] [Real]Absence check using 15 positive place invariants in 29 ms returned sat
[2020-06-02 23:16:00] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 38 ms returned sat
[2020-06-02 23:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:16:02] [INFO ] [Real]Absence check using state equation in 2282 ms returned sat
[2020-06-02 23:16:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:16:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 38 ms returned sat
[2020-06-02 23:16:02] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 54 ms returned sat
[2020-06-02 23:16:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:16:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:16:13] [INFO ] [Nat]Absence check using state equation in 10530 ms returned sat
[2020-06-02 23:16:13] [INFO ] [Nat]Added 130 Read/Feed constraints in 458 ms returned sat
[2020-06-02 23:16:13] [INFO ] Deduced a trap composed of 65 places in 268 ms
[2020-06-02 23:16:14] [INFO ] Deduced a trap composed of 66 places in 265 ms
[2020-06-02 23:16:14] [INFO ] Deduced a trap composed of 65 places in 225 ms
[2020-06-02 23:16:14] [INFO ] Deduced a trap composed of 65 places in 150 ms
[2020-06-02 23:16:15] [INFO ] Deduced a trap composed of 65 places in 121 ms
[2020-06-02 23:16:15] [INFO ] Deduced a trap composed of 65 places in 77 ms
[2020-06-02 23:16:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1774 ms
[2020-06-02 23:16:15] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 125 ms.
[2020-06-02 23:16:22] [INFO ] Added : 175 causal constraints over 35 iterations in 7055 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-02 23:16:22] [INFO ] [Real]Absence check using 15 positive place invariants in 32 ms returned sat
[2020-06-02 23:16:22] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 54 ms returned sat
[2020-06-02 23:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:16:25] [INFO ] [Real]Absence check using state equation in 2326 ms returned sat
[2020-06-02 23:16:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:16:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 41 ms returned sat
[2020-06-02 23:16:25] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 92 ms returned sat
[2020-06-02 23:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:16:29] [INFO ] [Nat]Absence check using state equation in 3822 ms returned sat
[2020-06-02 23:16:30] [INFO ] [Nat]Added 130 Read/Feed constraints in 1089 ms returned sat
[2020-06-02 23:16:30] [INFO ] Deduced a trap composed of 66 places in 68 ms
[2020-06-02 23:16:32] [INFO ] Deduced a trap composed of 66 places in 96 ms
[2020-06-02 23:16:32] [INFO ] Deduced a trap composed of 66 places in 68 ms
[2020-06-02 23:16:33] [INFO ] Deduced a trap composed of 65 places in 81 ms
[2020-06-02 23:16:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:16:45] [INFO ] Deduced a trap composed of 2 places in 711 ms
[2020-06-02 23:16:45] [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 closed (> (+ s370 s373) 0)") while checking expression at index 7
[2020-06-02 23:16:45] [INFO ] [Real]Absence check using 15 positive place invariants in 29 ms returned sat
[2020-06-02 23:16:45] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 45 ms returned sat
[2020-06-02 23:16:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:16:48] [INFO ] [Real]Absence check using state equation in 2199 ms returned sat
[2020-06-02 23:16:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:16:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 27 ms returned sat
[2020-06-02 23:16:48] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 41 ms returned sat
[2020-06-02 23:16:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:16:55] [INFO ] [Nat]Absence check using state equation in 7289 ms returned sat
[2020-06-02 23:16:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:17:00] [INFO ] [Nat]Added 130 Read/Feed constraints in 5193 ms returned sat
[2020-06-02 23:17:01] [INFO ] Deduced a trap composed of 65 places in 282 ms
[2020-06-02 23:17:01] [INFO ] Deduced a trap composed of 65 places in 289 ms
[2020-06-02 23:17:01] [INFO ] Deduced a trap composed of 65 places in 304 ms
[2020-06-02 23:17:02] [INFO ] Deduced a trap composed of 66 places in 181 ms
[2020-06-02 23:17:02] [INFO ] Deduced a trap composed of 65 places in 151 ms
[2020-06-02 23:17:02] [INFO ] Deduced a trap composed of 65 places in 95 ms
[2020-06-02 23:17:02] [INFO ] Deduced a trap composed of 66 places in 67 ms
[2020-06-02 23:17:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2012 ms
[2020-06-02 23:17:02] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 122 ms.
[2020-06-02 23:17:08] [INFO ] Added : 50 causal constraints over 10 iterations in 5345 ms. Result :unknown
[2020-06-02 23:17:08] [INFO ] [Real]Absence check using 15 positive place invariants in 40 ms returned sat
[2020-06-02 23:17:08] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 50 ms returned sat
[2020-06-02 23:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:17:10] [INFO ] [Real]Absence check using state equation in 2349 ms returned sat
[2020-06-02 23:17:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:17:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 39 ms returned sat
[2020-06-02 23:17:10] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 54 ms returned sat
[2020-06-02 23:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:17:14] [INFO ] [Nat]Absence check using state equation in 3409 ms returned sat
[2020-06-02 23:17:15] [INFO ] [Nat]Added 130 Read/Feed constraints in 1314 ms returned sat
[2020-06-02 23:17:15] [INFO ] Deduced a trap composed of 65 places in 115 ms
[2020-06-02 23:17:16] [INFO ] Deduced a trap composed of 65 places in 84 ms
[2020-06-02 23:17:16] [INFO ] Deduced a trap composed of 65 places in 133 ms
[2020-06-02 23:17:17] [INFO ] Deduced a trap composed of 65 places in 44 ms
[2020-06-02 23:17:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1721 ms
[2020-06-02 23:17:17] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 92 ms.
[2020-06-02 23:17:26] [INFO ] Added : 110 causal constraints over 22 iterations in 8808 ms. Result :unknown
[2020-06-02 23:17:26] [INFO ] [Real]Absence check using 15 positive place invariants in 34 ms returned sat
[2020-06-02 23:17:26] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 52 ms returned sat
[2020-06-02 23:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:17:28] [INFO ] [Real]Absence check using state equation in 2373 ms returned sat
[2020-06-02 23:17:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:17:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 38 ms returned sat
[2020-06-02 23:17:28] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 54 ms returned sat
[2020-06-02 23:17:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:17:31] [INFO ] [Nat]Absence check using state equation in 2918 ms returned sat
[2020-06-02 23:17:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:17:36] [INFO ] [Nat]Added 130 Read/Feed constraints in 4147 ms returned sat
[2020-06-02 23:17:36] [INFO ] Deduced a trap composed of 65 places in 194 ms
[2020-06-02 23:17:38] [INFO ] Deduced a trap composed of 65 places in 156 ms
[2020-06-02 23:17:39] [INFO ] Deduced a trap composed of 66 places in 147 ms
[2020-06-02 23:17:39] [INFO ] Deduced a trap composed of 65 places in 107 ms
[2020-06-02 23:17:39] [INFO ] Deduced a trap composed of 65 places in 90 ms
[2020-06-02 23:17:40] [INFO ] Deduced a trap composed of 65 places in 105 ms
[2020-06-02 23:17:40] [INFO ] Deduced a trap composed of 66 places in 66 ms
[2020-06-02 23:17:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4968 ms
[2020-06-02 23:17:41] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 110 ms.
[2020-06-02 23:17:48] [INFO ] Added : 180 causal constraints over 36 iterations in 7786 ms. Result :(error "Failed to check-sat")
[2020-06-02 23:17:48] [INFO ] [Real]Absence check using 15 positive place invariants in 31 ms returned sat
[2020-06-02 23:17:48] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 52 ms returned sat
[2020-06-02 23:17:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:17:51] [INFO ] [Real]Absence check using state equation in 2672 ms returned sat
[2020-06-02 23:17:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:17:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 37 ms returned sat
[2020-06-02 23:17:51] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 54 ms returned sat
[2020-06-02 23:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:17:55] [INFO ] [Nat]Absence check using state equation in 3800 ms returned sat
[2020-06-02 23:17:57] [INFO ] [Nat]Added 130 Read/Feed constraints in 1442 ms returned sat
[2020-06-02 23:17:57] [INFO ] Deduced a trap composed of 65 places in 467 ms
[2020-06-02 23:17:58] [INFO ] Deduced a trap composed of 65 places in 175 ms
[2020-06-02 23:17:58] [INFO ] Deduced a trap composed of 65 places in 63 ms
[2020-06-02 23:17:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1839 ms
[2020-06-02 23:17:59] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 142 ms.
[2020-06-02 23:18:07] [INFO ] Added : 100 causal constraints over 20 iterations in 8329 ms. Result :unknown
[2020-06-02 23:18:07] [INFO ] [Real]Absence check using 15 positive place invariants in 36 ms returned sat
[2020-06-02 23:18:07] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 52 ms returned sat
[2020-06-02 23:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:18:09] [INFO ] [Real]Absence check using state equation in 2345 ms returned sat
[2020-06-02 23:18:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:18:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 51 ms returned sat
[2020-06-02 23:18:10] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 54 ms returned sat
[2020-06-02 23:18:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:18:13] [INFO ] [Nat]Absence check using state equation in 3049 ms returned sat
[2020-06-02 23:18:15] [INFO ] [Nat]Added 130 Read/Feed constraints in 2089 ms returned sat
[2020-06-02 23:18:15] [INFO ] Deduced a trap composed of 65 places in 99 ms
[2020-06-02 23:18:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:18:30] [INFO ] Deduced a trap composed of 2 places in 630 ms
[2020-06-02 23:18:30] [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 closed (> (+ s370 s373) 0)") while checking expression at index 12
[2020-06-02 23:18:30] [INFO ] [Real]Absence check using 15 positive place invariants in 40 ms returned sat
[2020-06-02 23:18:30] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 77 ms returned sat
[2020-06-02 23:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:18:33] [INFO ] [Real]Absence check using state equation in 2483 ms returned sat
[2020-06-02 23:18:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:18:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 27 ms returned sat
[2020-06-02 23:18:33] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 92 ms returned sat
[2020-06-02 23:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:18:36] [INFO ] [Nat]Absence check using state equation in 2987 ms returned sat
[2020-06-02 23:18:37] [INFO ] [Nat]Added 130 Read/Feed constraints in 800 ms returned sat
[2020-06-02 23:18:37] [INFO ] Deduced a trap composed of 66 places in 73 ms
[2020-06-02 23:18:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2020-06-02 23:18:37] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 109 ms.
[2020-06-02 23:18:53] [INFO ] Added : 415 causal constraints over 83 iterations in 15861 ms. Result :unknown
[2020-06-02 23:18:53] [INFO ] [Real]Absence check using 15 positive place invariants in 33 ms returned sat
[2020-06-02 23:18:53] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 65 ms returned sat
[2020-06-02 23:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:18:55] [INFO ] [Real]Absence check using state equation in 2172 ms returned sat
[2020-06-02 23:18:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:18:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 35 ms returned sat
[2020-06-02 23:18:55] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 61 ms returned sat
[2020-06-02 23:18:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:18:59] [INFO ] [Nat]Absence check using state equation in 3694 ms returned sat
[2020-06-02 23:19:00] [INFO ] [Nat]Added 130 Read/Feed constraints in 554 ms returned sat
[2020-06-02 23:19:00] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 84 ms.
[2020-06-02 23:19:08] [INFO ] Added : 105 causal constraints over 21 iterations in 8160 ms. Result :sat
[2020-06-02 23:19:08] [INFO ] Deduced a trap composed of 65 places in 157 ms
[2020-06-02 23:19:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:19:16] [INFO ] Deduced a trap composed of 2 places in 633 ms
[2020-06-02 23:19:16] [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 closed (> (+ s370 s373) 0)") while checking expression at index 14
[2020-06-02 23:19:16] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2020-06-02 23:19:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 30 ms returned unsat
[2020-06-02 23:19:16] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned unsat
[2020-06-02 23:19:16] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2020-06-02 23:19:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 32 ms returned unsat
[2020-06-02 23:19:16] [INFO ] [Real]Absence check using 15 positive place invariants in 31 ms returned sat
[2020-06-02 23:19:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 45 ms returned unsat
[2020-06-02 23:19:16] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned unsat
[2020-06-02 23:19:17] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2020-06-02 23:19:17] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 66 ms returned unsat
[2020-06-02 23:19:17] [INFO ] [Real]Absence check using 15 positive place invariants in 22 ms returned unsat
[2020-06-02 23:19:17] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned unsat
[2020-06-02 23:19:17] [INFO ] [Real]Absence check using 15 positive place invariants in 35 ms returned sat
[2020-06-02 23:19:17] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 50 ms returned unsat
[2020-06-02 23:19:17] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned unsat
[2020-06-02 23:19:17] [INFO ] [Real]Absence check using 15 positive place invariants in 30 ms returned sat
[2020-06-02 23:19:17] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 44 ms returned unsat
[2020-06-02 23:19:17] [INFO ] [Real]Absence check using 15 positive place invariants in 29 ms returned sat
[2020-06-02 23:19:17] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 43 ms returned unsat
[2020-06-02 23:19:18] [INFO ] [Real]Absence check using 15 positive place invariants in 22 ms returned unsat
[2020-06-02 23:19:18] [INFO ] [Real]Absence check using 15 positive place invariants in 28 ms returned sat
[2020-06-02 23:19:18] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 38 ms returned unsat
[2020-06-02 23:19:18] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned unsat
[2020-06-02 23:19:18] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned unsat
[2020-06-02 23:19:18] [INFO ] [Real]Absence check using 15 positive place invariants in 39 ms returned unsat
[2020-06-02 23:19:18] [INFO ] [Real]Absence check using 15 positive place invariants in 32 ms returned sat
[2020-06-02 23:19:18] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 45 ms returned unsat
[2020-06-02 23:19:18] [INFO ] [Real]Absence check using 15 positive place invariants in 32 ms returned sat
[2020-06-02 23:19:18] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 54 ms returned unsat
[2020-06-02 23:19:18] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned unsat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive place invariants in 22 ms returned unsat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive place invariants in 35 ms returned sat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 46 ms returned unsat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive place invariants in 34 ms returned sat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 43 ms returned unsat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned unsat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 31 ms returned unsat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned unsat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned sat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 31 ms returned unsat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned unsat
[2020-06-02 23:19:19] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned unsat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 31 ms returned unsat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned sat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 33 ms returned unsat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned unsat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive place invariants in 44 ms returned sat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 33 ms returned unsat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned unsat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 31 ms returned unsat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned unsat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned unsat
[2020-06-02 23:19:20] [INFO ] [Real]Absence check using 15 positive place invariants in 54 ms returned unsat
[2020-06-02 23:19:21] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2020-06-02 23:19:21] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 30 ms returned unsat
[2020-06-02 23:19:21] [INFO ] [Real]Absence check using 15 positive place invariants in 61 ms returned sat
[2020-06-02 23:19:21] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 53 ms returned unsat
[2020-06-02 23:19:21] [INFO ] [Real]Absence check using 15 positive place invariants in 34 ms returned sat
[2020-06-02 23:19:21] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 54 ms returned unsat
Successfully simplified 43 atomic propositions for a total of 43 simplifications.
[2020-06-02 23:19:21] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 23:19:21] [INFO ] Flatten gal took : 256 ms
FORMULA PolyORBLF-COL-S02J04T10-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:19:21] [INFO ] Applying decomposition
[2020-06-02 23:19:22] [INFO ] Flatten gal took : 149 ms
[2020-06-02 23:19:22] [INFO ] Decomposing Gal with order
[2020-06-02 23:19:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 23:19:22] [INFO ] Removed a total of 3837 redundant transitions.
[2020-06-02 23:19:22] [INFO ] Flatten gal took : 325 ms
[2020-06-02 23:19:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 29 ms.
[2020-06-02 23:19:22] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 12 ms.
[2020-06-02 23:19:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ PolyORBLF-COL-S02J04T10 @ 3570 seconds
check_solution: Variable C982 = -1.07585525513 is below its lower bound 0
check_solution: Variable C1738 = -1.14576721191 is below its lower bound 0
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 3.77503051324e-311 is above its equality of -9
check_solution: Constraint R157 = 4.23125960824e-311 is above its equality of -1
check_solution: Constraint R220 = 3.99147408403e-311 is above its equality of -1
check_solution: Constraint R258 = 5.16281576062e-311 is above its equality of -1
check_solution: Constraint R259 = 5.1670597522e-311 is above its equality of -1
check_solution: Constraint R260 = 3.4058032457e-311 is above its equality of -1
check_solution: Constraint R335 = 2.06257991007e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1.14577)
check_solution: Variable C602 = -0.00528163462877 is below its lower bound 0
check_solution: Variable C1358 = -0.00519360974431 is below its lower bound 0
check_solution: Variable C2114 = -0.00519360974431 is below its lower bound 0
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 4.36918933461e-311 is above its equality of -9
check_solution: Constraint R157 = 6.09437191262e-311 is above its equality of -1
check_solution: Constraint R220 = -0.0174614787102 is above its equality of -1
check_solution: Constraint R258 = 3.4058032457e-311 is above its equality of -1
check_solution: Constraint R259 = 1.59149684359e-312 is above its equality of -1
check_solution: Constraint R260 = 1.63393675942e-312 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 192.544)
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 4.3479693767e-311 is above its equality of -9
check_solution: Constraint R157 = 4.45831315786e-311 is above its equality of -1
check_solution: Constraint R220 = 1.83552636054e-311 is above its equality of -1
check_solution: Constraint R230 = -1.30678272247 is below its equality of 0
check_solution: Constraint R258 = 3.1787496959e-311 is above its equality of -1
check_solution: Constraint R259 = 3.17238370823e-311 is above its equality of -1
check_solution: Constraint R260 = 3.16813971665e-311 is above its equality of -1
check_solution: Constraint R335 = 4.54955897688e-311 is above its equality of -1
check_solution: Constraint R336 = 4.59199889271e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Variable C376 = -1.31729030609 is below its lower bound 0
check_solution: Variable C1132 = -0.389520645142 is below its lower bound 0
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 5.65936277562e-311 is above its equality of -9
check_solution: Constraint R157 = 6.14742180786e-311 is above its equality of -1
check_solution: Constraint R220 = 4.75963656005e-311 is above its equality of -1
check_solution: Constraint R258 = 4.36070135145e-311 is above its equality of -1
check_solution: Constraint R259 = 4.38616530094e-311 is above its equality of -1
check_solution: Constraint R260 = 4.14637977627e-311 is above its equality of -1
check_solution: Constraint R335 = 5.19040170597e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1.31729)
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 3.97874210899e-311 is above its equality of -9
check_solution: Constraint R157 = 4.47316712813e-311 is above its equality of -1
check_solution: Constraint R220 = 3.7432005764e-311 is above its equality of -1
check_solution: Constraint R258 = 4.78934450135e-311 is above its equality of -1
check_solution: Constraint R259 = 3.27848349826e-311 is above its equality of -1
check_solution: Constraint R260 = 4.72780662355e-311 is above its equality of -1
check_solution: Constraint R335 = 4.58987689692e-311 is above its equality of -1
check_solution: Constraint R336 = 4.52833901921e-311 is above its equality of -1
check_solution: Constraint R337 = 4.57077893488e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Variable C40 = -0.5 is below its lower bound 0
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 4.85937036244e-312 is above its equality of -9
check_solution: Constraint R157 = 4.40950725465e-311 is above its equality of -1
check_solution: Constraint R220 = 2.31085341713e-311 is above its equality of -1
check_solution: Constraint R258 = 3.93205820157e-311 is above its equality of -1
check_solution: Constraint R259 = 3.93630219316e-311 is above its equality of -1
check_solution: Constraint R260 = 4.74690458531e-311 is above its equality of -1
check_solution: Constraint R335 = 4.69809868229e-311 is above its equality of -1
check_solution: Constraint R336 = 4.70022067808e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R4 = 1 is above its equality of 0
check_solution: Constraint R5 = 1 is above its equality of 0
check_solution: Constraint R6 = 1 is above its equality of 0
check_solution: Constraint R7 = 1 is above its equality of 0
check_solution: Constraint R8 = 1 is above its equality of 0
check_solution: Constraint R9 = 1 is above its equality of 0
check_solution: Constraint R10 = 1 is above its equality of 0
check_solution: Constraint R11 = 1 is above its equality of 0
check_solution: Constraint R12 = 1 is above its equality of 0
Seriously low accuracy found ||*|| = 11 (rel. error 2)
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 5.29650149547e-311 is above its equality of -9
check_solution: Constraint R157 = 6.13044584083e-311 is above its equality of -1
check_solution: Constraint R220 = 3.93418019737e-311 is above its equality of -1
check_solution: Constraint R258 = 4.34372538503e-311 is above its equality of -1
check_solution: Constraint R259 = 4.3479693767e-311 is above its equality of -1
check_solution: Constraint R260 = 4.35221336828e-311 is above its equality of -1
check_solution: Constraint R335 = 3.50765904346e-311 is above its equality of -1
check_solution: Constraint R336 = 3.2424095696e-311 is above its equality of -1
check_solution: Constraint R337 = 3.24665356105e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Variable C124 = -0.049463570118 is below its lower bound 0
check_solution: Variable C502 = -0.165361523628 is below its lower bound 0
check_solution: Variable C880 = -0.124150753021 is below its lower bound 0
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 4.90817626565e-311 is above its equality of -9
check_solution: Constraint R120 = -0.165361523628 is below its equality of 0
check_solution: Constraint R157 = 5.1670597522e-311 is above its equality of -1
check_solution: Constraint R220 = 3.50553704773e-311 is above its equality of -1
check_solution: Constraint R258 = 4.81480845013e-311 is above its equality of -1
check_solution: Constraint R259 = 4.86149235806e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 8.05472)
check_solution: Variable C1004 = -1 is below its lower bound 0
check_solution: Variable C1054 = -1 is below its lower bound 0
check_solution: Variable C1254 = -1 is below its lower bound 0
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 0 is above its equality of -9
check_solution: Constraint R157 = 0 is above its equality of -1
check_solution: Constraint R220 = 0 is above its equality of -1
check_solution: Constraint R258 = 0 is above its equality of -1
check_solution: Constraint R259 = 0 is above its equality of -1
check_solution: Constraint R260 = 0 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 6.03495603091e-311 is above its equality of -9
check_solution: Constraint R157 = 4.90817626551e-311 is above its equality of -1
check_solution: Constraint R220 = 3.43551118646e-311 is above its equality of -1
check_solution: Constraint R258 = 5.17554773512e-311 is above its equality of -1
check_solution: Constraint R259 = 3.34214337178e-311 is above its equality of -1
check_solution: Constraint R260 = 2.40209923625e-311 is above its equality of -1
check_solution: Constraint R335 = 2.07531188412e-311 is above its equality of -1
check_solution: Constraint R336 = 3.34850935952e-311 is above its equality of -1
check_solution: Constraint R337 = 3.44824316159e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1.11111)
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 2.82437639882e-311 is above its equality of -9
check_solution: Constraint R157 = 3.48007309814e-311 is above its equality of -1
check_solution: Constraint R220 = 5.37713733555e-311 is above its equality of -1
check_solution: Constraint R258 = 4.04664597447e-311 is above its equality of -1
check_solution: Constraint R259 = 5.27740353326e-311 is above its equality of -1
check_solution: Constraint R260 = 4.76812454361e-311 is above its equality of -1
check_solution: Constraint R335 = 5.95007619925e-311 is above its equality of -1
check_solution: Constraint R336 = 5.95432019083e-311 is above its equality of -1
check_solution: Constraint R337 = 4.51560704396e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Variable C446 = -0.239639520645 is below its lower bound 0
check_solution: Variable C824 = -0.0871344804764 is below its lower bound 0
check_solution: Variable C1580 = -0.0240866094828 is below its lower bound 0
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R64 = -0.0132642313838 is below its equality of 0
check_solution: Constraint R113 = 4.60260887167e-311 is above its equality of -9
check_solution: Constraint R157 = 4.56229095161e-311 is above its equality of -1
check_solution: Constraint R220 = 5.29650149568e-311 is above its equality of -1
check_solution: Constraint R258 = 3.3336553885e-311 is above its equality of -1
check_solution: Constraint R259 = 5.68482672522e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 61.8284)
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 0 is above its equality of -9
check_solution: Constraint R157 = 0 is above its equality of -1
check_solution: Constraint R220 = 0 is above its equality of -1
check_solution: Constraint R258 = 0 is above its equality of -1
check_solution: Constraint R259 = 0 is above its equality of -1
check_solution: Constraint R260 = 0 is above its equality of -1
check_solution: Constraint R335 = 0 is above its equality of -1
check_solution: Constraint R336 = 0 is above its equality of -1
check_solution: Constraint R337 = 0 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R113 = 0 is above its equality of -9
check_solution: Constraint R157 = 0 is above its equality of -1
check_solution: Constraint R220 = 0 is above its equality of -1
check_solution: Constraint R258 = 0 is above its equality of -1
check_solution: Constraint R259 = 0 is above its equality of -1
check_solution: Constraint R260 = 0 is above its equality of -1
check_solution: Constraint R335 = 0 is above its equality of -1
check_solution: Constraint R336 = 0 is above its equality of -1
check_solution: Constraint R337 = 0 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Constraint R1 = 6.92050405425e-310 is above its equality of -10
check_solution: Constraint R17 = 0.997296056085 is above its equality of 0
check_solution: Constraint R18 = 1.57360726667 is above its equality of 0
check_solution: Constraint R30 = 3.78350993985 is above its equality of 0
check_solution: Constraint R80 = 1.64501019343 is above its equality of 0
check_solution: Constraint R106 = 1.06817861364 is above its equality of 0
check_solution: Constraint R108 = 3.04802147237 is above its equality of 0
check_solution: Constraint R113 = 0 is above its equality of -9
check_solution: Constraint R118 = 1.12199369107 is above its equality of 0
check_solution: Constraint R145 = 2.92334780188 is above its equality of 0
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 11079988 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16133348 kB
--------------------
content from stderr:
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="PolyORBLF-COL-S02J04T10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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-4028"
echo " Executing tool itslola"
echo " Input is PolyORBLF-COL-S02J04T10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871600282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T10.tgz
mv PolyORBLF-COL-S02J04T10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;